{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KFMXNEHBC7NQXAR4ZO3YH4NTKD","short_pith_number":"pith:KFMXNEHB","schema_version":"1.0","canonical_sha256":"51597690e117db0b823ccbb783f1b350cca00f8f16ef3a772f8b5f2ae9217020","source":{"kind":"arxiv","id":"1704.06018","version":1},"attestation_state":"computed","paper":{"title":"A Fuzzy Brute Force Matching Method for Binary Image Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Betul Bostanci, Erkan Bostanci, Mehmet Serdar Guzel, Nadia Kanwal","submitted_at":"2017-04-20T05:29:06Z","abstract_excerpt":"Matching of binary image features is an important step in many different computer vision applications. Conventionally, an arbitrary threshold is used to identify a correct match from incorrect matches using Hamming distance which may improve or degrade the matching results for different input images. This is mainly due to the image content which is affected by the scene, lighting and imaging conditions. This paper presents a fuzzy logic based approach for brute force matching of image features to overcome this situation. The method was tested using a well-known image database with known ground"},"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":"1704.06018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-20T05:29:06Z","cross_cats_sorted":[],"title_canon_sha256":"50d531c92f0cfccbe26e53f9e29813d19c2a31e2b159bf065c6dd82d98692051","abstract_canon_sha256":"8188e57796f76ad3773a918704ac0475917328876f3710cb38333e5e488f3b7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.517824Z","signature_b64":"DKryE42wDf8NjtV6y08LGqw/wUnq6cdCivn3aMMo1lCnk7VZ4cQadt68t9EBCetIQgUoqW0rXIerAX7dNGQzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51597690e117db0b823ccbb783f1b350cca00f8f16ef3a772f8b5f2ae9217020","last_reissued_at":"2026-05-18T00:46:03.516772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.516772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fuzzy Brute Force Matching Method for Binary Image Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Betul Bostanci, Erkan Bostanci, Mehmet Serdar Guzel, Nadia Kanwal","submitted_at":"2017-04-20T05:29:06Z","abstract_excerpt":"Matching of binary image features is an important step in many different computer vision applications. Conventionally, an arbitrary threshold is used to identify a correct match from incorrect matches using Hamming distance which may improve or degrade the matching results for different input images. This is mainly due to the image content which is affected by the scene, lighting and imaging conditions. This paper presents a fuzzy logic based approach for brute force matching of image features to overcome this situation. The method was tested using a well-known image database with known ground"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06018","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":"1704.06018","created_at":"2026-05-18T00:46:03.516882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06018v1","created_at":"2026-05-18T00:46:03.516882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06018","created_at":"2026-05-18T00:46:03.516882+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFMXNEHBC7NQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFMXNEHBC7NQXAR4","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFMXNEHB","created_at":"2026-05-18T12:31:24.725408+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/KFMXNEHBC7NQXAR4ZO3YH4NTKD","json":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD.json","graph_json":"https://pith.science/api/pith-number/KFMXNEHBC7NQXAR4ZO3YH4NTKD/graph.json","events_json":"https://pith.science/api/pith-number/KFMXNEHBC7NQXAR4ZO3YH4NTKD/events.json","paper":"https://pith.science/paper/KFMXNEHB"},"agent_actions":{"view_html":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD","download_json":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD.json","view_paper":"https://pith.science/paper/KFMXNEHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06018&json=true","fetch_graph":"https://pith.science/api/pith-number/KFMXNEHBC7NQXAR4ZO3YH4NTKD/graph.json","fetch_events":"https://pith.science/api/pith-number/KFMXNEHBC7NQXAR4ZO3YH4NTKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD/action/storage_attestation","attest_author":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD/action/author_attestation","sign_citation":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD/action/citation_signature","submit_replication":"https://pith.science/pith/KFMXNEHBC7NQXAR4ZO3YH4NTKD/action/replication_record"}},"created_at":"2026-05-18T00:46:03.516882+00:00","updated_at":"2026-05-18T00:46:03.516882+00:00"}