797 search results - page 34 / 160 » Observing Success in the Pi-Calculus |
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
113
click to vote
TSMC
2010
14 years 4 months ago
2010
Most existing camera placement algorithms focus on coverage and/or visibility analysis, which ensures that the object of interest is visible in the camera's field of view (FOV...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...
ICIAP
2005
ACM
15 years 9 months ago
2005
ACM
This paper introduces a new efficient way for computing affine invariant features from gray-scale images. The method is based on a novel image transform which produces infinitely m...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Diffusion Maps (DiffMaps) has recently provided a general framework that unites many other spectral manifold learning algorithms, including Laplacian Eigenmaps, and it has become ...