메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 8-

Minimum ratio contours on surface meshes

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL METHODS; GRAPHIC METHODS;

EID: 33845435926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2006.25     Document Type: Conference Paper
Times cited : (3)

References (23)
  • 1
    • 0024172568 scopus 로고    scopus 로고
    • Using dynamic programming for minimizing the energy of active contours in the presence of hard constraints
    • A. Amini, S. Tehrani, and T. Weymouth. Using dynamic programming for minimizing the energy of active contours in the presence of hard constraints. In IEEE Int. Conf. on Computer Vision, pages 95-99, 1998.
    • (1998) IEEE Int. Conf. on Computer Vision , pp. 95-99
    • Amini, A.1    Tehrani, S.2    Weymouth, T.3
  • 2
    • 3042644439 scopus 로고    scopus 로고
    • Parameterization-free active contour models
    • S. Bischoff and L. Kobbelt. Parameterization-free active contour models. The Visual Computer, 20:217-228, 2004.
    • (2004) The Visual Computer , vol.20 , pp. 217-228
    • Bischoff, S.1    Kobbelt, L.2
  • 6
    • 0005196882 scopus 로고
    • On active contour models and balloons
    • L. Cohen. On active contour models and balloons. CVGIP: Image Understanding, 53(2):211-218, 1991.
    • (1991) CVGIP: Image Understanding , vol.53 , Issue.2 , pp. 211-218
    • Cohen, L.1
  • 12
    • 0035481208 scopus 로고    scopus 로고
    • Globally optimal regions and boundaries as minimum ratio weight cycles
    • I. Jermyn and H. Ishikawa. Globally optimal regions and boundaries as minimum ratio weight cycles. IEEE Trans. on Pattern Analysis Machine Intelligence, 23(10):1075-1088, 2001.
    • (2001) IEEE Trans. on Pattern Analysis Machine Intelligence , vol.23 , Issue.10 , pp. 1075-1088
    • Jermyn, I.1    Ishikawa, H.2
  • 16
    • 0036735554 scopus 로고    scopus 로고
    • Geometric snakes for triangular meshes
    • Y. Lee and S. Lee. Geometric snakes for triangular meshes. Computer Graphics Forum, 21:229-238, 2002.
    • (2002) Computer Graphics Forum , vol.21 , pp. 229-238
    • Lee, Y.1    Lee, S.2
  • 18
    • 0000754733 scopus 로고    scopus 로고
    • Segmentation of a wrap-around model using an active contour
    • M. J. Milroy, C. Bradley, and G. W. Vickers. Segmentation of a wrap-around model using an active contour. Computer Aided Design, 29(4), 1997.
    • (1997) Computer Aided Design , vol.29 , Issue.4
    • Milroy, M.J.1    Bradley, C.2    Vickers, G.W.3
  • 19
    • 0002851510 scopus 로고    scopus 로고
    • Straightest geodesics on polyhedral surfaces
    • K. Polthier and M. Schmies. Straightest geodesics on polyhedral surfaces. In Mathematical Visualization, pages 391-410, 1998.
    • (1998) Mathematical Visualization , pp. 391-410
    • Polthier, K.1    Schmies, M.2
  • 23
    • 0026741340 scopus 로고
    • A fast algorithm for active contours and curvature estimation
    • D. Williams and M. Shah. A fast algorithm for active contours and curvature estimation. CVGIP: Image Understanding, 55(1):14-26, 1992.
    • (1992) CVGIP: Image Understanding , vol.55 , Issue.1 , pp. 14-26
    • Williams, D.1    Shah, M.2


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