2010 3rd International Congress on Image and Signal Processing 2010
DOI: 10.1109/cisp.2010.5647972
|View full text |Cite
|
Sign up to set email alerts
|

An improved Douglas-Peucker algorithm for fast curve approximation

Abstract: A novel polygonal approximation algorithm for curve representation is proposed in this paper. This algorithm is based on the framework of the Douglas-Peucker algorithm. By integrating the cornerity index as the measure, it iteratively selects the points with local extremum of cornerity index under the control of max perpendicular distance till no points can be marked. With the cornerity index, not only does the corner selection procedure keep simple, the selected corners are more accurate too. The proposed alg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
2
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…To make the process more robust, we ensured that the resulting contour is a rectangle. This was done by approximating the contour using the Douglas–Peucker algorithm, 31 , 32 ensuring that the contour consisted of four lines even when the frame was cut off or other artifacts were obstructing the frame. Next, we checked the angles between the four lines of the approximated contour, ensuring that it was at least close to a rectangle.…”
Section: Methodsmentioning
confidence: 99%
“…To make the process more robust, we ensured that the resulting contour is a rectangle. This was done by approximating the contour using the Douglas–Peucker algorithm, 31 , 32 ensuring that the contour consisted of four lines even when the frame was cut off or other artifacts were obstructing the frame. Next, we checked the angles between the four lines of the approximated contour, ensuring that it was at least close to a rectangle.…”
Section: Methodsmentioning
confidence: 99%
“…To make the process more robust, we ensured that the resulting contour is a rectangle. This was done by approximating the contour using the Douglas-Peucker algorithm, 31,32 ensuring that the contour consisted of four lines even when the frame was cut-off or other artifacts were obstructing the frame.…”
Section: Image Analysis Of Manually Recorded 24-hour Iop Profilesmentioning
confidence: 99%
“…Since its introduction [6] the DP algorithm has become a classic reference approach for line partitioning, and still remains the subject of various extensions and improvements [7], [8]. The DP algorithm approximates a trajectory by recursively splitting the component at the point farthest from that line, until no interior points are farther than a pre-selected tolerance parameter ε (expressed for example as a number of pixels).…”
Section: Trajectory Partitioning Using MMLmentioning
confidence: 99%