Frames: a maximum entropy statistical estimate of the inverse problem

A maximum entropy statistical treatment of an inverse problem concerning frame theory is presented. The problem arises from the fact that a frame is an overcomplete set of vectors that defines a mapping with no unique inverse. Although any vector in the concomitant space can be expressed as a linear combination of frame elements, the coefficients of the expansion are not unique. Frame theory guarantees the existence of a set of coefficients which is “optimal” in a minimum norm sense. We show here that these coefficients are also “optimal” from a maximum entropy viewpoint.

A survey on the inverse integrating factor

The relation between limit cycles of planar differential systems and the inverse integrating factor was first shown in an article of Giacomini, Llibre and Viano appeared in 1996. From that moment on, many research articles are devoted to the study of the properties of the inverse integrating factor and its relationwith limit cycles and their bifurcations. This paper is a summary of all the results about this topic. We include a list of references together with the corresponding related results aiming at being as much exhaustive as possible. The paper is, nonetheless, self-contained in such a way that all the main results on the inverse integrating factor are stated and a complete overview of the subject is given. Each section contains a different issue to which the inverse integrating factor plays a role: the integrability problem, relation with Lie symmetries, the center problem, vanishing set of an inverse integrating factor, bifurcation of limit cycles from either a period annulus or from a monodromic ω-limit set and some generalizations.

Features extraction based on the Discrete Hartley Transform for closed contour

In this paper the authors propose a new closed contour descriptor that could be seen as a Feature Extractor of closed contours based on the Discrete Hartley Transform (DHT), its main characteristic is that uses only half of the coefficients required by Elliptical Fourier Descriptors (EFD) to obtain a contour approximation with similar error measure. The proposed closed contour descriptor provides an excellent capability of information compression useful for a great number of AI applications. Moreover it can provide scale, position and rotation invariance, and last but not least it has the advantage that both the parameterization and the reconstructed shape from the compressed set can be computed very efficiently by the fast Discrete Hartley Transform (DHT) algorithm. This Feature Extractor could be useful when the application claims for reversible features and when the user needs and easy measure of the quality for a given level of compression, scalable from low to very high quality.