Efficient visual recognition using the Hausdorff distance
From MaRDI portal
Publication:2563915
DOI10.1007/BFb0015091zbMath0863.68117OpenAlexW1602797708MaRDI QIDQ2563915
Publication date: 26 January 1997
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0015091
Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Novel semi-metrics for multivariate change point analysis and anomaly detection ⋮ CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection ⋮ A practical approximation algorithm for the LTS estimator ⋮ The complexity of the Hausdorff distance ⋮ Hausdorff distance between convex semialgebraic sets ⋮ Metrics based on average distance between sets ⋮ Recognizing the similarity of polygons in a strengthened Hausdorff metric ⋮ Precise Hausdorff distance computation for freeform surfaces based on computations with osculating toroidal patches ⋮ Classifying transformation-variant attributed point patterns ⋮ Integrating prior domain knowledge into discriminative learning using automatic model construction and phantom examples ⋮ Exploring the boundary region of tolerance rough sets for feature selection ⋮ Numerical modelling challenges for clinical electroporation ablation technique of liver tumors ⋮ A new measure between sets of probability distributions with applications to erratic financial behavior ⋮ A note on the representability of compact sets by real sequences
