A constrained recursive least squares algorithm for adaptive combination of multiple models

In this paper, we develop a novel constrained recursive least squares algorithm for adaptively combining a set of given multiple models. With data available in an online fashion, the linear combination coefficients of submodels are adapted via the proposed algorithm.We propose to minimize the mean square error with a forgetting factor, and apply the sum to one constraint to the combination parameters. Moreover an l1-norm constraint to the combination parameters is also applied with the aim to achieve sparsity of multiple models so that only a subset of models may be selected into the final model. Then a weighted l2-norm is applied as an approximation to the l1-norm term. As such at each time step, a closed solution of the model combination parameters is available. The contribution of this paper is to derive the proposed constrained recursive least squares algorithm that is computational efficient by exploiting matrix theory. The effectiveness of the approach has been demonstrated using both simulated and real time series examples.

Estimação paramétrica e não-paramétrica em modelos de markov ocultos

In this work we study the Hidden Markov Models with finite as well as general state space. In the finite case, the forward and backward algorithms are considered and the probability of a given observed sequence is computed. Next, we use the EM algorithm to estimate the model parameters. In the general case, the kernel estimators are used and to built a sequence of estimators that converge in L1-norm to the density function of the observable process

Eigenvalue estimates for non-selfadjoint Dirac operators on the real line

We show that the non-embedded eigenvalues of the Dirac operator on the real line with complex mass and non-Hermitian potential V lie in the disjoint union of two disks, provided that the L1-norm of V is bounded from above by the speed of light times the reduced Planck constant. The result is sharp; moreover, the analogous sharp result for the Schrödinger operator, originally proved by Abramov, Aslanyan and Davies, emerges in the nonrelativistic limit. For massless Dirac operators, the condition on V implies the absence of non-real eigenvalues. Our results are further generalized to potentials with slower decay at infinity. As an application, we determine bounds on resonances and embedded eigenvalues of Dirac operators with Hermitian dilation-analytic potentials.

Regularizing Image Reconstruction for Gradient-Domain Rendering with Feature Patches

We present a novel algorithm to reconstruct high-quality images from sampled pixels and gradients in gradient-domain rendering. Our approach extends screened Poisson reconstruction by adding additional regularization constraints. Our key idea is to exploit local patches in feature images, which contain per-pixels normals, textures, position, etc., to formulate these constraints. We describe a GPU implementation of our approach that runs on the order of seconds on megapixel images. We demonstrate a significant improvement in image quality over screened Poisson reconstruction under the L1 norm. Because we adapt the regularization constraints to the noise level in the input, our algorithm is consistent and converges to the ground truth.

Robust Image Registration with Global Intensity Transformation

This paper presents a registration method for images with global illumination variations. The method is based on a joint iterative optimization (geometric and photometric) of the L1 norm of the intensity error. Two strategies are compared to directly find the appropriate intensity transformation within each iteration: histogram specification and the solution obtained by analyzing the necessary optimality conditions. Such strategies reduce the search space of the joint optimization to that of the geometric transformation between the images.

Outlier-resisting graph embedding

Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages. © 2009 Elsevier B.V. All rights reserved.

Deformable face ensemble alignment with robust grouped-L1 anchors

Many methods exist at the moment for deformable face fitting. A drawback to nearly all these approaches is that they are (i) noisy in terms of landmark positions, and (ii) the noise is biased across frames (i.e. the misalignment is toward common directions across all frames). In this paper we propose a grouped $\mathcal{L}1$-norm anchored method for simultaneously aligning an ensemble of deformable face images stemming from the same subject, given noisy heterogeneous landmark estimates. Impressive alignment performance improvement and refinement is obtained using very weak initialization as "anchors".

TV-L1 optical flow estimation

