A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.

Global localization with non-quantized local image features

In the field of appearance-based robot localization, the mainstream approach uses a quantized representation of local image features. An alternative strategy is the exploitation of raw feature descriptors, thus avoiding approximations due to quantization. In this work, the quantized and non-quantized representations are compared with respect to their discriminativity, in the context of the robot global localization problem. Having demonstrated the advantages of the non-quantized representation, the paper proposes mechanisms to reduce the computational burden this approach would carry, when applied in its simplest form. This reduction is achieved through a hierarchical strategy which gradually discards candidate locations and by exploring two simplifying assumptions about the training data. The potential of the non-quantized representation is exploited by resorting to the entropy-discriminativity relation. The idea behind this approach is that the non-quantized representation facilitates the assessment of the distinctiveness of features, through the entropy measure. Building on this finding, the robustness of the localization system is enhanced by modulating the importance of features according to the entropy measure. Experimental results support the effectiveness of this approach, as well as the validity of the proposed computation reduction methods.

An unsupervised approach to feature discretization and selection

Many learning problems require handling high dimensional datasets with a relatively small number of instances. Learning algorithms are thus confronted with the curse of dimensionality, and need to address it in order to be effective. Examples of these types of data include the bag-of-words representation in text classification problems and gene expression data for tumor detection/classification. Usually, among the high number of features characterizing the instances, many may be irrelevant (or even detrimental) for the learning tasks. It is thus clear that there is a need for adequate techniques for feature representation, reduction, and selection, to improve both the classification accuracy and the memory requirements. In this paper, we propose combined unsupervised feature discretization and feature selection techniques, suitable for medium and high-dimensional datasets. The experimental results on several standard datasets, with both sparse and dense features, show the efficiency of the proposed techniques as well as improvements over previous related techniques.

Visualization of clusters in geo-referenced data using three-dimensional self-organizing maps

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Estatística e Gestão de Informação

Feature Discretization with Relevance and Mutual Information Criteria

Feature discretization (FD) techniques often yield adequate and compact representations of the data, suitable for machine learning and pattern recognition problems. These representations usually decrease the training time, yielding higher classification accuracy while allowing for humans to better understand and visualize the data, as compared to the use of the original features. This paper proposes two new FD techniques. The first one is based on the well-known Linde-Buzo-Gray quantization algorithm, coupled with a relevance criterion, being able perform unsupervised, supervised, or semi-supervised discretization. The second technique works in supervised mode, being based on the maximization of the mutual information between each discrete feature and the class label. Our experimental results on standard benchmark datasets show that these techniques scale up to high-dimensional data, attaining in many cases better accuracy than existing unsupervised and supervised FD approaches, while using fewer discretization intervals.

An integrated system for human action recognition from video using hidden Markov model

In this paper, we present an integrated system for real-time automatic detection of human actions from video. The proposed approach uses the boundary of humans as the main feature for recognizing actions. Background subtraction is performed using Gaussian mixture model. Then, features are extracted from silhouettes and Vector Quantization is used to map features into symbols (bag of words approach). Finally, actions are detected using the Hidden Markov Model. The proposed system was validated using a newly collected real- world dataset. The obtained results show that the system is capable of achieving robust human detection, in both indoor and outdoor environments. Moreover, promising classification results were achieved when detecting two basic human actions: walking and sitting.

An information theoretic framework for image segmentation

In this paper, an information theoretic framework for image segmentation is presented. This approach is based on the information channel that goes from the image intensity histogram to the regions of the partitioned image. It allows us to define a new family of segmentation methods which maximize the mutual information of the channel. Firstly, a greedy top-down algorithm which partitions an image into homogeneous regions is introduced. Secondly, a histogram quantization algorithm which clusters color bins in a greedy bottom-up way is defined. Finally, the resulting regions in the partitioning algorithm can optionally be merged using the quantized histogram

A zero-delay sequential scheme for lossy coding of individual sequences

We consider adaptive sequential lossy coding of bounded individual sequences when the performance is measured by the sequentially accumulated mean squared distortion. Theencoder and the decoder are connected via a noiseless channel of capacity $R$ and both are assumed to have zero delay. No probabilistic assumptions are made on how the sequence to be encoded is generated. For any bounded sequence of length $n$, the distortion redundancy is defined as the normalized cumulative distortion of the sequential scheme minus the normalized cumulative distortion of the best scalarquantizer of rate $R$ which is matched to this particular sequence. We demonstrate the existence of a zero-delay sequential scheme which uses common randomization in the encoder and the decoder such that the normalized maximum distortion redundancy converges to zero at a rate $n^{-1/5}\log n$ as the length of the encoded sequence $n$ increases without bound.

Mult-class differentiation of cannabis seedlings in a forensic context

