Sciweavers

6005 search results - page 391 / 1201
» Graph-Theoretical Methods in Computer Vision
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
DynamicBoost: Boosting Time Series Generated by Dynamical Systems
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
René Vidal, Paolo Favaro
ICCV
2003
IEEE
16 years 8 months ago
How To Deal with Point Correspondences and Tangential Velocities in the Level Set Framework
In this paper, we overcome a major drawback of the level set framework: the lack of point correspondences. We maintain explicit backward correspondences from the evolving interfac...
Jean-Philippe Pons, Gerardo Hermosillo, Renaud Ker...
ECCV
2008
Springer
16 years 8 months ago
Improving Shape Retrieval by Learning Graph Transduction
Abstract. Shape retrieval/matching is a very important topic in computer vision. The recent progress in this domain has been mostly driven by designing smart features for providing...
Xingwei Yang, Xiang Bai, Longin Jan Latecki, Zhuow...
ECCV
2006
Springer
16 years 8 months ago
High Accuracy Optical Flow Serves 3-D Pose Tracking: Exploiting Contour and Flow Based Constraints
Tracking the 3-D pose of an object needs correspondences between 2-D features in the image and their 3-D counterparts in the object model. A large variety of such features has been...
Thomas Brox, Bodo Rosenhahn, Daniel Cremers, Hans-...
CVPR
2006
IEEE
16 years 28 days ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou