DocumentCode
1923264
Title
Application of Quad Tree for low bitrate compression
Author
Varma, K. C Ravi Chandra ; Parthasarathy, Sudharsan ; Sankaran, Praveen
Author_Institution
Dept. of Electron. & Commun. Eng., Nat. Inst. of Technol. Calicut, Calicut, India
fYear
2012
fDate
2-3 March 2012
Firstpage
104
Lastpage
108
Abstract
Quad Tree algorithm is an efficient method for image compression at lower bit rates. It divides the image into four equal quadrants based on a threshold. The threshold is chosen from image characteristics using Otsu thresholding method. The image regions obtained from the Quad Tree decomposition are approximated by using a first order polynomial. Polynomial approximation coefficients now represent the pixel values. Its performance is better than JPEG at lower bitrates.
Keywords
data compression; image coding; polynomial approximation; quadtrees; JPEG; Otsu thresholding method; first order polynomial; image compression; low bitrate compression; polynomial approximation coefficients; quad tree algorithm; quad tree decomposition; Approximation methods; Bit rate; Image coding; Mathematical model; PSNR; Polynomials; Otsu Thresholding; Polynomial approximation of image; Quad Tree decomposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Signal Processing (CISP), 2012 2nd National Conference on
Conference_Location
Guwahati, Assam
Print_ISBN
978-1-4577-0719-3
Type
conf
DOI
10.1109/NCCISP.2012.6189687
Filename
6189687
Link To Document