IIIT Hyderabad Synthesizing Classifiers for Novel Settings Viresh Ranjan CVIT,IIIT-H Adviser: Prof. C. V. Jawahar, IIIT-H Co-Adviser: Dr. Gaurav Harit,

Slides:

Advertisements

Similar presentations

Learning visual representations for unfamiliar environments Kate Saenko, Brian Kulis, Trevor Darrell UC Berkeley EECS & ICSI.

Advertisements

Pseudo-Relevance Feedback For Multimedia Retrieval By Rong Yan, Alexander G. and Rong Jin Mwangi S. Kariuki

Context-based object-class recognition and retrieval by generalized correlograms by J. Amores, N. Sebe and P. Radeva Discussion led by Qi An Duke University.

Location Recognition Given: A query image A database of images with known locations Two types of approaches: Direct matching: directly match image features.

Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.

Foreground Focus: Finding Meaningful Features in Unlabeled Images Yong Jae Lee and Kristen Grauman University of Texas at Austin.

Rajat Raina Honglak Lee, Roger Grosse Alexis Battle, Chaitanya Ekanadham, Helen Kwong, Benjamin Packer, Narut Sereewattanawoot Andrew Y. Ng Stanford University.

A CTION R ECOGNITION FROM V IDEO U SING F EATURE C OVARIANCE M ATRICES Kai Guo, Prakash Ishwar, Senior Member, IEEE, and Janusz Konrad, Fellow, IEEE.

Machine learning continued Image source:

A novel supervised feature extraction and classification framework for land cover recognition of the off-land scenario Yan Cui

Robust Object Tracking via Sparsity-based Collaborative Model

Query Dependent Pseudo-Relevance Feedback based on Wikipedia SIGIR ‘09 Advisor: Dr. Koh Jia-Ling Speaker: Lin, Yi-Jhen Date: 2010/01/24 1.

Data Visualization STAT 890, STAT 442, CM 462

GENERATING AUTOMATIC SEMANTIC ANNOTATIONS FOR RESEARCH DATASETS AYUSH SINGHAL AND JAIDEEP SRIVASTAVA CS DEPT., UNIVERSITY OF MINNESOTA, MN, USA.

Watching Unlabeled Video Helps Learn New Human Actions from Very Few Labeled Snapshots Chao-Yeh Chen and Kristen Grauman University of Texas at Austin.

Large Lump Detection by SVM Sharmin Nilufar Nilanjan Ray.

Principal Component Analysis

1 Integrating User Feedback Log into Relevance Feedback by Coupled SVM for Content-Based Image Retrieval 9-April, 2005 Steven C. H. Hoi *, Michael R. Lyu.

Supervised Distance Metric Learning Presented at CMU’s Computer Vision Misc-Read Reading Group May 9, 2007 by Tomasz Malisiewicz.

Presented by Zeehasham Rasheed

Large Lump Detection by SVM Sharmin Nilufar Nilanjan Ray.

© 2013 IBM Corporation Efficient Multi-stage Image Classification for Mobile Sensing in Urban Environments Presented by Shashank Mujumdar IBM Research,

Learning from Multiple Outlooks Maayan Harel and Shie Mannor ICML 2011 Presented by Minhua Chen.

IIIT HyderabadUMASS AMHERST Robust Recognition of Documents by Fusing Results of Word Clusters Venkat Rasagna 1, Anand Kumar 1, C. V. Jawahar 1, R. Manmatha.

Introduction to domain adaptation

Learning to Learn By Exploiting Prior Knowledge

Jinhui Tang †, Shuicheng Yan †, Richang Hong †, Guo-Jun Qi ‡, Tat-Seng Chua † † National University of Singapore ‡ University of Illinois at Urbana-Champaign.

Online Dictionary Learning for Sparse Coding International Conference on Machine Learning, 2009 Julien Mairal, Francis Bach, Jean Ponce and Guillermo Sapiro.

Attention Deficit Hyperactivity Disorder (ADHD) Student Classification Using Genetic Algorithm and Artificial Neural Network S. Yenaeng 1, S. Saelee 2.

