3630 search results - page 109 / 726 » Fast Marching Methods |
101
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
108
click to vote
ACCV
2006
Springer
15 years 8 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
98
Voted
ROBOCUP
2004
Springer
15 years 7 months ago
2004
Springer
We have developed an automatic calibration method for a global camera system. Firstly, we show how to define automatically the color maps we use for tracking the robots’ markers...
127
click to vote
Publication
In this note, improvements to the non-local means
image denoising method introduced in [2], [3] are presented.
The original non-local means method replaces a noisy pixel by
the ...
114
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...