Sciweavers

123 search results - page 20 / 25
» Robust binary least squares: Relaxations and algorithms
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 9 months ago
Extracting shared subspace for multi-label classification
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
Shuiwang Ji, Lei Tang, Shipeng Yu, Jieping Ye
IBPRIA
2007
Springer
14 years 2 months ago
Progressive Compression of Geometry Information with Smooth Intermediate Meshes
We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each gr...
Taejung Park, Haeyoung Lee, Chang-hun Kim
CVPR
2006
IEEE
14 years 10 months ago
3D Surface Matching and Recognition Using Conformal Geometry
3D surface matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition and classification. However, surface matchin...
Sen Wang, Yang Wang, Miao Jin, Xianfeng Gu, Dimitr...
ICASSP
2009
IEEE
14 years 3 months ago
Sparse LMS for system identification
We propose a new approach to adaptive system identification when the system model is sparse. The approach applies the ℓ1 relaxation, common in compressive sensing, to improve t...
Yilun Chen, Yuantao Gu, Alfred O. Hero III
DICTA
2008
13 years 10 months ago
Image Reconstruction from Contrast Information
An iterative algorithm for the reconstruction of natural images given only their contrast map is presented. The solution is neuro-physiologically inspired, where the retinal cells...
Asim A. Khwaja, Roland Goecke