Parallel algorithm for corner finding on digital curves

DOI10.1016/0167-8655(88)90023-2MaRDI QIDQ3804230zbMATH OpenOpenAlexFDO

Authors Fang-Hsuan Cheng, Wen-Hsing Hsu

Publication date 1988

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(88)90023-2

zbMATH Keywords

3\(\times 3\) maskcorner findingcurve digitizationimage processingparallel algorithmtable-lookup procedure

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• An optimal parallel algorithm for digital curve segmentation
• Line segmentation of digital curves in parallel
• Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
• scientific article; zbMATH DE number 1196828
• Parallel algorithms for some functions of two convex polygons
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
• A parallel algorithm for finding congruent regions

Cited in

(6)

• An optimal parallel algorithm for digital curve segmentation
• A new algorithm for dominant points detection and polygonization of digital curves.
• Development of an algorithm for fast corner points detection
• Line segmentation of digital curves in parallel
• A new corner detection algorithm for chain code representation
• Combinatorial Image Analysis

This page was built for publication: Parallel algorithm for corner finding on digital curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804230)