Convex and Concave Parts of digital Curves
作者： H. Dorksen-Reiter , I. Debled-Rennesson
关键词: Line segment 、 Concave function 、 Convex hull 、 Polygonal chain 、 Pure mathematics 、 Convex set 、 Mathematics 、 Convexity 、 Convex curve 、 Combinatorics 、 Digital geometry
摘要: Decomposition of a digital curve into convex and concave parts is relevance in several scopes image processing. In plane convexity cannot be observed locally. It becomes an interesting question, how far one can decide whether part or by method which "as local as possible". previous paper, it was proposed to define the meaningful corresponding polygonal representation. This technique has approximative character. our considerations, we use geometry arithmetical discrete line segments. We will introduce exact curve.
springer.com
sci-hub.se 参考文章(13)
Wolfgang Scherl, Bildanalyse allgemeiner Dokumente Springer Berlin Heidelberg. ,(1987) , 10.1007/978-3-642-71657-7
Reinhard Klette, Klaus Voss, Albrecht Hübler, Determination of the Convex Hull of a Finite Set of Planar Points Within Linear Time. Journal of Automata, Languages and Combinatorics. ,vol. 17, pp. 121- 139 ,(1981)
Fabien Feschet, Laure Tougne, Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature discrete geometry for computer imagery. ,vol. 1568, pp. 31- 40 ,(1999) , 10.1007/3-540-49126-0_3
Klaus Voss, Discrete Images, Objects, and Functions in Zn ,(1993)
Valentin E. Brimkov, Reinhard Klette, Curves, hypersurfaces, and good pairs of adjacency relations international workshop on combinatorial image analysis. pp. 276- 290 ,(2004) , 10.1007/978-3-540-30503-3_21
ISABELLE DEBLED-RENNESSON, JEAN-PIERRE REVEILLÈS, A LINEAR ALGORITHM FOR SEGMENTATION OF DIGITAL CURVES International Journal of Pattern Recognition and Artificial Intelligence. ,vol. 9, pp. 635- 662 ,(1995) , 10.1142/S0218001495000249
T.Y Kong, A Rosenfeld, Digital topology: introduction and survey Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing. ,vol. 48, pp. 357- 393 ,(1989) , 10.1016/0734-189X(89)90147-3
Chul E. Kim, Digital Convexity, Straightness, and Convex Polygons IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-4, pp. 618- 626 ,(1982) , 10.1109/TPAMI.1982.4767315
Chul E. Kim, Azriel Rosenfeld, Digital Straight Lines and Convexity of Digital Regions IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-4, pp. 149- 153 ,(1982) , 10.1109/TPAMI.1982.4767221
Longin Jan Latecki, Rolf Lakämper, Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution Computer Vision and Image Understanding. ,vol. 73, pp. 441- 454 ,(1999) , 10.1006/CVIU.1998.0738