This article presents an experimental study about the classification ability of several classifiers for multi-classclassification of cannabis seedlings. As the cultivation of drug type cannabis is forbidden in Switzerland lawenforcement authorities regularly ask forensic laboratories to determinate the chemotype of a seized cannabisplant and then to conclude if the plantation is legal or not. This classification is mainly performed when theplant is mature as required by the EU official protocol and then the classification of cannabis seedlings is a timeconsuming and costly procedure. A previous study made by the authors has investigated this problematic [1]and showed that it is possible to differentiate between drug type (illegal) and fibre type (legal) cannabis at anearly stage of growth using gas chromatography interfaced with mass spectrometry (GC-MS) based on therelative proportions of eight major leaf compounds. The aims of the present work are on one hand to continueformer work and to optimize the methodology for the discrimination of drug- and fibre type cannabisdeveloped in the previous study and on the other hand to investigate the possibility to predict illegal cannabisvarieties. Seven classifiers for differentiating between cannabis seedlings are evaluated in this paper, namelyLinear Discriminant Analysis (LDA), Partial Least Squares Discriminant Analysis (PLS-DA), Nearest NeighbourClassification (NNC), Learning Vector Quantization (LVQ), Radial Basis Function Support Vector Machines(RBF SVMs), Random Forest (RF) and Artificial Neural Networks (ANN). The performance of each method wasassessed using the same analytical dataset that consists of 861 samples split into drug- and fibre type cannabiswith drug type cannabis being made up of 12 varieties (i.e. 12 classes). The results show that linear classifiersare not able to manage the distribution of classes in which some overlap areas exist for both classificationproblems. Unlike linear classifiers, NNC and RBF SVMs best differentiate cannabis samples both for 2-class and12-class classifications with average classification results up to 99% and 98%, respectively. Furthermore, RBFSVMs correctly classified into drug type cannabis the independent validation set, which consists of cannabisplants coming from police seizures. In forensic case work this study shows that the discrimination betweencannabis samples at an early stage of growth is possible with fairly high classification performance fordiscriminating between cannabis chemotypes or between drug type cannabis varieties.

Batalin-Vilkovisky analysis of covariant and noncovariant actions

The equivalence between the covariant and the noncovariant versions of a constrained system is shown to hold after quantization in the framework of the field-antifield formalism. Our study covers the cases of electromagnetism and Yang-Mills fields and sheds light on some aspects of the Faddeev-Popov method, for both the covariant and noncovariant approaches, which have not been fully clarified in the literature.

Pseudoclassical description for a nonrelativistic spinning particle. I. The Levy-Leblond equation

A pseudoclassical model for a spinning nonrelativistic particle is presented. The model contains two first-class constraints which after quantization give rise to the Levy-Leblond equation for a spin-1/2 particle.

Perturbation theory and locality in the Field-Antifield formalism

The BatalinVilkovisky formalism is studied in the framework of perturbation theory by analyzing the antibracket BecchiRouetStoraTyutin (BRST) cohomology of the proper solution S0. It is concluded that the recursive equations for the complete proper solution S can be solved at any order of perturbation theory. If certain conditions on the classical action and on the gauge generators are imposed the solution can be taken local.

Batalin-Vilkovisky analysis of covariant and noncovariant actions

The equivalence between the covariant and the noncovariant versions of a constrained system is shown to hold after quantization in the framework of the field-antifield formalism. Our study covers the cases of electromagnetism and Yang-Mills fields and sheds light on some aspects of the Faddeev-Popov method, for both the covariant and noncovariant approaches, which have not been fully clarified in the literature.

Quantum fluctuations on domain walls, strings, and vacuum bubbles

We develop a covariant quantum theory of fluctuations on vacuum domain walls and strings. The fluctuations are described by a scalar field defined on the classical world sheet of the defects. We consider the following cases: straight strings and planar walls in flat space, true vacuum bubbles nucleating in false vacuum, and strings and walls nucleating during inflation. The quantum state for the perturbations is constructed so that it respects the original symmetries of the classical solution. In particular, for the case of vacuum bubbles and nucleating strings and walls, the geometry of the world sheet is that of a lower-dimensional de Sitter space, and the problem reduces to the quantization of a scalar field of tachyonic mass in de Sitter space. In all cases, the root-mean-squared fluctuation is evaluated in detail, and the physical implications are briefly discussed.

Nucleation rates in flat and curved space

Nucleation rates for tunneling processes in Minkowski and de Sitter space are investigated, taking into account one loop prefactors. In particular, we consider the creation of membranes by an antisymmetric tensor field, analogous to Schwinger pair production. This can be viewed as a model for the decay of a false (or true) vacuum at zero temperature in the thin wall limit. Also considered is the spontaneous nucleation of strings, domain walls, and monopoles during inflation. The instantons for these processes are spherical world sheets or world lines embedded in flat or de Sitter backgrounds. We find the contribution of such instantons to the semiclassical partition function, including the one loop corrections due to small fluctuations around the spherical world sheet. We suggest a prescription for obtaining, from the partition function, the distribution of objects nucleated during inflation. This can be seen as an extension of the usual formula, valid in flat space, according to which the nucleation rate is twice the imaginary part of the free energy. For the case of pair production, the results reproduce those that can be obtained using second quantization methods, confirming the validity of instanton techniques in de Sitter space. Throughout the paper, both the gravitational field and the antisymmetric tensor field are assumed external.