Sciweavers

817 search results - page 12 / 164
» Robust Euclidean embedding
Sort
View
PKDD
2005
Springer
131views Data Mining» more  PKDD 2005»
15 years 3 months ago
ISOLLE: Locally Linear Embedding with Geodesic Distance
Locally Linear Embedding (LLE) has recently been proposed as a method for dimensional reduction of high-dimensional nonlinear data sets. In LLE each data point is reconstructed fro...
Claudio Varini, Andreas Degenhard, Tim W. Nattkemp...
ICML
2008
IEEE
15 years 10 months ago
Topologically-constrained latent variable models
In dimensionality reduction approaches, the data are typically embedded in a Euclidean latent space. However for some data sets this is inappropriate. For example, in human motion...
Raquel Urtasun, David J. Fleet, Andreas Geiger, Jo...
EMMCVPR
2009
Springer
14 years 7 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
SIGMOD
2005
ACM
113views Database» more  SIGMOD 2005»
15 years 3 months ago
Robust and Fast Similarity Search for Moving Object Trajectories
An important consideration in similarity-based retrieval of moving object trajectories is the definition of a distance function. The existing distance functions are usually sensi...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
ECCV
2010
Springer
15 years 2 months ago
Practical Autocalibration
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...