Sciweavers

2219 search results - page 83 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
CVPR
2003
IEEE
15 years 7 days ago
The Viewing Graph
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
Noam Levi, Michael Werman
CVPR
2003
IEEE
14 years 3 months ago
Surface Reconstruction via Helmholtz Reciprocity with a Single Image Pair
This paper brings a novel method for three-dimensional reconstruction of surfaces that takes advantage of the symmetry resulting from alternating the positions of a camera and a l...
Peter H. Tu, Paulo R. S. Mendonça
SCALESPACE
1999
Springer
14 years 2 months ago
A Scale-Space Based Approach for Deformable Contour Optimization
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
Yusuf Sinan Akgul, Chandra Kambhamettu
ECCV
2008
Springer
15 years 3 days 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...
IPL
2006
97views more  IPL 2006»
13 years 10 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier