{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T06:05:39Z","timestamp":1768457139773,"version":"3.49.0"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030012397","type":"print"},{"value":"9783030012403","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01240-3_5","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T04:36:08Z","timestamp":1538800568000},"page":"68-85","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["A Scalable Exemplar-Based Subspace Clustering Algorithm for Class-Imbalanced Data"],"prefix":"10.1007","author":[{"given":"Chong","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel P.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MSP.2010.939739","volume":"28","author":"R Vidal","year":"2011","unstructured":"Vidal, R.: Subspace clustering. IEEE Signal Process. Mag. 28(3), 52\u201368 (2011)","journal-title":"IEEE Signal Process. Mag."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2790\u20132797 (2009)","DOI":"10.1109\/CVPR.2009.5206547"},{"issue":"11","key":"5_CR4","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.1214\/12-AOS1034","volume":"40","author":"M Soltanolkotabi","year":"2012","unstructured":"Soltanolkotabi, M., Cand\u00e8s, E.J.: A geometric analysis of subspace clustering with outliers. Ann. Stat. 40(4), 2195\u20132238 (2012)","journal-title":"Ann. Stat."},{"key":"5_CR6","unstructured":"You, C., Vidal, R.: Geometric conditions for subspace-sparse recovery. In: International Conference on Machine Learning, pp. 1585\u20131593 (2015)"},{"issue":"12","key":"5_CR7","first-page":"1","volume":"17","author":"YX Wang","year":"2016","unstructured":"Wang, Y.X., Xu, H.: Noisy sparse subspace clustering. J. Mach. Learn. Res. 17(12), 1\u201341 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"You, C., Robinson, D., Vidal, R.: Provable self-representation based outlier detection in a union of subspaces. In: IEEE Conference on Computer Vision and Pattern Recognition (2017)","DOI":"10.1109\/CVPR.2017.460"},{"key":"5_CR9","unstructured":"Liu, G., Lin, Z., Yu, Y.: Robust subspace segmentation by low-rank representation. In: International Conference on Machine Learning, pp. 663\u2013670 (2010)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-33786-4_26","volume-title":"Computer Vision \u2013 ECCV 2012","author":"C-Y Lu","year":"2012","unstructured":"Lu, C.-Y., Min, H., Zhao, Z.-Q., Zhu, L., Huang, D.-S., Yan, S.: Robust and efficient subspace segmentation via least squares regression. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7578, pp. 347\u2013360. Springer, Heidelberg (2012). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-33786-4_26"},{"issue":"1","key":"5_CR11","first-page":"2487","volume":"14","author":"EL Dyer","year":"2013","unstructured":"Dyer, E.L., Sankaranarayanan, A.C., Baraniuk, R.G.: Greedy feature selection for subspace clustering. J. Mach. Learn. Res. 14(1), 2487\u20132517 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"You, C., Li, C.G., Robinson, D., Vidal, R.: Oracle based active set algorithm for scalable elastic net subspace clustering. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 3928\u20133937 (2016)","DOI":"10.1109\/CVPR.2016.426"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-319-46475-6_45","volume-title":"Computer Vision \u2013 ECCV 2016","author":"Y Yang","year":"2016","unstructured":"Yang, Y., Feng, J., Jojic, N., Yang, J., Huang, T.S.: $$\\ell ^{0}$$-sparse subspace clustering. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9906, pp. 731\u2013747. Springer, Cham (2016). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-46475-6_45"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/TSP.2017.2762279","volume":"66","author":"B Xin","year":"2018","unstructured":"Xin, B., Wang, Y., Gao, W., Wipf, D.: Building invariances into sparse subspace clustering. IEEE Trans. Signal Process. 66(2), 449\u2013462 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"You, C., Donnat, C., Robinson, D., Vidal, R.: A divide-and-conquer framework for large-scale subspace clustering. In: Asilomar Conference on Signals, Systems and Computers (2016)","DOI":"10.1109\/ACSSC.2016.7869521"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-01240-3_5","volume-title":"Computer Vision \u2013 ECCV 2018","author":"Chong You","year":"2018","unstructured":"You, C., Li, C., Robinson, D., Vidal, R.: A scalable exemplar-based subspace clustering algorithm for class-imbalanced data (2018)"},{"issue":"11","key":"5_CR17","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.M.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311\u20134322 (2006)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"5_CR18","first-page":"1","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. J. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2012)","journal-title":"J. Found. Trends Mach. Learn."},{"issue":"10","key":"5_CR19","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1109\/TNNLS.2014.2374631","volume":"26","author":"A Adler","year":"2015","unstructured":"Adler, A., Elad, M., Hel-Or, Y.: Linear-time subspace clustering via bipartite graph modeling. IEEE Trans. Neural Netw. Learn. Syst. 26(10), 2234\u20132246 (2015)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1109\/TSP.2017.2781649","volume":"66","author":"PA Traganitis","year":"2017","unstructured":"Traganitis, P.A., Giannakis, G.B.: Sketched subspace clustering. IEEE Trans. Signal Process. 66, 1663\u20131675 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.sigpro.2005.05.030","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A., Gilbert, A.C., Strauss, M.J.: Algorithms for simultaneous sparse approximation. Part I: greedy pursuit. Signal Process. 86(3), 572\u2013588 (2006)","journal-title":"Signal Process."},{"issue":"5","key":"5_CR22","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1109\/JSTSP.2011.2161862","volume":"5","author":"V Cevher","year":"2011","unstructured":"Cevher, V., Krause, A.: Greedy dictionary selection for sparse representation. IEEE J. Sel. Top. Signal Process. 5(5), 979\u2013988 (2011)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"5_CR23","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv preprint arXiv:1102.3975 (2011)"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.sigpro.2005.05.031","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Algorithms for simultaneous sparse approximation. Part II: convex relaxation. Signal Process. 86, 589\u2013602 (2006). Special Issue on Sparse approximations in signal and image processing","journal-title":"Signal Process."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Cong, Y., Yuan, J., Liu, J.: Sparse reconstruction cost for abnormal event detection. In: The 24th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, Colorado Springs, CO, USA, 20\u201325 June 2011, pp. 3449\u20133456 (2011)","DOI":"10.1109\/CVPR.2011.5995434"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Sapiro, G., Vidal, R.: See all by looking at a few: sparse modeling for finding representative objects. In: IEEE Conference on Computer Vision and Pattern Recognition (2012)","DOI":"10.1109\/CVPR.2012.6247852"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Meng, J., Wang, H., Yuan, J., Tan, Y.P.: From keyframes to key objects: video summarization by representative object proposal selection. In: CVPR, pp. 1039\u20131048 (2016)","DOI":"10.1109\/CVPR.2016.118"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.patcog.2016.10.014","volume":"63","author":"H Wang","year":"2017","unstructured":"Wang, H., Kawahara, Y., Weng, C., Yuan, J.: Representative selection with structured sparsity. Pattern Recognit. 63, 268\u2013278 (2017)","journal-title":"Pattern Recognit."},{"issue":"1","key":"5_CR29","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/TMM.2011.2166951","volume":"14","author":"Y Cong","year":"2012","unstructured":"Cong, Y., Yuan, J., Luo, J.: Towards scalable summarization of consumer videos via sparse dictionary selection. IEEE Trans. Multimed. 14(1), 66\u201375 (2012)","journal-title":"IEEE Trans. Multimed."},{"key":"5_CR30","unstructured":"Borodin, A.: Determinantal point processes. arXiv preprint arXiv:0911.1153 (2009)"},{"key":"5_CR31","unstructured":"Gillenwater, J.A., Kulesza, A., Fox, E., Taskar, B.: Expectation-maximization for learning determinantal point processes. In: NIPS, pp. 3149\u20133157 (2014)"},{"key":"5_CR32","unstructured":"Kulesza, A., Taskar, B.: k-DPPs: Fixed-size determinantal point processes. In: ICML, pp. 1193\u20131200 (2011)"},{"key":"5_CR33","first-page":"67","volume":"88\u201389","author":"T Chan","year":"1987","unstructured":"Chan, T.: Rank revealing QR factorizations. Linear Algebra Appl. 88\u201389, 67\u201382 (1987)","journal-title":"Linear Algebra Appl."},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/1.9781611973068.105","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christos Boutsidis","year":"2009","unstructured":"Boutsidis, C., Mahoney, M.W., Drineas, P.: An improved approximation algorithm for the column subset selection problem. In: Proceedings of SODA, pp. 968\u2013977 (2009)"},{"key":"5_CR35","unstructured":"Altschuler, J., Bhaskara, A., Fu, G., Mirrokni, V., Rostamizadeh, A., Zadimoghaddam, M.: Greedy column subset selection: new bounds and distributed algorithms. In: International Conference on Machine Learning, pp. 2539\u20132548 (2016)"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Arora, S., Ge, R., Kannan, R., Moitra, A.: Computing a nonnegative matrix factorization\u2013provably. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 145\u2013162. ACM (2012)","DOI":"10.1145\/2213977.2213994"},{"key":"5_CR37","unstructured":"Kumar, A., Sindhwani, V., Kambadur, P.: Fast conical hull algorithms for near-separable non-negative matrix factorization. In: Proceedings of the 30th International Conference on Machine Learning, ICML, pp. 231\u2013239 (2013)"},{"key":"5_CR38","unstructured":"Elhamifar, E., Sapiro, G., Vidal, R.: Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery. In: Neural Information Processing and Systems (2012)"},{"key":"5_CR39","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.acha.2017.08.006","volume":"45","author":"A Aldroubi","year":"2017","unstructured":"Aldroubi, A., Sekmen, A., Koku, A.B., Cakmak, A.F.: Similarity matrix framework for data from union of subspaces. Appl. Comput. Harmon. Anal. 45, 425\u2013435 (2017)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"5_CR40","unstructured":"Aldroubi, A., Hamm, K., Koku, A.B., Sekmen, A.: CUR decompositions, similarity matrices, and subspace clustering. arXiv preprint arXiv:1711.04178 (2017)"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Abdolali, M., Gillis, N., Rahmati, M.: Scalable and robust sparse subspace clustering using randomized clustering and multilayer graphs. arXiv preprint arXiv:1802.07648 (2018)","DOI":"10.1016\/j.sigpro.2019.05.017"},{"key":"5_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"5_CR43","unstructured":"Vershynin, R.: Lectures in geometric functional analysis (2009)"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Donoho, D.L.: Neighborly polytopes and sparse solution of underdetermined linear equations. Technical report. Stanford University (2005)","DOI":"10.1073\/pnas.0502269102"},{"key":"5_CR45","first-page":"40","volume":"50","author":"LF Toth","year":"1943","unstructured":"Toth, L.F.: On covering a spherical surface with equal spherical caps. Matematikai Fiz. Lapok 50, 40\u201346 (1943). (in Hungarian)","journal-title":"Matematikai Fiz. Lapok"},{"key":"5_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0963-8","volume-title":"Unsolved Problems in Geometry","author":"HT Croft","year":"1991","unstructured":"Croft, H.T., Guy, R.K., Falconer, K.J.: Unsolved Problems in Geometry. Springer, New York (1991). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-1-4612-0963-8"},{"issue":"1","key":"5_CR47","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11263-007-0099-z","volume":"79","author":"R Vidal","year":"2008","unstructured":"Vidal, R., Tron, R., Hartley, R.: Multiframe motion segmentation with missing data using PowerFactorization, and GPCA. Int. J. Comput. Vis. 79(1), 85\u2013105 (2008)","journal-title":"Int. J. Comput. Vis."},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"You, C., Robinson, D., Vidal, R.: Scalable sparse subspace clustering by orthogonal matching pursuit. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 3918\u20133927 (2016)","DOI":"10.1109\/CVPR.2016.425"},{"issue":"2","key":"5_CR49","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Ann. Stat. 32(2), 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"5_CR50","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19\u201360 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR51","unstructured":"Vedaldi, A., Fulkerson, B.: VLFeat: an open and portable library of computer vision algorithms (2008). https:\/\/2.zoppoz.workers.dev:443\/http\/www.vlfeat.org\/"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Cohen, G., Afshar, S., Tapson, J., van Schaik, A.: EMNIST: an extension of MNIST to handwritten letters. arXiv preprint arXiv:1702.05373 (2017)","DOI":"10.1109\/IJCNN.2017.7966217"},{"issue":"8","key":"5_CR53","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/TPAMI.2012.230","volume":"35","author":"J Bruna","year":"2013","unstructured":"Bruna, J., Mallat, S.: Invariant scattering convolution networks. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1872\u20131886 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"5_CR54","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.neunet.2012.02.016","volume":"32","author":"J Stallkamp","year":"2012","unstructured":"Stallkamp, J., Schlipsing, M., Salmen, J., Igel, C.: Man vs. computer: benchmarking machine learning algorithms for traffic sign recognition. Neural Netw. 32, 323\u2013332 (2012)","journal-title":"Neural Netw."},{"key":"5_CR55","unstructured":"Dalal, N., Triggs, B.: Histograms of oriented gradients for human detection. In: IEEE Conference on Computer Vision and Pattern Recognition (2005)"},{"issue":"2","key":"5_CR56","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/TPAMI.2003.1177153","volume":"25","author":"R Basri","year":"2003","unstructured":"Basri, R., Jacobs, D.: Lambertian reflection and linear subspaces. IEEE Trans. Pattern Anal. Mach. Intell. 25(2), 218\u2013233 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"5_CR57","doi-asserted-by":"publisher","first-page":"6320","DOI":"10.1109\/TIT.2015.2472520","volume":"61","author":"R Heckel","year":"2015","unstructured":"Heckel, R., B\u00f6lcskei, H.: Robust subspace clustering via thresholding. IEEE Trans. Inf. Theory 61(11), 6320\u20136342 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR58","unstructured":"Shen, J., Li, P., Xu, H.: Online low-rank subspace clustering by basis dictionary pursuit. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 622\u2013631 (2016)"},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Brodersen, K.H., Ong, C.S., Stephan, K.E., Buhmann, J.M.: The balanced accuracy and its posterior distribution. In: 2010 20th International Conference on Pattern Recognition, ICPR, pp. 3121\u20133124. IEEE (2010)","DOI":"10.1109\/ICPR.2010.764"},{"key":"5_CR60","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"5_CR61","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park, H.S., Jun, C.H.: A simple and fast algorithm for K-medoids clustering. Expert Syst. Appl. 36(2), 3336\u20133341 (2009)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01240-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T01:24:55Z","timestamp":1665019495000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-030-01240-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030012397","9783030012403"],"references-count":61,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-01240-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"5 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/eccv2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}