This paper presents a method for the segmentation and recognition of facial features and face tracking in digital video sequences based on inexact graph matching. It extends a previous approach proposed for static images to video sequences by incorporating the temporal aspect that is inherent to such sequences. Facial features are represented by attributed relational graphs, in which vertices c...

Dynamical systems are mathematical models characterized by a set of differential or difference equations. Due to the increasing demand for more accuracy, the number of equations involved may reach the order of thousands and even millions. With so many equations, it often becomes computationally cumbersome to work with these large-scale dynamical systems. Model reduction aims to replace the orig...

this text carries out some ideas about exact and p− exact sequences of transformationsemigroups. some theorems like the short five lemma (lemma 1.3 and lemma 2.3) are valid here as inexact sequences of r − modules.

The hybrid conjugate gradient (CG) method is among the efficient variants of CG for solving optimization problems. This due to their low memory requirements and nice convergence properties. In this paper, we present an unconstrained models show that satisfies sufficient descent condition. global prove proposed would be established under inexact line search. Application famous statistical regres...

Abstract A bundle method for minimizing the difference of convex (DC) and possibly nonsmooth functions is developed. The may be viewed as an inexact version DC algorithm, where each subproblem solved only approximately by a method. We always terminate after first serious step. This yields descent direction original objective function, it shown that stepsize at least one accepted in this way. Us...

Bilevel linear programming  is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

We introduce a novel Bayesian inexact point pattern matching model that assumes that a linear transformation relates the two sets of points. The matching problem is inexact due to the lack of one-to-one correspondence between the point sets and the presence of noise. The algorithm is itself inexact; we use variational Bayesian approximation to estimate the posterior distributions in the face of...

Due to the NGS data deluge, sequence mapping has become an intensive task that, depending on the experiment, may demand high amounts of computing power or memory capacity. On the one hand, GPGPU architectures have become a cost-effective solution that outperforms common processors in specific tasks. On the other hand, out-of-core implementations allow to directly access data from secondary memo...

This paper presents novel convergence results for the Augmented Lagrangian based Alternating Direction Inexact Newton method (ALADIN) in the context of distributed convex optimization. It is shown that ALADIN converges for a large class of convex optimization problems from any starting point to minimizers without needing line-search or other globalization routines. Under additional regularity a...