{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:54:11Z","timestamp":1760597651462,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,12,14]],"date-time":"2014-12-14T00:00:00Z","timestamp":1418515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,12,14]]},"DOI":"10.1145\/2683483.2683499","type":"proceedings-article","created":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T16:31:04Z","timestamp":1431361864000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Parametric Dictionaries and Feature Augmentation for Continuous Domain Adaptation"],"prefix":"10.1145","author":[{"given":"Sumit","family":"Shekhar","sequence":"first","affiliation":[{"name":"Adobe Research, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitesh","family":"Shroff","sequence":"additional","affiliation":[{"name":"Light, Paolo Alto, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rama","family":"Chellappa","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,12,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1610075.1610094"},{"key":"e_1_3_2_1_3_1","volume-title":"ACL","author":"H.","year":"2007","unstructured":"H. Daum\u00e9 III. Frustratingly easy domain adaptation . In ACL , 2007 . H. Daum\u00e9 III. Frustratingly easy domain adaptation. In ACL, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881969"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.760624"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/83.718485"},{"key":"e_1_3_2_1_7_1","first-page":"2073","volume-title":"IEEE Conference on Computer Vision and Pattern Recognition","author":"Gong B.","year":"2012","unstructured":"B. Gong , Y. Shi , F. Sha , and K. Grauman . Geodesic flow kernel for unsupervised domain adaptation . IEEE Conference on Computer Vision and Pattern Recognition , pages 2066\u2013 2073 , June 2012 . B. Gong, Y. Shi, F. Sha, and K. Grauman. Geodesic flow kernel for unsupervised domain adaptation. IEEE Conference on Computer Vision and Pattern Recognition, pages 2066\u20132073, June 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126344"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.249"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.55"},{"key":"e_1_3_2_1_11_1","volume-title":"ICML","author":"Jenatton R.","year":"2010","unstructured":"R. Jenatton , J. Mairal , G. Obozinski , and F. Bach . Proximal methods for sparse hierarchical dictionary learning . In ICML , 2010 . R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In ICML, 2010."},{"key":"e_1_3_2_1_12_1","first-page":"990","volume-title":"Neural Information Processing Systems","author":"Jia Y.","year":"2010","unstructured":"Y. Jia , M. Salzmann , and T. Darrell . Factorized latent spaces with structured sparsity . Neural Information Processing Systems , pages 982\u2013 990 , 2010 . Y. Jia, M. Salzmann, and T. Darrell. Factorized latent spaces with structured sparsity. Neural Information Processing Systems, pages 982\u2013990, 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995354"},{"key":"e_1_3_2_1_14_1","volume-title":"NIPS","author":"Lee H.","year":"2007","unstructured":"H. Lee , A. Battle , R. Raina , and A. Ng . Efficient sparse coding algorithms . In NIPS , 2007 . H. Lee, A. Battle, R. Raina, and A. Ng. Efficient sparse coding algorithms. In NIPS, 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.92"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2005.02.002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.156"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587652"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.95"},{"key":"e_1_3_2_1_21_1","volume-title":"Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision research, 37(23):3311\u20133325","author":"Olshausen B.","year":"1997","unstructured":"B. Olshausen and D. Field . Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision research, 37(23):3311\u20133325 , 1997 . B. Olshausen and D. Field. Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision research, 37(23):3311\u20133325, 1997."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33765-9_45"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2187642"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888089.1888106"},{"key":"e_1_3_2_1_26_1","volume-title":"The new york times annotated corpus","author":"Sandhaus E.","year":"2008","unstructured":"E. Sandhaus . The new york times annotated corpus . Linguistic Data Consortium , Philadelphia , 2008 . E. Sandhaus. The new york times annotated corpus. Linguistic Data Consortium, Philadelphia, 2008."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.53"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/WACV.2014.6836088"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/874061.875452"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539989"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126442"}],"event":{"name":"ICVGIP '14: Indian Conference on Computer Vision Graphics and Image Processing","acronym":"ICVGIP '14","location":"Bangalore India"},"container-title":["Proceedings of the 2014 Indian Conference on Computer Vision Graphics and Image Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2683483.2683499","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2683483.2683499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:00Z","timestamp":1750227180000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2683483.2683499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,14]]},"references-count":34,"alternative-id":["10.1145\/2683483.2683499","10.1145\/2683483"],"URL":"https:\/\/doi.org\/10.1145\/2683483.2683499","relation":{},"subject":[],"published":{"date-parts":[[2014,12,14]]},"assertion":[{"value":"2014-12-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}