Model based analysis or explicit definition/listing of all models or assumptions used in the derivation of an image fusion method allows us to understand the rationale or properties of existing methods and shows a way for a proper usage or proposal/selection of new methods ‘better’ satisfying the needs of a particular application. Most existing pan-sharpening methods are based mainly on the two...

The partial least squares (PLS) method computes a sequence of approximate solutions xk ∈ Kk(AA,A b), k = 1, 2, . . . , to the least squares problem minx ‖Ax− b‖2. If carried out to completion, the method always terminates with the pseudoinverse solution x† = A†b. Two direct PLS algorithms are analyzed. The first uses the Golub–Kahan Householder algorithm for reducing A to upper bidiagonal form....

Sets of orthogonal basis functions over circular areas – pupils in optical applications – are known in the literature for the full circle (Zernike or Jacobi polynomials) and the annulus. Here, an orthogonal set is proposed if the area is two non-overlapping circles of equal size. The geometric master parameter is the ratio of the pupil radii over the distance between both circles. Increasingly ...

We study the algebraic aspects of equivariant quantum cohomology algebra of the flag manifold. We introduce and study the quantum double Schubert polynomials S̃w(x, y), which are the Lascoux– Schützenberger type representatives of the equivariant quantum cohomology classes. Our approach is based on the quantum Cauchy identity. We define also quantum Schubert polynomials S̃w(x) as the Gram–Schmidt...

‎for any group $g$‎, ‎we define an equivalence relation $thicksim$ as below‎: ‎[forall g‎, ‎h in g gthicksim h longleftrightarrow |g|=|h|]‎ ‎the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$‎. ‎in this paper‎, ‎we give a partial answer to a conjecture raised by shen‎. ‎in fact‎, ‎we show that if $g$ is a nilpote...

For nonselfadjoint elliptic boundary value problem which are preconditioned by a sub-structuring method, i.e., nonoverlapping domain decomposition, we introduce and study the concept of subspace orthogonalization. In subspace orthogonalization variants of Krylov methods the computation of inner products and vector updates, and the storage of basis elements is restricted to a (presumably small) ...

—— This paper describes an evaluation of Inhibition/Enhancement (In/En) network for robust automatic speech recognition (ASR). In distinctive phonetic features (DPFs) based speech recognition using neural network, In/En network is needed to discriminate whether the DPFs dynamic patterns of trajectories are convex or concave. The network is used to achieve categorical DPFs movement by enhancing ...