fractal coding
Recently Published Documents


TOTAL DOCUMENTS

153
(FIVE YEARS 2)

H-INDEX

13
(FIVE YEARS 0)

Author(s):  
Shailesh D. Kamble ◽  
Nileshsingh V. Thakur ◽  
Preeti R. Bajaj

Main objective of the proposed work is to develop an approach for video coding based on Fractal coding using the weighted finite automata (WFA). The proposed work only focuses on reducing the encoding time as this is the basic limitation why the Fractal coding not becomes the practical reality. WFA is used for the coding as it behaves like the Fractal Coding (FC). WFA represents an image based on the idea of fractal that the image has self-similarity in itself. The plane WFA (applied on every frame), and Plane FC (applied on every frame) coding approaches are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, Traffic, Paris, Bus, Akiyo, Mobile, Suzie etc. and on the recorded video, namely, Geometry and Circle. Developed approaches are compared on the basis of performance evaluation parameters, namely, encoding time, decoding time, compression ratio, compression percentage, bits per pixel and Peak Signal to Noise Ratio (PSNR). Though the initial number of states is 256 for every frame of all the types of videos, but we got the different number of states for different frames and it is quite obvious due to minimality of constructed WFA for respective frame. Based on the obtained results, it is observed that the number of states is more in videos namely, Traffic, Bus, Paris, Mobile, and Akiyo, therefore the reconstructed video quality is good in comparison with other videos namely, Circle, Suzie, and Geometry.





2020 ◽  
Vol 39 (10) ◽  
pp. 5198-5225 ◽  
Author(s):  
Ahmed Hussain Ali ◽  
Loay Edwar George ◽  
Mohd Rosmadi Mokhtar


Author(s):  
Ahmed Hussain Ali ◽  
Loay Edwar George ◽  
Omar S. Saleh ◽  
Mohd Rosmadi Mokhtar ◽  
Qusay Al-Maatouk

The goal of compression techniques is to reducing the size of data and decreasing the communication cost while transferring data. Fractal based coding technique is widely used to compress images files which provides high compression ratio and good image quality. However, like a compression technique, it is still limited because of the difference of the human perceptions between audio and image files, the long time for searching the best possible domain blocks and many comparisons in the encoding process. For those reasons, Fractal Coding had not broadly studied on audio data. Few years ago, Fractal Coding has been extended to apply on the audio data. In this paper, the application of the Fractal Coding on different types of audio files is investigated. Moreover, the effect of block length on the audio quality and compression performance are highlighted since block length is considered the main factor in the Fractal Coding algorithm. A GTZAN dataset is adopted in the evaluation and the experimental results show that there is an inverse relationship between block length and audio quality and proportional relationship between block length and compression ratio and factor. Furthermore, it can be noticed that the Fractal Coding can be compressed any speech and music audio signal directly with acceptable quality, PSNR 39 dB on average with a high compression ratio around 90 % with compression factor around 10 when the block length is 20 samples.



2020 ◽  
Vol 15 ◽  
pp. 2587-2601 ◽  
Author(s):  
Sani M. Abdullahi ◽  
Hongxia Wang ◽  
Tao Li


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Zhen Hua ◽  
Haicheng Zhang ◽  
Jinjiang Li

Fractal coding techniques are an effective tool for describing image textures. Considering the shortcomings of the existing image super-resolution (SR) method, the large-scale factor reconstruction performance is poor and the texture details are incomplete. In this paper, we propose an SR method based on error compensation and fractal coding. First, quadtree coding is performed on the image, and the similarity between the range block and the domain block is established to determine the fractal code. Then, through this similarity relationship, the attractor is reconstructed by super-resolution fractal decoding to obtain an interpolated image. Finally, the fractal error of the fractal code is estimated by the depth residual network, and the estimated version of the error image is added as an error compensation term to the interpolation image to obtain the final reconstructed image. The network structure is jointly trained by a deep network and a shallow network. Residual learning is introduced to greatly improve the convergence speed and reconstruction accuracy of the network. Experiments with other state-of-the-art methods on the benchmark datasets Set5, Set14, B100, and Urban100 show that our algorithm achieves competitive performance quantitatively and qualitatively, with subtle edges and vivid textures. Large-scale factor images can also be reconstructed better.



2019 ◽  
Vol 13 (11) ◽  
pp. 1872-1879
Author(s):  
Jian Cao ◽  
Aihua Zhang ◽  
Lei Shi


Author(s):  
Ahmed Huaasin Ali ◽  
Ali Nihad Abbas ◽  
Loay Edwar George ◽  
Mohd Rosmadi Mokhtar

<p>This study aims to review the recent techniques in digital multimedia compression with respect to fractal coding techniques. It covers the proposed fractal coding methods in audio and image domain and the techniques that were used for accelerating the encoding time process which is considered the main challenge in fractal compression. This study also presents the trends of the researcher's interests in applying fractal coding in image domain in comparison to the audio domain. This review opens directions for further researches in the area of fractal coding in audio compression and removes the obstacles that face its implementation in order to compare fractal audio with the renowned audio compression techniques.</p>



2019 ◽  
Vol 531 (2) ◽  
pp. 1970014
Author(s):  
Samaneh Moeini ◽  
Tie Jun Cui
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document