• DocumentCode
    2402410
  • Title

    Efficient Computation of Closed Contours using Modified Baum-Welch Updating

  • Author

    Johnston, Leigh A. ; Elder, James H.

  • Author_Institution
    York University, Toronto, Canada
  • fYear
    2004
  • fDate
    27-02 June 2004
  • Firstpage
    48
  • Lastpage
    48
  • Abstract
    We address the problem of computing closed contours delineating the boundaries of objects of interest from image tangent maps. The Bayesian formulation of this problem incorporates the notion of foreground and background models in inferring the optimal image organization. Due to vital non-local constraints, the optimal MAP solution is intractable. We present a novel efficient search algorithm for the construction of highly probable closed contours, based on the Baum-Welch algorithm for updating hidden Markov model parameters.
  • Keywords
    Bayesian methods; Clustering algorithms; Computer vision; Costs; Dynamic programming; Greedy algorithms; Heuristic algorithms; Hidden Markov models; Jacobian matrices; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Vision and Pattern Recognition Workshop, 2004. CVPRW '04. Conference on
  • Type

    conf

  • DOI
    10.1109/CVPR.2004.56
  • Filename
    1384840