JCURVE: multiscale curve coding via second order beamlets

Authors:
Agnieszka Lisowska;Tomasz Kaczmarzyk
Affiliations:
University of Silesia, Institute of Computer Science, Sosnowiec, Poland;University of Silesia, Institute of Computer Science, Sosnowiec, Poland
Venue:
Machine Graphics & Vision International Journal - Special issue on Image Databases
Year:
2010

Citing 14
Cited 0

The Chain Pyramid: Hierarchical Contour Processing

IEEE Transactions on Pattern Analysis and Machine Intelligence
Arithmetic coding for data compression

Communications of the ACM
Hierarchical representation of chain-encoded binary image contours

Computer Vision and Image Understanding
Applied Geometry for Computer Graphics

Applied Geometry for Computer Graphics
Curvature Scale Space Representation: Theory, Applications, and MPEG-7 Standardization

Curvature Scale Space Representation: Theory, Applications, and MPEG-7 Standardization
Algorithm for computer control of a digital plotter

IBM Systems Journal
Embedded image coding using zerotrees of wavelet coefficients

IEEE Transactions on Signal Processing
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory
The JPEG2000 still image coding system: an overview

IEEE Transactions on Consumer Electronics
A similarity metric for edge images

IEEE Transactions on Pattern Analysis and Machine Intelligence
JBEAM: multiscale curve coding via beamlets

IEEE Transactions on Image Processing
Piecewise Linear Digital Curve Representation and Compression Using Graph Theory and a Line Segment Alphabet

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology
The emerging JBIG2 standard

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents an algorithm JCURVE for compression of binary images with linear or curvilinear features, which is a kind of generalization of the JBEAM coder. The proposed algorithm is based on second order beamlet representation, where second order beamlets are defined as hierarchically organized segments of conic curves. The algorithm can compress images in both a lossy and losless way, and it is also progressive. The experiments performed on benchmark images have shown that the proposed algorithm significantly outperforms the known JBIG2 standard and the base JBEAM algorithm both in losless and lossy compression. It is characterized, additionally, by the same time complexity as JBEAM, namely O(N2 log2 N) for image of size N × N pixels.