Sciweavers

1728 search results - page 102 / 346
» The Accelerated Euclidean Algorithm
Sort
View
122
Voted
IWVF
2001
Springer
15 years 7 months ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel
ICCV
1999
IEEE
15 years 7 months ago
Flexible Calibration: Minimal Cases for Auto-Calibration
This paper deals with the concept of auto-calibration, i.e. methods to calibrate a camera on-line. In particular, we deal with minimal conditions on the intrinsic parameters neede...
Anders Heyden, Kalle Åström
CATS
2007
15 years 4 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
ADCM
2008
111views more  ADCM 2008»
15 years 3 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 3 months ago
Non-Negative Matrix Factorization, Convexity and Isometry
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...