{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00094695","sets":["934:1162:7067"]},"path":["7067"],"owner":"11","recid":"94695","title":["Sparse Isotropic Hashing"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-07-29"},"_buckets":{"deposit":"81592205-2825-4a04-9ea5-bf9ad0da3ecf"},"_deposit":{"id":"94695","pid":{"type":"depid","value":"94695","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Sparse Isotropic Hashing","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Sparse Isotropic Hashing"},{"subitem_title":"Sparse Isotropic Hashing","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[Regular Paper - Express Paper] binary codes, nearest neighbor search, local descriptors, sparse matrix","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2013-07-29","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Denso IT Laboratory, Inc."},{"subitem_text_value":"Denso IT Laboratory, Inc."},{"subitem_text_value":"Denso IT Laboratory, Inc."}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Denso IT Laboratory, Inc.","subitem_text_language":"en"},{"subitem_text_value":"Denso IT Laboratory, Inc.","subitem_text_language":"en"},{"subitem_text_value":"Denso IT Laboratory, Inc.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/94695/files/IPSJ-TCVA0500007.pdf"},"date":[{"dateType":"Available","dateValue":"2013-07-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TCVA0500007.pdf","filesize":[{"value":"376.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"20"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"63c82857-759d-4208-ab4f-c078ab0df1aa","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ikuro, Sato"},{"creatorName":"Mitsuru, Ambai"},{"creatorName":"Koichiro, Suzuki"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ikuro, Sato","creatorNameLang":"en"},{"creatorName":"Mitsuru, Ambai","creatorNameLang":"en"},{"creatorName":"Koichiro, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6695","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"This paper address the problem of binary coding of real vectors for efficient similarity computations. It has been argued that orthogonal transformation of center-subtracted vectors followed by sign function produces binary codes which well preserve similarities in the original space, especially when orthogonally transformed vectors have covariance matrix with equal diagonal elements. We propose a simple hashing algorithm that can orthogonally transform an arbitrary covariance matrix to the one with equal diagonal elements. We further expand this method to make the projection matrix sparse, which yield faster coding. It is demonstrated that proposed methods have comparable level of similarity preservation to the existing methods.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper address the problem of binary coding of real vectors for efficient similarity computations. It has been argued that orthogonal transformation of center-subtracted vectors followed by sign function produces binary codes which well preserve similarities in the original space, especially when orthogonally transformed vectors have covariance matrix with equal diagonal elements. We propose a simple hashing algorithm that can orthogonally transform an arbitrary covariance matrix to the one with equal diagonal elements. We further expand this method to make the projection matrix sparse, which yield faster coding. It is demonstrated that proposed methods have comparable level of similarity preservation to the existing methods.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"44","bibliographic_titles":[{"bibliographic_title":"IPSJ Transactions on Computer Vision and Applications （CVA）"}],"bibliographicPageStart":"40","bibliographicIssueDates":{"bibliographicIssueDate":"2013-07-29","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"5"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":94695,"updated":"2025-01-21T14:27:08.832887+00:00","links":{},"created":"2025-01-18T23:41:57.735977+00:00"}