A simple expression for the map of Asplund's distances with the multiplicative Logarithmic Image Processing (LIP) law
Guillaume Noyel (IPRI), Michel Jourlin (IPRI, LHC)

TL;DR
This paper presents a straightforward formula for computing Asplund's distance map using the multiplicative Logarithmic Image Processing law, leveraging morphological operations to simplify the process.
Contribution
It introduces a simple expression for Asplund's distances based on morphological dilation and erosion under the multiplicative LIP law, simplifying previous methods.
Findings
Provides a concise formula for Asplund's distance map
Utilizes morphological gradient with additive structuring function
Simplifies computation under the multiplicative LIP law
Abstract
We introduce a simple expression for the map of Asplund's distances with the multiplicative Logarithmic Image Processing (LIP) law. It is a difference between a morphological dilation and a morphological erosion with an additive structuring function which corresponds to a morphological gradient.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Image and Object Detection Techniques · Robotics and Sensor-Based Localization
