Rate-distortion optimized tree structured compression algorithms for piecewise smooth images

Rate-distortion optimized tree structured compression algorithms for piecewise smooth images (2005)

Cached

Download Links

by Rahul Shukla , Pier Luigi Dragotti , Minh N. Do , Martin Vetterli

Venue:	IEEE Trans. Image Processing
Citations:	53 - 13 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Rate-distortion optimized tree structured compression algorithms for piecewise smooth images	INFERENCE
AUTHOR NAME	Rahul Shukla	SVM HeaderParse 0.2
AUTHOR AFFIL	§ Department of EECS	SVM HeaderParse 0.2
AUTHOR ADDR	University of California Berkeley, CA 94720, USA	SVM HeaderParse 0.2
AUTHOR NAME	Pier Luigi Dragotti	SVM HeaderParse 0.2
AUTHOR AFFIL	§ Department of EECS	SVM HeaderParse 0.2
AUTHOR ADDR	University of California Berkeley, CA 94720, USA	SVM HeaderParse 0.2
AUTHOR NAME	Minh N. Do	SVM HeaderParse 0.2
AUTHOR AFFIL	§ Department of EECS	SVM HeaderParse 0.2
AUTHOR ADDR	University of California Berkeley, CA 94720, USA	SVM HeaderParse 0.2
AUTHOR NAME	Martin Vetterli	SVM HeaderParse 0.2
AUTHOR AFFIL	§ Department of EECS	SVM HeaderParse 0.2
AUTHOR ADDR	University of California Berkeley, CA 94720, USA	SVM HeaderParse 0.2
ABSTRACT	IEEE Transactions on Image Processing This paper presents novel coding algorithms based on tree structured segmentation, which achieve the correct asymptotic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise poly-nomials, by using an R-D based prune and join scheme. For the one dimensional (1-D) case, our scheme is based on binary tree segmentation of the signal. This scheme approximates the signal segments using polynomial models and utilizes an R-D optimal bit allocation strategy among the different signal segments. The scheme further encodes similar neighbors jointly to achieve the correct exponentially decaying R-D behavior � D(R) ∼ c02 −c1R � , thus improving over classic wavelet schemes. We also prove that the com-putational complexity of the scheme is of O (N log N). We then show the extension of this scheme to the two dimensional (2-D) case using a quadtree. This quadtree coding scheme also achieves an exponentially decaying R-D behavior, for the polygonal image model composed of a white polygon shaped object against a uniform black background, with low computational cost of O (N log N). Again, the key is an R-D opti-mized prune and join strategy. Finally, we conclude with numerical results, which show that the proposed quadtree coding scheme outperforms JPEG2000 by about 1 dB for real images, like cameraman, at low rates of around 0.15 bpp.	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	IEEE Trans. Image Processing	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	343--359	INFERENCE
VOLUME	14	INFERENCE
CITATIONS	32 found	ParsCit 1.0