An automatic region-based video sequence codec based on fractal compression

Zhu, Shiping; Li, Liyun; Chen, Juqiang; Belloulata, Kamel

doi:10.1016/j.aeue.2014.03.003

Cited by 8 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed methods present an average of 20% reduction in coding time and 2% decrease in compression ratio with marginal degradation of PSNR by 0.15 dB if compared to the H.264. Table 2 shows the comparison of performances of the proposed methods with existing fractal video coder methods [17,18,20]. In each existing method, the different video sequences with different GOPs are used for analysis.…”

Section: Resultsmentioning

confidence: 99%

“…The sequence highway (15 frames, 352 × 288 pixels) is used and the compression ratio is 3.55 times with PSNR 1.72 dB higher than average of [17,18]. The silent and mother-daughter (20 frames each, 352 × 288 pixels) sequences are used and their average PSNR increased by 4.11 dB and bit rate decreased by 33% in comparison with algorithm in [20]. For low bit rate videos, these proposed methods give much better performance than H.264.…”

Section: Resultsmentioning

confidence: 99%

“…A new object-based method [19] is introduced in the transform domain using shape-adaptive DCT for stereo video compression. Zhu et al proposed an automatic region-based video coder [20] with asymmetrical hexagon searching algorithm and deblocking loop filter to improve decompression video quality. High efficiency fractal multiview codec is presented in [21] to encode anchor viewpoint video using intraprediction modes and fractal coder with motion compensation technique.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fractal Video Coding Using Fast Normalized Covariance Based Similarity Measure

Chaudhari

Dhok

2016

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Fast normalized covariance based similarity measure for fractal video compression with quadtree partitioning is proposed in this paper. To increase the speed of fractal encoding, a simplified expression of covariance between range and overlapped domain blocks within a search window is implemented in frequency domain. All the covariance coefficients are normalized by using standard deviation of overlapped domain blocks and these are efficiently calculated in one computation by using two different approaches, namely, FFT based and sum table based. Results of these two approaches are compared and they are almost equal to each other in all aspects, except the memory requirement. Based on proposed simplified similarity measure, gray level transformation parameters are computationally modified and isometry transformations are performed using rotation/reflection properties of IFFT. Quadtree decompositions are used for the partitions of larger size of range block, that is, 16 × 16, which is based on target level of motion compensated prediction error. Experimental result shows that proposed method can increase the encoding speed and compression ratio by 66.49% and 9.58%, respectively, as compared to NHEXS method with increase in PSNR by 0.41 dB. Compared to H.264, proposed method can save 20% of compression time with marginal variation in PSNR and compression ratio.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fractal Video Coding Using Fast Normalized Covariance Based Similarity Measure

Chaudhari

Dhok

2016

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…An automatic region-based video sequence codec based on fractal compression [21] uses intra frame coding. It also uses deblocking loop filter and sub pixel matching to increase the quality of the decoded image.…”

Section: Literature Reviewmentioning

confidence: 99%

Fractal based Image Compression Techniques

Kadam¹,

Rathod²

2017

IJCA

View full text Add to dashboard Cite

Fractal image compression offers high compression ratios and quality image reconstruction. It uses various techniques as the fractal with DCT, wavelet, neural network, genetic algorithms, quantum acceleration etc. Additionally, because fractals are infinitely magnifiable, fractal compression is resolution independent and so a single compressed image can be used efficiently for display in any image resolution including resolution higher than the resolution of the original image. Breaking an image into pieces and identifying selfsimilar ones is the main principle of the approach. In this paper, the different issues in fractal image compression as partitioning, larger encoding time, compression ratio, quality of the reconstructed image, decoding time, SSIM(Structured Similarity Index) are discussed and highlighted. The various areas for improvement as larger encoding time and PSNR are also suggested. The various parameters for evaluating the performance of these techniques as PSNR, compression ratio, encoding time, and decoding time are also suggested. Comparison of Fractal techniques for color image, texture and satellite image is done using different parameters as compression time, compression ratio and PSNR. The hybrid method which combines Fractal quad tree with wavelet and Huffman coding is implemented and compared different parameters as compression ratio and the compression time of the proposed method with the existing methods.

show abstract

“…Our previous studies of fractal video compression [7,8] also demonstrate its good compression performance. Fractal coding techniques are based on the theory of iterated function systems (IFS) and are further developed by Barnsley in the early 1980s [9,10].…”

Section: Introductionmentioning

confidence: 99%

Hybrid Prediction and Fractal Hyperspectral Image Compression

Zhu

Zhao

Wang³

2015

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

The data size of hyperspectral image is too large for storage and transmission, and it has become a bottleneck restricting its applications. So it is necessary to study a high efficiency compression method for hyperspectral image. Prediction encoding is easy to realize and has been studied widely in the hyperspectral image compression field. Fractal coding has the advantages of high compression ratio, resolution independence, and a fast decoding speed, but its application in the hyperspectral image compression field is not popular. In this paper, we propose a novel algorithm for hyperspectral image compression based on hybrid prediction and fractal. Intraband prediction is implemented to the first band and all the remaining bands are encoded by modified fractal coding algorithm. The proposed algorithm can effectively exploit the spectral correlation in hyperspectral image, since each range block is approximated by the domain block in the adjacent band, which is of the same size as the range block. Experimental results indicate that the proposed algorithm provides very promising performance at low bitrate. Compared to other algorithms, the encoding complexity is lower, the decoding quality has a great enhancement, and the PSNR can be increased by about 5 dB to 10 dB.

show abstract

An automatic region-based video sequence codec based on fractal compression

Cited by 8 publications

References 26 publications

Fractal Video Coding Using Fast Normalized Covariance Based Similarity Measure

Fractal Video Coding Using Fast Normalized Covariance Based Similarity Measure

Fractal based Image Compression Techniques

Hybrid Prediction and Fractal Hyperspectral Image Compression

Contact Info

Product

Resources

About