Another look at the dominant point detection of digital curves

doi:10.1016/S0167-8655(96)00116-X

Pattern Recognition Letters

Volume 18, Issue 1, January 1997, Pages 13-25

https://doi.org/10.1016/S0167-8655(96)00116-X Get rights and content

Abstract

We propose a straightforward parameter-free method for detecting dominant points of digital curves. It uses the chain code properties of digital straight lines to compute two vectors of significance. The dominant points are derived from these vectors by a logical function (strategy). The dominant point set depends on the strategy used. Prior knowledge can easily be taken into account to guide the results. The obtained approximating polygon keeps the symmetrical nature of a shape.

References (0)

Cited by (46)

Fast progressive polygonal approximations for online strokes
2023, Graphical Models
This paper presents a fast and progressive polygonal approximation algorithm for online strokes. A stroke is defined as a sequence of points between a pen-down and a pen-up. The proposed method generates polygonal approximations progressively as the user inputs the stroke. The proposed algorithm is suitable for real time shape modeling and retrieval. The number of operations used in the proposed algorithm is bounded by O(n), where n is the number of points in a stroke. Detailed experimental results show that the proposed method is not only fast, but also accurate enough compared to other reported algorithms.
Dominant point detection based on suboptimal feature selection methods
2020, Expert Systems with Applications
This paper presents a viable alternative solution for dominant point detection predicated on the comparison of suboptimal feature selection methods. Suboptimal feature selection methods are utilized as standard criteria to identify dominant points. Considering that all of the combinations of points comprise many sets, an algorithm that eliminates some of them is affirmed and illustrated. The sequential backward selection, sequential forward selection, generalized sequential forward selection, generalized sequential backward selection and plus l-take away r selection methods are performed on the remaining points to extract the dominant points. The simulation results exhibit that this method is significantly more effective and efficient in comparison to other proposed methods.
Polygonal approximation based on coarse-grained parallel genetic algorithm
2020, Journal of Visual Communication and Image Representation
Citation Excerpt :
2) Given the error bound, the aim is to obtain the polygon that has the minimum number of vertices, and to make the error between the original shape curve and the approximating polygon not exceed the tolerance of error. Over recent decades, numerous methods have been proposed to solve the two types of polygonal approximation problems, such as (1) Sequential method [1–7]; (2) Spilt method, merge method, and split-and-merge method [8–12]; (3) Dominant and angle detection method [13–25]; (4) Newton’s method [26]; (5) Iteration method [27]; (6) k-means method [28–29]; (7) Dynamic programming [30–33]; (8) Bio-inspired intelligent algorithms [34–39]. Among all these methods, Ray and Ray [2] propose to obtain the polygon of object curve through making the line segment maximize and meanwhile making the approximation error minimize.
This paper proposes to apply coarse-grained parallel genetic algorithm (CGPGA) to solve polygonal approximation problem. Chromosomes are used to represent digital curves and genes correspond to points of curves. This method divides the whole population into several subpopulations, each of which performs evolutionary process independently. After every migration interval number of generations, these subpopulations exchange their information with each other. Inspired by the designing theory of ensemble learning in machine learning, this paper further improves the basic CGPGA through adopting different but effective genetic algorithms, respectively, in different subpopulations. Both the diversity among different subpopulations and the accuracy in each individual subpopulation are ensured. Experimental results, based on four benchmark curves and four real image curves extracted from the lake maps, show that the basic CGPGA outperforms the used genetic algorithm, and further the improved CGPGA (ICGPGA) is more effective than the basic CGPGA, in terms of the quality of best solutions, the average solutions, and the variance of best solutions. Especially for those larger approximation problems, the ICGPGA is more remarkably superior to some representative genetic algorithms.
Fast computation of optimal polygonal approximations of digital planar closed curves
2016, Graphical Models
Citation Excerpt :
Dominant points are those that can describe the curve for visual perception and recognition. In the literature two major categories can be found: corner detection methods [2–4] and polygonal approximation methods [5–7]. In computer vision polygonal approximation of digital planar curves is an important task for a variety of applications like simplification on vectorization algorithms [8], image analysis [9], shape analysis [10], object recognition [11], Geographical Information Systems [12], and digital cartography [13].
We face the problem of obtaining the optimal polygonal approximation of a digital planar curve. Given an ordered set of points on the Euclidean plane, an efficient method to obtain a polygonal approximation with the minimum number of segments, such that, the distortion error does not excess a threshold, is proposed. We present a novel algorithm to determine the optimal solution for the min-# polygonal approximation problem using the sum of square deviations criterion on closed curves.
Our proposal, which is based on Mixed Integer Programming, has been tested using a set of contours of real images, obtaining significant differences in the computation time needed in comparison to the state-of-the-art methods.
A robust method for scale independent detection of curvature-based criticalities and intersections in line drawings
2015, Pattern Recognition
A novel two-phase iterative method is proposed to identify curvature based criticalities and intersections in line drawings. The method is based on evaluating a field obtained from the image via diffusion using adaptively changing ellipse-shaped analysis windows. The deviation of the average field strength values within the analysis windows from that of an external reference field is used as a metric to evaluate the criticality of a region. The external reference field is computed from an image of a straight line. The experimental results depict that the method is effective in detecting curvature based criticalities and intersections, even for noisy and disconnected drawings as well as drawings drawn with a variety of brush characteristics, such as glass, ocean, ripple, scatter, stamp, strokes effects. Our method can be employed as a part of a design grammar interpreter.
Polygonal approximation of digital planar curves through break point suppression
2010, Pattern Recognition
Citation Excerpt :
Those that evaluate the curvature by transforming the contour to the Gaussian scale space [14,35,36,43]. Those that search for dominant points using some significant measure other than curvature [5,9,13,25,19,53,29,55,56,30,7,3,31,15,32,33]. Some of the direct curvature estimation methods use angle detection algorithms and need a previous region of support to estimate the curvature.
This paper presents a new algorithm that detects a set of dominant points on the boundary of an eight-connected shape to obtain a polygonal approximation of the shape itself. The set of dominant points is obtained from the original break points of the initial boundary, where the integral square is zero. For this goal, most of the original break points are deleted by suppressing those whose perpendicular distance to an approximating straight line is lower than a variable threshold value. The proposed algorithm iteratively deletes redundant break points until the required approximation, which relies on a decrease in the length of the contour and the highest error, is achieved. A comparative experiment with another commonly used algorithm showed that the proposed method produced efficient and effective polygonal approximations for digital planar curves with features of several sizes.

View all citing articles on Scopus

^☆: Electronic Annexes available. See http://www.elsevier.nl/ locate/patrec.

View full text

Another look at the dominant point detection of digital curves1☆

Abstract