Region-based fractal image compression using deterministic search

Breazu, Macarie; Toderean, Gavril

doi:10.1109/icip.1998.723602

Cited by 3 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This process is repeated until no more triangles are formed. There are other types of partitioning techniques proposed, such as right angle irregular shape partitioning technique (Breazu and Toderean, 1998;Hartenstein and Saupe, 2000); Belloulata and Konard (2002) use the rectangular range, and domain block for best matching in this boundary blocks is divided into different regions; Ochotta and Saupe (2004) worked on the split and merge partitioning scheme. In this partitioning scheme, the process of partitioning is divided into two phases, i.e., splitting and merging.…”

Section: Challenges In Fractal Codingmentioning

confidence: 99%

Quadtree partitioning and extended weighted finite automata-based fractal colour video coding

Kamble

Thakur²,

Malik

et al. 2016

IJIM

View full text Add to dashboard Cite

Fractal coding technique has become the most popular coding technique in the recent development of image/video compression technologies for its better performance, achieving a high compression ratio, less decoding time and good reconstruction quality of image. This paper elaborates on the approach which is a combination of a quadtree partitioning scheme and extended weighted finite automata (EWFA) coding for fractal video compression based on the concept of intra-frame coding. The quadtree partitioning scheme is used to specify the address of each sub-image. It is observed that any image can be represented by the quadtree-based EWFA; the S.D. Kamble et al. quadtree-based EWFA coding process is similar to fractal coding process; and also the size of domain pool increases dynamically during the process of quadtree-based EWFA encoding as that of in fractal coding. Experimentations are carried on standard databases like Soccer, Suzie, Bus, Football, Xylophone, Paris, Traffic, Akiyo, Ice and mobile sequence. The developed basic fractal image compression existing mechanism is also further implemented on video/image sequences based on the concept of intra-frame coding used for comparing the results with the proposed approach. Experimental results show that the EWFA encoding/decoding process improves the quality, compression ratio, encoding and decoding time of reconstructed image sequence.

show abstract

Section: Challenges In Fractal Codingmentioning

confidence: 99%

Quadtree partitioning and extended weighted finite automata-based fractal colour video coding

Kamble

Thakur²,

Malik

et al. 2016

IJIM

View full text Add to dashboard Cite

show abstract

“…To find optimal transformations (irregularly-shaped range blocks and corresponding transformations) for a given distortion, an exhaustive search of the space of blocks needs to be performed. Since this is hardly practical, suboptimal but computationally-efficient approaches have been proposed, such as heuristic algorithm [14], evolutionary algorithm [15], [16] and deterministic search [17]. Note, that the described method creates image partitioning during encoding and does not use any prior partitioning, unlike in MPEG-4.…”

Section: Fractal Image Coding With Irregularly-shaped Range and mentioning

confidence: 99%

“…In fine-to-coarse quadtree partitioning [13] small blocks are merged into larger blocks within a quadtree. Alternatively, neighboring range blocks can be merged without the quadtree restriction; rightangled irregularly-shaped (IS) range blocks result [14], [15], [16], [17], [18]. Although the range, and consequently domain blocks, can take on a variety of shapes, this method creates partitions based on thresholding a simple local metric and cannot, in general, produce semantically-meaningful regions.…”

Section: Introductionmentioning

confidence: 99%

Fractal image compression with region-based functionality

Belloulata

Konrad

2002

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

Region-based functionality offered by the MPEG-4 video compression standard is also appealing for still images, for example to permit object-based queries of a still-image database. A popular method for still-image compression is fractal coding. However, traditional fractal image coding uses rectangular range and domain blocks. Although new schemes have been proposed that merge small blocks into irregular shapes, the merging process does not, in general, produce semantically-meaningful regions. We propose a new approach to fractal image coding that permits region-based functionalities; images are coded region by region according to a previously-computed segmentation map. We use rectangular range and domain blocks, but divide boundary blocks into segments belonging to different regions. Since this prevents the use of standard dissimilarity measure, we propose a new measure adapted to segment shape. We propose two approaches: one in the spatial and one in the transform domain. While providing additional functionality, the proposed methods perform similarly to other tested methods in terms of PSNR but often result in images that are subjectively better. Due to the limited domain-block codebook size, the new methods are faster than other fractal coding methods tested. The results are very encouraging and show the potential of this approach for various internet and still-image database applications.

show abstract