A Euclidean distance matrix is one in which the (i, j) entry specifies the squared distance between particle i and particle j. Given a partially-specified symmetric matrix A with zero diagonal, the Euclidean distance matrix completion problem (EDMCP) is to determine the unspecified entries to make A a Euclidean distance matrix. We survey three different approaches to solving the EDMCP.We advoca...

Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computation, a commonly used approximate algorithm is the chamfer distance transform. This paper presents an efficient linear-time algorithm for calculating the true Euclidean distance-squared of each point from the nearest ...

In this paper, we suggest a novel recommender system where set of appropriate propositions is formed by measuring how user query features are close to space all possible propositions. The for e-traders selling commodities. A commodity has hierarchical-structure properties which mapped the respective numerical scales. scales normalized so that from potential customer and any proposition e-trader...

The work presented in this paper focuses on recognition of isolated handwritten characters in Devanagari and Gurumukhi script. The proposed work uses four feature extraction methods like Zoning density, Projection histograms, Distance profiles and Background Directional Distribution(BDD). On the basis of these four types of features we have formed 10 feature vectors using different combinations...

This paper presents a new method for personal recognition using palmprints. This method uses inkless, normalized palmprint images to generate eigenpalms. Every palmprint image is thus characterized by a feature vector, consisting of weights from eigenpalm images. The performance of proposed method using two measures, i.e., minimum Euclidean distance and maximum similarity measure, is evaluated....

3D objects, search in databases, moments, support vector machine, quadratic programming This paper introduces a content-based search algorithm for a database of 3D objects. The search is performed by giving an example object, and looking for similar ones in the database. The search system result is given as several nearest neighbor objects. The weighted Euclidean distance between a sequence of ...

This paper presents a new method for personal recognition using palmprints. This method uses, inkless, normalized palmprint images to generate eigenpalms. Every palmprint image is thus characterized by a feature vector, consisting of weights from eigenpalm images. The performance of proposed method using two measures i.e., minimum Euclidean distance and maximum similarity measure, is evaluated....