{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:47:19Z","timestamp":1749804439839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319105833"},{"type":"electronic","value":"9783319105840"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10584-0_17","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T11:40:08Z","timestamp":1408016408000},"page":"250-264","source":"Crossref","is-referenced-by-count":33,"title":["Graph Cuts for Supervised Binary Coding"],"prefix":"10.1007","author":[{"given":"Tiezheng","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiming","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Agarwala, A., Dontcheva, M., Agrawala, M., Drucker, S., Colburn, A., Curless, B., Salesin, D., Cohen, M.: Interactive digital photomontage. In: SIGGRAPH (2004)","key":"17_CR1","DOI":"10.1145\/1186562.1015718"},{"doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468 (2006)","key":"17_CR2","DOI":"10.1109\/FOCS.2006.49"},{"doi-asserted-by":"crossref","unstructured":"Blake, A., Kohli, P., Rother, C.: Markov random fields for vision and image processing. The MIT Press (2011)","key":"17_CR3","DOI":"10.7551\/mitpress\/8579.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. TPAMI (2004)","key":"17_CR4","DOI":"10.1109\/TPAMI.2004.60"},{"doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: ICCV (1999)","key":"17_CR5","DOI":"10.1109\/ICCV.1999.791245"},{"doi-asserted-by":"crossref","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Machine Learning, 273\u2013297 (1995)","key":"17_CR6","DOI":"10.1007\/BF00994018"},{"unstructured":"Fan, R.E., Chang, K.W., Hsieh, C.J., Wang, X.R., Lin, C.J.: Liblinear: A library for large linear classification. JMLR, 1871\u20131874 (2008)","key":"17_CR7"},{"doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: CVPR (2013)","key":"17_CR8","DOI":"10.1109\/CVPR.2013.379"},{"doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. TPAMI (2014)","key":"17_CR9","DOI":"10.1109\/TPAMI.2013.240"},{"doi-asserted-by":"crossref","unstructured":"Gong, Y., Lazebnik, S.: Iterative quantization: A procrustean approach to learning binary codes. In: CVPR (2011)","key":"17_CR10","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"17_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T.J. Hastie","year":"2009","unstructured":"Hastie, T.J., Tibshirani, R.J., Friedman, J.H.: The Elements of Statistical Learning. Springer, New York (2009)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-33709-3_2","volume-title":"Computer Vision \u2013 ECCV 2012","author":"K. He","year":"2012","unstructured":"He, K., Sun, J.: Statistics of patch offsets for image completion. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part II. LNCS, vol.\u00a07573, pp. 16\u201329. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"He, K., Wen, F., Sun, J.: K-means Hashing: an Affinity-Preserving Quantization Method for Learning Binary Compact Codes. In: CVPR (2013)","key":"17_CR13","DOI":"10.1109\/CVPR.2013.378"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","key":"17_CR14","DOI":"10.1145\/276698.276876"},{"doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts-a review. TPAMI (2007)","key":"17_CR15","DOI":"10.1109\/TPAMI.2007.1031"},{"unstructured":"Krizhevsky, A.: Cifar-10, \n                    \n                      http:\/\/www.cs.toronto.edu\/~kriz\/cifar.html","key":"17_CR16"},{"unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.: Imagenet classification with deep convolutional neural networks (2012)","key":"17_CR17"},{"unstructured":"Kulis, B., Darrell, T.: Learning to hash with binary reconstructive embeddings. In: NIPS, pp. 1042\u20131050 (2009)","key":"17_CR18"},{"doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: ICCV (2009)","key":"17_CR19","DOI":"10.1109\/ICCV.2009.5459466"},{"doi-asserted-by":"crossref","unstructured":"Kwatra, V., Sch\u00f6dl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: image and video synthesis using graph cuts. In: SIGGRAPH, pp. 277\u2013286 (2003)","key":"17_CR20","DOI":"10.1145\/882262.882264"},{"unstructured":"Liu, W., Wang, J., Ji, R., Jiang, Y.-G., Chang, S.-F.: Supervised hashing with kernels. In: CVPR (2012)","key":"17_CR21"},{"unstructured":"Liu, W.: Large-Scale Machine Learning for Classification and Search. Ph.D. thesis, Columbia University (2012)","key":"17_CR22"},{"unstructured":"Liu, W., Wang, J., Kumar, S., Chang, S.-F.: Hashing with graphs. In: ICML (2011)","key":"17_CR23"},{"doi-asserted-by":"crossref","unstructured":"Norouzi, M., Fleet, D.: Cartesian k-means. In: CVPR (2013)","key":"17_CR24","DOI":"10.1109\/CVPR.2013.388"},{"unstructured":"Norouzi, M.E., Fleet, D.J.: Minimal loss hashing for compact binary codes. In: ICML, pp. 353\u2013360 (2011)","key":"17_CR25"},{"unstructured":"Oliva, A., Torralba, A.: Modeling the shape of the scene: a holistic representation of the spatial envelope. IJCV (2001)","key":"17_CR26"},{"doi-asserted-by":"crossref","unstructured":"Pritch, Y., Kav-Venaki, E., Peleg, S.: Shift-map image editing. In: ICCV (2009)","key":"17_CR27","DOI":"10.1109\/ICCV.2009.5459159"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1007\/978-3-642-33783-3_63","volume-title":"Computer Vision \u2013 ECCV 2012","author":"M. Rastegari","year":"2012","unstructured":"Rastegari, M., Farhadi, A., Forsyth, D.: Attribute discovery via predictable discriminative binary codes. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part VI. LNCS, vol.\u00a07577, pp. 876\u2013889. Springer, Heidelberg (2012)"},{"unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 7\u201342 (2002)","key":"17_CR29"},{"doi-asserted-by":"crossref","unstructured":"Shen, F., Shen, C., Shi, Q., van den Hengel, A., Tang, Z.: Inductive hashing on manifolds. In: CVPR (2013)","key":"17_CR30","DOI":"10.1109\/CVPR.2013.205"},{"doi-asserted-by":"crossref","unstructured":"Tan, R.T.: Visibility in bad weather from a single image. In: CVPR, pp. 1\u20138 (2008)","key":"17_CR31","DOI":"10.1109\/CVPR.2008.4587643"},{"doi-asserted-by":"crossref","unstructured":"Torralba, A.B., Fergus, R., Weiss, Y.: Small codes and large image databases for recognition. In: CVPR (2008)","key":"17_CR32","DOI":"10.1109\/CVPR.2008.4587633"},{"doi-asserted-by":"crossref","unstructured":"Vedaldi, A., Fulkerson, B.: Vlfeat: An open and portable library of computer vision algorithms. In: Proceedings of the International Conference on Multimedia, pp. 1469\u20131472. ACM (2010)","key":"17_CR33","DOI":"10.1145\/1873951.1874249"},{"doi-asserted-by":"crossref","unstructured":"Vedaldi, A., Zisserman, A.: Efficient additive kernels via explicit feature maps. TPAMI, 480\u2013492 (2012)","key":"17_CR34","DOI":"10.1109\/TPAMI.2011.153"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Kumar, S., Chang, S.-F.: Semi-supervised hashing for scalable image retrieval. In: CVPR (2010)","key":"17_CR35","DOI":"10.1109\/CVPR.2010.5539994"},{"unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, pp. 1753\u20131760 (2008)","key":"17_CR36"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10584-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T09:50:01Z","timestamp":1575280201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10584-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319105833","9783319105840"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10584-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}