Sciweavers

101 search results - page 11 / 21
» Newton's iterates can converge to non-stationary points
Sort
View
127
Voted
CVPR
2008
IEEE
16 years 3 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
ICPR
2004
IEEE
16 years 2 months ago
Gaussian Energy Functions for Registration without Correspondences
A new criterion based on Gaussian fields is introduced and applied to the task of automatic rigid registration of point-sets. The method defines a simple energy function, which is...
Andreas Koschan, Besma R. Abidi, Faysal Boughorbel...
117
Voted
ICASSP
2011
IEEE
14 years 5 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
IOR
2010
98views more  IOR 2010»
14 years 11 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
116
Voted
TNN
2011
107views more  TNN 2011»
14 years 8 months ago
Iterative Gaussianization: From ICA to Random Rotations
Abstract—Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this paper, we propose a solution to t...
Valero Laparra, Gustavo Camps-Valls, Jesus Malo