Sciweavers

105 search results - page 9 / 21
» Histogram Clustering for Unsupervised Image Segmentation
Sort
View
EMMCVPR
1997
Springer
15 years 1 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 1 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
89
Voted
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
15 years 6 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
MICCAI
2010
Springer
14 years 8 months ago
Guide-Wire Extraction through Perceptual Organization of Local Segments in Fluoroscopic Images
Segmentation of surgical devices in fluoroscopic images and in particular of guide-wires is a valuable element during surgery. In cardiac angioplasty, the problem is particularly ...
Nicolas Honnorat, Régis Vaillant, Nikos Par...
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg