127,307 Hits in 5.3 sec

Scalable and efficient parallel algorithms for Euclidean distance transform on the LARPBS model

Ling Chen, Y. Pan, Xiao-hua Xu
2004 IEEE Transactions on Parallel and Distributed Systems  
A parallel algorithm for Euclidean Distance Transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented.  ...  To the best of our knowledge, this is the most efficient constant-time EDT algorithm on LARPBS. Index Terms-Distance transform, parallel algorithm, image processing. ae . L. Chen is with the  ...  ACKNOWLEDGMENTS The authors would like to thank the associate editor, Professor Ivan Stojmenovic, for his timely handling of their submission and the three anonymous reviewers for their constructive comments  ... 
doi:10.1109/tpds.2004.71 fatcat:uycbac7qsvdxnhx546tmouh57y

FastGeodis: Fast Generalised Geodesic Distance Transform [article]

Muhammad Asad, Reuben Dorent, Tom Vercauteren
2022 arXiv   pre-print
The FastGeodis package provides an efficient implementation for computing Geodesic and Euclidean distance transforms (or a mixture of both) targeting efficient utilisation of CPU and GPU hardwares.  ...  The performance speed-ups reported here were evaluated using 3D volume data on Nvidia GeForce Titan X (12 GB) with 6-Core Intel Xeon E5-1650 CPU.  ...  Acknowledgements This research was supported by the European Union's Horizon 2020 research and innovation programme under grant agreement No 101016131.  ... 
arXiv:2208.00001v1 fatcat:74p3kinhz5g2tgkjtjbhgmwqnq

Euclidean Distance Transform of Digital Images in Arbitrary Dimensions [chapter]

Dong Xu, Hua Li
2006 Lecture Notes in Computer Science  
A new algorithm for Euclidean distance transform is proposed in this paper. It propagates from the boundary to the inner of object layer by layer, like the inverse propagation of water wave.  ...  Euclidean distance transformations of digital images in 2-D and 3-D are conducted in the experiments. Voronoi diagram and Delaunay triangulation can also be produced by this method.  ...  Butterfly is a commonly used image for Euclidean distance transformation and skeleton extraction in 2-D. The left of Fig. 3 shows the distance transform result of our algorithm.  ... 
doi:10.1007/11922162_9 fatcat:frojs6eyr5gklmtwzvdp6ztlxm

Clustering Dichotomous Data for Health Care

D Ashok Kumar
2012 International Journal of Information Sciences and Techniques  
The proposed algorithm can be usable for determining the correlation of the health disorders and symptoms observed in large medical and health binary databases.  ...  Binary data are the simplest form of data used for heath care databases in which close ended questions can be used; it is very efficient based on computational efficiency and memory capacity to represent  ...  ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers for their significant and constructive critiques and suggestions, which improved the paper very much.  ... 
doi:10.5121/ijist.2012.2203 fatcat:ol5un5gv5nbr3jgntysehuln6q

The "dead reckoning" signed distance transform

George J Grevera
2004 Computer Vision and Image Understanding  
We compare Dead Reckoning with a wide variety of other distance transform algorithms based on the Chamfer distance algorithm for both accuracy and speed, and demonstrate that Dead Reckoning produces more  ...  These algorithms often trade accuracy for efficiency, exhibit varying degrees of conceptual complexity, and some require parallel processors. One algorithm in particular, the Chamfer distance [J.  ...  Acknowledgments The author gratefully acknowledges NIH Grants NS 37172 and P01-CA85424 for support of this work.  ... 
doi:10.1016/j.cviu.2004.05.002 fatcat:u7usormbfnb4ne3hxucjzsagby

Efficient Euclidean distance transform using perpendicular bisector segmentation

Jun Wang, Ying Tan
2011 CVPR 2011  
In this paper, we propose an efficient algorithm for computing the Euclidean distance transform of two-dimensional binary image, called PBEDT (Perpendicular Bisector Euclidean Distance Transform).  ...  All these methods reduce the computational complexity significantly. Consequently, an efficient and exact linear time Euclidean distance transform algorithm is implemented.  ...  In this paper, we propose an efficient algorithm for computing the Euclidean distance transform of two-dimensional binary image, called PBEDT (Perpendicular Bisector Euclidean Distance Transform).  ... 
doi:10.1109/cvpr.2011.5995644 dblp:conf/cvpr/WangT11 fatcat:4thrbqrg3rff7m7zcwoaihcbva

The Exact Euclidean Distance Transform: A New Algorithm for Universal Path Planning

Juan Carlos Elizondo-Leal, Ezra Federico Parra-González, José Gabriel Ramírez-Torres
2013 International Journal of Advanced Robotic Systems  
In this paper, we present a new algorithm for universal path planning in cell decomposition, using a raster scan method for computing the Exact Euclidean Distance Transform (EEDT) for each cell in the  ...  Our algorithm computes, for every cell in the map, the point sequence to the goal.  ...  The Exact Euclidean Distance Transform algorithm The core of our approach, called the Exact Euclidean Distance Transform (EEDT), is that for each cell we obtain the best visible sub goal towards the goal  ... 
doi:10.5772/56581 fatcat:ucdz7lplw5cu3pief5wdfogdfm

Efficient shape representation by minimizing the set of centres of maximal discs/spheres

Gunilla Borgefors, Ingela Nyström
1997 Pattern Recognition Letters  
Distance transform based algorithms can be used to compute the set of centres of maximal discs/spheres, that represents a shape.  ...  This paper describes a method that reduces this set, under the constraint that the shape can be exactly reconstructed using the reverse distance transformation.  ...  A special thanks also to Dr Ingemar Ragnemalm for doing the work in the 2D Euclidean case.  ... 
doi:10.1016/s0167-8655(97)00027-5 fatcat:ir2qbuaniretfbh2mvlwniasoi

Fast and exact signed Euclidean distance transformation with linear complexity

O. Cuisenaire, B. Macq
1999 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)  
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson.  ...  In contrast with all fast algorithms previously published, our algorithm produces perfect Euclidean distance maps in a time linearly proportional to the number of pixels in the image.  ...  A distance transformation (DT) is the algorithm producing this map from a binary image describing the objects. A Euclidean DT is a transformation that uses the Euclidean metric.  ... 
doi:10.1109/icassp.1999.757545 dblp:conf/icassp/CuisenaireM99 fatcat:qspn6irlzrcrzlddv6uminvnrq

A similarity search algorithm for ellipsoid queries using spatial transformation

Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uemura, Ryoji Kataoka
2004 Systems and Computers in Japan  
distance is measured by Euclidean distance functions.  ...  Our method significantly reduces CPU cost due to the distance approximation by the spatial transformation; exact distance evaluations are avoided for most of the accessed bounding rectangles in the index  ...  Search Algorithm Range queries and k-nearest neighbor queries are useful for multi-dimensional databases. An algorithm based on spatial transformation can efficiently support both types of queries.  ... 
doi:10.1002/scj.10307 fatcat:2uauwg2jsbfkjgv2anz4u2dptu

Comparative Evaluation of Transform and Cluster based CBIR

Seema AnandChaurasia, Omprakash Yadav, Vaishali Suryawanshi
2014 International Journal of Computer Applications  
In this paper, comparative evaluation is made on the result of CBIR system based on transform based Image retrieval and cluster based Image retrieval by taking Euclidean distance as similarity measure  ...  Distance Type Average Precision Average recall Transform based Haar 68.84% 68.84% Cluster based using LBG Algorithm 85.55% 85.55% Distance Type Average Precision Average recall Transform based using Haar  ...  PERFORMANCE MEASUREMENT USING EUCLIDEAN DISTANCE The parameters being used for calculation of efficiency of the CBIR system designed, namely Average Precision and Average Recall are the ones being used  ... 
doi:10.5120/17381-7917 fatcat:2cy2xqjoqbchhlrzpjpjobg4by

New Higher-Resolution Discrete Euclidean Medial Axis in nD with Linear Time Parallel Algorithm

André Vital Saúde
2008 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing  
The HRDMA can be combined with the algorithms in abstract complexes, so a reversible and homotopic Euclidean skeleton can be computed in optimal time.  ...  To preserve topology and reversibility, the MA is usually combined with homotopic thinning algorithms.  ...  The author is grateful to the collaboration of M. Couprie, from Esiee Paris, and to D. Coeurjolly, from INSA Lyon, who has provided a free C code of the RDMA.  ... 
doi:10.1109/sibgrapi.2008.38 dblp:conf/sibgrapi/Saude08 fatcat:eel4nhslqzcmnl2u4ucihqbqka

Implementation of Morphological Operation through Intercept Based Euclidean Distance Algorithm

In this paper, we proposed a model which is a robust intercept based Euclidean distance (IBED) algorithm to perform morphological operation to extract the surface of the skeleton from the computed Tomography  ...  The index value, edge points, Euclidean distance and fracture length have been calculated. The proposed technique is employed to four men and two women with different fractures in CT scanned image.  ...  for Euclidean Distance Transform.  ... 
doi:10.35940/ijitee.c9051.029420 fatcat:nkeqqvit5nbwxphfm3bfyisseu

A Robust and Fast Collision-Avoidance Approach for Micro Aerial Vehicles Using a Depth Sensor

Liang Lu, Adrian Carrio, Carlos Sampedro, Pascual Campoy
2021 Remote Sensing  
First of all, a depth-based Euclidean distance field mapping algorithm is generated.  ...  Then, the proposed Euclidean distance field mapping strategy is integrated with a rapid-exploration random tree to construct a collision-avoidance system.  ...  CSC) for the Scholarship of the first author.  ... 
doi:10.3390/rs13091796 fatcat:rsw7u62vanfpjdg2fuzxdkdpgi

Locally adaptable mathematical morphology

O. Cuisenaire
2005 IEEE International Conference on Image Processing 2005  
We show that when the SE are balls of a metric, locally adaptable erosion and dilation can be efficiently implemented as a variant of distance transformation algorithms.  ...  Opening and closing are obtained by a local threshold of a distance transformation, followed by the adaptable dilation.  ...  For openings and closings, the exact Euclidean distance transform [6] requires 3 scans of the image, and has a complexity similar to the dilation algorithm above.  ... 
doi:10.1109/icip.2005.1530007 dblp:conf/icip/Cuisenaire05 fatcat:qf2rgdro5zc4bae5d6jvlif2jq
« Previous Showing results 1 — 15 out of 127,307 results