Sciweavers

34 search results - page 3 / 7
» A geometric framework for solving subsequence problems in co...
Sort
View
ECCV
2010
Springer
13 years 9 months ago
Efficient Non-Consecutive Feature Tracking for Structure-from-Motion
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...
CVPR
2006
IEEE
14 years 7 months ago
Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction
Geometric reconstruction problems in computer vision can be solved by minimizing the maximum of reprojection errors, i.e., the L-norm. Unlike L2-norm (sum of squared reprojection ...
Qifa Ke, Takeo Kanade
ICIP
1998
IEEE
14 years 6 months ago
Direct Computation of Differential Invariants of Image Contours from Shading
In this paper we present a framework combining differential geometry and scale-space to show that local geometric invariants of image contours such as tangent, curvature and deriv...
Liangyin Yu, Charles R. Dyer
BMCBI
2006
100views more  BMCBI 2006»
13 years 5 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
DGCI
2008
Springer
13 years 7 months ago
Statistical Template Matching under Geometric Transformations
Abstract. We present a novel template matching framework for detecting geometrically transformed objects. A template is a simplified representation of the object of interest by a s...
Alexander Sibiryakov