sparse coding

Due to the growing increase of generated images via cameras and various instruments, image processing has found an important role in most of practical usages including medical, security and driving. However, most of the available models has no considerable performance and in some usages the amount of error is very effective. The main cause of this failure in most of available models is the distribution mismatch across the source and target domains. In fact, the made model has no generalization to test data with different properties and distribution compared to the source data, and its performance degrades dramatically to face with new data. In this paper, we propose a novel approach entitled Sparse coding and ADAptive classification (SADA) which is robust against data drift across domains. The proposed model reduces the distribution difference across domains via generating a common subspace between the source and target domains and increases the performance of model. Also, SADA reduces the distribution mismatch across domains via the selection of the source samples which are related to target samples. Moreover, SADA adapts the model parameters to build an adaptive model to encounter with data drift. Our variety of experiments demonstrate that the proposed approach outperforms all stat-of-the-art domain adaptation methods.

Due to the rapid growth of information technology and exponential increasing of information the need for more and more storage capacity and efficiency has increased. Image compression is an important tool to reduce the redundancy of images data in order to be able to store or transmit them in an efficient manner. When images are limited to a specific and limited family of images like MRI databases of a hospital or facial image database of a university or an organization or fingerprint image databases, this limitation increases the total spatial redundancy. Thus, efficient storage of such images is beneficial, and their compression becomes an appealing application, and this urges algorithms specially tailored for the task of content base image compression to surpass general purpose compression algorithms. The facial images, due to their wide application as the most common images in the organizations and companies are more considerable for image compression. In this paper a new image compression scheme using sparse coding and RLS-DLA redundant dictionary learning is proposed that can be used for compressing of face image databases. In the proposed method, several dictionaries are exploited adaptively based on the required image quality to enhance the overall rate-distortion. The simulation results show that this scheme outperforms the state-of-art algorithms like JPEG2000 by about 0.5 to 1.2 dB for reconstructed images PSNR.

Domain adaptation can transfer knowledge from a training set (source domain) to a test set (target domain), promoting the performance of the model learned from the training set. In addition, sparse coding makes the learned model more succinct and easy to manipulate. However, the existence of the distribution mismatch across the source and target domains reduce the performance of model. In this paper, we propose an unsupervised domain adaptation model to minimize the prediction error of image classification. Sample reweighting is utilized to handle redundant and useless information of source data in the new representation. Moreover, the difference of the conditional distributions across the source and target domains is reduced along with the subspace alignment. Our proposed approach learns a sparse domain-invariant classifier in a latent subspace with preserving the structure of the input data. Extensive experiments demonstrate that our proposed approach shows 4.49% improvement in classification accuracy on real-world datasets compared to state-of-the-art machine learning and domain adaptation methods.