Abstract This paper presents a robust watermarking for still digital images based on schur factorization and Singular Value Decomposition (SVD). In this paper, image is decomposed into 8 8  blocks and after applying schur factorization, the stable largest eigen values of the upper triangle is used as robust locations for embedding watermark. The matrix array formed by largest eigen values furt...

In this paper, the performance of SVD and Schur decomposition is evaluated and compared for image copyright protection applications. The watermark image is embedded in the cover image by using Quantization Index Modulus Modulation (QIMM) and Quantization Index Modulation (QIM). Watermark image is embedded in the D matrix of Schur decomposition and Singular Value Decomposition (SVD). Watermarkin...

Let S (Λ) be the cyclotomic q-Schur algebra associated to the ArikiKoike algebra Hn,r, introduced by Dipper-James-Mathas. In this paper, we consider v-decomposition numbers of S (Λ), namely decomposition numbers with respect to the Jantzen filtrations of Weyl modules. We prove, as a v-analogue of the result obtained by Shoji-Wada, a product formula for v-decomposition numbers of S (Λ), which as...

We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decomposition of a problem is performed using a graph partitioning. It results in sparse submatrices with balanced sizes. An envelope method is used to factorize these submatrices. However, the memory requirements to store them and the com...

This thesis presents a parallel resolution method for sparse linear systems which combines effectively techniques of direct and iterative solvers using a Schur complement approach. A domain decomposition is built ; the interiors of the subdomains are eliminated by a direct method in order to use an iterative method only on the interface unknowns. The system on the interface (Schur complement) i...

We show that a Schur form of a real orthogonal matrix can be obtained from a full CS decomposition. Based on this fact a CS decomposition-based orthogonal eigenvalue method is developed. We also describe an algorithm for orthogonal similarity transformation of an orthogonal matrix to a condensed product form, and an algorithm for full CS decomposition. The latter uses mixed shifted and zero-shi...

Since every even power of the Vandermonde determinant is a symmetric polynomial, we want to understand its decomposition in terms of the basis of Schur functions. We investigate several combinatorial properties of the coefficients in the decomposition. In particular, I will give a recursive approach for computing the coefficient of the Schur function sμ in the decomposition of an even power of ...

BACKGROUND The inverse problem of fluorescent molecular tomography (FMT) often involves complex large-scale matrix operations, which may lead to unacceptable computational errors and complexity. In this research, a tree structured Schur complement decomposition strategy is proposed to accelerate the reconstruction process and reduce the computational complexity. Additionally, an adaptive regula...