Results 31 to 40 of about 8,805 (204)
$k$-Median clustering under discrete Fréchet and Hausdorff distances
We give the first near-linear time (1+ε)-approximation algorithms for k-median clustering of polygonal trajectories under the discrete Fréchet distance, and finite point sets under the Hausdorff distance, provided the complexity of each cluster center ...
Abhinandan Nath, Erin Taylor
doaj +1 more source
In this paper we study the one-sided Hausdorff distance betweenВ the shifted Heaviside step--function and the transmuted Stannard growth function. Precise upper and lower bounds for the Hausdorff distance have been obtained. We present a software module (
Anton Iliev Iliev +2 more
doaj +1 more source
Some Notes for Two Generalized Trigonometric Families of Distributions
The paper deals with two general families of cumulative distribution functions based on arctangent function. We provide analysis of the error of the best one-sided Hausdorff approximation for some special cases of these families.
Maria T. Vasileva
doaj +1 more source
Quantized Gromov–Hausdorff distance
A quantized metric space is a matrix order unit space equipped with an operator space version of Rieffel's Lip-norm. We develop for quantized metric spaces an operator space version of quantum Gromov-Hausdorff distance. We show that two quantized metric spaces are completely isometric if and only if their quantized Gromov-Hausdorff distance is zero. We
openaire +2 more sources
Method and Algorithms for Computing Fuzzy Fréchet and Hausdorff Distance
Accurate image similarity assessment is a key problem in computer vision, particularly in segmentation and classification problems. Classical Hausdorff and Fréchet metrics provide pointwise distance values and do not allow similarity to be evaluated in ...
Mykhailo Zarichnyi +3 more
doaj +1 more source
The Gromov–Hausdorff distance between spheres
* We made some structural changes for better ...
Lim, Sunhyuk +2 more
openaire +2 more sources
DDSurfer reconstructs cortical surfaces directly from diffusion MRI without requiring T1‐weighted scans. By fusing complementary microstructural features and learning diffeomorphic deformations, it efficiently generates accurate white matter and pial surfaces, improving geometric fidelity and morphometric reliability across datasets for robust surface ...
Chengjin Li +10 more
wiley +1 more source
Cell Segmentation Beyond 2D—A Review of the State‐of‐the‐Art
Cell segmentation underpins many biological image analysis tasks, yet most deep learning methods remain limited to 2D despite the inherently 3D nature of cellular processes. This review surveys segmentation approaches beyond 2D, comparing 2.5D and fully 3D methods, analyzing 31 models and 32 volumetric datasets, and introducing a unified reference ...
Fabian Schmeisser +6 more
wiley +1 more source
Real-time image matching for navigation system based on genetic algorithm
In order to meet requirement that scene matching aided navigation system must get aircraft position error real-timely, an image matching algorithm based on genetic algorithm and weighted Hausdorff distance was proposed.
LENG Xue-fei1, LIU Jian-ye2, XIONG Zhi2
doaj +2 more sources
Some properties of the Blumberg's hyper-log-logistic curve
The paper considers the sigmoid function definedthrough the hyper-log-logistic model introduced by Blumberg. We study the Hausdorff distance of this sigmoid to the Heaviside function, which characterises the shape of switching from 0 to 1.
Roumen Anguelov +2 more
doaj +1 more source

