Results 131 to 140 of about 564,243 (186)
, 1988 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Iterative reconstruction algorithms
Computers in Biology and Medicine, 1976Abstract In this paper a survey of recent results on iterative reconstruction algorithms is given. These results, many of which have not yet appeared elsewhere, are applicable to a very general formulation of the reconstruction problem based on the series expansion approach.
G T, Herman, A, Lent
openaire +2 more sources
2010
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +2 more sources
The present chapter surveys computational algorithms for solving the independent component analysis (ICA) problem. Most of these algorithms rely on gradient or Newton iterations for contrast function maximization, and can work either in batch or adaptive processing mode.
Zarzoso, Vicente, Aapo, Hyvärinen
openaire +2 more sources
International Transactions in Operational Research, 2009
AbstractThe recently presented sequential unconstrained minimization algorithm, SUMMA, is extended to provide a framework for the derivation of block‐iterative, or partial‐gradient, optimization methods. This block‐iterative SUMMA (BI‐SUMMA) includes, and is motivated by, block‐iterative versions of the algebraic reconstruction technique (ART) and its ...
openaire +1 more source
AbstractThe recently presented sequential unconstrained minimization algorithm, SUMMA, is extended to provide a framework for the derivation of block‐iterative, or partial‐gradient, optimization methods. This block‐iterative SUMMA (BI‐SUMMA) includes, and is motivated by, block‐iterative versions of the algebraic reconstruction technique (ART) and its ...
openaire +1 more source
Iterative Scheduling Algorithms
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switch is the scheduling algorithm that decides which packets to transfer from ingress ports to egress ports in a given timeslot. It is desirable that such algorithms be iterative (so
M. Bayati +3 more
openaire +1 more source
Pattern Recognition Letters, 2011
Recent years have witnessed a growing interest in the information bottleneck theory. Among the relevant algorithms in the extant literature, the sequential Information Bottleneck (sIB) algorithm is recognized for its balance between accuracy and complexity.
Huaqiang Yuan, Yangdong Ye
openaire +1 more source
Recent years have witnessed a growing interest in the information bottleneck theory. Among the relevant algorithms in the extant literature, the sequential Information Bottleneck (sIB) algorithm is recognized for its balance between accuracy and complexity.
Huaqiang Yuan, Yangdong Ye
openaire +1 more source
Distributed Iterative Algorithms
IFAC Proceedings Volumes, 1988Abstract We consider iterative algorithms of the form x := f(x) , executed by a distributed network of processors. We first discuss a few possibilities for synchronous execution. We then consider asynchronous implementations whereby each processor iterates on a different component of x , at its own pace, using the most recently received (but ...
openaire +1 more source
Morphological iterative closest point algorithm
IEEE Transactions on Image Processing, 1999This work presents a method for the registration of three-dimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the "model" shape points is first constructed in the volume.
C A, Kapoutsis +2 more
openaire +2 more sources
Blind deconvolution: multiplicative iterative algorithm
Optics Letters, 2007A new algorithm has been developed for performing blind deconvolution on degraded images. The algorithm naturally preserves the nonnegative constraint on the iterative solutions of blind deconvolution and can produce a restored image of high resolution.
Jianlin, Zhang +2 more
openaire +2 more sources