Sciweavers

331 search results - page 37 / 67
» Possibilistic Clustering in Feature Space
Sort
View
COMSIS
2010
13 years 5 months ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu
ICPR
2002
IEEE
14 years 21 days ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho
ISBI
2011
IEEE
12 years 11 months ago
Group sparsity based classification for cervigram segmentation
This paper presents an algorithm to classify pixels in uterine cervix images into two classes, namely normal and abnormal tissues, and simultaneously select relevant features, usi...
Yang Yu, Junzhou Huang, Shaoting Zhang, Christophe...
ICIP
2008
IEEE
14 years 9 months ago
Feature-based object modelling for visual surveillance
This paper introduces a new feature-based technique for implicitly modelling objects in visual surveillance. Previous work has generally employed background subtraction and other ...
Gary Baugh, Anil C. Kokaram
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
14 years 8 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...