A complex network-based approach for boundary shape analysis

This paper introduces a novel methodology to shape boundary characterization, where a shape is modeled into a small-world complex network. It uses degree and joint degree measurements in a dynamic evolution network to compose a set of shape descriptors. The proposed shape characterization method has all efficient power of shape characterization, it is robust, noise tolerant, scale invariant and rotation invariant. A leaf plant classification experiment is presented on three image databases in order to evaluate the method and compare it with other descriptors in the literature (Fourier descriptors, Curvature, Zernike moments and multiscale fractal dimension). (C) 2008 Elsevier Ltd. All rights reserved.

An entropy-based approach to automatic image segmentation of satellite images

An entropy-based image segmentation approach is introduced and applied to color images obtained from Google Earth. Segmentation refers to the process of partitioning a digital image in order to locate different objects and regions of interest. The application to satellite images paves the way to automated monitoring of ecological catastrophes, urban growth, agricultural activity, maritime pollution, climate changing and general surveillance. Regions representing aquatic, rural and urban areas are identified and the accuracy of the proposed segmentation methodology is evaluated. The comparison with gray level images revealed that the color information is fundamental to obtain an accurate segmentation. (C) 2010 Elsevier B.V. All rights reserved.

Mice and larvae tracking using a particle filter with an auto-adjustable observation model

This paper proposes a novel way to combine different observation models in a particle filter framework. This, so called, auto-adjustable observation model, enhance the particle filter accuracy when the tracked objects overlap without infringing a great runtime penalty to the whole tracking system. The approach has been tested under two important real world situations related to animal behavior: mice and larvae tracking. The proposal was compared to some state-of-art approaches and the results show, under the datasets tested, that a good trade-off between accuracy and runtime can be achieved using an auto-adjustable observation model. (C) 2009 Elsevier B.V. All rights reserved.

Wavelet-based dynamic time warping

Dynamic Time Warping (DTW), a pattern matching technique traditionally used for restricted vocabulary speech recognition, is based on a temporal alignment of the input signal with the template models. The principal drawback of DTW is its high computational cost as the lengths of the signals increase. This paper shows extended results over our previously published conference paper, which introduces an optimized version of the DTW I hat is based on the Discrete Wavelet Transform (DWT). (C) 2008 Elsevier B.V. All rights reserved.

Structural matching of 2D electrophoresis gels using deformed graphs

2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential analysis between pairs of images to study changes in protein content. It is thus necessary to register two images by finding spot correspondences. Although it may seem a simple task, generally, the manual processing of this kind of images is very cumbersome, especially when strong variations between corresponding sets of spots are expected (e.g. strong non-linear deformations and outliers). In order to solve this problem, this paper proposes a new quadratic assignment formulation together with a correspondence estimation algorithm based on graph matching which takes into account the structural information between the detected spots. Each image is represented by a graph and the task is to find a maximum common subgraph. Successful experimental results using real data are presented, including an extensive comparative performance evaluation with ground-truth data. (C) 2010 Elsevier B.V. All rights reserved.

Multiple camera people detection and tracking using support integration