[EN] This article describes an implementation of the optical flow estimation method introduced by Zach, Pock and Bischof. This method is based on the minimization of a functional containing a data term using the L norm and a regularization term using the total variation of the flow. The main feature of this formulation is that it allows discontinuities in the flow field, while being more robust to noise than the classical approach. The algorithm is an efficient numerical scheme, which solves a relaxed version of the problem by alternate minimization.

On the Lp-Norm Regression Models for Estimating Value-at-Risk

Analysis of risk measures associated with price series data movements and its predictions are of strategic importance in the financial markets as well as to policy makers in particular for short- and longterm planning for setting up economic growth targets. For example, oilprice risk-management focuses primarily on when and how an organization can best prevent the costly exposure to price risk. Value-at-Risk (VaR) is the commonly practised instrument to measure risk and is evaluated by analysing the negative/positive tail of the probability distributions of the returns (profit or loss). In modelling applications, least-squares estimation (LSE)-based linear regression models are often employed for modeling and analyzing correlated data. These linear models are optimal and perform relatively well under conditions such as errors following normal or approximately normal distributions, being free of large size outliers and satisfying the Gauss-Markov assumptions. However, often in practical situations, the LSE-based linear regression models fail to provide optimal results, for instance, in non-Gaussian situations especially when the errors follow distributions with fat tails and error terms possess a finite variance. This is the situation in case of risk analysis which involves analyzing tail distributions. Thus, applications of the LSE-based regression models may be questioned for appropriateness and may have limited applicability. We have carried out the risk analysis of Iranian crude oil price data based on the Lp-norm regression models and have noted that the LSE-based models do not always perform the best. We discuss results from the L1, L2 and L∞-norm based linear regression models. ACM Computing Classification System (1998): B.1.2, F.1.3, F.2.3, G.3, J.2.

Quenching phenomenon of singular parabolic problems with L1 initial data

We extend some previous existence results for quenching type parabolic problems involving a negative power of the unknown in the equation to the case of merely integrable initial data. We show that L1 Ω is the suitable framework to obtain the continuous dependence with respect to some norm of the initial datum; This way we answer to the question raised by several authors in the previous literature. We also show the complete quenching phenomena for such a L1-initial datum.

Data-driven impostor selection for T-norm score normalisation and the background dataset in SVM-based speaker verification

A data-driven background dataset refinement technique was recently proposed for SVM based speaker verification. This method selects a refined SVM background dataset from a set of candidate impostor examples after individually ranking examples by their relevance. This paper extends this technique to the refinement of the T-norm dataset for SVM-based speaker verification. The independent refinement of the background and T-norm datasets provides a means of investigating the sensitivity of SVM-based speaker verification performance to the selection of each of these datasets. Using refined datasets provided improvements of 13% in min. DCF and 9% in EER over the full set of impostor examples on the 2006 SRE corpus with the majority of these gains due to refinement of the T-norm dataset. Similar trends were observed for the unseen data of the NIST 2008 SRE.

The effects of L1 orthography on processing an artificial logographic script

To date, studies have focused on the acquisition of alphabetic second languages (L2s) in alphabetic first language (L1) users, demonstrating significant transfer effects. The present study examined the process from a reverse perspective, comparing logographic (Mandarin-Chinese) and alphabetic (English) L1 users in the acquisition of an artificial logographic script, in order to determine whether similar language-specific advantageous transfer effects occurred. English monolinguals, English-French bilinguals and Chinese-English bilinguals learned a small set of symbols in an artificial logographic script and were subsequently tested on their ability to process this script in regard to three main perspectives: L2 reading, L2 working memory (WM), and inner processing strategies. In terms of L2 reading, a lexical decision task on the artificial symbols revealed markedly faster response times in the Chinese-English bilinguals, indicating a logographic transfer effect suggestive of a visual processing advantage. A syntactic decision task evaluated the degree to which the new language was mastered beyond the single word level. No L1-specific transfer effects were found for artificial language strings. In order to investigate visual processing of the artificial logographs further, a series of WM experiments were conducted. Artificial logographs were recalled under concurrent auditory and visuo-spatial suppression conditions to disrupt phonological and visual processing, respectively. No L1-specific transfer effects were found, indicating no visual processing advantage of the Chinese-English bilinguals. However, a bilingual processing advantage was found indicative of a superior ability to control executive functions. In terms of L1 WM, the Chinese-English bilinguals outperformed the alphabetic L1 users when processing L1 words, indicating a language experience-specific advantage. Questionnaire data on the cognitive strategies that were deployed during the acquisition and processing of the artificial logographic script revealed that the Chinese-English bilinguals rated their inner speech as lower than the alphabetic L1 users, suggesting that they were transferring their phonological processing skill set to the acquisition and use of an artificial script. Overall, evidence was found to indicate that language learners transfer specific L1 orthographic processing skills to L2 logographic processing. Additionally, evidence was also found indicating that a bilingual history enhances cognitive performance in L2.

