Publication

Adaptable Mathematical Morphology in D Dimensions Using the Separable Euclidean DT in D+1 Dimensions

Olivier Cuisenaire
2005
Conference Papers

Abstract

Locally adaptable mathematical morphology (AMM) uses circular structuring elements whose sizes can vary arbitrarily over the image plane. In this paper, we present an efficient algorithm to implement the dilation, erosion, closing and opening operators in arbitrary dimensions. The core of the method relies on adapting the separable Euclidean distance transformation (DT) introduced by Maurer in [IEEE Trans. PAMI, 25(2):265-270,2003]. The algorithm is both more accurate and significantly faster than the previously published method.

Official source

https://infoscience.epfl.ch/entities/publication/b45bc0b5-4467-4bdb-90f7-432f218ac5ae

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.

Olivier Cuisenaire
2005
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/b45bc0b5-4467-4bdb-90f7-432f218ac5ae

About this result

Related concepts (19)

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.

Shor's algorithm

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (that is, non-quantum) algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future.

Divide-and-conquer algorithm

In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. The divide-and-conquer technique is the basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.

Related publications (8)

Adaptable Mathematical Morphology in D Dimensions Using the Separable Euclidean DT in D+1 Dimensions

Chat with Graph Search

MATHICSE Technical Report : Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems

An Adaptive Initialization Method for Speaker Diarization based on Prosodic Features

understanding metro station usage using closed circuit television cameras analysis