CVPR
2012
IEEE
12 years 9 days ago
2012
IEEE
Scale invariant feature detectors often find stable scales in only a few image pixels. Consequently, methods for feature matching typically choose one of two extreme options: mat...
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
Image registration and 3D reconstruction are fundamental computer vision and medical imaging problems. They are particularly challenging when the input data are images of a deform...
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
Acquiring transparent, refractive objects is challenging as these kinds of objects can only be observed by analyzing the distortion of reference background patterns. We present a ...
CGF
2011
13 years 1 months ago
2011
Bidirectional texture functions (BTFs) represent the appearance of complex materials. Three major shortcomings with BTFs are the bulky storage, the difficulty in editing and the ...
25
Voted
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We consider the question whether there exists a set A such that every set polynomial-time Turing equivalent to A is also many-one equivalent to A. We show that if E = NE then no s...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
ICIP
2009
IEEE
14 years 11 months ago
2009
IEEE
We explore sparse regression for effective feature selection and classification in face identity and expression recognition. We argue that sparse regression in pixel space is inap...
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
In this paper, we propose a novel volumetric representation for a sparse set of calibrated multi-view images of a nonLambertian scene. The depth map of each reference view is regi...