A parallel implementation of a fractal image compression algorithm

Stapleton, William A.; Mahmoud, Wagdy; Jackson, David Jeff

doi:10.1109/ssst.1996.493524

Cited by 4 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique allows circumventing the computational load of the encoding fractal compression within a VS node. Various parallel implementations of a fractal image compression are proposed in the literature [75][76][77]. A reader interested by this subject is invited to consult [78,79].…”

Section: Fractal Compressionmentioning

confidence: 99%

A Survey of Image Compression Algorithms for Visual Sensor Networks

Mammeri

Hadjou

Khoumsi

2012

ISRN Sensor Networks

View full text Add to dashboard Cite

With the advent of visual sensor networks (VSNs), energy-aware compression algorithms have gained wide attention. That is, new strategies and mechanisms for power-efficient image compression algorithms are developed, since the application of the conventional methods is not always energy beneficial. In this paper, we provide a survey of image compression algorithms for visual sensor networks, ranging from the conventional standards such as JPEG and JPEG2000 to a new compression method, for example, compressive sensing. We provide the advantages and shortcomings of the application of these algorithms in VSN, a literature review of their application in VSN, as well as an open research issue for each compression standard/method. Moreover, factors influencing the design of compression algorithms in the context of VSN are presented. We conclude by some guidelines which concern the design of a compression method for VSN.

show abstract

Section: Fractal Compressionmentioning

confidence: 99%

A Survey of Image Compression Algorithms for Visual Sensor Networks

Mammeri

Hadjou

Khoumsi

2012

ISRN Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Stapleton et al [34] used a host and node model to explore the parallel nature of the iterated function system (IFS) calculation for image compression. The authors compared the methodology using quadtree decomposition and reposition partitioning scheme and claimed 10% usage of total time with the classifier.…”

Section: Optimisation Approaches Of the Ficmentioning

confidence: 99%

“…The authors compared the methodology using quadtree decomposition and reposition partitioning scheme and claimed 10% usage of total time with the classifier. The approach in [34] successfully reduced the execution time, but the computation complexity of the algorithm remains O ( n 4). The authors proposed various classification schemes to reduce the search space and the number of calculations.…”

Section: Optimisation Approaches Of the Ficmentioning

confidence: 99%

See 1 more Smart Citation

Computational complexity of fractal image compression algorithm

Gupta

Mehrotra

Tyagi³

2020

IET image process

View full text Add to dashboard Cite

This study presents insights into the computational complexity of fractal image compression (FIC) algorithms. Unlike JPEG, a fractal encoder necessitates more CPU time in contrast to the decoder. The study examines various factors that impact the encoder and its computational cost. Many researchers have dedicated themselves to the field of fractal encoding to overcome the computational cost of the FIC algorithm. Here, this study offers a look over the approaches in the aspect of time complexity. The automated baseline fractal compression algorithm is studied to demonstrate the understanding of delay in the encoder. The study establishes how various approaches trade‐off between the quality of decoder, compression ratio, and CPU time. The experiment section shows the bargain between fidelity criteria of the baseline algorithm.

show abstract

“…The construction of a PSTs takes a combination of idea from ( [15], [32], [31] and [19]) in order to build the most optimal approach. In ( [32]) the construction of the parallelized Suffix Tree algorithm are performed through several phases but it is only the first phase which could be useful in optimizing PST construction.…”

Section: Scot Trainingmentioning

confidence: 99%

Parallel implementation of information-theoretic separate testing of inputs and authorship detection via stochastic context trees with homogeneity testing and sequence divergence

Grosu

View full text Add to dashboard Cite

A parallel implementation of a fractal image compression algorithm

Cited by 4 publications

References 6 publications

A Survey of Image Compression Algorithms for Visual Sensor Networks

A Survey of Image Compression Algorithms for Visual Sensor Networks

Computational complexity of fractal image compression algorithm

Parallel implementation of information-theoretic separate testing of inputs and authorship detection via stochastic context trees with homogeneity testing and sequence divergence

Contact Info

Product

Resources

About