{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HT72X6HJJCPM2DBJZSHWJEDLBC","short_pith_number":"pith:HT72X6HJ","schema_version":"1.0","canonical_sha256":"3cffabf8e9489ecd0c29cc8f64906b08bed1696d03d97609503ff1f35be65d70","source":{"kind":"arxiv","id":"1707.05062","version":2},"attestation_state":"computed","paper":{"title":"Speeding up the K\\\"ohler's method of contrast thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.CV","authors_text":"Guillaume Noyel (IPRI, SIGPH@iPRI)","submitted_at":"2017-07-17T09:41:04Z","abstract_excerpt":"K{\\\"o}hler's method is a useful multi-thresholding technique based on boundary contrast. However, the direct algorithm has a too high complexity-O(N 2) i.e. quadratic with the pixel numbers N-to process images at a sufficient speed for practical applications. In this paper, a new algorithm to speed up K{\\\"o}hler's method is introduced with a complexity in O(N M), M is the number of grey levels. The proposed algorithm is designed for parallelisation and vector processing , which are available in current processors, using OpenMP (Open Multi-Processing) and SIMD instructions (Single Instruction o"},"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":"1707.05062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-17T09:41:04Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"cb191bc0857f5bc655d4c3254d1d4722450fd289f9583e0ede591636ad131aaf","abstract_canon_sha256":"da757ffe2d97b55f92534439ef089659434cc5a1be47889e5f7b8641856eecad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:52.987869Z","signature_b64":"OcxXaaMkIHCFJq+MfVce4tz1pfyE7h1tCiLnm1C0I4kdFkxNU+YlTqrfJI3J+k5q5qddfClWCUu2phhkInxxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cffabf8e9489ecd0c29cc8f64906b08bed1696d03d97609503ff1f35be65d70","last_reissued_at":"2026-05-17T23:47:52.987275Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:52.987275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding up the K\\\"ohler's method of contrast thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.CV","authors_text":"Guillaume Noyel (IPRI, SIGPH@iPRI)","submitted_at":"2017-07-17T09:41:04Z","abstract_excerpt":"K{\\\"o}hler's method is a useful multi-thresholding technique based on boundary contrast. However, the direct algorithm has a too high complexity-O(N 2) i.e. quadratic with the pixel numbers N-to process images at a sufficient speed for practical applications. In this paper, a new algorithm to speed up K{\\\"o}hler's method is introduced with a complexity in O(N M), M is the number of grey levels. The proposed algorithm is designed for parallelisation and vector processing , which are available in current processors, using OpenMP (Open Multi-Processing) and SIMD instructions (Single Instruction o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05062","kind":"arxiv","version":2},"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":"1707.05062","created_at":"2026-05-17T23:47:52.987372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05062v2","created_at":"2026-05-17T23:47:52.987372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05062","created_at":"2026-05-17T23:47:52.987372+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT72X6HJJCPM","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT72X6HJJCPM2DBJ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT72X6HJ","created_at":"2026-05-18T12:31:18.294218+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/HT72X6HJJCPM2DBJZSHWJEDLBC","json":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC.json","graph_json":"https://pith.science/api/pith-number/HT72X6HJJCPM2DBJZSHWJEDLBC/graph.json","events_json":"https://pith.science/api/pith-number/HT72X6HJJCPM2DBJZSHWJEDLBC/events.json","paper":"https://pith.science/paper/HT72X6HJ"},"agent_actions":{"view_html":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC","download_json":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC.json","view_paper":"https://pith.science/paper/HT72X6HJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05062&json=true","fetch_graph":"https://pith.science/api/pith-number/HT72X6HJJCPM2DBJZSHWJEDLBC/graph.json","fetch_events":"https://pith.science/api/pith-number/HT72X6HJJCPM2DBJZSHWJEDLBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC/action/storage_attestation","attest_author":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC/action/author_attestation","sign_citation":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC/action/citation_signature","submit_replication":"https://pith.science/pith/HT72X6HJJCPM2DBJZSHWJEDLBC/action/replication_record"}},"created_at":"2026-05-17T23:47:52.987372+00:00","updated_at":"2026-05-17T23:47:52.987372+00:00"}