A non-parametric sequential method for polygonal approximation of digital curves

No abstract is available for this paper.

• Publication year

  1994

• Venue

  Pattern Recognition Letters

• Publication date

  1994-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0167-8655(94)90045-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Robust partial shape classification using invariant breakpoints and dynamic alignment

  1990cited by this paper
• Optimum Uniform Piecewise Linear Approximation of Planar Curves

  1986cited by this paper
• Corner detection and curve representation using cubic B-splines

  1986cited by this paper
• A fast sequential method for polygonal approximation of digitized curves

  1984cited by this paper
• Polygonal approximation by the minimax method

  1982cited by this paper
• Algorithms for Graphics and Image Processing

  1981cited by this paper
• An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves

  1978cited by this paper
• Pattern classification and scene analysis

  1974cited by this paper
• Segmentation of Plane Curves

  1974cited by this paper
• Angle Detection on Digital Curves

  1973cited by this paper
• An iterative procedure for the polygonal approximation of plane curves

  1972cited by this paper

• A Robust Method for Polygonal Approximation by Line Simplification and Smoothing

  2023cites this paper
• Polygonal approximation for digital image boundary using firefly algorithm

  2022cites this paper
• Review and classification of trajectory summarisation algorithms: From compression to segmentation

  2021cites this paper
• Polygonal approximation based on coarse-grained parallel genetic algorithm

  2020cites this paper
• Outils pour l'analyse des courbes discrètes bruitées. (Tools for the analysis of noisy discrete curves)

  2018cites this paper
• Contribución al reconocimiento de objetos 2D mediante aproximaciones poligonales

  2017cites this paper
• An iterative point elimination technique to retain significant vertices on digital planar curves

  2016cites this paper
• TopDom: an efficient and deterministic method for identifying topological domains in genomes

  2015cites this paper
• Polygonal approximation of digital planar curve using local integral deviation

  2015cites this paper
• The computation of polygonal approximations for 2D contours based on a concavity tree

  2014cites this paper
• A moment-based polygonal approximation algorithm for regular digital curves

  2013cites this paper
• L EAST SQUARE BASED AUTOMATIC THRESHOLD SELECTION FOR POLYGONAL APPROXIMATION OF DIGITAL CURVES

  2013cites this paper
• Symbolic representation and clustering of bio-medical time-series data using non-parametric segmentation and cluster ensemble

  2012cites this paper
• A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification

  2012cites this paper
• Behavior of Normalized Moments under Distortion and Optimization

  2011cites this paper
• Assisting Human Motion-Tasks with Minimal, Real-time Feedback

  2011cites this paper
• Online Sketch Recognition: Geometric Shapes

  2011cites this paper
• Estimation of Road Centerline Curvature from Raw GPS Data

  2011cites this paper
• An improved Douglas-Peucker algorithm for fast curve approximation

  2010influential citation
• A genetic algorithm with chromosome-repairing for min - # and min - epsilon polygonal approximation of digital curves

  2009cites this paper
• Optimum Segmentation of Digital Planar Curves Using Quadric Bézier Curves

  2009cites this paper
• Automatic detection of the vertices of references by polygonal approximation curves discrete closed noisy obtained from using segmented contour algorithm Alexander Kolesnikov, Pasi Fräntia

  2008cites this paper
• Novel efficient two-pass algorithm for closed polygonal approximation based on LISE and curvature constraint criteria

  2008cites this paper
• An Efficient Method for Near-Optimal Polygonal Approximation Based on Differential Evolution

  2008cites this paper
• Motion analysis and modeling for activity recognition and 3-D animation based on geometrical and video processing algorithms

  2007cites this paper
• Polygonal approximation of closed discrete curves

  2007cites this paper
• An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm

  2007cites this paper
• Any dimension polygonal approximation based on equal errors principle

  2007cites this paper
• SOME APPLICATIONS OF ALGORITHMS FOR GENERATING POINTS ON REGULAR PARAMETRIC CURVES.

  2006cites this paper
• Any Dimension Polygonal Approximation Based on Equidistance Principle

  2005cites this paper
• 3D Assisted 2D Face Recognition: Methodology

  2005cites this paper
• Data reduction of large vector graphics

  2005cites this paper
• Smoothing of Polygonal Chains for 2D Shape Representation Using a G2-Continuous Cubic A-Spline

  2005cites this paper
• A GENETIC ALGORITHM-THEORETIC APPROACH TO POLYGONAL APPROXIMATON

  2004cites this paper
• Reduced-search dynamic programming for approximation of polygonal curves

  2003cites this paper
• An adaptive smoothing approach for fitting digital planar curves with line segments and circular arcs

  2003cites this paper
• Improving fitting quality of polygonal approximation by using the dynamic programming technique

  2002cites this paper
• Efficient algorithms for 3-D polygonal approximation based on LISE criterion

  2002cites this paper
• Fitting a conic A-spline to contour image data

  2002cites this paper
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

  2002cites this paper
• High-quality polygonal contour approximation based on relaxation

  2001cites this paper
• A dynamic programming approach for fitting digital planar curves with line segments and circular arcs

  2001cites this paper
• Recursive representation and progressive display of binary objects for efficient network browsing

  1998cites this paper
• Optimum approximation of digital planar curves using circular arcs

  1996cites this paper
• Decomposing Contours into Curves of Different Families

  1995cites this paper
• A Novel Model For Determining Boundary Shape Based On The Optimum Tolerance Value For Polygon Approximation

  year unknowncites this paper