Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2312.12020

Spatial Metric Space for Pattern Recognition Problems

Q. M. Danish Lohani·Ashutosh Tiwari·Mohd Shoaib Khan
View original source ↗Read source document ↗Export metadata ↓

Abstract

The definition of weighted distance measure involves weights. The paper proposes a weighted distance measure without the help of weights. Here, weights are intrinsically added to the measure, and for this, the concept of metric space is generalized based on a novel divided difference operator. The proposed operator is used over a two-dimensional sequence of bounded variation, and it generalizes metric space with the introduction of a multivalued metric space called spatial metric space. The environment considered for the study is a two-dimensional Atanassov intuitionistic fuzzy set (AIFS) under the assumption that membership and non-membership components are its independent variables. The weighted distance measure is proposed as a spatial distance measure in the spatial metric space. The spatial distance measure consists of three branches. In the first branch, there is a domination of membership values, non-membership values dominate the second branch, and the third branch is equidominant. The domination of membership and non-membership values are not in the form of weights in the proposed spatial distance measure, and hence it is a measure independent of weights. The proposed spatial metric space is mathematically studied, and as an implication, the spatial similarity measure is multivalued in nature. The spatial similarity measure can recognize a maximum of three patterns simultaneously. The spatial similarity measure is tested for the pattern recognition problems and the obtained classification results are compared with some other existing similarity measures to show its potency. This study connects the double sequence to the application domain via a divided difference operator for the first time while proposing a novel divided difference operator-based spatial metric space.

Explore related subjects

math.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Q. M. Danish Lohani, Ashutosh Tiwari, Mohd Shoaib Khan. 2023-12-19. Spatial Metric Space for Pattern Recognition Problems. https://arxiv.org/abs/2312.12020

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

$β$-Uniform Convexity and Divisible Domains

Divisible convex sets have long been important in the study of Hilbert geometries. When a divisible convex set is an ellipsoid, the Hilbert geometry it induces is the hyperbolic space. In general, strictly convex divisible domains exhibit negative curvature properties, but only the ellipsoid is a CAT(0) space. The notion of p-uniform convexity from the theory of Banach spaces has been proposed by Shin-Ichi Ohta as a generalization of the Alexandrov-Toponogov comparison theorems to Finsler manifolds. We prove that a natural Finsler metric on a strictly convex divisible domain is $β$-uniformly convex, where the constant $β$ is related to the regularity of the boundary. We use this to show, with AI assistance, that the Hilbert metric, under suitable local and scale-dependent assumptions, is $β$-uniformly convex on such domains.

math.MG↗
arXiv2026

A positive solution to the $L^p$ projection centroid conjecture

In a classical paper [21] in 2000, Lutwak-Yang-Zhang established the $L^p$ analog of the Petty projection inequality and the $L^p$ analog of the Busemann-Petty centroid inequality. In Section 7 of [21], Lutwak-Yang-Zhang proposed the important $L^p$ projection centroid conjecture. We give a positive solution to the $L^p$ projection centroid conjecture in this work.

math.MG↗
arXiv2026

Minimal central slices of the regular simplex

We prove that minimal-volume hyperplane sections of the regular simplex through its centroid are parallel to a facet. The proof combines variational methods with Fourier-analytic techniques and zero-diminishing arguments to show that every critical normal vector has at most three distinct non-zero coordinates. Analysis of the two- and three-value cases then yields the sharp lower bound.

math.MG↗