Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis
暂无分享,去创建一个
[1] Avraham A. Melkman,et al. On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..
[2] Paul L. Rosin. Techniques for Assessing Polygonal Approximations of Curves , 1996, BMVC.
[3] Azriel Rosenfeld,et al. Digital straightness - a review , 2004, Discret. Appl. Math..
[4] Isabelle Debled-Rennesson,et al. Linear segmentation of discrete curves into blurred segments , 2005, Discret. Appl. Math..
[5] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[6] Paul L. Rosin. Techniques for Assessing Polygonal Approximations of Curves , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[7] Laure Tougne,et al. On the min DSS problem of closed discrete curves , 2003, Discret. Appl. Math..
[8] Isabelle Debled-Rennesson,et al. A Linear Algorithm for Segmentation of Digital Curves , 1995, Int. J. Pattern Recognit. Artif. Intell..
[9] Isabelle Debled-Rennesson. Estimation of tangents to a noisy discrete curve , 2004, IS&T/SPIE Electronic Imaging.
[10] Lilian Buzer. An Elementary Algorithm for Digital Line Recognition in the General Case , 2005, DGCI.
[11] Guojun Lu,et al. Review of shape representation and description techniques , 2004, Pattern Recognit..
[12] Isabelle Debled-Rennesson,et al. Optimal Blurred Segments Decomposition in Linear Time , 2005, DGCI.
[13] Sven Loncaric,et al. A survey of shape analysis techniques , 1998, Pattern Recognit..
[14] Isabelle Debled-Rennesson,et al. Optimal blurred segments decomposition of noisy shapes in linear time , 2006, Comput. Graph..