2957 search results - page 469 / 592 » The Complexity of Polynomial-Time Approximation |
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
ECCV
2000
Springer
14 years 11 months ago
2000
Springer
This paper considers a fundamental problem in visual motion perception, namely the problem of egomotion estimation based on visual input. Many of the existing techniques for solvin...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
A richer set of land-cover classes are observable in satellite imagery than ever before due to the increased sub-meter resolution. Individual objects, such as cars and houses, are...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
Piecewise constant and piecewise smooth Mumford-Shah (MS) models have been widely studied and used for image segmentation. More complicated than piecewise constant MS, global Gaus...