Recovery of norbixin from a raw extraction solution of annatto pigments using colloidal gas aphrons (CGAs)

Annatto dyes are widely used in food and are finding increasing interest also for their application in the pharmaceutical and cosmetics industry. Bixin is the main pigment extracted from annatto seeds and accounts for 80% of the carotenoids in the outer coat of the seeds; norbixin being the water-soluble form of the bixin. Typically annatto dyes are extracted from the seeds by mechanical means or solutions of alkali, edible oil or organic solvents, or a combination of the two depending on the desired final product. In this work CGAs are investigated as an alternative separation method for the recovery of norbixin from a raw extraction solution of annatto pigments in KOH. A volume of CGAs generated from a cationic surfactant (CTAB) solution is mixed with a volume of annatto solution and when the mixture is allowed to settle it separates into the top aphron phase and the bottom liquid phase. Potassium norbixinate presented in the annatto solution will interact with the surfactant in the aphron phase, which results in the effective separation of norbixin. Recovery= 94% was achieved at a CTAB to norbixin molar ratio of 3.3. In addition a mechanism of separation is proposed here based on the separation results with the cationic surfactant and an anionic surfactant (bis-2-ethyl hexyl sulfosuccinate, AOT) and measurements of surfactant to norbixin ratio in the aphron phase; electrostatic interactions between the surfactant and norbixin molecules result in the fort-nation of a coloured complex and effective separation of norbixin. (c) 2005 Elsevier B.V. All rights reserved.

Distinguishing novelty and familiarity effects in infant preference procedures

This paper considers possible problems researchers might face when interpreting the results of studies that employ variants of the preference procedure. Infants show a tendency to shift their preference from familiar to novel stimuli with increasing exposure to the familiar stimulus, a behaviour that is exploited by the habituation paradigm. This change in attentional preference with exposure leads us to suggest that researchers interested in infants' pre-experimental or spontaneous preferences should beware of the potentially confounding effects of exposing infants to familiarization trials prior to employing the preference procedure. The notion that infant attentional preference is dynamic also calls into question the use of the direction of post-familiarization preference per se when interpreting the knowledge or strategies available to infants. We look into the results of a cross-modal word learning study to show how the interpretation of results may be difficult when infants exhibit a significant preference in an unexpected direction. As a possible solution to this problem we propose that significant preferences in both directions should be sought at multiple intervals over time. Copyright (C) 2004 John Wiley Sons, Ltd.

Facial feature extraction and selection by Gabor wavelets and boosting

In this paper, we present a feature selection approach based on Gabor wavelet feature and boosting for face verification. By convolution with a group of Gabor wavelets, the original images are transformed into vectors of Gabor wavelet features. Then for individual person, a small set of significant features are selected by the boosting algorithm from a large set of Gabor wavelet features. The experiment results have shown that the approach successfully selects meaningful and explainable features for face verification. The experiments also suggest that for the common characteristics such as eyes, noses, mouths may not be as important as some unique characteristic when training set is small. When training set is large, the unique characteristics and the common characteristics are both important.

Semi-automatic knowledge extraction, representation and context-sensitive intelligent retrieval of video content using collateral context modelling with scalable ontological networks

Automatic indexing and retrieval of digital data poses major challenges. The main problem arises from the ever increasing mass of digital media and the lack of efficient methods for indexing and retrieval of such data based on the semantic content rather than keywords. To enable intelligent web interactions, or even web filtering, we need to be capable of interpreting the information base in an intelligent manner. For a number of years research has been ongoing in the field of ontological engineering with the aim of using ontologies to add such (meta) knowledge to information. In this paper, we describe the architecture of a system (Dynamic REtrieval Analysis and semantic metadata Management (DREAM)) designed to automatically and intelligently index huge repositories of special effects video clips, based on their semantic content, using a network of scalable ontologies to enable intelligent retrieval. The DREAM Demonstrator has been evaluated as deployed in the film post-production phase to support the process of storage, indexing and retrieval of large data sets of special effects video clips as an exemplar application domain. This paper provides its performance and usability results and highlights the scope for future enhancements of the DREAM architecture which has proven successful in its first and possibly most challenging proving ground, namely film production, where it is already in routine use within our test bed Partners' creative processes. (C) 2009 Published by Elsevier B.V.

A neurofuzzy network knowledge extraction and extended gram-Schmidt algorithm for model subspace decomposition

This paper introduces a new neurofuzzy model construction and parameter estimation algorithm from observed finite data sets, based on a Takagi and Sugeno (T-S) inference mechanism and a new extended Gram-Schmidt orthogonal decomposition algorithm, for the modeling of a priori unknown dynamical systems in the form of a set of fuzzy rules. The first contribution of the paper is the introduction of a one to one mapping between a fuzzy rule-base and a model matrix feature subspace using the T-S inference mechanism. This link enables the numerical properties associated with a rule-based matrix subspace, the relationships amongst these matrix subspaces, and the correlation between the output vector and a rule-base matrix subspace, to be investigated and extracted as rule-based knowledge to enhance model transparency. The matrix subspace spanned by a fuzzy rule is initially derived as the input regression matrix multiplied by a weighting matrix that consists of the corresponding fuzzy membership functions over the training data set. Model transparency is explored by the derivation of an equivalence between an A-optimality experimental design criterion of the weighting matrix and the average model output sensitivity to the fuzzy rule, so that rule-bases can be effectively measured by their identifiability via the A-optimality experimental design criterion. The A-optimality experimental design criterion of the weighting matrices of fuzzy rules is used to construct an initial model rule-base. An extended Gram-Schmidt algorithm is then developed to estimate the parameter vector for each rule. This new algorithm decomposes the model rule-bases via an orthogonal subspace decomposition approach, so as to enhance model transparency with the capability of interpreting the derived rule-base energy level. This new approach is computationally simpler than the conventional Gram-Schmidt algorithm for resolving high dimensional regression problems, whereby it is computationally desirable to decompose complex models into a few submodels rather than a single model with large number of input variables and the associated curse of dimensionality problem. Numerical examples are included to demonstrate the effectiveness of the proposed new algorithm.

Robust neurofuzzy rule base knowledge extraction and estimation using subspace decomposition combined with regularization and D-optimality

A new robust neurofuzzy model construction algorithm has been introduced for the modeling of a priori unknown dynamical systems from observed finite data sets in the form of a set of fuzzy rules. Based on a Takagi-Sugeno (T-S) inference mechanism a one to one mapping between a fuzzy rule base and a model matrix feature subspace is established. This link enables rule based knowledge to be extracted from matrix subspace to enhance model transparency. In order to achieve maximized model robustness and sparsity, a new robust extended Gram-Schmidt (G-S) method has been introduced via two effective and complementary approaches of regularization and D-optimality experimental design. Model rule bases are decomposed into orthogonal subspaces, so as to enhance model transparency with the capability of interpreting the derived rule base energy level. A locally regularized orthogonal least squares algorithm, combined with a D-optimality used for subspace based rule selection, has been extended for fuzzy rule regularization and subspace based information extraction. By using a weighting for the D-optimality cost function, the entire model construction procedure becomes automatic. Numerical examples are included to demonstrate the effectiveness of the proposed new algorithm.