Publication

Efficient algorithms for the k-distance transformation

Olivier Cuisenaire
2006
Journal Articles

Abstract

The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discrete regular grid within a D dimensional volume, which Warfield [Patt. Rec. Letters, 17(1996) 713-721] proposed to implement using 2^D raster scans. We investigate the possible approaches for efficient implementations by extending the existing Euclidean 1-DT methods and propose two new k-DT algorithms. The first is based on ordered propagation while the second divides the problem into D 1-dimensional problems. We compare the computational complexity of the different approaches.

Official source

https://infoscience.epfl.ch/entities/publication/fc44542e-6efe-436e-b426-41d7f0949a76

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Efficient algorithms for the k-distance transformation

Chat with Graph Search

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Stable cones in the thin one-phase problem