Please use this identifier to cite or link to this item:
|Title:||An effieient algorithm for fractal image coding using kick-out and zero contrast conditions|
|Keywords:||Fractal image coding|
Fractal image compression
DCT Inner Product algorithm
Efficient image coding algorithm
|Source:||Proceedings of the 2003 IEEE International Symposium on Circuits and Systems : ISCAS 2003 : Sunday, May 25-Wednesday, May 28, 2003, Bangkok, Thailand, p. II480-II483 How to cite?|
|Abstract:||In this paper, we propose a fast algorithm for fractal image coding based on a single kick-out condition and the zero contrast prediction. The single kick-out condition can eliminate lots of unmatched domain blocks in the early encoding phase. An efficient method based on the zero contrast prediction is also proposed, which can determine whether the contrast factor for a domain block is zero or not and compute the corresponding difference between the range block and the transformed domain block efficiently and exactly. The proposed algorithm can achieve the same reconstructed image quality as the exhaustive search, and can greatly reduce the required computational complexity. In addition, this algorithm does not need any preprocessing step and additional memory for its implementation, and can combine with other fast fractal algorithms to further improve the speed. Experimental results show that the runtime is reduced by about 50% when compared to the exhaustive search method. The runtime can be reduced by about 75% when our algorithm is combined with the DCT Inner Product algorithm.|
|Rights:||© 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Apr 10, 2016
Checked on May 29, 2016
Checked on May 29, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.