1439 search results - page 144 / 288 » Fast approximation of centrality |
226
Voted
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
82
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
We present methods for training high quality object detectors
very quickly. The core contribution is a pair of fast
training algorithms for piece-wise linear classifiers, which
...
108
Voted
ICIP
2000
IEEE
16 years 2 months ago
2000
IEEE
This paper presents a new non-iterative, closed-form approximation to the maximum entropy (M.E.) image restoration method. A fast frequency domain implementation of this closed fo...
89
Voted
ICIP
1997
IEEE
16 years 2 months ago
1997
IEEE
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 ...
88
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
This paper describes the recognition of container code characters. The system has to deal with outdoor images which usually have damaged characters and obtain an answer in real ti...