Sciweavers

7742 search results - page 282 / 1549
» The Robustness of Level Sets
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 8 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
VMV
2001
145views Visualization» more  VMV 2001»
15 years 8 months ago
Registering Real-Scene to Virtual Imagery Using Robust Image Features
The ability to locate objects in a real-time video and relate them to virtual objects in a database is important in a number of applications including visually-guided robotic navi...
Yi Lu Murphey, Jianxin Zhang, Michael DelRose
TREC
2004
15 years 8 months ago
The Hong Kong Polytechnic University at the TREC 2004 Robust Track
In the robust track, we mainly tested our passage-based retrieval model with different passage sizes and weighting schemes. In our approach, we used two retrieval models, namely t...
D. Y. Wang, Robert Wing Pong Luk, Kam-Fai Wong
MVA
2000
155views Computer Vision» more  MVA 2000»
15 years 8 months ago
Virtual Subspace Method for Robust Face Recognition Independent of Lighting Conditions
A concept of virtual subspace is introduced for realizing a robust face recognition independent of the lighting conditions. The virtual subspace is a paradoxical concept because i...
Takeshi Shakunaga, Nobumasa Yamamoto
ICML
2010
IEEE
15 years 7 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu