Fractal Coding Based Video Compression Using Weighted Finite Automata

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.

2018 ◽  
Vol 9 (1) ◽  
pp. 115-133 ◽  
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.


1998 ◽  
Vol 16 (1) ◽  
pp. 108-119 ◽  
Author(s):  
U. Hafner ◽  
J. Albert ◽  
S. Frank ◽  
M. Unger

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2872
Author(s):  
Miroslav Uhrina ◽  
Anna Holesova ◽  
Juraj Bienik ◽  
Lukas Sevcik

This paper deals with the impact of content on the perceived video quality evaluated using the subjective Absolute Category Rating (ACR) method. The assessment was conducted on eight types of video sequences with diverse content obtained from the SJTU dataset. The sequences were encoded at 5 different constant bitrates in two widely video compression standards H.264/AVC and H.265/HEVC at Full HD and Ultra HD resolutions, which means 160 annotated video sequences were created. The length of Group of Pictures (GOP) was set to half the framerate value, as is typical for video intended for transmission over a noisy communication channel. The evaluation was performed in two laboratories: one situated at the University of Zilina, and the second at the VSB—Technical University in Ostrava. The results acquired in both laboratories reached/showed a high correlation. Notwithstanding the fact that the sequences with low Spatial Information (SI) and Temporal Information (TI) values reached better Mean Opinion Score (MOS) score than the sequences with higher SI and TI values, these two parameters are not sufficient for scene description, and this domain should be the subject of further research. The evaluation results led us to the conclusion that it is unnecessary to use the H.265/HEVC codec for compression of Full HD sequences and the compression efficiency of the H.265 codec by the Ultra HD resolution reaches the compression efficiency of both codecs by the Full HD resolution. This paper also includes the recommendations for minimum bitrate thresholds at which the video sequences at both resolutions retain good and fair subjectively perceived quality.


2007 ◽  
Vol 18 (04) ◽  
pp. 799-811
Author(s):  
MATHIEU GIRAUD ◽  
PHILLIPE VEBER ◽  
DOMINIQUE LAVENIER

Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ∊-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ∊-transitions-removal problem. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.


Author(s):  
U.S.N. Raju ◽  
Irlanki Sandeep ◽  
Nattam Sai Karthik ◽  
Rayapudi Siva Praveen ◽  
Mayank Singh Sachan

Sign in / Sign up

Export Citation Format

Share Document