The DOI matches its Crossref record.
A near optimal coder for image geometry with adaptive partitioning
Abstract
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry (e.g. wedgelet) in two ways. First, we employ an adaptive rectangular partitioning rather than quadratic partitioning. Second, our coder uses an overcomplete collection of (stripe-like) atoms which contains wedgelets as a special case. We present an information-theoretical analysis based on Kolmogorov's e- entropy to show that this collection provides a near-optimal representation of a class of cartoon images with piecewise polynomial boundaries. Furthermore, we develop a provably near-optimal greedy algorithm that significantly reduces the complexity of the exhaustive search method required to achieve the entropy bound. Simulation results for the rate distortion shows a 1.5-2 dB improvement over the standard wedgelets for the "Cameraman" image.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Maleki, Shahram and Carlsson (2008) constructed a scheme based on the Klein bottle which outperforms wedgelets on some particular images.
“Maleki, Shahram and Carlsson (2008) have constructed a scheme based on the Klein bottle which outperforms wedgelets on some particular images.”
From Topological pattern recognition for point cloud data (2014) · cites this paper as Maleki, Shahram and Carlsson (2008)
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 13
- hastie, 2001, The Elements of Statistical Learning, 10.1007/978-0-387-21606-5 · DOI · Paper page
- 10.1002/0471200611 · DOI
- royden, 1968, Real Analysis
- 10.1109/TSP.2006.881199 · DOI
- candes, 1999, curvelets-a surprisingly effective nonadaptive representation for objects with edges, Curves and Sureface fitting
- 10.1214/aos/1018031261 · DOI · Paper page
- 10.1109/79.952805 · DOI
- 10.1038/381607a0 · DOI · Paper page
- 10.1109/DCC.2002.999942 · DOI
- 10.1109/TIP.2005.859376 · DOI
- 10.1098/rsta.1999.0444 · DOI
- 10.1109/TIP.2004.840710 · DOI
- do, 2001, on the compression two-dimensional piecewise smooth functions, IEEE International Conf on Image Proc, 14
Cited by
Sorted by citations
Topological pattern recognition for point cloud data
Carlsson, G. (2014) · Acta Numerica · doi:10.1017/s0962492914000051 · Cited by 230
Self-citation
Metadata
- Authors
- Maleki, A., Shahram, M., & Carlsson, G.
- Affiliations
- Stanford University (US)
- Venue
- 2008 15th IEEE International Conference on Image Processing
- Publisher
- IEEE
- Published
- 2008
- Pages
- 1061-1064
- ISSN
- 1522-4880 (ISSN-L)
- OpenAlex
- W2171177138
- Cited by
- 8
- References
- 0
- Citations by year
- 2020: 1 · 2018: 1 · 2012: 2
- FWCI
- 1.07
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Proceedings - International Conference on Image Processing (publishedVersion)
- Funders
- Defense Advanced Research Projects Agency
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Signal Processing › Video Coding and Compression Technologies
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- information-theoretic limits, greedy algorithm, cartoons, rate-distortion performance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
