메뉴 건너뛰기




Volumn , Issue , 2013, Pages 2336-2343

Tree shape priors with connectivity constraints using convex relaxation on general graphs

Author keywords

Medical Imaging; Optimization; Segmentation

Indexed keywords

BINARY TREES; COMMUNICATION SYSTEMS; CONVEX OPTIMIZATION; FORESTRY; GEODESY; IMAGE SEGMENTATION; MEDICAL IMAGING; OPTIMIZATION; RELAXATION PROCESSES;

EID: 84898813585     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2013.290     Document Type: Conference Paper
Times cited : (43)

References (31)
  • 1
    • 0025483204 scopus 로고
    • Using dynamic programming for solving variational problems in vision. Pattern Analysis and Machine Intelligence
    • A. A. Amini, T. E.Weymouth, and R. C. Jain. Using dynamic programming for solving variational problems in vision. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 12(9):855-867, 1990.
    • (1990) IEEE Transactions on , vol.12 , Issue.9 , pp. 855-867
    • Amini, A.A.1    Weymouth, T.E.2    Jain, R.C.3
  • 3
    • 75749090310 scopus 로고    scopus 로고
    • Segmentation of interwoven 3d tubular tree structures utilizing shape priors and graph cuts
    • C. Bauer, T. Pock, E. Sorantin, H. Bischof, and R. Beichel. Segmentation of interwoven 3d tubular tree structures utilizing shape priors and graph cuts. Medical image analysis, 14(2):172-184, 2010.
    • (2010) Medical Image Analysis , vol.14 , Issue.2 , pp. 172-184
    • Bauer, C.1    Pock, T.2    Sorantin, E.3    Bischof, H.4    Beichel, R.5
  • 4
    • 80053541481 scopus 로고    scopus 로고
    • Tubular structure segmentation based on minimal path method and anisotropic enhancement
    • F. Benmansour and L. Cohen. Tubular structure segmentation based on minimal path method and anisotropic enhancement. International Journal of Computer Vision, 92:192-210, 2011.
    • (2011) International Journal of Computer Vision , vol.92 , pp. 192-210
    • Benmansour, F.1    Cohen, L.2
  • 7
    • 37249038709 scopus 로고    scopus 로고
    • Discrete regularization on weighted graphs for image and mesh filtering
    • F. Sgallari, A. Murli, and N. Paragios, editors Springer
    • S. Bougleux, A. Elmoataz, and M. Melkemi. Discrete regularization on weighted graphs for image and mesh filtering. In F. Sgallari, A. Murli, and N. Paragios, editors, SSVM, volume 4485 of Lecture Notes in Computer Science, pages 128-139. Springer, 2007.
    • (2007) SSVM Volume 4485 of Lecture Notes in Computer Science , pp. 128-139
    • Bougleux, S.1    Elmoataz, A.2    Melkemi, M.3
  • 8
    • 4344598245 scopus 로고    scopus 로고
    • An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
    • sept.
    • Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 26(9):1124-1137, sept. 2004.
    • (2004) Pattern Analysis and Machine Intelligence IEEE Transactions on , vol.26 , Issue.9 , pp. 1124-1137
    • Boykov, Y.1    Kolmogorov, V.2
  • 10
    • 79953201848 scopus 로고    scopus 로고
    • A first-order primal-dual algorithm for convex problems with applications to imaging
    • May
    • A. Chambolle and T. Pock. A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis., 40(1):120-145, May 2011.
    • (2011) J. Math. Imaging Vis. , vol.40 , Issue.1 , pp. 120-145
    • Chambolle, A.1    Pock, T.2
  • 12
    • 56749152265 scopus 로고    scopus 로고
    • Geos: Geodesic image segmentation
    • Springer
    • A. Criminisi, T. Sharp, and A. Blake. Geos: Geodesic image segmentation. In Computer Vision-ECCV 2008, pages 99-112. Springer, 2008.
    • (2008) Computer Vision-ECCV , vol.2008 , pp. 99-112
    • Criminisi, A.1    Sharp, T.2    Blake, A.3
  • 13
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 14
    • 77955995927 scopus 로고    scopus 로고
    • Fast global optimization of curvature
    • IEEE
    • N. Y. El-Zehiry and L. Grady. Fast global optimization of curvature. In CVPR, pages 3257-3264. IEEE, 2010.
    • (2010) CVPR , pp. 3257-3264
    • El-Zehiry, N.Y.1    Grady, L.2
  • 15
    • 45949105032 scopus 로고    scopus 로고
    • Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing
    • july
    • A. Elmoataz, O. Lezoray, and S. Bougleux. Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing. Image Processing, IEEE Transactions on, 17(7):1047-1060, july 2008.
    • (2008) Image Processing IEEE Transactions on , vol.17 , Issue.7 , pp. 1047-1060
    • Elmoataz, A.1    Lezoray, O.2    Bougleux, S.3
  • 22
    • 70350345530 scopus 로고    scopus 로고
    • A review of 3d vessel lumen segmentation techniques: Models, features and extraction schemes
    • D. Lesage, E. D. Angelini, I. Bloch, and G. Funka-Lea. A review of 3d vessel lumen segmentation techniques: Models, features and extraction schemes. Medical image analysis, 13(6):819-845, 2009.
    • (2009) Medical Image Analysis , vol.13 , Issue.6 , pp. 819-845
    • Lesage, D.1    Angelini, E.D.2    Bloch, I.3    Funka-Lea, G.4
  • 25
    • 84860525582 scopus 로고    scopus 로고
    • A linear framework for region-based image segmentation and inpainting involving curvature penalization
    • to appear
    • T. Schoenemann, F. Kahl, S. Masnou, and D. Cremers. A linear framework for region-based image segmentation and inpainting involving curvature penalization. International Journal of Computer Vision, 2012. to appear.
    • (2012) International Journal of Computer Vision
    • Schoenemann, T.1    Kahl, F.2    Masnou, S.3    Cremers, D.4
  • 26
    • 0029966538 scopus 로고    scopus 로고
    • A fast marching level set method for monotonically advancing fronts
    • J. A. Sethian. A fast marching level set method for monotonically advancing fronts. Proceedings of the National Academy of Sciences, 93(4):1591-1595, 1996.
    • (1996) Proceedings of the National Academy of Sciences , vol.93 , Issue.4 , pp. 1591-1595
    • Sethian, J.A.1
  • 28
    • 0029373106 scopus 로고
    • Efficient algorithms for globally optimal trajectories
    • sep
    • J. Tsitsiklis. Efficient algorithms for globally optimal trajectories. Automatic Control, IEEE Transactions on, 40(9):1528-1538, sep 1995.
    • (1995) Automatic Control IEEE Transactions on , vol.40 , Issue.9 , pp. 1528-1538
    • Tsitsiklis, J.1
  • 31
    • 52949102105 scopus 로고    scopus 로고
    • Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in n-d images
    • Y. Zeng, D. Samaras, W. Chen, and Q. Peng. Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in n-d images. Computer vision and image understanding, 112(1):81-90, 2008.
    • (2008) Computer Vision and Image Understanding , vol.112 , Issue.1 , pp. 81-90
    • Zeng, Y.1    Samaras, D.2    Chen, W.3    Peng, Q.4


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