Sciweavers

846 search results - page 76 / 170
» Transforming structures by set interpretations
Sort
View
IVC
2007
184views more  IVC 2007»
13 years 10 months ago
Image distance functions for manifold learning
Many natural image sets are samples of a low-dimensional manifold in the space of all possible images. When the image data set is not a linear combination of a small number of bas...
Richard Souvenir, Robert Pless
BMCBI
2008
95views more  BMCBI 2008»
13 years 10 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
3DPVT
2002
IEEE
145views Visualization» more  3DPVT 2002»
14 years 3 months ago
Multiresolution Distance Volumes for Progressive Surface Compression
We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topolo...
Daniel E. Laney, Martin Bertram, Mark A. Duchainea...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 5 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
ICPR
2000
IEEE
14 years 11 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu