Sharif Digital Repository

In this paper we address the problem of learning low-dimensional subspaces using a given set of training data. To this aim, we propose an algorithm that performs by sequentially fitting a number of low-dimensional subspaces to the training data. Once we found a subset of the training data that is sufficiently near a fitted subspace, we omit these signals from the set of training signals and repeat the same procedure for the remaining signals until all training signals are assigned to a subspace. We then propose a robust version of the algorithm to address the situation in which the training signals are contaminated by additive white Gaussian noise (AWGN). Experimental results on both... 

A new algorithm for learning jointly reconstructive and discriminative dictionaries for sparse representation (SR) is presented. While in a usual dictionary learning algorithm like K-SVD only the reconstructive aspect of the sparse representations is considered to learn a dictionary, in our proposed algorithm, which we call K-LDA, the discriminative aspect of the sparse representations is also addressed. In fact, K-LDA is an extension of K-SVD in the case that the class informations (labels) of the training data are also available. K-LDA takes into account these information in order to make the sparse representations more discriminate. It makes a trade-off between the amount of... 

Dictionary learning (DL) for sparse representation has been widely investigated during the last decade. A DL algorithm uses a training data set to learn a set of basis functions over which all training signals can be sparsely represented. In practice, training signals may contain a few outlier data, whose structures differ from those of the clean training set. The presence of these unpleasant data may heavily affect the learning performance of a DL algorithm. In this paper we propose a robust-to-outlier formulation of the DL problem. We then present an algorithm for solving the resulting problem. Experimental results on both synthetic data and image denoising demonstrate the promising... 

In this paper we propose a new algorithm for learning low-dimensional linear subspaces. Our proposed algorithm performs by sequentially finding some low-dimensional subspaces on which a set of training data lies. Each subspace is found in such a way that the number of signals lying on (or near to) it is maximized. Once we found a subset of the training data that is sufficiently close to a subspace, then we omit these signals from the set of training signals and repeat the procedure for the remaining signals until all training signals are assigned to a subspace. This data reduction procedure results in a significant improvement to the runtime of our algorithm. We then propose a robust version... 

Many research works have been done in face recognition during the last years that indicates the importance of face recognition systems in many applications including identity authentication. In this paper we propose an approach for face recognition which is suitable for unconstrained image acquisition and has a low computational cost. Since in practical applications such as in smartphones, imaging conditions are not limited to existing images in the database, robustness of the recognition algorithm is very important. Here a sparse representation framework is proposed which achieves some degree of robustness. Using double sparse representation the high computational cost of sparsity-based...