Fractal image compression with quadtree partitioning and a new fast classification strategy

Nandi, Utpal; Santra, Sahadeb; Mandal, Jyotsna Kumar; Nandi, Suman

doi:10.1109/c3it.2015.7060153

Cited by 8 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposal research is concerned more with accelerating compression processing based on fractals, so from the Table I we can notice that the best technique that gives high speed up compression with Less encoding time by using "DCT with Quadtree Partitioning" in [17] which applied on Lena image with Image size(256× 256) and Block size(8×8). As for video compression the highest speed achieve in [12] Which reduced the encoding time and increased the quality of video sequence that applied on 'mother-daughter' video with frame size(352×288) and block size(8×8) by using "Fractal video sequences compression coding with region-based on functionality" technique.…”

Section: Discussionmentioning

confidence: 99%

“…U. Nandi, S. Santra, J. K. Mandal, and S. Nandi, 2015 [17] created a new rapid classification strategy with quadtree partitioning technique and DCT for image compression . The compression ratio and peak signal to noise ratio (PSNR) of the fractal image compression approach are maintained by this classification procedure, but the compression time is greatly reduced.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Review on Fractal Video and Image Compression Techniques

2023

IJCCCE

View full text Add to dashboard Cite

Compression of images process is a step in the image processing. It is concerned with the transmission and storage of digitally created images. Fractal coding is a potential image and video compression approach with good reconstruction fidelity and relatively large compression ratios, because of its simplicity and great performance; fractal image compression (FIC) is a particularly popular approach in image compression applications. However, it has a significant disadvantage in the form of a long encoding time. This is because encoding any small bit necessitates a massive similarity search in the original data As a result; the FIC search time is reduced while the quality of the reconstructed images is maintained acceptable level in many introduced paper and other still a study topic in progress. Fractal images are images that are self-similar in that each individual part is the same as the total. This paper will discusses many attempts for more author that working on image and video compression using fractal compression technique based on various approach and with each discuss focuses on the main parameter of compression such compression ratio (CR), peak signal to noise ratio (PSNR) and encoding time, as well as the details of data set the used for testing also writing with each technique to creating fractal video and image compression. Index Terms— FIC, Video compression, parallel processing, Iteration Function System (IFS), Image processing.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Review on Fractal Video and Image Compression Techniques

2023

IJCCCE

View full text Add to dashboard Cite

show abstract

“…The zero values eliminated using a zig-zag approach on the block values, which improves compression quality and extracts nonzero data. In U. Nandi, et al [45] created a new rapid classification strategy with quadtree partitioning technique and DCT for image compression. The compression ratio and peak signal to noise ratio (PSNR) of the fractal image compression approach is maintained by this classification procedure, but the compression time is greatly reduced.…”

Section: Related Workmentioning

confidence: 99%

Fast Full-Search Algorithm of Fractal Image Compression for Acceleration Image Processing

Abood

Akkar

Al-Safi

2023

SJUOZ

View full text Add to dashboard Cite

A new processing algorithm based on fractal image compression is proposed for image processing efficiency. An image will partition into non-overlapping blocks called range blocks and overlapping blocks called domain blocks, with the domain blocks generally bigger than the range blocks, to achieve a rapid encoding time. This research introduced a new fast full-search algorithm approach that starts the search for the best matching domain in the range block from the closest points in the range blocks and expands the search until an acceptable match is found or the search is completed to save even more encoding time. The proposed fast full-search approach, despite its simplicity, is more efficient than the standard search method. The search reduction, peak signal to noise ratio, compression ratio, and encoding time of the suggested approach are all examined. The proposed method can encode a 512x512 grayscale Lena image in 0.36 seconds, with a total search reduction of 87% according to experimental results.

show abstract

A Novel Hierarchical Classification Scheme for Adaptive Quadtree Partitioning Based Fractal Image Coding

Nandi

Mandal

2018

Social Transformation – Digital Way

View full text Add to dashboard Cite

Fractal image compression with quadtree partitioning and a new fast classification strategy

Cited by 8 publications

References 10 publications

Review on Fractal Video and Image Compression Techniques

Review on Fractal Video and Image Compression Techniques

Fast Full-Search Algorithm of Fractal Image Compression for Acceleration Image Processing

A Novel Hierarchical Classification Scheme for Adaptive Quadtree Partitioning Based Fractal Image Coding

Contact Info

Product

Resources

About