Broad Bean Mottle Virus: Identification, Serology, Host Range, and Occurrence on Faba Bean (Vicia Faba) in West Asia and Norm Africa

One of the faba bean viruses found in West Asia and North Africa was identified as broad bean mottle virus (BBMV) by host reactions, particle morphology and size, serology, and granular, often vesiculated cytoplasmic inclusions. Detailed research on four isolates, one each from Morocco, Tunisia, Sudan and Syria, provided new information on the virus. The isolates, though indistinguishable in ELISA or gel-diffusion tests, differed slightly in host range and symptoms. Twenty-one species (12 legumes and 9 non-legumes) out of 27 tested were systemically infected, and 14 of these by all four isolates. Infection in several species was symptomless, but major legumes such as chickpea, lentil and especially pea, suffered severely from infection. All 23 genotypes of faba bean, 2 of chickpea, 4 of lentil, 11 out of 21 of Phaseolus bean, and 16 out of 17 of pea were systemically sensitive to the virus. Twelve plant species were found to be new potential hosts and cucumber a new local-lesion test plant of the virus. BBMV particles occurred in faba bean plants in very high concentrations and seed transmission in this species (1.37%) was confirmed. An isolate from Syria was purified and two antisera were produced, one of which was used in ELISA to detect BBMV in faba bean field samples. Two hundred and three out of the 789 samples with symptoms suggestive of virus infection collected in 1985, 1986 and 1987, were found infected with BBMV: 4 out of 70 (4/70) tested samples from Egypt, 0/44 from Lebanon, 1/15 from Morocco, 46/254 from Sudan, 72/269 from Syria and 80/137 from Tunisia. This is the first report on its occurrence in Egypt, Syria and Tunisia. The virus is a potential threat to crop improvement in the region.

A novel corepressor, BCoR-L1, represses transcription through an interaction with CtBP

Corepressors play a crucial role in negative gene regulation and are defective in several diseases. BCoR is a corepressor for the BCL6 repressor protein. Here we describe and functionally characterize BCoR-L1, a homolog of BCoR. When tethered to a heterologous promoter, BCoR-L1 is capable of strong repression. Like other corepressors, BCoR-L1 associates with histone deacetylase (HDAC) activity. Specifically, BCoR-L1 coprecipitates with the Class II HDACs, HDAC4, HDAC5, and HDAC7, suggesting that they are involved in its role as a transcriptional repressor. BCoR-L1 also interacts with the CtBP corepressor through a CtBP-interacting motif in its amino terminus. Abrogation of the CtBP binding site within BCoR-L1 partially relieves BCoR-L1-mediated transcriptional repression. Furthermore, BCoR-L1 is located on the E-cadherin promoter, a known CtBP-regulated promoter, and represses the E-cadherin promoter activity in a reporter assay. The inhibition of BCoR-L1 expression by RNA-mediated interference results in derepression of E-cadherin in cells that do not normally express E-cadherin, indicating that BCoR-L1 contributes to the repression of an authentic endogenous CtBP target.