Sciweavers

6365 search results - page 165 / 1273
» Fast Local Computation Algorithms
Sort
View
ACCV
2007
Springer
15 years 11 months ago
Learning a Fast Emulator of a Binary Decision Process
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
Jan Sochman, Jiri Matas
GD
2001
Springer
15 years 9 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
SIAMIS
2008
279views more  SIAMIS 2008»
15 years 5 months ago
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
RECONFIG
2008
IEEE
107views VLSI» more  RECONFIG 2008»
15 years 11 months ago
Fast Implementation of a Bio-inspired Model for Decentralized Gathering
In the context of the emergence of alternative computing resources to address the challenge of the upcoming end of Moore’s law, we consider the feasibility of gathering computat...
Bernard Girau, Cesar Torres-Huitzil
ICIP
2009
IEEE
16 years 6 months ago
Fast Pseudo-enhancement Correction In Ct Colonography Using Linear Shift-invariant Filters
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...