AdvisorStudent Dr. Jia Li Shaojun Liu Dept. of Computer Science and Engineering, Oakland University 3D Shape Classification Using Conformal Mapping In.

Transfer Learning From Multiple Source Domains via Consensus Regularization Ping Luo, Fuzhen Zhuang, Hui Xiong, Yuhong Xiong, Qing He.

Person-Specific Domain Adaptation with Applications to Heterogeneous Face Recognition (HFR) Presenter: Yao-Hung Tsai Dept. of Electrical Engineering, NTU.

Thien Anh Dinh1, Tomi Silander1, Bolan Su1, Tianxia Gong

Overcoming Dataset Bias: An Unsupervised Domain Adaptation Approach Boqing Gong University of Southern California Joint work with Fei Sha and Kristen Grauman.

Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.

BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.

A Simple Unsupervised Query Categorizer for Web Search Engines Prashant Ullegaddi and Vasudeva Varma Search and Information Extraction Lab Language Technologies.

The Necessity of Combining Adaptation Methods Cognitive Computation Group, University of Illinois Experimental Results Title Ming-Wei Chang, Michael Connor.

A Statistical Approach to Speed Up Ranking/Re-Ranking Hong-Ming Chen Advisor: Professor Shih-Fu Chang.

Group Sparse Coding Samy Bengio, Fernando Pereira, Yoram Singer, Dennis Strelow Google Mountain View, CA (NIPS2009) Presented by Miao Liu July

Transfer Learning for Image Classification Group No.: 15 Group member : Feng Cai Sauptik Dhar Sauptik.

IIIT Hyderabad Document Image Retrieval using Bag of Visual Words Model Ravi Shekhar CVIT, IIIT Hyderabad Advisor : Prof. C.V. Jawahar.

Mingyang Zhu, Huaijiang Sun, Zhigang Deng Quaternion Space Sparse Decomposition for Motion Compression and Retrieval SCA 2012.

Towards Semantic Embedding in Visual Vocabulary Towards Semantic Embedding in Visual Vocabulary The Twenty-Third IEEE Conference on Computer Vision and.

Geodesic Flow Kernel for Unsupervised Domain Adaptation Boqing Gong University of Southern California Joint work with Yuan Shi, Fei Sha, and Kristen Grauman.

Visual Categorization With Bags of Keypoints Original Authors: G. Csurka, C.R. Dance, L. Fan, J. Willamowski, C. Bray ECCV Workshop on Statistical Learning.

Event retrieval in large video collections with circulant temporal encoding CVPR 2013 Oral.

H. Lexie Yang1, Dr. Melba M. Crawford2

HAITHAM BOU AMMAR MAASTRICHT UNIVERSITY Transfer for Supervised Learning Tasks.

Image Classification for Automatic Annotation

Iterative similarity based adaptation technique for Cross Domain text classification Under: Prof. Amitabha Mukherjee By: Narendra Roy Roll no: Group:

Ariadna Quattoni Xavier Carreras An Efficient Projection for l 1,∞ Regularization Michael Collins Trevor Darrell MIT CSAIL.

Final Project Mei-Chen Yeh May 15, General In-class presentation – June 12 and June 19, 2012 – 15 minutes, in English 30% of the overall grade In-class.

Enhanced Regulatory Sequence Prediction Using Gapped k-mer Features 王荣 14S

Virtual Examples for Text Classification with Support Vector Machines Manabu Sassano Proceedings of the 2003 Conference on Emprical Methods in Natural.

Preliminary Transformations Presented By: -Mona Saudagar Under Guidance of: - Prof. S. V. Jain Multi Oriented Text Recognition In Digital Images.

Martina Uray Heinz Mayer Joanneum Research Graz Institute of Digital Image Processing Horst Bischof Graz University of Technology Institute for Computer.

1 Bilinear Classifiers for Visual Recognition Computational Vision Lab. University of California Irvine To be presented in NIPS 2009 Hamed Pirsiavash Deva.

Image Retrieval and Ranking using L.S.I and Cross View Learning Sumit Kumar Vivek Gupta

