A full quadtree searchless IFS fractal image encoding algorithm applicable in both high and low compression rates

Fractal image compression is a lossy compression technique developed in the early 1990s. It makes use of the local self-similarity property existing in an image and finds a contractive mapping affine transformation (fractal transform) T, such that the fixed point of T is close to the given image in a suitable metric. It has generated much interest due to its promise of high compression ratios with good decompression quality. Image encoding based on fractal block-coding method relies on assumption that image redundancy can be efficiently exploited through block-self transformability. It has shown promise in producing high fidelity, resolution independent images. The low complexity of decoding process also suggested use in real time applications. The high encoding time, in combination with patents on technology have unfortunately discouraged results. In this paper, we have proposed efficient domain search technique using feature extraction for the encoding of fractal image which reduces encoding-decoding time and proposed technique improves quality of compressed image.

Download Full-text

SECURE FRACTAL IMAGE CODING BASED ON FRACTAL PARAMETER ENCRYPTION

Fractals ◽

10.1142/s0218348x09004405 ◽

2009 ◽

Vol 17 (02) ◽

pp. 149-160 ◽

Cited By ~ 9

Author(s):

SHIGUO LIAN ◽

XI CHEN ◽

DENGPAN YE

Keyword(s):

Image Coding ◽

Parameter Distribution ◽

Self Similarity ◽

Image Encoding ◽

Coding Scheme ◽

Fractal Image ◽

Fractal Image Coding ◽

Fractal Parameters ◽

Fractal Encoding ◽

Computational Resources

In recent work, various fractal image coding methods are reported, which adopt the self-similarity of images to compress the size of images. However, till now, no solutions for the security of fractal encoded images have been provided. In this paper, a secure fractal image coding scheme is proposed and evaluated, which encrypts some of the fractal parameters during fractal encoding, and thus, produces the encrypted and encoded image. The encrypted image can only be recovered by the correct key. To maintain security and efficiency, only the suitable parameters are selected and encrypted through investigating the properties of various fractal parameters, including parameter space, parameter distribution and parameter sensitivity. The encryption process does not change the file format, keeps secure in perception, and costs little time or computational resources. These properties make it suitable for secure image encoding or transmission.

Download Full-text

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

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512) ◽

10.1109/iscas.2004.1328907 ◽

2004 ◽

Cited By ~ 2

Author(s):

S. Ongwattanakul ◽

Xianwei Wu ◽

D.J. Jackson

Keyword(s):

Image Compression ◽

Real Time ◽

Image Encoding ◽

Compression Device ◽

Fractal Image ◽

Real Time Image ◽

Encoding Method ◽

Time Image

Download Full-text

Fractal Image Encoding

Unconventional Photoactive Solids ◽

10.1007/978-1-4613-0727-3_1 ◽

1988 ◽

pp. 1-10 ◽

Cited By ~ 1

Author(s):

M. F. Barnsley ◽

J. H. Elton ◽

A. D. Sloan ◽

H. Strickland

Keyword(s):

Image Encoding ◽

Fractal Image

Download Full-text

THE PARALLEL-PIPELINED IMPLEMENTATION OF THE FRACTAL IMAGE COMPRESSION FOR RECONFIGURABLE COMPUTING SYSTEMS

Vestnik komp iuternykh i informatsionnykh tekhnologii ◽

10.14489/vkit.2021.04.pp.037-044 ◽

2021 ◽

pp. 37-44

Author(s):

I. I. Levin ◽

M. D. Chekina

Keyword(s):

Image Compression ◽

Reconfigurable Computing ◽

Fractal Image Compression ◽

Computing Systems ◽

Image Encoding ◽

Fractal Image ◽

Computational Structure ◽

Parallel Pipeline ◽

Performance Reduction ◽

Critical Resource

The developed fractal image compression method, implemented for reconfigurable computing systems is described. The main idea parallel fractal image compression based on parallel execution pairwise comparison of domain and rank blocks. Achievement high performance occurs at the expense of simultaneously comparing maximum number of pairs. Implementation fractal image compression for reconfigurable computing systems has two critical resources, as number of input channels and FPGA Look-up Table (LUT). The main critical resource for fractal image compression is data channels, and implementation this task for reconfigurable computing systems requires parallel-pipeline computations organization replace parallel, preliminarily produced performance reduction parallel computational structure. The main critical resource for fractal image compression is data channels, and implementation this task for reconfigurable computing systems requires parallel-pipeline computations organization replace parallel computations organiation. For using parallel-pipeline computations organization, preliminarily have produce performance reduction parallel computational structure. Each operator has routed to computational structure sequentially (bit by bit) to save computational resources and reduces equipment downtime. Storing iterated functions system coefficients for image encoding has been introduced in data structure, which correlates between corresponding parameters the numbers of rank and domain blocks. Applying this approach for parallel-pipeline programs allows scaling computing structure to plurality programmable logic arrays (FPGAs). Task implementation on the reconfigurable computer system Tertius-2 containing eight FPGAs 15 000 times provides performed acceleration relatively with universal multi-core processor, and 18 – 25 times whit to existing solutions for FPGAs.

Download Full-text