A new searchless fractal image encoding method for a real-time image compression device

Fast fractal image compression algorithm using specific update search

“…In recent years, many researchers have done a lot of work to speed up the encoding process. Some researchers have noticed that the search for matching domain blocks in the encoding process of the FIC is time‐consuming, so they have proposed no‐search or search‐less FIC techniques to improve the coding performance by avoiding the search for the matching blocks [6–10]. The fast no search fractal image coding method proposed by Furao and Hasegawa [6] incorporated the adjusted quad‐tree scheme into the no‐search scheme to significantly improve the coding fidelity.…”

An Improved Fractal Image Coding Method

“…[6][7][8][9] To further reduce the coding time, a number of scholars have put forth various no search fractal coding strategies that greatly reduce coding time. [10][11][12][13] For example, Monro put forward path fractal transform by coding sub-blocks 10 ; Fisher posed linear function approximation methods based on orthogonal vectors 11 ; Orgwattanalcul proposed a fixed domain block coding method. 13 On the basis of above studies, this paper proposes a fractal image compression algorithm which is based on asymptotic move strategy and quadtree partition.…”

“…[10][11][12][13] For example, Monro put forward path fractal transform by coding sub-blocks 10 ; Fisher posed linear function approximation methods based on orthogonal vectors 11 ; Orgwattanalcul proposed a fixed domain block coding method. 13 On the basis of above studies, this paper proposes a fractal image compression algorithm which is based on asymptotic move strategy and quadtree partition. The proposed method first searches the optimal matched domain block in five nearest neighbors of the range block, and then carries out an asymptotic search process along the direction of potential optimal solution, which greatly reduce the search space; if the optimal matched solution is not improved in the process of asymptotic search, we carry out quadtree partition for the range block and its corresponding domain block, and repeat the above asymptotic search process.…”