Topological triangle characterization with application to object detection from images

A novel mathematical framework inspired on Morse Theory for topological triangle characterization in 2D meshes is introduced that is useful for applications involving the creation of mesh models of objects whose geometry is not known a priori. The framework guarantees a precise control of topological changes introduced as a result of triangle insertion/removal operations and enables the definition of intuitive high-level operators for managing the mesh while keeping its topological integrity. An application is described in the implementation of an innovative approach for the detection of 2D objects from images that integrates the topological control enabled by geometric modeling with traditional image processing techniques. (C) 2008 Published by Elsevier B.V.

A Parallel Hardware Architecture for Scale and Rotation Invariant Feature Detection

This paper proposes a parallel hardware architecture for image feature detection based on the Scale Invariant Feature Transform algorithm and applied to the Simultaneous Localization And Mapping problem. The work also proposes specific hardware optimizations considered fundamental to embed such a robotic control system on-a-chip. The proposed architecture is completely stand-alone; it reads the input data directly from a CMOS image sensor and provides the results via a field-programmable gate array coupled to an embedded processor. The results may either be used directly in an on-chip application or accessed through an Ethernet connection. The system is able to detect features up to 30 frames per second (320 x 240 pixels) and has accuracy similar to a PC-based implementation. The achieved system performance is at least one order of magnitude better than a PC-based solution, a result achieved by investigating the impact of several hardware-orientated optimizations oil performance, area and accuracy.

Chaotic phase synchronization and desynchronization in an oscillator network for object selection

Object selection refers to the mechanism of extracting objects of interest while ignoring other objects and background in a given visual scene. It is a fundamental issue for many computer vision and image analysis techniques and it is still a challenging task to artificial Visual systems. Chaotic phase synchronization takes place in cases involving almost identical dynamical systems and it means that the phase difference between the systems is kept bounded over the time, while their amplitudes remain chaotic and may be uncorrelated. Instead of complete synchronization, phase synchronization is believed to be a mechanism for neural integration in brain. In this paper, an object selection model is proposed. Oscillators in the network representing the salient object in a given scene are phase synchronized, while no phase synchronization occurs for background objects. In this way, the salient object can be extracted. In this model, a shift mechanism is also introduced to change attention from one object to another. Computer simulations show that the model produces some results similar to those observed in natural vision systems.

QCD sum rule calculation for the charmonium-like structures in the J/psi phi and J/psi omega invariant mass spectra

Using the QCD sum rules we test if the charmonium-like structure Y(4274), observed in the J/psi phi invariant mass spectrum, can be described with a D(s)(D) over bar (s0)(2317)+ h.c. molecular current with J(PC) = 0(-+). We consider the contributions of condensates up to dimension ten and we work at leading order in alpha(s). We keep terms which are linear in the strange quark mass m(s). The mass obtained for such state is mD(s)D(s0) = (4.78 +/- 0.54) GeV. We also consider a molecular 0(-+) D (D) over bar (0)(2400)+ h.c. current and we obtain m(DD0) = (4.55 +/- 0.49) GeV. Our study shows that the newly observed Y(4274) in the J/psi phi invariant mass spectrum can be, considering the uncertainties, described using a molecular charmonium current. (C) 2011 Elsevier B.V. All rights reserved.

A new scale-invariant ratio and finite-size scaling for the stochastic susceptible-infected-recovered model

The critical behavior of the stochastic susceptible-infected-recovered model on a square lattice is obtained by numerical simulations and finite-size scaling. The order parameter as well as the distribution in the number of recovered individuals is determined as a function of the infection rate for several values of the system size. The analysis around criticality is obtained by exploring the close relationship between the present model and standard percolation theory. The quantity UP, equal to the ratio U between the second moment and the squared first moment of the size distribution multiplied by the order parameter P, is shown to have, for a square system, a universal value 1.0167(1) that is the same for site and bond percolation, confirming further that the SIR model is also in the percolation class.

Field on Poincare Group and Quantum Description of Orientable Objects

