Please use this identifier to cite or link to this item:
|Title:||A fast fractal image coding based on kick-out and zero contrast conditions|
|Keywords:||Fractal image coding|
|Source:||IEEE transactions on image processing, Nov. 2003, v. 12, no. 11, p. 1398-1403 How to cite?|
|Journal:||IEEE transactions on image processing|
|Abstract:||A fast algorithm for fractal image coding based on a single kick-out condition and the zero contrast prediction is proposed in this paper. The single kick-out condition can avoid a large number of range-domain block matches when finding the best matched domain block. An efficient method for 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 computation or runtime. In addition, this algorithm does not need any pre-processing step or 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% of that of the exhaustive search method. When combined with the DCT Inner Product algorithm, the required runtime for the algorithm can be further reduced by about 50%. The proposed algorithm was also compared to two other fast fractal algorithms. Experimental results also show that our algorithm achieves a better efficiency and requires a much smaller amount of memory for implementation.|
|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:||Journal/Magazine Article|
Show full item record
Citations as of Jun 8, 2016
WEB OF SCIENCETM
Citations as of Oct 19, 2016
Checked on Oct 16, 2016
Checked on Oct 16, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.