Guillaume-Alexandre Bilodeau

CLASSIFICATION OF TUMOR HISTOPATHOLOGY VIA SPARSE FEATURE LEARNING Nandita M. Nayak1, Hang Chang1, Alexander Borowsky2, Paul Spellman3 and Bahram Parvin1.

Introductory Seminar on Research: Fall 2017

Presenter: Hajar Emami

Unsupervised Face Alignment by Robust Nonrigid Mapping

Thesis Advisor : Prof C.V. Jawahar

Finding Clusters within a Class to Improve Classification Accuracy

Outline S. C. Zhu, X. Liu, and Y. Wu, “Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo”, IEEE Transactions On Pattern Analysis And Machine.

Bilinear Classifiers for Visual Recognition

Xiao-Yu Zhang, Shupeng Wang, Xiaochun Yun

An Efficient Projection for L1-∞ Regularization

Presentation transcript:

IIIT Hyderabad Synthesizing Classifiers for Novel Settings Viresh Ranjan CVIT,IIIT-H Adviser: Prof. C. V. Jawahar, IIIT-H Co-Adviser: Dr. Gaurav Harit, IIT, Jodhpur 1

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks. 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift. b)Large number of categories. 3.Handling Dataset Shift. 4.Handling large number of categories.

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift 4.Handling large number of categories

IIIT Hyderabad Introduction Image Feature Extraction Classifier Image labels “Car” “Not Car” “Car” “Not Car” Visual Recognition & Retrieval Object Recognition

IIIT Hyderabad Introduction Image Feature Extraction Classifier Image labels “room” “Not room” “room” “Not room” Visual Recognition & Retrieval Word image retrieval

IIIT Hyderabad Introduction Image Feature Extraction Classifier Image labels “2” “Not 2” “2” “Not 2” Visual Recognition & Retrieval Handwritten digit classification

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift 4.Handling large number of categories

IIIT Hyderabad Introduction Challenges in Visual Recognition & Retrieval Dataset Shift Target (test set)Source (training set) Dataset Shift in Object Recognition

IIIT Hyderabad Introduction Challenges in Visual Recognition & Retrieval Dataset Shift Source(training set) Target(test set) Printed handwritten Dataset Shift in digits classification

IIIT Hyderabad Introduction Challenges in Visual Recognition & Retrieval Dataset Shift Source(training set) Target(test set) Dataset Shift in word image retrieval

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift 4.Handling large number of categories

IIIT Hyderabad Introduction Challenges in Visual Recognition & Retrieval Dataset Shift Too many categories Around 200K word categories in English language

IIIT Hyderabad Introduction Challenges in Visual Recognition & Retrieval Dataset Shift Too many categories Tackling the challenges Dataset Shift –i) Domain Adaptation ii) Kernelized feature extraction Too many categories – Transfer Learning

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift a)Handling Dataset Shift in object recognition by Domain Adaptation b)Handling Dataset Shift in digit classification by Domain Adaptation c)Handling Dataset Shift in word image retrieval by Kernelized Feature Extraction 4.Handling large number of categories

IIIT Hyderabad 3. a. Handling Dataset Shift in object recognition by Domain Adaptation

IIIT Hyderabad Problem Statement Target DomainSource Domain Given: Labeled Source Domain, Unlabeled Target Domain. Goal: Classify target domain images. 16

IIIT Hyderabad Overview of Domain Adaptation 17 Target Classification Target classification using Source classifier using DA (a) (b) Unlabeled Target domain images Labeled Source domain images

IIIT Hyderabad Proposed Approach Target Domain Source Domain Domain Specific Domain Independent Decompose features into: Domain Specific features Domain Independent features 18 Domain Specific

IIIT Hyderabad Source Specific Domain Independent Discard domain specific features 19 Target Specific Discard Proposed Approach Target Domain Source Domain

IIIT Hyderabad Proposed Approach Domain Independent Train classifiers using domain independent features 20 Classifier Train Test Target Domain Source Domain

