Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Continuous Skeletons from Digitized Images
Journal of the ACM (JACM)
Design of Perimeter Estimators for Digitized Planar Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polygonal approximations that minimize the number of inflections
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast Decomposition of Digital Curves into Polygons Using the Haar Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Limit Properties in Digitization Schemes
Journal of the ACM (JACM)
Progress in Picture Processing: 1969--71
ACM Computing Surveys (CSUR)
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Representation of many-sided polygons and polygonal lines for rapid processing
Communications of the ACM
Recognition of Handwritten Cursive Arabic Characters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Local Versus Nonlocal Computation of Length of Digitized Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Simple Decomposition for Smoothing and Feature Point Detection of Noisy Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Moment-Preserving Piecewise Linear Approximations of Signals and Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Optimizing triangulations by curvature equalization
VIS '92 Proceedings of the 3rd conference on Visualization '92
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Measuring Concavity on a Rectangular Mosaic
IEEE Transactions on Computers
Journal of Visual Communication and Image Representation
Concurrency, Graphs and Models
Parametric font and image definition and generation
AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
Waveform Segmentation Through Functional Approximation
IEEE Transactions on Computers
Two linear-time algorithms for computing the minimum length polygon of a digital contour
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Digital deformable model simulating active contours
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A new method for contour compression
MIV'05 Proceedings of the 5th WSEAS international conference on Multimedia, internet & video technologies
Computing the characteristics of a subsegment of a digital straight line in logarithmic time
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Dynamic minimum length polygon
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Discrete Applied Mathematics
A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours
Computer Vision and Image Understanding
| Hi-index | 48.24 |
A method for extracting a smooth polygonal contour from a digitized image is illustrated. The ordered sequence of contour points and the connection graph of the image are first obtained by a modified Ledley algorithm in one image scan. A minimal perimeter polygon subjected to specified constraints is then chosen as the approximating contour. The determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables. Some examples are presented, and the corresponding computing times are listed.