2006
DOI: 10.1109/aipr.2006.30
|View full text |Cite
|
Sign up to set email alerts
|

Rapid Automated Polygonal Image Decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 1 publication
0
13
0
Order By: Relevance
“…Lecot and Levy [2006] decompose images into a set of regions delimited by cubic splines, each with their own precomputed color gradients. Swaminarayan and Prasad [2006] placed triangle primitives along edges in images and sampled the triangle colors from the original image, resulting in an artistic abstraction of the input. Demaret et al [2006] combined an adaptive triangulation with a first-order spline in order to more accurately preserve input image details, specifically for image compression.…”
Section: Related Workmentioning
confidence: 99%
“…Lecot and Levy [2006] decompose images into a set of regions delimited by cubic splines, each with their own precomputed color gradients. Swaminarayan and Prasad [2006] placed triangle primitives along edges in images and sampled the triangle colors from the original image, resulting in an artistic abstraction of the input. Demaret et al [2006] combined an adaptive triangulation with a first-order spline in order to more accurately preserve input image details, specifically for image compression.…”
Section: Related Workmentioning
confidence: 99%
“…The information is represented in the Scalable Vector Graphics (SVG) format which allows a very compact encoding of the vector data. A related approach [7] that is used in the RaveGrid 978-1-4244-7493-6/10/$26.00 c 2010 IEEE ICME 2010 1124 software [8] is the use of the Delaunay triangulation that fits triangles to image regions. The limitation of this method (and of [4]) is that a large amount of vector data (triangles or polygons) is required for a faithful reconstruction of the original image.…”
Section: Related Workmentioning
confidence: 99%
“…Existing vectorization techniques for full-color raster images fall roughly into three categories. Triangulations A few algorithms have been proposed based on constrained Delaunay triangulation [16], [22], [29]. In triangulation-based representations, each curvilinear feature needs to be approximated by many short line segments.…”
Section: Related Workmentioning
confidence: 99%