IIIT Hyderabad Sparse Representation: ImageDictionary Sparse coefficients 21 However, above sparse representation cannot separate domain specific & independent features. How do we separate domain specific & independent features ? Learning Domain Specific & Domain Independent features

IIIT Hyderabad Learning Domain Specific & Domain Independent features Key idea: domain specific & shared atoms in dictionary. Source imageSource Specific Atoms Shared Atoms 22 Target imageTarget Specific Atoms Shared Atoms Coeff. for Source specific atoms Coeff. for shared atoms Coeff. for Target specific atoms Coeff. for shared atoms

IIIT Hyderabad Source Specific Atoms Shared Atoms Target Specific Atoms (1)(2) 23 Learning Domain Specific & Domain Independent features Target Domain Source Domain

IIIT Hyderabad 24 Learning Cross Domain Classifiers Source images Target images Source specific coeffs. Coeffs. for shared atoms Target specific coeffs. Coeffs. for shared atoms Sparse representation

IIIT Hyderabad 25 Learning Cross Domain Classifiers Source images Discard domain specific coeffs. Train classifiers using coeffs. for shared atoms

IIIT Hyderabad (3) Source reconstruction errorTarget reconstruction error 26 Learning Domain Specific & Domain Independent features where Y s contains source images, Y t contains target images, D s and D t are source and target dictionary. (4) (5)

IIIT Hyderabad Experiments Dataset  10 object classes from Caltech-256 (C), Webcam(W), Dslr(D), Amazon(A) Feature representation  SURF features  BOW representation(800 visual words) 27

IIIT Hyderabad Results Unsupervised Setting(no target labels) 28 MethodC->AC->DA->CA->WW->CW->AD->AD->W MOD src MOD tgt Gopalan et al Gong et al Ni et al PSDL(ours)

IIIT Hyderabad 29 Results PSDL Original features PSDL Original features PSDL Original features Query Retrieved Images

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift a)Handling Dataset Shift in word image retrieval by Kernelized Feature Extraction b)Handling Dataset Shift in digit classification by Domain Adaptation. c)Handling Dataset Shift in object recognition by Domain Adaptation 4.Handling large number of categories

IIIT Hyderabad 3. b. Handling Dataset Shift in digit classification by Domain Adaptation

IIIT Hyderabad Problem Statement Given: Labeled Source Domain, Unlabeled Target Domain. Goal: Classify target domain images. 32 Target DomainSource Domain

IIIT Hyderabad Approach Overview 33 Source data Target data Source Subspace Target Subspace Common Subspace

IIIT Hyderabad 34 Desired properties for Subspace: Preserve local geometry of data. Utilize label information. Locality Preserving Projections(LPP) [1]: Preserves local neighborhood. Can utilize label information. [1] X. He and P. Niyogi, “Locality preserving projections,” in NIPS, 2003, pp. 234–241 Locality Preserving Subspace Alignment(LPSA)

IIIT Hyderabad 35 Locality Preserving Projection(LPP): (6) Locality Preserving Subspace Alignment(LPSA)

IIIT Hyderabad Locality Preserving Subspace Alignment(LPSA) 36 Supervised Locality Preserving Projection(sLPP): (6)

IIIT Hyderabad Locality Preserving Subspace Alignment(LPSA) 37

IIIT Hyderabad Locality Preserving Subspace Alignment(LPSA) 38 Approach: Aligning Subspaces Target Subspace (7)

IIIT Hyderabad Approach: Projection,

IIIT Hyderabad Datasets 40 DatasetSourceNo. Images Printed digitsRendering digits in 300 different fonts Handwritten digits(HW) Sampling 300 images per digit MNIST. 3000

IIIT Hyderabad Experimental Results 41 SourceTargetMethodAccuracy HandwrittenPrintedNo Adaptation48.8 HandwrittenPrintedPCA(source)55.9 HandwrittenPrintedPCA(target)56.5 HandwrittenPrintedPCA(combined)56.5 HandwrittenPrintedFernando et al [2] 57.0 HandwrittenPrintedLPSA(Ours)64.8 [2] Fernando, Basura, et al. "Unsupervised visual domain adaptation using subspace alignment." Computer Vision (ICCV), 2013 IEEE International Conference on. IEEE, 2013.

