Sciweavers

195 search results - page 9 / 39
» Cluster-based find and replace
Sort
View
SOCO
2008
Springer
13 years 6 months ago
A particular Gaussian mixture model for clustering and its application to image retrieval
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
Hichem Sahbi
ICIP
2007
IEEE
14 years 1 months ago
A VQ-Based Demosaicing by Self-Similarity
In this paper, we propose a learning-based demosaicing and a restoration error detection. A Vector Quantization (VQ)based method is utilized for learning. We take advantage of a s...
Yoshikuni Nomura, Shree K. Nayar
CG
2006
Springer
13 years 6 months ago
A smooth, obstacle-avoiding curve
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
Zhong Li, Dereck S. Meek, Desmond J. Walton
COOPIS
2004
IEEE
13 years 10 months ago
Trust-Aware Collaborative Filtering for Recommender Systems
Recommender Systems allow people to find the resources they need by making use of the experiences and opinions of their nearest neighbours. Costly annotations by experts are replac...
Paolo Massa, Paolo Avesani
CIDM
2007
IEEE
14 years 1 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...