T. P. Nguyen and I. Debled-rennesson, Curvature Estimation in Noisy Curves, LNCS, vol.4673, pp.474-481, 2007.
DOI : 10.1007/978-3-540-74272-2_59

URL : https://hal.archives-ouvertes.fr/hal-00184127

T. P. Nguyen and I. Debled-rennesson, Curvature and Torsion Estimators for 3D Curves, LNCS, vol.5358, issue.1, pp.688-699, 2008.
DOI : 10.1007/978-3-540-89639-5_66

URL : https://hal.archives-ouvertes.fr/hal-00345708

T. P. Nguyen, ON THE LOCAL PROPERTIES OF DIGITAL CURVES, International Journal of Shape Modeling, vol.58, issue.02, pp.105-125, 2008.
DOI : 10.1073/pnas.88.6.2312

URL : https://hal.archives-ouvertes.fr/hal-00437304

T. P. Nguyen and I. Debled-rennesson, A linear method for segmentation of digital arcs, 2010.

T. P. Nguyen, Debled-Rennesson, I. : Fast and robust dominant point detection on digital curves, pp.953-956, 2009.

T. P. Nguyen, Debled-Rennesson, I. : A discrete geometry approach for dominant point detection, Pattern Recognition, 2010.

T. P. Nguyen, Debled-Rennesson, I. : Free-parameter method for polygonal representation of noisy curves, 2009.

T. P. Nguyen, Debled-Rennesson, I. : A multi-scale approach to decompose a digital curves into meaningful parts, In : ICPR, 2010.

T. P. Nguyen and I. Debled-rennesson, Segmentation en arcs discrets en temps linéaire, In : RFIA, 2010.

T. P. Nguyen, B. Kerautret, I. Debled-rennesson, and J. Oliver-lachaud, Unsupervised, Fast and Precise Recognition of Digital Arcs in Noisy Images, ICCVG, 2010.
DOI : 10.1007/978-3-642-15910-7_7

URL : https://hal.archives-ouvertes.fr/inria-00544737

T. P. Nguyen and I. Debled-rennesson, Decomposition of a curve into arcs and straight lines, 2010.

T. P. Nguyen and I. Debled-rennesson, Circularity Measuring in Linear Time, 2010 20th International Conference on Pattern Recognition, 2010.
DOI : 10.1109/ICPR.2010.1157

URL : https://hal.archives-ouvertes.fr/inria-00544736

E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, S. B. Joseph et al., An efficiently computable metric for comparing polygonal shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.3, pp.209-216, 1976.
DOI : 10.1109/34.75509

[. Hernández, Corner detection and curve segmentation by multiresolution chain-code linking, Pattern Recognition, vol.38, issue.10, pp.1596-1614, 2005.

J. [. Aho and J. D. Hopcroft, Ullman : The Design and Analysis of Computer Algorithms, 1974.

H. Aoyama and M. Kawagoe, A piecewise linear approximation method preserving visual feature points of original figures, CVGIP: Graphical Models and Image Processing, vol.53, issue.5, pp.435-446, 1991.
DOI : 10.1016/1049-9652(91)90028-I

E. Andres, Discrete circles, rings and spheres, Computers & Graphics, vol.18, issue.5, pp.695-706, 1994.
DOI : 10.1016/0097-8493(94)90164-3

C. Arcelli and G. Ramella, Finding contour-based abstractions of planar patterns, Pattern Recognition, vol.26, issue.10, pp.1563-1577, 1993.
DOI : 10.1016/0031-3203(93)90161-O

]. E. Att54 and . Attneave, Some informational aspects of visual perception, Psychol. Rev, vol.61, issue.3, pp.183-193, 1954.

A. Ansari, W. Kuo, and . Huang, Non-parametric dominant point detection, Pattern Recognition, vol.24, issue.9, pp.849-862, 1991.
DOI : 10.1016/0031-3203(91)90004-O

[. Bribiesca, An easy measure of compactness for 2D and 3D shapes, Pattern Recognition, vol.41, issue.2, pp.543-554, 2008.
DOI : 10.1016/j.patcog.2007.06.029

]. L. Buz05 and . Buzer, An elementary algorithm for digital line recognition in the general case, DGCI, pp.299-310, 2005.

[. Canny, A computational approach to edge detection, IEEE Trans. Pattern Anal. Mach. Intell, vol.8, issue.6, pp.679-698, 1986.

[. Coeurjolly, Y. Gérard, J. Reveillès, and L. Tougne, An elementary algorithm for digital arc segmentation, Discrete Applied Mathematics, vol.139, issue.1-3, pp.31-50, 2004.
DOI : 10.1016/j.dam.2003.08.003

URL : https://hal.archives-ouvertes.fr/hal-00185216

[. Chen, Roundness measurements for discontinuous perimeters via machine visions, Computers in Industry, vol.47, issue.2, pp.185-197, 2002.
DOI : 10.1016/S0166-3615(01)00143-9

J. Chassery and A. Montanvert, Géométrie discrète en analyse d'images. Hermès, 1991.

S. [. Coeurjolly, L. Miguet, and . Tougne, Discrete Curvature Based on Osculating Circle Estimation, IWVF, volume 2059 de LNCS, pp.303-312, 2001.
DOI : 10.1007/3-540-45129-3_27

[. Coeurjolly, Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces, Thèse de doctorat, 2002.

R. [. Teh and . Chin, On the detection of dominant points on digital curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, issue.8, pp.859-872, 1989.
DOI : 10.1109/34.31447

T. M. Cronin, A boundary concavity code to support dominant point detection, Pattern Recognition Letters, vol.20, issue.6, pp.617-634, 1999.
DOI : 10.1016/S0167-8655(99)00025-2

[. Coeurjolly and S. Svensson, Estimation of Curvature along Curves with Application to Fibres in 3D Images of Paper, SCIA, volume 2749 de LNCS, pp.247-254, 2003.
DOI : 10.1007/3-540-45103-X_34

URL : https://hal.archives-ouvertes.fr/hal-00185208

[. Damaschke, The linear time recognition of digital arcs, Pattern Recognition Letters, vol.16, issue.5, pp.543-548, 1995.
DOI : 10.1016/0167-8655(95)00127-3

]. E. Dav84 and . Davies, A modified hough scheme for general circle location, Pattern Recognition Letters, vol.7, pp.37-43, 1984.

[. Debled-rennesson, F. Feschet, and J. Rouyer-degli, Optimal Blurred Segments Decomposition in Linear Time, DGCI, pp.371-382, 2005.
DOI : 10.1007/978-3-540-31965-8_34

URL : https://hal.archives-ouvertes.fr/inria-00000112

[. Debled-rennesson, F. Feschet, and J. Rouyer-degli, Optimal blurred segments decomposition of noisy shapes in linear time, Computers & Graphics, vol.30, issue.1, pp.30-36, 2006.
DOI : 10.1016/j.cag.2005.10.007

URL : https://hal.archives-ouvertes.fr/inria-00173228

[. Debled-rennesson and J. Reveillès, A linear algorithm for segmentation of digital curves, IJPRAI, vol.9, issue.4, pp.635-662, 1995.

[. Debled-rennesson, J. Remy, and J. Rouyer-degli, Segmentation of Discrete Curves into Fuzzy Segments, Electronic Notes in Discrete Mathematics, vol.12, pp.372-383, 2003.
DOI : 10.1016/S1571-0653(04)00500-1

URL : https://hal.archives-ouvertes.fr/inria-00071589

I. Debled-rennesson, S. Tabbone, and L. Wendling, Fast polygonal approximation of digital curves, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004., pp.465-468, 2004.
DOI : 10.1109/ICPR.2004.1334165

URL : https://hal.archives-ouvertes.fr/inria-00100038

D. Elliman, TIF2VEC, An Algorithm for Arc Segmentation in Engineering Drawings, GREC, volume 2390 de LNCS, pp.350-358, 2002.
DOI : 10.1007/3-540-45868-9_31

H. Federer, Geometric Measure Theory, 1996.
DOI : 10.1007/978-3-642-62010-2

A. Faure and F. Feschet, Tangential cover for thick digital curves, DGCI, pp.358-369, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00622470

S. Fisk, Separating point sets by circles, and the recognition of digital disks. Pattern Analysis and Machine Intelligence, IEEE Transactions, issue.84, pp.554-556, 1986.

[. Feschet and J. Reveillès, A Generic Approach for n-Dimensional Digital Lines, DGCI, pp.29-40, 2006.
DOI : 10.1007/11907350_3

]. H. Fre61 and . Freeman, On the encoding of arbitrary geometric configurations, IRE Trans. Electron. Comput, vol.10, pp.260-268, 1961.

L. [. Feschet and . Tougne, Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature, DGCI, volume 1568 de LNCS, pp.31-40, 1999.
DOI : 10.1007/3-540-49126-0_3

URL : https://hal.archives-ouvertes.fr/hal-01517330

K. [. Held and C. Abe, Arc segmentation contest Arcelli : Towards a hierarchical contour description via dominant point detection. Systems, Man and Cybernetics, IEEE Transactions, issue.6, pp.24942-949, 1994.

]. R. Har74, Haralick : A measure for circularity of digital figures, IEEE Trans. Systems, Man, and Cybernetics, vol.4, 1974.

H. [. Harris and . Stocker, Handbook of mathematics and computational science, 1998.
DOI : 10.1007/978-1-4612-5317-4

E. Chul, . Kim, and A. Timothy, Anderson : Digital disks and a digital compactness measure, STOC '84 : Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp.117-124, 1984.

[. Kimme, D. Ballard, and J. Sklansky, Finding circles by an array of accumulators, Short Communications Graphics and Image Processing, pp.120-122, 1975.
DOI : 10.1145/360666.360677

W. [. Kurozumi, Polygonal approximation by the minimax method, Computer Graphics and Image Processing, vol.19, issue.3, pp.248-264, 1982.
DOI : 10.1016/0146-664X(82)90011-9

D. Nasser, J. P. Kehtarnavaz-et-rui, and . De-figueiredo, A 3-d contour segmentation scheme based on curvature and torsion, IEEE Trans. Pattern Anal. Mach. Intell, vol.10, issue.5, pp.707-713, 1988.

R. M. Kanungo, H. S. Haralick, W. Baird, D. Stuetzle, and . Madigan, Document degradation models : Parameter estimation and model validation, MVA, pp.552-557, 1994.

E. Chul and . Kim, Digital disks. Pattern Analysis and Machine Intelligence, IEEE Transactions, issue.63, pp.372-374, 1984.

E. Chul and . Kim, Three-dimensional digital planes. Pattern Analysis and Machine Intelligence, IEEE Transactions, issue.6, pp.639-645, 1984.

[. Kerautret, J. Kerautret, and J. Lachaud, Curvature estimation along noisy digital contours by approximate global optimization Multi-scale analysis of discrete contours for unsupervised noise detection Comparison of discrete curvature estimators and application to corner detection [Kol07] Alexander Kolesnikov : Optimal algorithm for lossy vector data compression Kovalevsky : New definition and fast recognition of digital straight segments and arcs, IWCIA ICIAR, volume 4633 de LNCS ICPR, pp.2265-2278, 1990.

E. Chul, . Kim, A. Rosenfeld-reinhard-klette, and . Rosenfeld, Convex digital solids. Pattern Analysis and Machine Intelligence Digital straightness -a review Lachaud : Espaces non-euclidiens et analyse d'image : modèles déformables riemanniens et discrets, topologie et géométrie discrète, IEEE Transactions on Discrete Applied Mathematics, vol.4, issue.1391-3, pp.612-618197, 1982.

T. Lewiner, J. , D. Gomes-jr, H. Lopes, M. Lewiner et al., Arc-length based curvature estimator Computer Graphics and Image Processing Curvature and torsion estimators based on parametric curve fitting Leavers : The dynamic generalized hough transform : its relationship to the probabilistic hough transforms and an application to the concurrent detection of circles and ellipses, LC99] Liyuan Li et Weinan Chen : Corner detection and interpretation on planar curves using fuzzy reasoning, pp.250-257641, 1992.

L. Jan, L. , R. J. Lakämper-[-ll00-]-l, R. Latecki, and . Lakamper, Polygon evolution by vertex deletion Shape similarity measure based on correspondence of visual parts. Pattern Analysis and Machine Intelligence, Scale-Space, pp.398-4091185, 1999.

L. Jan, L. , R. Lakämperlvdv05, ]. Lachaud, A. Vialard et al., Application of planar shape comparison to object retrieval in image databases Analysis and comparative evaluation of discrete tangent estimators, DGCI, volume 3429 de LNCS Lachaud, A. Vialard et F. de Vieilleville : Fast, accurate and convergent tangent estimation on digital contours. Image Vision Comput, pp.15-29, 2002.

M. Marji, On the detection of dominant points on digital planar curves

A. Masood, Dominant point detection by reverse polygonization of digital curves, Image and Vision Computing, vol.26, issue.5, pp.702-715, 2008.
DOI : 10.1016/j.imavis.2007.08.006

[. Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed, Journal of the ACM, vol.31, issue.1, pp.114-127, 1984.
DOI : 10.1145/2422.322418

A. A. Melkman, On-line construction of the convex hull of a simple polyline, Information Processing Letters, vol.25, issue.1, pp.11-12, 1987.
DOI : 10.1016/0020-0190(87)90086-X

[. M. Pitteway and M. L. , ???Integer Circles, Etc.??? ??? some further thoughts, Computer Graphics and Image Processing, vol.3, issue.3, pp.262-265, 1974.
DOI : 10.1016/0146-664X(74)90020-3

K. Mm92-]-farzin-mokhtarian-et-alan, Mackworth : A theory of multiscale, curvaturebased shape representation for planar curves, IEEE Trans. Pattern Anal. Mach. Intell, vol.14, issue.8, pp.789-805, 1992.

R. [. Mokhtarian and . Soumela, Robust image corner detection through curvature scale space, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.20, issue.12, pp.1376-1381, 1998.
DOI : 10.1109/34.735812

URL : http://www.ece.lsu.edu/gunturk/EE7700/CSS.pdf

[. Marji and P. Siy, A new algorithm for dominant points detection and polygonization of digital curves, Pattern Recognition, vol.36, issue.10, pp.2239-2251, 2003.
DOI : 10.1016/S0031-3203(03)00119-5

[. Marji and P. Siy, Polygonal representation of digital planar curves through dominant point detection???a nonparametric algorithm, Pattern Recognition, vol.37, issue.11, pp.2113-2130, 2004.
DOI : 10.1016/j.patcog.2004.03.004

R. Medina, A. Wahle, M. E. Olszewski, and M. Sonka, Curvature and torsion estimation for coronary-artery motion analysis, Medical Imaging 2004: Physiology, Function, and Structure from Medical Images, pp.504-515, 2004.
DOI : 10.1117/12.537301

[. Nguyen and I. Debled-rennesson, Curvature Estimation in Noisy Curves, CAIP, pp.474-481, 2007.
DOI : 10.1007/978-3-540-74272-2_59

URL : https://hal.archives-ouvertes.fr/hal-00184127

[. Nguyen and I. Debled-rennesson, Curvature and Torsion Estimators for 3D Curves, LNCS, vol.1, issue.5358, pp.688-699
DOI : 10.1007/978-3-540-89639-5_66

URL : https://hal.archives-ouvertes.fr/hal-00345708

T. P. Nguyen and I. Debled-rennesson, ON THE LOCAL PROPERTIES OF DIGITAL CURVES, International Journal of Shape Modeling, vol.58, issue.02, pp.105-125, 2008.
DOI : 10.1073/pnas.88.6.2312

URL : https://hal.archives-ouvertes.fr/hal-00437304

T. P. Nguyen and I. Debled-rennesson, Fast and robust dominant points detection on digital curves, 2009 16th IEEE International Conference on Image Processing (ICIP), pp.953-956, 2009.
DOI : 10.1109/ICIP.2009.5414027

T. P. Nguyen and I. Debled-rennesson, Free-parameter method for polygonal representation of noisy curves, IWCIA, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00437309

T. P. Nguyen and I. Debled-rennesson, Decomposition of a curve into arcs and straight lines, 2010.

T. P. Nguyen and I. Debled-rennesson, A discrete geometry approach for dominant point detection, Pattern Recognition, vol.44, issue.1, 2010.
DOI : 10.1016/j.patcog.2010.06.022

URL : https://hal.archives-ouvertes.fr/inria-00526714

T. P. Nguyen and I. Debled-rennesson, A linear method for segmentation of digital arcs, 2010.

T. P. Nguyen and I. Debled-rennesson, A Multi-scale Approach to Decompose a Digital Curve into Meaningful Parts, 2010 20th International Conference on Pattern Recognition, 2010.
DOI : 10.1109/ICPR.2010.268

T. P. Nguyen and I. Debled-rennesson, Segmentation en arcs discrets en temps linéaire, RFIA, 2010.

[. Nguyen, Courbure discrète et ses applications, 2005.

[. Nguyen and B. Kerautret, Isabelle Debled-Rennesson et Jaques Oliver-Lachaud : Unsupervised, fast and precise recognition of digital arcs in noisy images, ICCVG, 2010.

]. M. Ovl81, J. Overmars, and . Van-leeuwen, Maintenance of configurations in the plane, J. Comput. and Syst. Sci, vol.23, pp.166-204, 1981.

[. Provot, L. Buzer, and I. Debled-rennesson, Recognition of Blurred Pieces of Discrete Planes, DGCI, volume 4245 de Lecture Notes in Computer Science, pp.65-76, 2006.
DOI : 10.1007/11907350_6

URL : https://hal.archives-ouvertes.fr/hal-00166285

J. and E. Vidal, Optimum polygonal approximation of digitized curves, Pattern Recognition Letters, vol.15, issue.8, pp.743-750, 1994.

A. Pikaz and . Its-'hak-dinstein, Optimal polygonal approximation of digital curves, Pattern Recognition, vol.28, issue.3, pp.373-379, 1995.
DOI : 10.1016/0031-3203(94)00108-X

[. Provot and I. Debled-rennesson, Segmentation of Noisy Discrete Surfaces, IWCIA, volume 4958 de Lecture Notes in Computer Science, pp.160-171, 2008.
DOI : 10.1007/978-3-540-78275-9_14

URL : https://hal.archives-ouvertes.fr/hal-00345289

N. Ángel-carmona-poyato, . Luis-fernández, R. García, F. Medina-carnicer, and . Madrid-cuevas, Dominant point detection: A new proposal, Image and Vision Computing, vol.23, issue.13, pp.1226-1236, 2005.
DOI : 10.1016/j.imavis.2005.07.025

[. Pei and J. Horng, Circular arc detection based on Hough transform, Pattern Recognition Letters, vol.16, issue.6, pp.615-625, 1995.
DOI : 10.1016/0167-8655(95)80007-G

[. Provot, Vers une polyérisation des objets discrets bruités 3D, Thèse de doctorat, 2009.

P. Franco, I. Preparata, and . Shamos, Computational Geometry -An Introduction, 1985.

A. Quddus and M. Gabbouj, Wavelet-based corner detection technique using optimal scale, Pattern Recognition Letters, vol.23, issue.1-3, pp.215-220, 2002.
DOI : 10.1016/S0167-8655(01)00090-3

[. Reveillès, Géométrie discrète, calculs en nombre entiers et algorithmique, Thèse d'état, 1991.

A. A. Rad and K. Faez, Qaragozlou : Fast circle detection using gradient pair vectors, Digital Image Comp. : Techniques and Applications, pp.879-887, 2003.

E. [. Roselfeld and . Johnston, Angle detection on digital curves, IEEE Trans. Comput, vol.22, pp.940-941, 1973.

[. Rosenfeld, Compact Figures in Digital Pictures, IEEE Transactions on Systems, Man, and Cybernetics, vol.4, issue.2, pp.221-223, 1974.
DOI : 10.1109/TSMC.1974.5409121

]. A. Ros74b and . Rosenfeld, Digital straight line segments. Computers, IEEE Transactions, issue.2312, pp.1264-1269, 1974.

L. Paul, Rosin : Techniques for assessing polygonal approximations of curves

B. Kr, . Ray, S. Kumar, and . Ray, Detection of significant points and polygonal approximation of digitized curves, Pattern Recognition Letters, vol.13, issue.6, pp.443-452, 1992.

R. Bimal-kumar, S. Kumar, and . Ray, An algorithm for polygonal approximation of digitized curves, Pattern Recognition Letters, vol.13, issue.7, pp.489-496, 1992.

R. Bimal-kumar and S. Kumar, Determination of optimal polygon from digital curve using L1 norm, Pattern Recognition, vol.26, issue.4, pp.505-509, 1993.
DOI : 10.1016/0031-3203(93)90106-7

I. Rsct09-]-tristan-roussillon, L. Sivignon, and . Cu-tougne, On-line recognition of digital circular arcs, DGCI, 2009.

[. Roussillon, I. Sivignon, and L. Tougne, Test and measure of circularity for digital curves, The 2008 International Conference on Image Processing, Computer Vision, and Pattern Recognition (IPCV'08 ), 2008.
URL : https://hal.archives-ouvertes.fr/hal-01501286

[. Roussillon, I. Sivignon, and L. Tougne, Measure of circularity for parts of digital boundaries and its fast computation, Pattern Recognition, vol.43, issue.1, pp.37-46, 2010.
DOI : 10.1016/j.patcog.2009.06.014

URL : https://hal.archives-ouvertes.fr/hal-00438631

L. Paul, . Rosin, A. W. Geoff, and . West, Segmentation of edges into lines and arcs, Image Vision Comput, vol.7, issue.2, pp.109-114, 1989.

M. [. Sarfraz, A. Asim, and . Masood, Piecewise polygonal approximation of digital curves. Information Visualisation, Proceedings. Eighth International Conference on, pp.991-996, 2004.

[. Sauer, On the recognition of digital circles in linear time, Computational Geometry, vol.2, issue.5, pp.287-302, 1993.
DOI : 10.1016/0925-7721(93)90025-2

[. Salmon, I. Debled-rennesson, and L. Wendling, A new method to detect arcs and segments from curvature profiles, 18th International Conference on Pattern Recognition (ICPR'06), pp.387-390, 2006.
DOI : 10.1109/ICPR.2006.123

URL : https://hal.archives-ouvertes.fr/inria-00104414

S. [. Kasvand, Hung : On the chord property and its equivalences, International Conference on Pattern Recognition, pp.116-119, 1984.

[. Song, M. R. Lyu, and S. Cai, Effective multiresolution arc segmentation : algorithms and performance evaluation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.26, issue.11, pp.1491-1506, 2004.

M. Shearer and J. Zou, Detection of Dominant Points Based on Noise Suppression and Error Minimisation, Third International Conference on Information Technology and Applications (ICITA'05), pp.772-775, 2005.
DOI : 10.1109/ICITA.2005.115

]. P. Vee93 and . Veelaert, On the flatness of digital hyperplanes, Journal of Mathematical Imaging and Vision, vol.3, pp.205-221, 1993.

A. Vialard, Geometrical parameters extraction from discrete paths, DGCI, volume 1176 de LNCS, pp.24-35, 1996.
DOI : 10.1007/3-540-62005-2_3

D. [. Wenyin and . Dori, Incremental arc segmentation algorithm and its evaluation . Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.20, issue.4, pp.424-431, 1998.
DOI : 10.1109/34.677280

URL : http://www.cs.cityu.edu.hk/~liuwy/publications/Arc_PAMI.pdf

P. Andrew, Witkin : Scale-space filtering, IJCAI, pp.1019-1022, 1983.

. Worring and W. M. Arnold, Smeulders : Digital curvature estimation, CVGIP : Image Understanding, vol.58, pp.366-382, 1993.

. Worring and W. M. Arnold, Smeulders : Digital curvature estimation. Computer Vision Graphics Image Processing : CVIU, pp.366-382, 1993.

A. [. Worring, Smeulders : Digitized circular arcs : characterization and parameter estimation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.17, issue.6, pp.587-598, 1995.

[. Wu, An adaptive method for detecting dominant points, Pattern Recognition, vol.36, issue.10, pp.2231-2237, 2003.
DOI : 10.1016/S0031-3203(03)00087-6

[. Zhao, Q. Huang, and W. Gao, Image Matching by Multiscale Oriented Corner Correlation, LNCS, vol.1, issue.3851, pp.928-937, 2006.
DOI : 10.1007/11612032_93

K. [. Zunic and P. L. Hirota, A Hu moment invariant as a shape circularity measure, Pattern Recognition, vol.43, issue.1, pp.47-57, 2010.
DOI : 10.1016/j.patcog.2009.06.017