Sciweavers

3630 search results - page 373 / 726
» Fast Marching Methods
Sort
View
ICIP
1997
IEEE
16 years 6 months ago
An Efficient Boundary Encoding Scheme which is Optimal in the Rate-Distortion Sense
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...
Fabian W. Meier, Guido M. Schuster, Aggelos K. Kat...
ICPR
2002
IEEE
16 years 6 months ago
Text Scanner with Text Detection Technology on Image Sequences
We propose a text scanner, which detects wide text strings in a sequence of scene images. For scene text detection, we use a multiple-CAMShift algorithm on a text probability imag...
Keechul Jung, Kwang In Kim, JungHyun Han
ISBI
2004
IEEE
16 years 5 months ago
Quasi-Maximum Likelihood Blind Deconvolution of Images Acquired Through Scattering Media
We address the problem of restoration of images obtained through a scattering medium. We present an efficient quasimaximum likelihood blind deconvolution approach based on the fas...
Michael M. Bronstein, Alexander M. Bronstein, Yeho...
159
Voted
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
15 years 11 months ago
Improved worst-case response-time calculations by upper-bound conditions
Fast real-time feasibility tests and analysis algorithms are necessary for a high acceptance of the formal techniques by industrial software engineers. This paper presents a possi...
Victor Pollex, Steffen Kollmann, Karsten Albers, F...
ICIP
2008
IEEE
15 years 11 months ago
Fully reversible image rotation by 1-D filtering
In this work, we propose a new image rotation algorithm. The main feature of our approach is the symmetric reversibility, which means that when using the same algorithm for the co...
Laurent Condat, Dimitri Van De Ville