IIIT Hyderabad Experimental Results 42 SourceTargetMethodAccuracy PrintedHandwrittenNo Adaptation70.0 PrintedHandwrittenPCA(source)68.1 PrintedHandwrittenPCA(target)68.9 PrintedHandwrittenPCA(combined)70.2 PrintedHandwrittenFernando et al [2] 70.6 PrintedHandwrittenLPSA(Ours)73.2 [2] Fernando, Basura, et al. "Unsupervised visual domain adaptation using subspace alignment." Computer Vision (ICCV), 2013 IEEE International Conference on. IEEE, 2013.

IIIT Hyderabad Experimental Results 43 Test Image No Adaptation DA using LPSA

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift a)Handling Dataset Shift in object recognition by Domain Adaptation b)Handling Dataset Shift in digit classification by Domain Adaptation c)Handling Dataset Shift in word image retrieval by Kernelized Feature Extraction 4.Handling large number of categories

IIIT Hyderabad 3.c. Handling Dataset Shift in word image retrieval by Kernelized Feature Extraction

IIIT Hyderabad Style-Content Factorization 46

IIIT Hyderabad Style-Content Factorization 47 Asymmetric Bilinear Model (Freeman et al. 2000). Factor 1 Factor 2 Image

IIIT Hyderabad 48 Asymmetric Bilinear Model (Freeman et al. 2000). Style Content Image Style-Content Factorization

IIIT Hyderabad 49 Asymmetric Bilinear Model (Freeman et al. 2000). Style Content Image Style-Content Factorization

IIIT Hyderabad 50 Asymmetric Bilinear Model (Freeman et al. 2000). (8) Style dependent Basis Vectors Content Vector Image Notation: refers to style(font), refers to content. Style-Content Factorization

IIIT Hyderabad 51 Asymmetric Bilinear Model (Freeman et al. 2000). (8) Style dependent Basis Vectors Content Vector Image Notation: refers to style(font), refers to content. Style-Content Factorization

IIIT Hyderabad 52 Problems with Asymmetric Bilinear Model – Needs separate learning for each new style(font). – Model is too simplistic, overlooks nonlinear interactions. Style-Content Factorization

IIIT Hyderabad 53 Problems with Asymmetric Bilinear Model – Needs separate learning for each new style. – Model is too simplistic, overlooks nonlinear relationship. To tackle these problems, we propose a kernelized version of Asymmetric Bilinear Model. Style-Content Factorization

IIIT Hyderabad Non-linear Style-Content Factorization 54 Asymmetric Kernel Bilinear model(AKBM) (10) (11) where

IIIT Hyderabad Non-linear Style-Content Factorization 55 (12) Style Basis Content vector Asymmetric Kernel Bilinear model(AKBM)

IIIT Hyderabad Non-linear Style-Content Factorization 56 Learning the Asymmetric Kernel Bilinear model(AKBM) parameters (13) Data fitting term Regularizer

IIIT Hyderabad Non-linear Style-Content Factorization 57 Learning the Asymmetric Kernel Bilinear model(AKBM) parameters The mapping function is not known. Kernel trick comes to rescue. (13)

IIIT Hyderabad Non-linear Style-Content Factorization 58 Learning the Asymmetric Kernel Bilinear model(AKBM) parameters Kernel Trick (13) (14) Here is the kernel matrix.

IIIT Hyderabad Non-linear Style-Content Factorization 59 Learning the Asymmetric Kernel Bilinear model(AKBM) parameters (14) Objective is non-convex in and, but convex with respect to any one of them. We solve it by alternating between solving the convex problem for keeping constant and vice-versa.

IIIT Hyderabad 60 Non-linear Style-Content Factorization Representing content using AKBM For novel query in any style, content is found by minimizing following objective (15) (16)

