{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LOJR6TYJ6PBK4W5B5GOCHLRVTN","short_pith_number":"pith:LOJR6TYJ","schema_version":"1.0","canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","source":{"kind":"arxiv","id":"1405.7229","version":1},"attestation_state":"computed","paper":{"title":"A Multi-threshold Segmentation Approach Based on Artificial Bee Colony Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CV","authors_text":"Daniel Zaldivar, Erik Cuevas, Felipe Sencion, Humberto Sossa, Marco Perez","submitted_at":"2014-05-28T13:39:20Z","abstract_excerpt":"This paper explores the use of the Artificial Bee Colony (ABC) algorithm to compute threshold selection for image segmentation. ABC is a heuristic algorithm motivated by the intelligent behavior of honey-bees which has been successfully employed to solve complex optimization problems. In this approach, an image 1D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. For the approximation scheme, each Gaussian function represents a pixel class and therefore a threshold. Unlike the Expectation Maximization (EM) algorithm, the ABC based "},"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":"1405.7229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T13:39:20Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"b0d549e9027e2025878ee69b281e3e62e47fd9c9889afcf99e6b2d5ea67e9aeb","abstract_canon_sha256":"bf0951fc166b961bfe723baf1f5276b32814523aaa0d45a57a9361b72d676748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:58.346070Z","signature_b64":"N70+r01UT07LUby5LTP6N+jo5QO7isabnfYupDgK17dn+yGV3UCcEXrkfg1YKCTtg0WnV9isIqcAG2JkNPPfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","last_reissued_at":"2026-05-18T02:50:58.345281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:58.345281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multi-threshold Segmentation Approach Based on Artificial Bee Colony Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CV","authors_text":"Daniel Zaldivar, Erik Cuevas, Felipe Sencion, Humberto Sossa, Marco Perez","submitted_at":"2014-05-28T13:39:20Z","abstract_excerpt":"This paper explores the use of the Artificial Bee Colony (ABC) algorithm to compute threshold selection for image segmentation. ABC is a heuristic algorithm motivated by the intelligent behavior of honey-bees which has been successfully employed to solve complex optimization problems. In this approach, an image 1D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. For the approximation scheme, each Gaussian function represents a pixel class and therefore a threshold. Unlike the Expectation Maximization (EM) algorithm, the ABC based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7229","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":"1405.7229","created_at":"2026-05-18T02:50:58.345430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7229v1","created_at":"2026-05-18T02:50:58.345430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7229","created_at":"2026-05-18T02:50:58.345430+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOJR6TYJ6PBK","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOJR6TYJ6PBK4W5B","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOJR6TYJ","created_at":"2026-05-18T12:28:38.356838+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/LOJR6TYJ6PBK4W5B5GOCHLRVTN","json":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN.json","graph_json":"https://pith.science/api/pith-number/LOJR6TYJ6PBK4W5B5GOCHLRVTN/graph.json","events_json":"https://pith.science/api/pith-number/LOJR6TYJ6PBK4W5B5GOCHLRVTN/events.json","paper":"https://pith.science/paper/LOJR6TYJ"},"agent_actions":{"view_html":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN","download_json":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN.json","view_paper":"https://pith.science/paper/LOJR6TYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7229&json=true","fetch_graph":"https://pith.science/api/pith-number/LOJR6TYJ6PBK4W5B5GOCHLRVTN/graph.json","fetch_events":"https://pith.science/api/pith-number/LOJR6TYJ6PBK4W5B5GOCHLRVTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/action/storage_attestation","attest_author":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/action/author_attestation","sign_citation":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/action/citation_signature","submit_replication":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/action/replication_record"}},"created_at":"2026-05-18T02:50:58.345430+00:00","updated_at":"2026-05-18T02:50:58.345430+00:00"}