Sciweavers

60 search results - page 1 / 12
» Subspace Constrained Mean-Shift
Sort
View
ICCV
2009
IEEE
14 years 10 months ago
Subspace Constrained Mean-Shift
Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of...
Jason M. Saragih, Simon Lucey, Jeffrey F. Cohn
CVPR
2010
IEEE
14 years 1 months ago
Manifold Blurring Mean Shift Algorithms
We propose a new family of algorithms for denoising data assumed to lie on a low-dimensional manifold. The algorithms are based on the blurring mean-shift update, which moves each...
Weiran Wang, Miguel Carreira-perpinan
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
14 years 10 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
ICCV
2003
IEEE
14 years 7 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
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...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
ACCV
2006
Springer
13 years 11 months ago
Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
Ju Yong Chang, Kyoung Mu Lee, Sang Uk Lee