We propose an approach to the quantum-mechanical description of relativistic orientable objects. It generalizes Wigner`s ideas concerning the treatment of nonrelativistic orientable objects (in particular, a nonrelativistic rotator) with the help of two reference frames (space-fixed and body-fixed). A technical realization of this generalization (for instance, in 3+1 dimensions) amounts to introducing wave functions that depend on elements of the Poincar, group G. A complete set of transformations that test the symmetries of an orientable object and of the embedding space belongs to the group I =GxG. All such transformations can be studied by considering a generalized regular representation of G in the space of scalar functions on the group, f(x,z), that depend on the Minkowski space points xaG/Spin(3,1) as well as on the orientation variables given by the elements z of a matrix ZaSpin(3,1). In particular, the field f(x,z) is a generating function of the usual spin-tensor multi-component fields. In the theory under consideration, there are four different types of spinors, and an orientable object is characterized by ten quantum numbers. We study the corresponding relativistic wave equations and their symmetry properties.

Shape classification using complex network and Multi-scale Fractal Dimension

Shape provides one of the most relevant information about an object. This makes shape one of the most important visual attributes used to characterize objects. This paper introduces a novel approach for shape characterization, which combines modeling shape into a complex network and the analysis of its complexity in a dynamic evolution context. Descriptors computed through this approach show to be efficient in shape characterization, incorporating many characteristics, such as scale and rotation invariant. Experiments using two different shape databases (an artificial shapes database and a leaf shape database) are presented in order to evaluate the method. and its results are compared to traditional shape analysis methods found in literature. (C) 2009 Published by Elsevier B.V.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

A conformal invariant growth model

We present a one-parameter extension of the raise and peel one-dimensional growth model. The model is defined in the configuration space of Dyck (RSOS) paths. Tiles from a rarefied gas hit the interface and change its shape. The adsorption rates are local but the desorption rates are non-local; they depend not only on the cluster hit by the tile but also on the total number of peaks (local maxima) belonging to all the clusters of the configuration. The domain of the parameter is determined by the condition that the rates are non-negative. In the finite-size scaling limit, the model is conformal invariant in the whole open domain. The parameter appears in the sound velocity only. At the boundary of the domain, the stationary state is an adsorbing state and conformal invariance is lost. The model allows us to check the universality of non-local observables in the raise and peel model. An example is given.

Cross-situational learning of object-word mapping using Neural Modeling Fields

The issue of how children learn the meaning of words is fundamental to developmental psychology. The recent attempts to develop or evolve efficient communication protocols among interacting robots or Virtual agents have brought that issue to a central place in more applied research fields, such as computational linguistics and neural networks, as well. An attractive approach to learning an object-word mapping is the so-called cross-situational learning. This learning scenario is based on the intuitive notion that a learner can determine the meaning of a word by finding something in common across all observed uses of that word. Here we show how the deterministic Neural Modeling Fields (NMF) categorization mechanism can be used by the learner as an efficient algorithm to infer the correct object-word mapping. To achieve that we first reduce the original on-line learning problem to a batch learning problem where the inputs to the NMF mechanism are all possible object-word associations that Could be inferred from the cross-situational learning scenario. Since many of those associations are incorrect, they are considered as clutter or noise and discarded automatically by a clutter detector model included in our NMF implementation. With these two key ingredients - batch learning and clutter detection - the NMF mechanism was capable to infer perfectly the correct object-word mapping. (C) 2009 Elsevier Ltd. All rights reserved.

The Hilbert space of the Chern-Simons theory on a cylinder: a loop quantum gravity approach

As a laboratory for loop quantum gravity, we consider the canonical quantization of the three-dimensional Chern-Simons theory on a noncompact space with the topology of a cylinder. Working within the loop quantization formalism, we define at the quantum level the constraints appearing in the canonical approach and completely solve them, thus constructing a gauge and diffeomorphism invariant physical Hilbert space for the theory. This space turns out to be infinite dimensional, but separable.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.

Representation type of Jordan algebras

The problem of classification of Jordan bit-nodules over (non-semisimple) finite dimensional Jordan algebras with respect to their representation type is considered. The notions of diagram of a Jordan algebra and of Jordan tensor algebra of a bimodule are introduced and a mapping Qui is constructed which associates to the diagram of a Jordan algebra J the quiver of its universal associative enveloping algebra S(J). The main results are concerned with Jordan algebras of semi-matrix type, that is, algebras whose semi-simple component is a direct sum of Jordan matrix algebras. In this case, criterion of finiteness and tameness for one-sided representations are obtained, in terms of diagram and mapping Qui, for Jordan tensor algebras and for algebras with radical square equals to 0. (c) 2010 Elsevier Inc. All rights reserved.