Sciweavers

35 search results - page 3 / 7
» Fast normal vector compression with bounded error
Sort
View
NIPS
1992
13 years 6 months ago
A Note on Learning Vector Quantization
Vector Quantization is useful for data compression. Competitive Learning which minimizes reconstruction error is an appropriate algorithm for vector quantization of unlabelled dat...
Virginia R. de Sa, Dana H. Ballard
CAD
2007
Springer
13 years 5 months ago
Error analysis of reparametrization based approaches for curve offsetting
This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bo...
Hong-Yan Zhao, Guo-Jin Wang
PR
2007
104views more  PR 2007»
13 years 4 months ago
Optimizing resources in model selection for support vector machine
Tuning SVM hyperparameters is an important step in achieving a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the...
Mathias M. Adankon, Mohamed Cheriet
ICPR
2002
IEEE
13 years 10 months ago
A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
Guangming Li, Jie Tian, Mingchang Zhao, Huiguang H...
CISS
2008
IEEE
13 years 11 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...