Sciweavers

158 search results - page 4 / 32
» Spatially Coherent Clustering Using Graph Cuts
Sort
View
DIS
2006
Springer
13 years 10 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
EMMCVPR
2003
Springer
13 years 11 months ago
Generalized Multi-camera Scene Reconstruction Using Graph Cuts
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...
Vladimir Kolmogorov, Ramin Zabih, Steven J. Gortle...
IJCAI
2003
13 years 7 months ago
Data Clustering: Principal Components, Hopfield and Self-Aggregation Networks
We present a coherent framework for data clustering. Starting with a Hopfield network, we show the solutions for several well-motivated clustering objective functions are principa...
Chris H. Q. Ding
ACCV
2009
Springer
13 years 11 months ago
Video Segmentation Using Iterated Graph Cuts Based on Spatio-temporal Volumes
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...
ECCV
2008
Springer
14 years 8 months ago
Automatic Image Colorization Via Multimodal Predictions
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
Bernhard Schölkopf, Guillaume Charpiat, Matth...