We introduce a novel parametric family of symmetric information-theoretic distances based on Jensen’s inequality for a convex functional generator. In particular, this family unifies the celebrated Jeffreys divergence with the Jensen-Shannon divergence when the Shannon entropy generator is chosen. We then design a generic algorithm to compute the unique centroid defined as the minimum average d...

This study investigates the asymptotic performance of the quadratic discriminant function (QDF) under skewed training samples. The main objective of this study is to evaluate the performance of the QDF under skewed distribution considering different sample size ratios, varying the group centroid separators and the number of variables. Three populations [Formula: see text] with increasing group ...

Efficient computation of shortest cycles which form a homology basis under Z2-additions in a given simplicial complex K has been researched actively in recent years. When the complex K is a weighted graph with n vertices andm edges, the problem of computing a shortest (homology) cycle basis is known to be solvable in O(mn/ log n+nm)-time. Several works [1,2] have addressed the case when the com...

Let P be an H-polytope in R with vertex set V . The vertex centroid is defined as the average of the vertices in V . We first prove that computing the vertex centroid of an H-polytope, or even just checking whether it lies in a given halfspace, are #P-hard. We also consider the problem of approximating the vertex centroid by finding a point within an ǫ distance from it and prove this problem to...

Specific distance measures have been proposed in order to identify video sequences that are very similar over time but not identical (e.g. repeated takes). One such measure is based on the Longest Common Subsequence (LCSS) algorithm, a variant of the string edit distance. After building a matching matrix back-tracking is performed to identify the longest common subsequence. The modification for...

A novel approach for human silhouette recognition is presented. The method is based on Fourier descriptors. We made an analysis of which and how many descriptors are enough to have a general human silhouette representation, and concluded that a reduced number of components, low and high frecuency, is sufficient for representing a human silhouette and for its recognition in different posses. Bas...

We present a hybrid method in which we classify music from a raw audio signal according to their spectral features, while maintaining the ability to assess similarities between any two pieces in the set of analyzed works. First we segment the audio file into discrete windows and create a vector of triplets respectively describing the spectral centroid, the short-time energy function, and the sh...

Localization based on received signal strength indication (RSSI) is a low cost and low complexity technology, and it is widely applied in distance-based localization of wireless sensor networks (WSNs). Error of existed localization technologies is significant. This paper presents the N-times trilateral centroid weighted localization algorithm (NTCWLA), which can reduce the error considerably. C...