Name
Abstract | ||
|---|---|---|
Compression of image contours is an important problem in many contexts. An example is object oriented video coding, where efficient encoding of shape information of arbitrarily shaped objects is a major problem. This paper presents a method for compressing contours by extracting representative points from the original curve. By formulating the point selection problem as a graph theory problem, known optimization theory can be applied in order to yield optimal compression with respect to a given error bound. The contour is reconstructed based on linear interpolation among the extracted curve points. The method presented guarantees a minimal distortion for a given number of retained curve points. Compared to many other compression methods, this method shows superior performance |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/ICIP.1998.723470 | Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference |
Keywords | Field | DocType |
data compression,edge detection,feature extraction,graph theory,image reconstruction,interpolation,optimisation,video coding,combinatorial optimization,contour reconstruction,error bound,graph theory,image contours compression,linear interpolation,minimal distortion,optimal compression,optimization theory,oriented video coding,performance,point selection problem,representative points extraction,shape information | Computer vision,Texture compression,Pattern recognition,Computer science,Edge detection,Interpolation,Combinatorial optimization,Artificial intelligence,Linear interpolation,Data compression,Image compression,Lossless compression | Conference |
Volume | ISBN | Citations |
1 | 0-8186-8821-1 | 4 |
PageRank | References | Authors |
0.52 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ranveig Nygaard | 1 | 7 | 1.40 |
| John Håkon Husøy | 2 | 341 | 34.26 |
| Dag Haugland | 3 | 151 | 15.18 |