Sciweavers

5331 search results - page 197 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
128
Voted
SAC
2011
ACM
14 years 9 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
CVPR
2005
IEEE
16 years 4 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
TEC
2010
193views more  TEC 2010»
14 years 9 months ago
Chemical-Reaction-Inspired Metaheuristic for Optimization
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
Albert Y. S. Lam, Victor O. K. Li
ICIP
1997
IEEE
16 years 4 months ago
Using mean field annealing to solve anisotropic diffusion problems
Anisotropic diffusion is a powerful method for image feature extraction in which blurring is allowed to occur except at edges. Mean field annealing (MFA) is an image optimization ...
Hairong Qi, Wesley E. Snyder, Griff L. Bilbro
CDC
2008
IEEE
130views Control Systems» more  CDC 2008»
15 years 9 months ago
Stochastic multiscale approaches to consensus problems
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...