Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...

  In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...

In this note, a generalization of higher rank numerical range isintroduced and some of its properties are investigated

Let M be a tropical matrix (k + x) × (k + x ′) for some k, x , x ′ ∈ N − {0} with tropical rank k. We show that Kapranov rank is k too if x and x ′ are not too big; namely if we are in one of the following cases: a) k ≥ 6 and x , x ′ ≤ 2 b) k = 4, 5, x ≤ 2 and x ′ ≤ 3 (or obviuosly the converse, that is x ≤ 3 and x ′ ≤ 2) c) k = 3 and either x , x ′ ≤ 3 or x ≤ 2 and x ′ ≤ 4 (or obviuosly the co...

We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but cycle rank at most k · ( 1 + log nk ) , thus refining the previously known bounds, as stated by Robertson and Seymour (1986) and by Bodlaender et al. (1995). Fu...