This paper proposes a method to locate and track people by combining evidence from multiple cameras using the homography constraint. The proposed method use foreground pixels from simple background subtraction to compute evidence of the location of people on a reference ground plane. The algorithm computes the amount of support that basically corresponds to the ""foreground mass"" above each pixel. Therefore, pixels that correspond to ground points have more support. The support is normalized to compensate for perspective effects and accumulated on the reference plane for all camera views. The detection of people on the reference plane becomes a search for regions of local maxima in the accumulator. Many false positives are filtered by checking the visibility consistency of the detected candidates against all camera views. The remaining candidates are tracked using Kalman filters and appearance models. Experimental results using challenging data from PETS`06 show good performance of the method in the presence of severe occlusion. Ground truth data also confirms the robustness of the method. (C) 2010 Elsevier B.V. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

An Information Theory framework for two-stage binary image operator design

The design of translation invariant and locally defined binary image operators over large windows is made difficult by decreased statistical precision and increased training time. We present a complete framework for the application of stacked design, a recently proposed technique to create two-stage operators that circumvents that difficulty. We propose a novel algorithm, based on Information Theory, to find groups of pixels that should be used together to predict the Output Value. We employ this algorithm to automate the process of creating a set of first-level operators that are later combined in a global operator. We also propose a principled way to guide this combination, by using feature selection and model comparison. Experimental results Show that the proposed framework leads to better results than single stage design. (C) 2009 Elsevier B.V. All rights reserved.

Characterization of a beta-1,3-glucanase active in the alkaline midgut of Spodoptera frugiperda larvae and its relation to beta-glucan-binding proteins

Spodoptera frugiperda beta-1,3-glucanase (SLam) was purified from larval midgut. It has a molecular mass of 37.5 kDa, an alkaline optimum pH of 9.0, is active against beta-1,3-glucan (laminarin), but cannot hydrolyze yeast beta-1,3-1,6-glucan or other polysaccharides. The enzyme is an endoglucanase with low processivity (0.4), and is not inhibited by high concentrations of substrate. In contrast to other digestive beta-1,3-glucanases from insects, SLam is unable to lyse Saccharomyces cerevisae cells. The cDNA encoding SLam was cloned and sequenced, showing that the protein belongs to glycosyl hydrolase family 16 as other insect glucanases and glucan-binding proteins. Multiple sequence alignment of beta-1,3-glucanases and beta-glucan-binding protein supports the assumption that the beta-1,3-glucanase gene duplicated in the ancestor of mollusks and arthropods. One copy originated the derived beta-1,3-glucanases by the loss of an extended N-terminal region and the beta-glucan-binding proteins by the loss of the catalytic residues. SLam homology modeling suggests that E228 may affect the ionization of the catalytic residues, thus displacing the enzyme pH optimum. SLam antiserum reacts with a single protein in the insect midgut. Immunocytolocalization shows that the enzyme is present in secretory vesicles and glycocalyx from columnar cells. (C) 2010 Elsevier Ltd. All rights reserved.

Computer-aided Structure Elucidation of Neolignans

This paper describes a new module of the expert system SISTEMAT used for the prediction of the skeletons of neolignans by (13)C NMR, (1)H NMR and botanical data obtained from the literature. SISTEMAT is composed of MACRONO, SISCONST, C13MACH, H1MACH and SISOCBOT programs, each analyzing data of the neolignan in question to predict the carbon skeleton of the compound. From these results, the global probability is computed and the most probable skeleton predicted. SISTEMAT predicted the skeletons of 75% of the 20 neolignans tested, in a rapid and simple procedure demonstrating its advantage for the structural elucidation of new compounds.

Use of copper and gold electrodes as sensitive elements for fabrication of an electronic tongue: Discrimination of wines and whiskies

A low-cost method is proposed to classify wine and whisky samples using a disposable voltammetric electronic tongue that was fabricated using gold and copper substrates and a pattern recognition technique (Principal Component Analysis). The proposed device was successfully used to discriminate between expensive and cheap whisky samples and to detect adulteration processes using only a copper electrode. For wines, the electronic tongue was composed of copper and gold working electrodes and was able to classify three different brands of wine and to make distinctions regarding the wine type, i.e., dry red, soft red, dry white and soft white brands. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

Quantitative ester analysis in cachaca and distilled spirits by gas chromatography-mass spectrometry (GC-MS)

An analytical procedure for the separation and quantification of ethyl acetate, ethyl butyrate, ethyl hexanoate, ethyl lactate, ethyl octanoate, ethyl nonanoate, ethyl decanoate, isoamyl octanoate, and ethyl laurate in cachaca, rum, and whisky by direct injection gas chromatography-mass spectrometry was developed. The analytical method is simple, selective, and appropriated for the determination of esters in distilled spirits. The limit of detection ranged from 29 (ethyl hexanoate) to 530 (ethyl acetate) mu g L-1, whereas the standard deviation for repeatability was between 0.774% (ethyl hexanoate) and 5.05% (isoamyl octanoate). Relative standard deviation values for accuracy vary from 90.3 to 98.5% for ethyl butyrate and ethyl acetate, respectively. Ethyl acetate was shown to be the major ester in cachaca (median content of 22.6 mg 100 mL(-1) anhydrous alcohol), followed by ethyl lactate (median content of 8.32 mg 100 mL(-1) anhydrous alcohol). Cachaca produced in copper and hybrid alembic present a higher content of ethyl acetate and ethyl lactate than those produced in a stainless-steel column, whereas cachaca produced by distillation in a stainless-steel column present a higher content of ethyl octanoate, ethyl decanoate, and ethyl laurate. As expected, ethyl acetate is the major ester in whiskey and rum, followed by ethyl lactate for samples of rum. Nevertheless, whiskey samples exhibit ethyl lactate at contents lower or at the same order of magnitude of the fatty esters.

Signal Processing and patternrecognition algorithm for monitoringParkinson’s disease.

This masters thesis describes the development of signal processing and patternrecognition in monitoring Parkison’s disease. It involves the development of a signalprocess algorithm and passing it into a pattern recogniton algorithm also. Thesealgorithms are used to determine , predict and make a conclusion on the study ofparkison’s disease. We get to understand the nature of how the parkinson’s disease isin humans.

Nonstationary feature extraction techniques for automatic classification of impact acoustic signals

Condition monitoring of wooden railway sleepers applications are generallycarried out by visual inspection and if necessary some impact acoustic examination iscarried out intuitively by skilled personnel. In this work, a pattern recognition solutionhas been proposed to automate the process for the achievement of robust results. Thestudy presents a comparison of several pattern recognition techniques together withvarious nonstationary feature extraction techniques for classification of impactacoustic emissions. Pattern classifiers such as multilayer perceptron, learning cectorquantization and gaussian mixture models, are combined with nonstationary featureextraction techniques such as Short Time Fourier Transform, Continuous WaveletTransform, Discrete Wavelet Transform and Wigner-Ville Distribution. Due to thepresence of several different feature extraction and classification technqies, datafusion has been investigated. Data fusion in the current case has mainly beeninvestigated on two levels, feature level and classifier level respectively. Fusion at thefeature level demonstrated best results with an overall accuracy of 82% whencompared to the human operator.