메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Unsupervised learning of finite mixtures using entropy regularization and its application to image segmentation

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC MODEL SELECTION; DETERMINISTIC ANNEALING; E-M ALGORITHMS; FINITE MIXTURES; GLOBAL MINIMIZATION; LEARNING PROBLEMS; MULTIVARIATE DATA; NUMBER OF COMPONENTS; POSTERIOR PROBABILITIES; REGULARIZATION THEORY; SIMULATION EXPERIMENTS; STATE-OF-THE-ART METHODS; UNSUPERVISED IMAGE SEGMENTATION;

EID: 51949115402     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587424     Document Type: Conference Paper
Times cited : (5)

References (15)
  • 1
    • 79953046563 scopus 로고    scopus 로고
    • Density estimation using mixtures of mixtures of Gaussians
    • W. Abd-Almageed and L. S. Davis. Density estimation using mixtures of mixtures of Gaussians. In Proc. ECCV, volume 4, pages 410-422, 2006.
    • (2006) Proc. ECCV , vol.4 , pp. 410-422
    • Abd-Almageed, W.1    Davis, L.S.2
  • 2
    • 0000675167 scopus 로고    scopus 로고
    • Structure learning in conditional probability models via entropic prior and parameter extinction
    • M. Brand. Structure learning in conditional probability models via entropic prior and parameter extinction. Neural Computation, 11:1155-1182, 1999.
    • (1999) Neural Computation , vol.11 , pp. 1155-1182
    • Brand, M.1
  • 5
    • 0034850577 scopus 로고    scopus 로고
    • A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics
    • D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In Proc. ICCV, volume 2, pages 416-423, 2001.
    • (2001) Proc. ICCV , vol.2 , pp. 416-423
    • Martin, D.1    Fowlkes, C.2    Tal, D.3    Malik, J.4
  • 6
    • 0023570352 scopus 로고
    • On bootstrapping the likelihood ratio test statistic for the number of components in a normal mixture
    • G. McLachlan. On bootstrapping the likelihood ratio test statistic for the number of components in a normal mixture. Journal of the Royal Statistical Society Series C, 36:318-324, 1987.
    • (1987) Journal of the Royal Statistical Society Series C , vol.36 , pp. 318-324
    • McLachlan, G.1
  • 7
    • 0004066260 scopus 로고    scopus 로고
    • G. McLachlan and D. Peel, editors, John Wiley & Sons, New York
    • G. McLachlan and D. Peel, editors. Finite Mixture Models. John Wiley & Sons, New York, 2000.
    • (2000) Finite Mixture Models
  • 8
    • 34047208285 scopus 로고    scopus 로고
    • A class-adaptive spatially variant mixture model for image segmentation
    • C. Nikou, N. P. Galatsanos, and A. C. Likas. A class-adaptive spatially variant mixture model for image segmentation. IEEE Trans. on Image Processing, 16(4):1121-1130, 2007.
    • (2007) IEEE Trans. on Image Processing , vol.16 , Issue.4 , pp. 1121-1130
    • Nikou, C.1    Galatsanos, N.P.2    Likas, A.C.3
  • 9
    • 0021404166 scopus 로고
    • Mixture densities, maximum likelihood and the EM algorithm
    • R. A. Render and H. F. Walker. Mixture densities, maximum likelihood and the EM algorithm. SIAM Review, 26(2):195-239, 1984.
    • (1984) SIAM Review , vol.26 , Issue.2 , pp. 195-239
    • Render, R.A.1    Walker, H.F.2
  • 10
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 12
    • 0003664883 scopus 로고
    • A. N. Tikhonov and V. Y. Arsenin, editors, Wiley, New York
    • A. N. Tikhonov and V. Y. Arsenin, editors. Solutions of Ill-Posed Problems. Wiley, New York, 1977.
    • (1977) Solutions of Ill-Posed Problems
  • 13
    • 0032029288 scopus 로고    scopus 로고
    • Deterministic annealing EM algorithm
    • N. Ueda and R. Nakano. Deterministic annealing EM algorithm. Neural Networks, 11:271-282, 1998.
    • (1998) Neural Networks , vol.11 , pp. 271-282
    • Ueda, N.1    Nakano, R.2
  • 15
    • 0032684826 scopus 로고    scopus 로고
    • Minimum message length and Kolmogorov complexity
    • C. S. Wallace and D. L. Dowe. Minimum message length and Kolmogorov complexity. Computer Journal, 42(4):270-283, 1999.
    • (1999) Computer Journal , vol.42 , Issue.4 , pp. 270-283
    • Wallace, C.S.1    Dowe, D.L.2


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