Sciweavers

3359 search results - page 219 / 672
» A Simplified Idea Algorithm
Sort
View
ICIP
1999
IEEE
16 years 5 months ago
Unsupervised Low-Frequency Driven Segmentation of Color Images
This paper presents an algorithm for unsupervised segmentation of color images. The main idea behind it is the use of the low-frequency content of images which allows for smoothin...
Luca Lucchese, Sanjit K. Mitra
ICDE
2003
IEEE
97views Database» more  ICDE 2003»
16 years 5 months ago
Spectral LPM: An Optimal Locality-Preserving Mapping using the Spectral (not Fractal) Order
For the past two decades, fractals (e.g., the Hilbert and Peano space-filling curves) have been considered the natural method for providing a locality-preserving mapping. The idea...
Mohamed F. Mokbel, Walid G. Aref, Ananth Grama
ICPR
2006
IEEE
16 years 4 months ago
Part-Based Probabilistic Point Matching
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
Graham McNeill, Sethu Vijayakumar
115
Voted
ICPR
2002
IEEE
16 years 4 months ago
Data Clustering Using Evidence Accumulation
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
Ana L. N. Fred, Anil K. Jain
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 4 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon