메뉴 건너뛰기




Volumn 103, Issue 2, 2006, Pages 101-111

A symmetric convexity measure

Author keywords

Convex hull; Convex skull; Convexity; Polygon; Shape measure

Indexed keywords

BOUNDARY CONDITIONS; DEFECTS; GENETIC ALGORITHMS; IMAGE ANALYSIS; MEDICAL IMAGING;

EID: 33746263796     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2006.04.002     Document Type: Article
Times cited : (42)

References (24)
  • 1
    • 33745132734 scopus 로고    scopus 로고
    • G. Borgefors, R. Strand, An approximation of the maximal inscribed convex set of a digital object, in: Internat. Conf. on Image Analysis and Processing, 2005, 438-445.
  • 2
    • 38249006483 scopus 로고
    • Computing deviations from convexity in polygons
    • Boxer L. Computing deviations from convexity in polygons. Pattern Recognit. Lett. 14 (1993) 163-167
    • (1993) Pattern Recognit. Lett. , vol.14 , pp. 163-167
    • Boxer, L.1
  • 3
    • 33746227232 scopus 로고    scopus 로고
    • D.J. Cavicchio, Adaptive Search Using Simulated Evolution. Ph.D. thesis, University of Michigan, 1970.
  • 4
    • 0010423824 scopus 로고
    • A polynomial solution for the potato-peeling problem
    • Chang J.S., and Yap C.K. A polynomial solution for the potato-peeling problem. Discrete Comput. Geom. 1 (1986) 155-182
    • (1986) Discrete Comput. Geom. , vol.1 , pp. 155-182
    • Chang, J.S.1    Yap, C.K.2
  • 5
    • 51249179364 scopus 로고
    • Triangulating a simple polygon in linear time
    • Chazelle B. Triangulating a simple polygon in linear time. Comput. Geom. 6 (1991)
    • (1991) Comput. Geom. , vol.6
    • Chazelle, B.1
  • 6
    • 0344494758 scopus 로고    scopus 로고
    • Dynamic programming approach to optimal vertex selection for polygon-based shape approximation
    • Choi J.G., Lee S.W., and Kang H.S. Dynamic programming approach to optimal vertex selection for polygon-based shape approximation. IEE Proc.-Vision Image Signal Process. 150 4 (2003) 287-291
    • (2003) IEE Proc.-Vision Image Signal Process. , vol.150 , Issue.4 , pp. 287-291
    • Choi, J.G.1    Lee, S.W.2    Kang, H.S.3
  • 7
    • 2842513801 scopus 로고
    • Asymptotic speed-ups in constructive solid geometry
    • Eppstein D. Asymptotic speed-ups in constructive solid geometry. Algorithmica 13 5 (1995) 462-471
    • (1995) Algorithmica , vol.13 , Issue.5 , pp. 462-471
    • Eppstein, D.1
  • 8
    • 0031875489 scopus 로고    scopus 로고
    • Training greeble experts: a framework for studying expert object recognition processes
    • Gauthier I., Williams P., Tarr M.J., and Tanaka J. Training greeble experts: a framework for studying expert object recognition processes. Vision Res. 38 (1998) 2401-2428
    • (1998) Vision Res. , vol.38 , pp. 2401-2428
    • Gauthier, I.1    Williams, P.2    Tarr, M.J.3    Tanaka, J.4
  • 9
    • 33749614292 scopus 로고    scopus 로고
    • A. Kolesnikov, P. Fränti, Optimal algorithm for convexity measure calculation, in: Internat. Conf. on Image Processing, 2005.
  • 10
    • 0037344458 scopus 로고    scopus 로고
    • Irregularity index: a new border irregularity measure for cutaneous lesions
    • Lee T.K., McLean D., and Atkins M.S. Irregularity index: a new border irregularity measure for cutaneous lesions. Med. Image Anal. 7 1 (2003) 47-64
    • (2003) Med. Image Anal. , vol.7 , Issue.1 , pp. 47-64
    • Lee, T.K.1    McLean, D.2    Atkins, M.S.3
  • 11
    • 0018739525 scopus 로고
    • A linear algorithm for finding the convex hull of a simple polygon
    • McCallum D., and Avis D. A linear algorithm for finding the convex hull of a simple polygon. Inform. Process. Lett. 9 (1979) 201-206
    • (1979) Inform. Process. Lett. , vol.9 , pp. 201-206
    • McCallum, D.1    Avis, D.2
  • 13
    • 33746252807 scopus 로고    scopus 로고
    • Simple population replacement strategies for a steady-state multi-objective evolutionary algorithm
    • GECCO, Springer
    • Mumford C.L. Simple population replacement strategies for a steady-state multi-objective evolutionary algorithm. GECCO. Lecture Notes in Computer Science vol. 3102 (2004), Springer 1389-1399
    • (2004) Lecture Notes in Computer Science , vol.3102 , pp. 1389-1399
    • Mumford, C.L.1
  • 14
    • 10044285409 scopus 로고    scopus 로고
    • Heuristics for large strip packing problems with guillotine patterns: an empirical study
    • Du D.Z., and Pardalos P.M. (Eds), Kluwer Academic Press
    • Mumford-Valenzuela C.L., Vick J., and Pearl Y. Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Du D.Z., and Pardalos P.M. (Eds). Metaheuristics: Computer Decision-Making (2003), Kluwer Academic Press
    • (2003) Metaheuristics: Computer Decision-Making
    • Mumford-Valenzuela, C.L.1    Vick, J.2    Pearl, Y.3
  • 15
    • 58149415051 scopus 로고
    • An iterative procedure for the polygonal approximation of plane curves
    • Ramer U. An iterative procedure for the polygonal approximation of plane curves. Comput. Graph. Image Process. 1 (1972) 244-256
    • (1972) Comput. Graph. Image Process. , vol.1 , pp. 244-256
    • Ramer, U.1
  • 16
    • 2642541226 scopus 로고    scopus 로고
    • Measuring shape: ellipticity, rectangularity, and triangularity
    • Rosin P.L. Measuring shape: ellipticity, rectangularity, and triangularity. Mach. Vision Appl. 14 (2003) 172-184
    • (2003) Mach. Vision Appl. , vol.14 , pp. 172-184
    • Rosin, P.L.1
  • 19
    • 0024869958 scopus 로고
    • Polygonal entropy: a convexity measure
    • Stern H.I. Polygonal entropy: a convexity measure. Pattern Recognit. Lett. 10 (1989) 229-235
    • (1989) Pattern Recognit. Lett. , vol.10 , pp. 229-235
    • Stern, H.I.1
  • 22
    • 84901418616 scopus 로고    scopus 로고
    • C.L. Valenzuela (Mumford), A simple evolutionary algorithm for multi-objective optimization (SEAMO), in: Congress on Evolutionary Computation (CEC), 2002, 717-722.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.