Hybrid fractal image coding with quadtree-based progressive structure

Orthogonal sparse fractal coding algorithm based on image texture feature

“…Compared with the traditional image coding technology, the fractal coding algorithm has high time-consuming in the grey level matching process. In this research, scholars have obtained many effective fast fractal coding algorithms [9][10][11][12][13][14][15][16][17][18][19][20][21]. Starting from the spatial relationship, the neighbour approach [9][10][11] is adopted to reduce the search space that the matched image blocks are mostly adjacent.…”

“…There is also a widely-used classification scheme, the fast FIC scheme proposed by Fisher in 1995 [18]. In addition, researches improved by accelerating the decoding iteration [19,20] and adaptive image block segmentation [21]. For example, Tong and Pi proposed the orthogonalisation fractal coding algorithm [19] and Moon et al selected initial iteration images [20] to accelerate the iteration.…”

Fractal image coding algorithm using particle swarm optimisation and hybrid quadtree partition scheme

“…The methods described above are related to the classification techniques. To improve the encoding time largely, some methods based on spatial correlation and no search [11–18] strategies have been proposed. Wang et al [12] first proposed a hybrid method combining the genetic algorithm (GA) and spatial correlation in 2009.…”

“…Based on Wang's fitting plane‐based fractal image coding using least‐square regression (LS‐FPFIC) in [16], Lu et al [17] presented an efficient Huber fitting plane‐based FIC method (HFPFIC). In paper [18], Yuen suggested a hybrid fractal image coding scheme based on traditional and no search fractal image coding with the proposed progressive structure.…”