Results 61 to 70 of about 2,269,164 (264)

Computing the Hausdorff Distance of Two Sets from Their Signed Distance Functions [PDF]

open access: yesInternational journal of computational geometry and applications, 2018
The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points.
Daniel Kraft
semanticscholar   +1 more source

Optimal VMD-Based Signal Denoising for Laser Radar via Hausdorff Distance and Wavelet Transform

open access: yesIEEE Access, 2019
Laser radar echo signals are easily contaminated by noise, such as background light and electronic noise, and this noise is an obstacle for the subsequent signal detection.
Tuan Hua   +7 more
semanticscholar   +1 more source

Hausdorff distance of univoque sets

open access: yesTopology and its Applications
Expansions in non-integer bases have been investigated abundantly since their introduction by R nyi. It was discovered by Erd s et al. that the sets of numbers with a unique expansion have a much more complex structure than in the integer base case. The present paper is devoted to the continuity properties of these maps with respect to the Hausdorff ...
Cai, Yi, Komornik, Vilmos
openaire   +3 more sources

Vector Bundles and Gromov–Hausdorff Distance [PDF]

open access: yesJournal of K-Theory, 2009
AbstractWe show how to make precise the vague idea that for compact metric spaces that are close together for Gromov–Hausdorff distance, suitable vector bundles on one metric space will have counterpart vector bundles on the other. Our approach employs the Lipschitz constants of projection-valued functions that determine vector bundles. We develop some
openaire   +3 more sources

Harnessing Deep Learning of Point Clouds for Morphology Mimicking of Universal 3D Shape‐Morphing Devices

open access: yesAdvanced Intelligent Systems, EarlyView.
Soft robots capable of morphing into various 3D shapes are crucial for applications like human‐machine interfaces and biological manipulation. However, controlling 3D shape‐morphing robots with soft actuators remains a challenge. This work introduces a machine learning model that maps complex 3D deformations to control inputs, enabling robots to mimic ...
Jue Wang   +3 more
wiley   +1 more source

The Quantum Gromov-Hausdorff Propinquity [PDF]

open access: yes, 2013
We introduce the quantum Gromov-Hausdorff propinquity, a new distance between quantum compact metric spaces, which extends the Gromov-Hausdorff distance to noncommutative geometry and strengthens Rieffel's quantum Gromov-Hausdorff distance and Rieffel's ...
Latremoliere, Frederic
core   +2 more sources

RefineCatDiff: Toward High‐Quality Medical Image Segmentation via a Categorical Diffusion Refinement Framework

open access: yesAdvanced Intelligent Systems, EarlyView.
This study proposes RefineCatDiff, a refinement framework for high‐quality medical image segmentation. By developing a categorical distribution‐based discrete diffusion process for refinement, the framework aligns well with the characteristics of image segmentation tasks. Experimental results on multiple datasets across different modalities demonstrate
Feng Liu   +8 more
wiley   +1 more source

A multivariate Gnedenko law of large numbers

open access: yes, 2013
We show that the convex hull of a large i.i.d. sample from an absolutely continuous log-concave distribution approximates a predetermined convex body in the logarithmic Hausdorff distance and in the Banach-Mazur distance.
Fresen, Daniel
core   +1 more source

Limit behaviour of constant distance boundaries of Jordan curves

open access: yesAIMS Mathematics, 2022
For a Jordan curve Γ in the complex plane, its constant distance boundary Γλ is an inflated version of Γ. A flatness condition, (1/2,r0)-chordal property, guarantees that Γλ is a Jordan curve when λ is not too large. We prove that Γλ converges to Γ, as λ
Feifei Qu, Xin Wei
doaj   +1 more source

Methods of optimization of Hausdorff distance between convex rotating figures [PDF]

open access: yesYugoslav Journal of Operations Research, 2020
We studied the problem of optimizing the Hausdorff distance between two convex polygons. Its minimization is chosen as the criterion of optimality. It is believed that one of the polygons can make arbitrary movements on the plane, including parallel ...
Lebedev Pavel, Ushakov Vladimir
doaj   +1 more source

Home - About - Disclaimer - Privacy