Sciweavers

356 search results - page 20 / 72
» Further results on the subspace distance
Sort
View
IJON
2010
150views more  IJON 2010»
13 years 8 months ago
Linear discriminant analysis using rotational invariant L1 norm
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition....
Xi Li, Weiming Hu, Hanzi Wang, Zhongfei Zhang

Publication
322views
14 years 2 months ago
Three-dimensional point cloud recognition via distributions of geometric distances
Ageometric framework for the recognition of three-dimensional objects represented by point clouds is introducedin this paper. The proposed approach is based on comparing distribut...
Mona Mahmoudi, Guillermo Sapiro
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 11 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
CVPR
2009
IEEE
15 years 5 months ago
Learning a Distance Metric from Multi-instance Multi-label Data
Multi-instance multi-label learning (MIML) refers to the learning problems where each example is represented by a bag/collection of instances and is labeled by multiple labels. ...
Rong Jin (Michigan State University), Shijun Wang...
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 3 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen