Sciweavers

215 search results - page 20 / 43
» Fast self-healing gradients
Sort
View
NIPS
1994
13 years 11 months ago
Convergence Properties of the K-Means Algorithms
This paper studies the convergence properties of the well known K-Means clustering algorithm. The K-Means algorithm can be described either as a gradient descent algorithmor by sl...
Léon Bottou, Yoshua Bengio
CVPR
2010
IEEE
14 years 6 months ago
Fast Image Alignment in the Fourier Domain
In this paper we propose a framework for gradient descent image alignment in the Fourier domain. Specifically, we propose an extension to the classical Lucas & Kanade (LK) a...
Ahmed Ashraf, Simon Lucey, Tsuhan Chen
SADM
2008
178views more  SADM 2008»
13 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
CVPR
2003
IEEE
14 years 12 months ago
Flux Driven Fly Throughs
We present a fast, robust and automatic method for computing central paths through tubular structures for application to virtual endoscopy. The key idea is to utilize a medial sur...
Sylvain Bouix, Kaleem Siddiqi, Allen Tannenbaum
ICIP
2007
IEEE
14 years 11 months ago
An Efficient Method for Compressed Sensing
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...
Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Step...