Facial makeup significantly changes the perceived appearance of face and reduces accuracy recognition. To adapt to application smart cities, in this study, we introduce a novel joint subspace low-rank coding method for exploit more discriminative information images, use feature projection technology find proper learn dictionary such subspace. In addition, constraint learning. Then, design learn...

Iterative projection methods may become trapped at non-solutions when the constraint sets are nonconvex. Two kinds of parameters available to help avoid this behavior and study gives examples both. The first kind parameter, called a hyperparameter, includes any parameter that appears in definition iteration rule itself. second comprises metric sets, feature arises problem be solved has two or m...

In this paper, an architecture for the combination of diierent constraint solvers with the help of projections is proposed. By means of the deenition of an interface and restricting properties of the operations of constraint solvers we are able to deene a mechanism for the open and consistent combination of constraint systems. We enable the use of a functional logic language as constraint solve...

Abstract To improve the performance of speech enhancement in a complex noise environment, joint constrained dictionary learning method for single-channel is proposed, which solves “cross projection” problem signals dictionary. In method, new optimization function not only constrains sparse representation noisy signal dictionary, and controls projection error on corresponding sub-dictionary, but...

BACKGROUND Computed Tomography (CT) is a technology that obtains the tomogram of the observed objects. In real-world applications, especially the biomedical applications, lower radiation dose have been constantly pursued. To shorten scanning time and reduce radiation dose, one can decrease X-ray exposure time at each projection view or decrease the number of projections. Until quite recently, t...

suppose $pi:mathcal{a}rightarrow mathcal{b}$ is a surjective unital $ast$-homomorphism between c*-algebras $mathcal{a}$ and $mathcal{b}$, and $0leq aleq1$ with $ain  mathcal{a}$. we give a sufficient condition that ensures there is a proection $pin mathcal{a}$ such that $pi left( pright) =pi left( aright) $. an easy consequence is a result of [l. g. brown and g. k. pedersen, c*-algebras of real...

This paper addresses the problem of how a robot can autonomously improve a manipulation skill in an efficient and secure manner. Instead of using the standard reinforcement learning formulation where all objectives are defined in a single reward function, we propose a generalized formulation that consists of three components: 1) A known analytic cost function; 2) A black-box reward function; 3)...

LSign 18] is an elegant domain for analyzing constraint logic programming languages over linear real constraints. Its key conceptual ideas are the abstraction of linear constraints by replacing coeecients by their signs and the use of annotations for preserving multiplicity information on the constraints. Unfortunately, the ordering of abstract constraint stores given in 18] does not capture th...

Flexibility analysis is an important task for the optimal design and synthesis of chemical processes with uncertainty. It is a challenging problem because of the discontinuity and nonconvexity of rigorous flexibility programming formulations. In this article, we propose a new parallel hybrid algorithm based on stochastic search in conjunction with a nearest constraint projection technique to nu...

This paper describes T OY, an implementation of a Constraint Functional Logic Programming scheme CFLP (C), where C is a coordination domain involving the cooperation among several constraint domains D1, ..., Dn via a mediatorial domain M . This implementation follows a cooperative goal solving calculus for CFLP (C) based on lazy narrowing, invocation of solvers for each domain Di, and projectio...