Sharif Digital Repository

Bag of words models for feature extraction have demonstrated top-notch performance in image classification. These representations are usually accompanied by a coding method. Recently, methods that code a descriptor giving regard to its nearby bases have proved efficacious. These methods take into account the nonlinear structure of descriptors, since local similarities are a good approximation of global similarities. However, they confine their usage of the global similarities to nearby bases. In this paper, we propose a coding scheme that brings into focus the manifold structure of descriptors, and devise a method to compute the global similarities of descriptors to the bases. Given a local... 

Traditional learning algorithms cannot perform well in scenarios where training data (source domain data) that are used to learn the model have a different distribution with test data (target domain data). The domain adaptation that intends to compensate this problem is an important capability for an intelligent agent. This paper presents a domain adaptation method which learns to adapt the data distribution of the source domain to that of the target domain where no labeled data of the target domain is available (and just unlabeled data are available for the target domain). Our method jointly learns a low dimensional representation space and an adaptive classifier. In fact, we try to find a...