In computer graphics, texture mapping is an important means to enhance the realism of model. Traditional texture image always was captured under special light condition. If the lighting in virtual environment is different from the texture image, the result of rendering will be incorrect and unrealistic. This paper proposes an image-based method to fit the reflection mode by a quadratic multinom...

Basis Pursuit (BP) and Basis Pursuit Denoising (BPDN), well established techniques for computing sparse representations, minimize an ` data fidelity term, subject to an ` sparsity constraint or regularization term, by mapping the problem to a linear or quadratic program. BPDN with an ` data fidelity term has recently been proposed, also implemented via a mapping to a linear program. We introduc...

We consider the problem of minimizing an indefinite quadratic function subject to two quadratic inequality constraints. When the problem is defined over the complex plane we show that strong duality holds and obtain necessary and sufficient optimality conditions. We then develop a connection between the image of the real and complex spaces under a quadratic mapping, which together with the resu...

Texture mapping may give the impression of geometric details in a model using an image. But texture always was captured under special light condition. If the lighting in virtual environment is different from the texture image, the result of rendering will be incorrect and unrealistic. This paper proposes an image-based method that requires basic texture map and coefficient maps to interpolate l...

In this paper we prove that a polynomial system can be always mapped by some rational mapping into a general quadratic system. This result is useful for studies of systems with a complex dynamics. One generalization is discussed. Our approach is based on theorems on algebraic dependent polynomials. Key-Words:Polynomial, polynomial system, quadratic system, rational mapping, algebraic dependence...

It is well known that the bilinear transform, or first order diagonal Padé approximation to the matrix exponential, preserves quadratic Lyapunov functions between continuous-time and corresponding discrete-time linear time invariant (LTI) systems, regardless of the sampling time. It is also well known that this mapping preserves common quadratic Lyapunov functions between continuous-time and di...