Sciweavers

6365 search results - page 283 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIP
1999
IEEE
16 years 8 months ago
A Fast Image Registration Technique for Motion Artifact Reduction in DSA
In digital subtraction angiography (DSA), patient motion is the primary cause of image quality degradation. The motion correction algorithms developed so far were not sufficiently...
Erik H. W. Meijering, Karel J. Zuiderveld, Wiro J....
TIP
2010
89views more  TIP 2010»
15 years 1 months ago
Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...
Mila Nikolova, Michael K. Ng, Chi-Pan Tam
JCC
2008
92views more  JCC 2008»
15 years 6 months ago
Fast procedure for reconstruction of full-atom protein models from reduced representations
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
Piotr Rotkiewicz, Jeffrey Skolnick
JCPHY
2011
85views more  JCPHY 2011»
14 years 9 months ago
A fast method for the solution of the Helmholtz equation
In this paper, we consider the numerical solution of the Helmholtz equation, arising from the study of the wave equation in the frequency domain. The approach proposed here diffe...
Eldad Haber, Scott MacLachlan
ICASSP
2011
IEEE
14 years 10 months ago
A variable step size evolutionary affine projection algorithm
It is well known that the affine projection algorithm (APA) offers a good tradeoff between convergence rate/tracking and computational complexity. Recently, the evolutionary APA (...
Felix Albu, Constantin Paleologu, Jacob Benesty