Sciweavers

255 search results - page 5 / 51
» An Efficient Euclidean Distance Transform
Sort
View
PIMRC
2010
IEEE
14 years 10 months ago
Euclidean distance decomposition to generate new 16-QAM and 64-QAM space-time trellis codes
In this paper, the generation of 16-QAM and 64-QAM space-time trellis codes (STTCs) for several transmit antennas is considered. The main problem with an exhaustive search is the i...
Pierre Viland, Gheorghe Zaharia, Jean-Franç...
TIP
1998
109views more  TIP 1998»
14 years 11 months ago
Optimum design of chamfer distance transforms
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
Muhammad Akmal Butt, Petros Maragos
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
14 years 12 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
112
Voted
SI3D
2010
ACM
15 years 7 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...
GIS
2002
ACM
14 years 12 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...