{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CMA3KDBF4PDFXMMXZQXAK6IHDU","short_pith_number":"pith:CMA3KDBF","schema_version":"1.0","canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","source":{"kind":"arxiv","id":"1608.01431","version":2},"attestation_state":"computed","paper":{"title":"An efficient iterative thresholding method for image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CV","authors_text":"Dong Wang, Haohan Li, Xiaoping Wang, Xiaoyu Wei","submitted_at":"2016-08-04T05:37:35Z","abstract_excerpt":"We proposed an efficient iterative thresholding method for multi-phase image segmentation. The algorithm is based on minimizing piecewise constant Mumford-Shah functional in which the contour length (or perimeter) is approximated by a non-local multi-phase energy. The minimization problem is solved by an iterative method. Each iteration consists of computing simple convolutions followed by a thresholding step. The algorithm is easy to implement and has the optimal complexity $O(N \\log N)$ per iteration. We also show that the iterative algorithm has the total energy decaying property. We presen"},"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":"1608.01431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-04T05:37:35Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"bc6f3136c359aec50e3ca880a67d0d8aee22217eca814ada0e2d703e277c9235","abstract_canon_sha256":"742eecce274650b938b3df0002f836e12e4f37e1bac6070d59ceb3b90f066c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:23.251604Z","signature_b64":"IcC3mPQiP7XOhZ0e8WFM2VaDwZZcPrpuEYl3Jp5nZvebTkTYaq3HEGH8wyb26nl7jWwB/qDZbV4o+08aSit3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1301b50c25e3c65bb197cc2e0579071d222ded864d823400bf488f0e112a7421","last_reissued_at":"2026-05-18T00:33:23.250944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:23.250944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient iterative thresholding method for image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CV","authors_text":"Dong Wang, Haohan Li, Xiaoping Wang, Xiaoyu Wei","submitted_at":"2016-08-04T05:37:35Z","abstract_excerpt":"We proposed an efficient iterative thresholding method for multi-phase image segmentation. The algorithm is based on minimizing piecewise constant Mumford-Shah functional in which the contour length (or perimeter) is approximated by a non-local multi-phase energy. The minimization problem is solved by an iterative method. Each iteration consists of computing simple convolutions followed by a thresholding step. The algorithm is easy to implement and has the optimal complexity $O(N \\log N)$ per iteration. We also show that the iterative algorithm has the total energy decaying property. We presen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01431","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":"1608.01431","created_at":"2026-05-18T00:33:23.251042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01431v2","created_at":"2026-05-18T00:33:23.251042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01431","created_at":"2026-05-18T00:33:23.251042+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMA3KDBF4PDF","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMA3KDBF4PDFXMMX","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMA3KDBF","created_at":"2026-05-18T12:30:09.641336+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/CMA3KDBF4PDFXMMXZQXAK6IHDU","json":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU.json","graph_json":"https://pith.science/api/pith-number/CMA3KDBF4PDFXMMXZQXAK6IHDU/graph.json","events_json":"https://pith.science/api/pith-number/CMA3KDBF4PDFXMMXZQXAK6IHDU/events.json","paper":"https://pith.science/paper/CMA3KDBF"},"agent_actions":{"view_html":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU","download_json":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU.json","view_paper":"https://pith.science/paper/CMA3KDBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01431&json=true","fetch_graph":"https://pith.science/api/pith-number/CMA3KDBF4PDFXMMXZQXAK6IHDU/graph.json","fetch_events":"https://pith.science/api/pith-number/CMA3KDBF4PDFXMMXZQXAK6IHDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/action/storage_attestation","attest_author":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/action/author_attestation","sign_citation":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/action/citation_signature","submit_replication":"https://pith.science/pith/CMA3KDBF4PDFXMMXZQXAK6IHDU/action/replication_record"}},"created_at":"2026-05-18T00:33:23.251042+00:00","updated_at":"2026-05-18T00:33:23.251042+00:00"}