Results 21 to 30 of about 8,805 (204)

On optimal polyline simplification using the Hausdorff and Fréchet distance

open access: yesJournal of Computational Geometry, 2020
We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given ε ...
Marc van Kreveld   +2 more
doaj   +1 more source

GAN‐LSTM‐3D: An efficient method for lung tumour 3D reconstruction enhanced by attention‐based LSTM

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Three‐dimensional (3D) image reconstruction of tumours can visualise their structures with precision and high resolution. In this article, GAN‐LSTM‐3D method is proposed for 3D reconstruction of lung cancer tumours from 2D CT images. Our method consists of three phases: lung segmentation, tumour segmentation, and tumour 3D reconstruction. Lung
Lu Hong   +12 more
wiley   +1 more source

Priority Degrees and Distance Measures of Complex Hesitant Fuzzy Sets With Application to Multi-Criteria Decision Making

open access: yesIEEE Access, 2023
The notion of a complex hesitant fuzzy set (CHFS) is one of the better tools in order to deal with complex information. Since distance plays a crucial role in order to differentiate between two things or sets, in this paper, we first develop a priority ...
Muhammad Sajjad Ali Khan   +4 more
doaj   +1 more source

Polyline simplification has cubic complexity

open access: yesJournal of Computational Geometry, 2021
$\DeclareMathOperator{\poly}{poly}$In the classic polyline simplification problem, given a polygonal curve~$P$ consisting of $n$ vertices and an error threshold $\delta \geq 0$, we want to replace $P$ by a subsequence~$Q$ of minimal size such that the ...
Karl Bringmann, Bhaskar Ray Chaudhury
doaj   +1 more source

The Hausdorff Algebra Fuzzy Distance and its Basic Properties [PDF]

open access: yesEngineering and Technology Journal, 2021
In this article we recall the definition of algebra fuzzy metric space and its basic properties. In order to introduced the Hausdorff algebra fuzzy metric from fuzzy compact set to another fuzzy compact set we define the algebra fuzzy distance between ...
Zainab Khudhair, Jehad Kider
doaj   +1 more source

Fully automated segmentation of the pons and midbrain using human T1 MR brain images. [PDF]

open access: yesPLoS ONE, 2014
This paper describes a novel method to automatically segment the human brainstem into midbrain and pons, called labs: Landmark-based Automated Brainstem Segmentation. LABS processes high-resolution structural magnetic resonance images (MRIs) according to
Salvatore Nigro   +10 more
doaj   +1 more source

The Hausdorff–Pompeiu Distance in Gn-Menger Fractal Spaces

open access: yesMathematics, 2022
This paper introduces a complete Gn-Menger space and defines the Hausdorff–Pompeiu distance in the space. Furthermore, we show a novel fixed-point theorem for Gn-Menger-θ-contractions in fractal spaces.
Donal O’Regan   +3 more
doaj   +1 more source

Edge Eigenface Weighted Hausdorff Distance for Face Recognition [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2011
The different face regions have different degrees of importance for face recognition. In previous Hausdorff distance (HD) measures, points are treated as same importance, or weight different points that calculated from gray domain.
Huachun Tan   +6 more
doaj   +1 more source

The topology of theρ-hausdorff distance

open access: yesAnnali di Matematica Pura ed Applicata, 1991
As the authors say ``the Hausdorff distance... works well as long as the sets lie in a bounded region. In many applications one has to deal with unbounded sets or with collections of bounded sets which are not uniformly bounded''. To deal with these situations this paper builds on earlier work of two of the authors and others and is a comprehensive ...
Attouch, Hedy   +2 more
openaire   +3 more sources

The Hausdorff core problem on simple polygons

open access: yesJournal of Computational Geometry, 2014
A polygon \(Q\) is a \(k\)-bounded Hausdorff Core of a polygon \(P\) if \(P\) contains \(Q\), \(Q\) is convex, and the Hausdorff distance between \(P\) and \(Q\) is at most \(k\).
Reza Dorrigiv   +7 more
doaj   +1 more source

Home - About - Disclaimer - Privacy