JBEAM: multiscale curve coding via beamlets

A multiscale coder for curves and boundaries is presented. It utilizes a multiscale structure-beamlets-that is designed primarily for linear and curvilinear features. The coder is composed of three main components: 1) a rate-distortion optimized beamlet-based representation, 2) a tree-based coding from a beamlet representation to a symbol stream, and 3) an entropy coder. This coder is named "JBEAM". Taking advantage of its multiscale property, we utilized tree-based coding to make it progressive. The derived coder has a low order of computational complexity. Simulations demonstrate an advantage over the state-of-the-art industrial standard: JBIG 2. A software package, which includes an implementation of JBEAM, is made available. Variations and potential improvements of this method will be discussed. This work may inspire more activities in this line of research, improving curve coding.

[1]  Jörn Ostermann,et al.  Special Issue on Shape Coding for Emerging Multimedia Applications , 2000, Signal Process. Image Commun..

[2]  Azriel Rosenfeld,et al.  The Chain Pyramid: Hierarchical Contour Processing , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Minh N. Do,et al.  Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images , 2005, IEEE Transactions on Image Processing.

[4]  Jack Koplowitz,et al.  Hierarchical Representation of Chain-Encoded Binary Image Contours , 1996, Comput. Vis. Image Underst..

[5]  Alan C. Bovik,et al.  Generalized predictive binary shape coding using polygon approximation , 2000, Signal Process. Image Commun..

[6]  Aggelos K. Katsaggelos,et al.  An efficient rate-distortion optimal shape coding approach utilizing a skeleton-based decomposition , 2003, IEEE Trans. Image Process..

[7]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[8]  D. Donoho.  Wedgelets: nearly minimax estimation of edges , 1999 .

[9]  D. Donoho,et al.  Fast Slant Stack: a notion of Radon transform for data in a Cartesian grid which is rapidly computable, algebraically exact, geometrically faithful and invertible , 2003 .

[10]  Minh N. Do,et al.  Rat e-distortion optimized tree structured compression algorithms for piecewise smooth images , 2005 .

[11]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..

[12]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[13]  Herbert Freeman,et al.  Application of the Generalized Chain Coding Scheme to Map Data Processing. , 1978 .

[14]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[15]  Søren Forchhammer,et al.  Context based coding of binary shapes by object boundary straightness analysis , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[16]  Aggelos K. Katsaggelos,et al.  MPEG-4 and rate-distortion-based shape-coding techniques , 1998, Proc. IEEE.

[17]  Faouzi Kossentini,et al.  The emerging JBIG2 standard , 1998, IEEE Trans. Circuits Syst. Video Technol..

[18]  Sambhunath Biswas.  Contour coding through stretching of discrete circular arcs by affine transformation , 2001, Pattern Recognit..

[19]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[20]  Xiaoming Huo,et al.  Beamlets and Multiscale Image Analysis , 2002 .

[21]  Justin K. Romberg,et al.  Wavelet-domain approximation and compression of piecewise smooth images , 2006, IEEE Transactions on Image Processing.

[22]  M. Pauline Baker,et al.  Computer Graphics, C Version , 1996 .

[23]  Aggelos K. Katsaggelos,et al.  An optimal polygonal boundary encoding scheme in the rate distortion sense , 1998, IEEE Trans. Image Process..

[24]  Cheng-Chang Lu,et al.  Highly efficient coding schemes for contour lines based on chain code representations , 1991, IEEE Trans. Commun..