Subspace clustering assumes that the data is separable into separate subspaces. Such a simple assumption, does not always hold. We assume that, even if raw subspaces, one can learn representation (transform coefficients) such learnt To achieve intended goal, we embed subspace techniques (locally linear manifold clustering, sparse and low rank representation) transform learning. The entire formu...

Consider applying the Conjugate Residual (CR) method, which is a Krylov subspace type iterative solver, to systems of linear equations Ax = b or least squares problems min x∈Rn ‖b −Ax‖2, where A is singular and nonsymmetric. We will show that when R(A)⊥ = kerA, the CR method can be decomposed into the R(A) and kerA components, and the necessary and sufficient condition for the CR method to conv...

In many applications of frequency estimation, the frequencies contained in the signals are so high that the data sampled at Nyquist rate are hard to acquire due to hardware limitation. In this paper, we propose a novel method based on subspace techniques to estimate the frequencies by using two sub-Nyquist sample sequences, provided that the two under-sampled ratios are relatively prime integer...

Partial least squares technique has been in use for identification of the dynamics & control for multivariable distillation process. Discrete input-output time series data ) ( Y X were generated by exciting non-linear process models with pseudo random binary signals. Signal to noise ratio was set to 10 by adding white noise to the data. The ARX models as well FIR models in combination with leas...

Let L ⊂ V = R be a maximally isotropic subspace. It is shown that any simply connected Lie group with a bi-invariant flat pseudo-Riemannian metric of signature (k, l) is 2-step nilpotent and is defined by an element η ∈ Λ3L ⊂ Λ3V . If η is of type (3, 0)+(0, 3) with respect to a skew-symmetric endomorphism J with J2 = ǫId, then the Lie group L(η) is endowed with a left-invariant nearly Kähler s...

We make an evaluation of the lepton flavor violating (LFV) decays τ → l(V 0, P 0), where l = e or μ and V 0(P 0) is a neutral vector (pseudo-scalar) meson, in the context of unparticle physics. The constraints are investigated systematically on the related coupling parameters from all the available experimental data, and the parameter values are specified appropriately. The results show that wh...

Employment of powerful Direction-of-Arrival (DOA) estimation and beam-forming algorithms with smart antenna systems enables continuous tracking of desired signal irrespective of the signal environment there by, enhancing the quality of wireless services. In this paper emphasis is laid mainly on the performance of the various powerful high-resolution subspace algorithms like MUSIC, root-MUSIC an...

Commonly used in many applications, robust PCA represents an algorithmic attempt to reduce the sensitivity of classical PCA to outliers. The basic idea is to learn a decomposition of some data matrix of interest into low rank and sparse components, the latter representing unwanted outliers. Although the resulting problem is typically NP-hard, convex relaxations provide a computationally-expedie...