Sciweavers

6365 search results - page 118 / 1273
» Fast Local Computation Algorithms
Sort
View
105
Voted
ECCV
2002
Springer
16 years 4 months ago
A Fast Radial Symmetry Transform for Detecting Points of Interest
A new feature detection technique is presented that utilises local radial symmetry to identify regions of interest within a scene. This transform is significantly faster than exist...
Gareth Loy, Alexander Zelinsky
113
Voted
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 9 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
107
Voted
ICIP
2007
IEEE
16 years 4 months ago
Dart: A Fast Heuristic Algebraic Reconstruction Algorithm for Discrete Tomography
Discrete tomography (DT) is concerned with the tomographic reconstruction of images that consist of only a small number of gray levels. DT reconstruction problems are usually unde...
Kees Joost Batenburg, Jan Sijbers
113
Voted
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 2 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
141
Voted
ISBI
2004
IEEE
16 years 3 months ago
A Fast Fully 4D Incremental Gradient Reconstruction Algorithm for List Mode PET Data
We present a fully four-dimensional, globally convergent, incremental gradient algorithm to estimate the continuous-time tracer density from list mode positron emission tomography...
Quanzheng Li, Evren Asma, Richard M. Leahy