M. Kawamata, M. Nagahisa, T. Higuchi. Multi-resolution tree search for iterated transformation theory-based coding. In Proc. ICIP-94 IEEE International Conference on Image Processing, Austin, Texas, 1994.
Iterated Transformation Theory-Based Coding (IT-TBC) suffers from very high computational complexity in encoding phase. This is due to ist excaustive search. This paper proposes Multiresolution Tree Search ITTBC (MTS-ITTBC) to reduce the encoding complexity. MTS-ITTBC searches ITT-code using a multi-resolution 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.
@InProceedings{KaNaHi94,
Author = {Kawamata, M. and Nagahisa, M. and Higuchi, T.},
Title = {Multi-resolution tree search for iterated transformation theory-based coding},
BookTitle = {Proc. ICIP-94 IEEE International Conference on Image Processing},
Address = {Austin, Texas},
Month = {},
Year = {1994}
}