Quadtree partitioning and extended weighted finite automata-based fractal colour video coding

2016 ◽  
Vol 2 (1) ◽  
pp. 31 ◽  
Author(s):  
Shailesh D. Kamble ◽  
Nileshsingh V. Thakur ◽  
Latesh G. Malik ◽  
Preeti R. Bajaj
Keyword(s):  
Video Coding ◽  
Finite Automata ◽  
Weighted Finite Automata

scholarly journals PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 799-811
Author(s):  
MATHIEU GIRAUD ◽  
PHILLIPE VEBER ◽  
DOMINIQUE LAVENIER
Keyword(s):  
Surface Area ◽  
Finite Automata ◽  
Clock Frequency ◽  
Partial Removal ◽  
Frequency Constraints ◽  
Weighted Automata ◽  
Weighted Finite Automata ◽  
Special Case

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.

Weighted Finite Automata Based Image Compression on Hadoop MapReduce Framework

2015 ◽  
Author(s):  
U.S.N. Raju ◽  
Irlanki Sandeep ◽  
Nattam Sai Karthik ◽  
Rayapudi Siva Praveen ◽  
Mayank Singh Sachan
Keyword(s):  
Image Compression ◽  
Finite Automata ◽  
Mapreduce Framework ◽  
Hadoop Mapreduce ◽  
Weighted Finite Automata

Fractal Coding Based Video Compression Using Weighted Finite Automata

2018 ◽  
Vol 9 (1) ◽  
pp. 115-133 ◽  
Author(s):  
Shailesh D. Kamble ◽  
Nileshsingh V. Thakur ◽  
Preeti R. Bajaj
Keyword(s):  
Video Compression ◽  
Signal To Noise Ratio ◽  
Finite Automata ◽  
Video Quality ◽  
Self Similarity ◽  
Fractal Coding ◽  
Time Compression ◽  
Practical Reality ◽  
Weighted Finite Automata ◽  
Evaluation Parameters

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.

Sign in / Sign up

Export Citation Format

Share Document