{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RX3KT7DVLOP4UZYOJFMIYHXYDT","short_pith_number":"pith:RX3KT7DV","schema_version":"1.0","canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","source":{"kind":"arxiv","id":"1709.05833","version":1},"attestation_state":"computed","paper":{"title":"Beyond SIFT using Binary features for Loop Closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guyue Zhou, Lan Xu, Lei Han, Lu Fang","submitted_at":"2017-09-18T09:36:13Z","abstract_excerpt":"In this paper a binary feature based Loop Closure Detection (LCD) method is proposed, which for the first time achieves higher precision-recall (PR) performance compared with state-of-the-art SIFT feature based approaches. The proposed system originates from our previous work Multi-Index hashing for Loop closure Detection (MILD), which employs Multi-Index Hashing (MIH)~\\cite{greene1994multi} for Approximate Nearest Neighbor (ANN) search of binary features. As the accuracy of MILD is limited by repeating textures and inaccurate image similarity measurement, burstiness handling is introduced to "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.05833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-18T09:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"1834887a42d20f3928f1cd3a4659c75b82c586acfe7d189be1a95e86b681a362","abstract_canon_sha256":"7a79a922dee0fe9a38c8badf9af1cd320a268e3148d5bd1fb718f9391e2c459f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:59.201605Z","signature_b64":"kNfscR96QEOz4iRYtW5xQZvX/7ND94lUmzi+NCoW3xzLEz7aSS0oEosYNIeXfyRjI4J/NBdJCNDIsPy1V8ulDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df6a9fc755b9fca670e49588c1ef81ceca327e400a41bece4bcf3ea2954d0a7","last_reissued_at":"2026-05-18T00:34:59.200880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:59.200880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond SIFT using Binary features for Loop Closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guyue Zhou, Lan Xu, Lei Han, Lu Fang","submitted_at":"2017-09-18T09:36:13Z","abstract_excerpt":"In this paper a binary feature based Loop Closure Detection (LCD) method is proposed, which for the first time achieves higher precision-recall (PR) performance compared with state-of-the-art SIFT feature based approaches. The proposed system originates from our previous work Multi-Index hashing for Loop closure Detection (MILD), which employs Multi-Index Hashing (MIH)~\\cite{greene1994multi} for Approximate Nearest Neighbor (ANN) search of binary features. As the accuracy of MILD is limited by repeating textures and inaccurate image similarity measurement, burstiness handling is introduced to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05833","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.05833","created_at":"2026-05-18T00:34:59.200977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05833v1","created_at":"2026-05-18T00:34:59.200977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05833","created_at":"2026-05-18T00:34:59.200977+00:00"},{"alias_kind":"pith_short_12","alias_value":"RX3KT7DVLOP4","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RX3KT7DVLOP4UZYO","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RX3KT7DV","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT","json":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT.json","graph_json":"https://pith.science/api/pith-number/RX3KT7DVLOP4UZYOJFMIYHXYDT/graph.json","events_json":"https://pith.science/api/pith-number/RX3KT7DVLOP4UZYOJFMIYHXYDT/events.json","paper":"https://pith.science/paper/RX3KT7DV"},"agent_actions":{"view_html":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT","download_json":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT.json","view_paper":"https://pith.science/paper/RX3KT7DV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05833&json=true","fetch_graph":"https://pith.science/api/pith-number/RX3KT7DVLOP4UZYOJFMIYHXYDT/graph.json","fetch_events":"https://pith.science/api/pith-number/RX3KT7DVLOP4UZYOJFMIYHXYDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/action/storage_attestation","attest_author":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/action/author_attestation","sign_citation":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/action/citation_signature","submit_replication":"https://pith.science/pith/RX3KT7DVLOP4UZYOJFMIYHXYDT/action/replication_record"}},"created_at":"2026-05-18T00:34:59.200977+00:00","updated_at":"2026-05-18T00:34:59.200977+00:00"}