Dominant point detection based on discrete curve structure and applications

DOI10.1016/j.jcss.2017.07.007zbMath1391.68114OpenAlexW2752689464MaRDI QIDQ1747505

Hayat Nasser, Phuc Ngo, Isabelle Debled-Rennesson

Publication date: 8 May 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01584733/file/mainJournal.pdf

zbMATH Keywords

classificationdiscrete structuredominant pointmaximal blurred segmentspolygonal simplification

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Analysis of noisy digital contours with adaptive tangential cover, Segmentation and identification of spectral and statistical textures for computer medical diagnostics in dermatology, Digital straight segment filter for geometric description

Cites Work

• Unnamed Item
• Unnamed Item
• Polygonal approximation using integer particle swarm optimization
• A discrete geometry approach for dominant point detection
• Tangential cover for thick digital curves
• Polygonal approximation of closed discrete curves
• A unified curvature definition for regular, polygonal, and digital planar curves
• A new algorithm for dominant points detection and polygonization of digital curves.
• Optimized polygonal approximation by dominant point deletion
• Polygonal approximation of digital planar curves through vertex betweenness
• Optimum polygonal approximation of digitized curves
• Reduced-search dynamic programming for approximation of polygonal curves