메뉴 건너뛰기




Volumn 11, Issue 2, 2001, Pages 145-166

Efficient algorithms for optimization-based image segmentation

Author keywords

Approximation scheme; Computer vision; Dynamic programming; Fast matrix searching; Hand probing; Polynomial time algorithm; Region segmentation

Indexed keywords


EID: 0035590607     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195901000420     Document Type: Article
Times cited : (33)

References (38)
  • 2
    • 51249165028 scopus 로고
    • Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
    • A. Aggarwal, B. Schieber, and T. Tokuyama: "Finding a minimum-weight k-link path in graphs with the concave Monge property and applications," Discrete & Comput. Geom., 12 (1994), pp. 263-280.
    • (1994) Discrete & Comput. Geom. , vol.12 , pp. 263-280
    • Aggarwal, A.1    Schieber, B.2    Tokuyama, T.3
  • 4
    • 0019716820 scopus 로고
    • Image segmentation schema for low-level computer vision
    • T. Asano and N. Yokoya: "Image segmentation schema for low-level computer vision," Pattern Recognition, 14 (1-6) (1981), pp. 267-173.
    • (1981) Pattern Recognition , vol.14 , Issue.1-6 , pp. 267-1173
    • Asano, T.1    Yokoya, N.2
  • 5
    • 84976702883 scopus 로고
    • Programming pearls - Algorithm design techniques
    • J.L. Bentley: "Programming pearls - Algorithm design techniques," Communications of the ACM, 27-9 (1984), pp. 865-871.
    • (1984) Communications of the ACM , vol.27 , Issue.9 , pp. 865-871
    • Bentley, J.L.1
  • 6
  • 7
    • 0023010037 scopus 로고
    • Fractional cascading: I. A data structure technique
    • B. Chazelle and L. Guibas: "Fractional cascading: I. A data structure technique," Algorithmica, 1 (1986), pp. 133-162.
    • (1986) Algorithmica , vol.1 , pp. 133-162
    • Chazelle, B.1    Guibas, L.2
  • 8
  • 9
    • 38249039076 scopus 로고
    • Searching and storing similar lists
    • R. Cole: "Searching and storing similar lists," J. of Algorithms, 7 (1986), pp. 202-220.
    • (1986) J. of Algorithms , vol.7 , pp. 202-220
    • Cole, R.1
  • 10
    • 0001266569 scopus 로고
    • A survey of edge detection techniques
    • L.S. Davis: "A survey of edge detection techniques," Comput. Graph. Image Process., 4 (1975), pp. 248-270.
    • (1975) Comput. Graph. Image Process. , vol.4 , pp. 248-270
    • Davis, L.S.1
  • 12
    • 0017014095 scopus 로고
    • Mathematical techniques for efficient record segmentation in large shared databases
    • M.J. Eisner and D.G. Severence: "Mathematical techniques for efficient record segmentation in large shared databases," J. of the ACM, 23 (1976), pp. 619-635.
    • (1976) J. of the ACM , vol.23 , pp. 619-635
    • Eisner, M.J.1    Severence, D.G.2
  • 13
    • 0346864103 scopus 로고    scopus 로고
    • private communication
    • T. Fukuda: private communication.
    • Fukuda, T.1
  • 17
    • 0000727336 scopus 로고
    • The rectilinear Steiner tree problem is NP complete
    • M.R. Garey and D.S. Johnson: "The rectilinear Steiner tree problem is NP complete," SIAM J. Appl. Math., 32 (1977), pp. 826-834.
    • (1977) SIAM J. Appl. Math. , vol.32 , pp. 826-834
    • Garey, M.R.1    Johnson, D.S.2
  • 20
    • 0027928863 scopus 로고
    • Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering
    • M. Inaba, N. Katoh, and H. Imai: "Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering," Proc. 12th Annual ACM Symp. on Computational Geometry, 1994, pp. 332-339.
    • (1994) Proc. 12th Annual ACM Symp. on Computational Geometry , pp. 332-339
    • Inaba, M.1    Katoh, N.2    Imai, H.3
  • 24
    • 0023344292 scopus 로고
    • A parametric characterization and an ∈-approximation scheme for the minimization of a quasiconcave program
    • N. Katoh and T. Ibaraki: "A parametric characterization and an ∈-approximation scheme for the minimization of a quasiconcave program," Discrete Applied Mathematics, 17 (1987), pp. 39-66.
    • (1987) Discrete Applied Mathematics , vol.17 , pp. 39-66
    • Katoh, N.1    Ibaraki, T.2
  • 25
    • 0022807204 scopus 로고
    • Data structures for retrieval on square grids
    • M.D. Katz and D.J. Volper: "Data structures for retrieval on square grids," SIAM J. Comput., 15 (1986), pp. 919-931.
    • (1986) SIAM J. Comput. , vol.15 , pp. 919-931
    • Katz, M.D.1    Volper, D.J.2
  • 31
    • 84994130495 scopus 로고    scopus 로고
    • Efficient construction of regression trees with range and region splitting
    • Y. Morimoto, H. Ishii, and S. Morishita: "Efficient construction of regression trees with range and region splitting," Proc. 23rd VLDB Conf., 1997, pp. 166-175.
    • (1997) Proc. 23rd VLDB Conf. , pp. 166-175
    • Morimoto, Y.1    Ishii, H.2    Morishita, S.3
  • 32
    • 0018296730 scopus 로고
    • Discriminant and least squares threshold selection
    • N. Ohtsu: "Discriminant and least squares threshold selection," Proc. 4th IJCPR, 1978, pp. 592-596.
    • (1978) Proc. 4th IJCPR , pp. 592-596
    • Ohtsu, N.1
  • 35
    • 0011575733 scopus 로고    scopus 로고
    • Application of algorithm theory to data mining
    • Also in Proc. CATS98
    • T. Tokuyama: "Application of algorithm theory to data mining," Proc. of Australasian Computer Science Conf., 1998, pp. 1-15. Also in Proc. CATS98
    • (1998) Proc. of Australasian Computer Science Conf. , pp. 1-15
    • Tokuyama, T.1
  • 36
    • 0041756152 scopus 로고
    • Computing maximum valued region
    • . 36. G.J. Woeginger: "Computing maximum valued region," Acta Cybernetica, 10 (1992), pp. 303-315.
    • (1992) Acta Cybernetica , vol.10 , pp. 303-315
    • Woeginger, G.J.1
  • 38
    • 0016993605 scopus 로고
    • Region growing: Childhood and adolescence
    • S.W. Zucker: "Region growing: Childhood and adolescence," Comput. Graph. Image Process., 5 (1976), pp. 382-399.
    • (1976) Comput. Graph. Image Process. , vol.5 , pp. 382-399
    • Zucker, S.W.1


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