Multi-resolution tree search for iterated transformation theory-based coding

M. Kawamata, M. Nagahisa, T. Higuchi

Research output: Contribution to journalConference articlepeer-review

5 Citations (Scopus)

Abstract

Iterated transformation theory-based coding (ITTBC) suffers from very high computational complexity in the encoding phase. This is due to its exhaustive search. This paper proposes a multiresolution tree search ITTBC (MTS-ITTBC) to reduce the encoding complexity. MTS-ITTBC searches the ITT-code using a multiresolution search-tree. The computational load of MTS-ITTBC is O(NlogN), while that of full search ITTBC is O(N2), where N is the number of range blocks or domain blocks in an image. Numerical examples show that the encoding time of MTS-ITTBC can be reduced to 14% of that of the full search ITTBC, while the loss in quality relative to the full search ITTBC is about 0.5 dB in p-pSNR, which is visually negligible.

Original languageEnglish
Article number413872
Pages (from-to)137-141
Number of pages5
JournalProceedings - International Conference on Image Processing, ICIP
Volume3
DOIs
Publication statusPublished - 1994 Jan 1
EventProceedings of the 1994 1st IEEE International Conference on Image Processing. Part 3 (of 3) - Austin, TX, USA
Duration: 1994 Nov 131994 Nov 16

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Fingerprint

Dive into the research topics of 'Multi-resolution tree search for iterated transformation theory-based coding'. Together they form a unique fingerprint.

Cite this