Sciweavers

158 search results - page 5 / 32
» Spatially Coherent Clustering Using Graph Cuts
Sort
View
PR
2007
189views more  PR 2007»
13 years 7 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
MICCAI
2008
Springer
14 years 8 months ago
A Slicing-Based Coherence Measure for Clusters of DTI Integral Curves
We present a slicing-based coherence measure for clusters of DTI integral curves. For a given cluster, we probe samples from the cluster by slicing it with a plane at regularly spa...
Çagatay Demiralp, Gregory Shakhnarovich, So...
ICCV
2003
IEEE
14 years 9 months ago
Using Temporal Coherence to Build Models of Animals
This paper describes a system that can build appearance models of animals automatically from a video sequence of the relevant animal with no explicit supervisory information. The ...
Deva Ramanan, David A. Forsyth
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
CVPR
1999
IEEE
14 years 9 months ago
Stochastic Image Segmentation by Typical Cuts
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
Yoram Gdalyahu, Daphna Weinshall, Michael Werman