2219 search results - page 4 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
CVPR
2007
IEEE
14 years 9 days ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
ACIVS
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Computer vision algorithms are currently developed by looking up the available operators from the literature and then arranging those operators such that the desired task...
ECCV
2006
Springer
14 years 7 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
CAIP
2009
Springer
14 years 16 days ago
2009
Springer
Abstract. Dynamic Programming (DP) is a popular and efficient method for calculating disparity maps from stereo images. It allows for meeting real-time constraints even on low-cos...