3600 search results - page 366 / 720 » The settling-time reducibility ordering |
213
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
362
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
171
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many vision and graphics problems such as relighting,
structured light scanning and photometric stereo, need im-
ages of a scene under a number of different illumination
conditi...
187
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We present a novel keyframe selection and recognition
method for robust markerless real-time camera tracking.
Our system contains an ofine module to select features
from a grou...
168
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...