IIIT Hyderabad Datasets DatasetNo. distinct wordsNo. word images D D D D D Dlab D1-D5 consists of word images from 5 different books, varying in font. Dlab is generated under laboratory settings, consists of 10 widely varying fonts.

IIIT Hyderabad Datasets Dlab

IIIT Hyderabad Experimental Results 63 D1->D2D1->D3D1->D4D2->D1D2->D3D2->D4 No Transfer ABM(Freeman et al.) AKBM(ours) Asymmetric Kernel Bilinear model(AKBM) refers to our Kernelized style-content factorization.

IIIT Hyderabad QueryRetrieved Images(Cross font) No Transfer AKBM No Transfer AKBM

IIIT Hyderabad 65 Retrieval results on Dlab Experimental Results

IIIT Hyderabad Overview 1.Visual Recognition & Retrieval Tasks 2.Challenges in Visual Recognition & Retrieval a)Dataset Shift b)Large number of categories 3.Handling Dataset Shift a)Handling Dataset Shift in object recognition by Domain Adaptation b)Handling Dataset Shift in digit classification by Domain Adaptation c)Handling Dataset Shift in word image retrieval by Kernelized Feature Extraction 4.Handling large number of categories via Transfer Learning

IIIT Hyderabad 4. Handling large number of categories via Transfer Learning

IIIT Hyderabad Problem Statement 68 To design a scalable classifier based document image retrieval system. Around 200K word categories in English language

IIIT Hyderabad Proposed Approach 69 Top few frequent words have most coverage. A query word can be Frequent query : corresponding to the frequent words(higher coverage). Rare query : corresponding to the rare words(less coverage).

IIIT Hyderabad Proposed Approach 70 Classifiers are trained for frequent queries & synthesized on-the-fly for rare queries. Rare queries consist of characters already present in one or multiple frequent queries. To synthesize classifier for a novel rare query, cut and paste relevant portions from existing frequent classifiers.

IIIT Hyderabad Proposed Approach 71 On-the-fly classifier synthesis

IIIT Hyderabad Proposed Approach 72 On-the-fly classifier synthesis

IIIT Hyderabad Datasets 73 DatasetSourceTypeNo. of Images D11 bookClean26,555 D22 booksClean35,730 D31 bookNoisy4373

IIIT Hyderabad Experimental Results 74 Where mAP is the mean average precision for the 100 queries. DatasetSourceType# Images# queries OCR (mAP) LDA (mAP) D11 bookClean26, D22 booksClean35, D31 bookNoisy

IIIT Hyderabad Experimental Results 75 Datase t No. of queries mAP (frequent queries) mAP (rare queries) D D D Where mAP is the mean average precision for the 100 queries.

IIIT Hyderabad Conclusion 76 Domain Adaptation reduces the mismatch across source & target domains. AKBM is more robust to font variations, in comparison to Asymmetric Bilinear Model. Transfer learning can be used to design scalable classifier based word image retrieval systems.

IIIT Hyderabad Contributions 77 PSDL: a joint dictionary learning strategy, suitable for domain adaptation. LPSA: a subspace alignment strategy for domain adaptation. AKBM: a nonlinear style-content factorization model. DQC: a transfer learning strategy for on-the-fly learning of word image classifiers.

IIIT Hyderabad Thank You 78 Related Publications 1. Viresh Ranjan, Gaurav Harit and C.V. Jawahar: Enhancing World Image Retrieval in Presence of Font Variations, International Conference on Pattern Recognition, 2014 (Oral) 2. Viresh Ranjan, Gaurav Harit and C.V. Jawahar: Document Retrieval with Unlimited Vocabulary, IEEE Winter Conference on Applications of Computer Vision(WACV), Viresh Ranjan, Gaurav Harit and C.V. Jawahar: Learning Partially Shared Dictionaries for Domain Adaptation, 12th Asian Conference on Computer Vision (ACCV 2014) (Workshop: FSLCV 2014) 4. Viresh Ranjan, Gaurav Harit and C.V. Jawahar: Domain Adaptation by Aligning Locality Preserving Subspaces, 8th International Conference on Advances in Pattern Recognition(ICAPR 2015)