Sciweavers

108 search results - page 11 / 22
» Efficiently solving convex relaxations for MAP estimation
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
77
Voted
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang
93
Voted
CVPR
2007
IEEE
15 years 11 months ago
Efficiently Determining Silhouette Consistency
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
Li Yi, David W. Jacobs
TSP
2010
14 years 4 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
PAMI
2012
13 years 2 days ago
Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
Kalin Kolev, Thomas Brox, Daniel Cremers