{"doi":"10.1109/cvpr.2010.5539928","extern":"1","type":"conference","date_created":"2024-10-15T11:20:54Z","month":"08","date_updated":"2024-12-02T14:00:22Z","scopus_import":"1","page":"3594 - 3601","author":[{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander"},{"first_name":"Fabrice","full_name":"Michel, Fabrice","last_name":"Michel"},{"full_name":"Paragios, Nikos","first_name":"Nikos","last_name":"Paragios"}],"publication_identifier":{"issn":["1063-6919 "]},"year":"2010","oa_version":"None","date_published":"2010-08-05T00:00:00Z","title":"Data fusion through cross-modality metric learning using similarity-sensitive hashing","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publisher":"IEEE","language":[{"iso":"eng"}],"publication_status":"published","publication":"2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","conference":{"name":"2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","location":"San Francisco, CA, USA","start_date":"2010-06-13","end_date":"2010-06-18"},"status":"public","day":"05","_id":"18376","citation":{"ista":"Bronstein MM, Bronstein AM, Michel F, Paragios N. 2010. Data fusion through cross-modality metric learning using similarity-sensitive hashing. 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 3594–3601.","short":"M.M. Bronstein, A.M. Bronstein, F. Michel, N. Paragios, in:, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2010, pp. 3594–3601.","ieee":"M. M. Bronstein, A. M. Bronstein, F. Michel, and N. Paragios, “Data fusion through cross-modality metric learning using similarity-sensitive hashing,” in 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Francisco, CA, USA, 2010, pp. 3594–3601.","ama":"Bronstein MM, Bronstein AM, Michel F, Paragios N. Data fusion through cross-modality metric learning using similarity-sensitive hashing. In: 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE; 2010:3594-3601. doi:10.1109/cvpr.2010.5539928","mla":"Bronstein, Michael M., et al. “Data Fusion through Cross-Modality Metric Learning Using Similarity-Sensitive Hashing.” 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2010, pp. 3594–601, doi:10.1109/cvpr.2010.5539928.","apa":"Bronstein, M. M., Bronstein, A. M., Michel, F., & Paragios, N. (2010). Data fusion through cross-modality metric learning using similarity-sensitive hashing. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 3594–3601). San Francisco, CA, USA: IEEE. https://doi.org/10.1109/cvpr.2010.5539928","chicago":"Bronstein, Michael M., Alex M. Bronstein, Fabrice Michel, and Nikos Paragios. “Data Fusion through Cross-Modality Metric Learning Using Similarity-Sensitive Hashing.” In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 3594–3601. IEEE, 2010. https://doi.org/10.1109/cvpr.2010.5539928."},"article_processing_charge":"No","quality_controlled":"1","abstract":[{"lang":"eng","text":"Visual understanding is often based on measuring similarity between observations. Learning similarities specific to a certain perception task from a set of examples has been shown advantageous in various computer vision and pattern recognition problems. In many important applications, the data that one needs to compare come from different representations or modalities, and the similarity between such data operates on objects that may have different and often incommensurable structure and dimensionality. In this paper, we propose a framework for supervised similarity learning based on embedding the input data from two arbitrary spaces into the Hamming space. The mapping is expressed as a binary classification problem with positive and negative examples, and can be efficiently learned using boosting algorithms. The utility and efficiency of such a generic approach is demonstrated on several challenging applications including cross-representation shape retrieval and alignment of multi-modal medical images."}]}