{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CVXKF6MCMNZWMLG2DAT2JM6OV3","short_pith_number":"pith:CVXKF6MC","schema_version":"1.0","canonical_sha256":"156ea2f9826373662cda1827a4b3ceaecbfaa61358c16a1405dbce348f9b0cc9","source":{"kind":"arxiv","id":"1805.08676","version":1},"attestation_state":"computed","paper":{"title":"Convexity Shape Prior for Level Set based Image Segmentation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hai-yang Huang, Jun Liu, Shi Yan, Xue-Cheng Tai","submitted_at":"2018-05-22T15:47:41Z","abstract_excerpt":"We propose a geometric convexity shape prior preservation method for variational level set based image segmentation methods. Our method is built upon the fact that the level set of a convex signed distanced function must be convex. This property enables us to transfer a complicated geometrical convexity prior into a simple inequality constraint on the function. An active set based Gauss-Seidel iteration is used to handle this constrained minimization problem to get an efficient algorithm. We apply our method to region and edge based level set segmentation models including Chan-Vese (CV) model "},"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":"1805.08676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-22T15:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"a9a1a4df3d98aae53fb0da234061e379780b6f5dd0e3ae6671f5174ecbb36aac","abstract_canon_sha256":"0d618066bb7c14eae60e59e812f8985dd1f2745540fb019e4a9cb8ddade1b0d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.457407Z","signature_b64":"ZyhYj+I6K73kVYpKmFxgyCC1ySSw9bjEoVd4Ku4bAAXYbCWNIw1fwHTGaA3n69z25o/phnn0l82IXL6IunvOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"156ea2f9826373662cda1827a4b3ceaecbfaa61358c16a1405dbce348f9b0cc9","last_reissued_at":"2026-05-18T00:15:25.456555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.456555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convexity Shape Prior for Level Set based Image Segmentation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hai-yang Huang, Jun Liu, Shi Yan, Xue-Cheng Tai","submitted_at":"2018-05-22T15:47:41Z","abstract_excerpt":"We propose a geometric convexity shape prior preservation method for variational level set based image segmentation methods. Our method is built upon the fact that the level set of a convex signed distanced function must be convex. This property enables us to transfer a complicated geometrical convexity prior into a simple inequality constraint on the function. An active set based Gauss-Seidel iteration is used to handle this constrained minimization problem to get an efficient algorithm. We apply our method to region and edge based level set segmentation models including Chan-Vese (CV) model "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08676","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":"1805.08676","created_at":"2026-05-18T00:15:25.456692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08676v1","created_at":"2026-05-18T00:15:25.456692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08676","created_at":"2026-05-18T00:15:25.456692+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVXKF6MCMNZW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVXKF6MCMNZWMLG2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVXKF6MC","created_at":"2026-05-18T12:32:19.392346+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/CVXKF6MCMNZWMLG2DAT2JM6OV3","json":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3.json","graph_json":"https://pith.science/api/pith-number/CVXKF6MCMNZWMLG2DAT2JM6OV3/graph.json","events_json":"https://pith.science/api/pith-number/CVXKF6MCMNZWMLG2DAT2JM6OV3/events.json","paper":"https://pith.science/paper/CVXKF6MC"},"agent_actions":{"view_html":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3","download_json":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3.json","view_paper":"https://pith.science/paper/CVXKF6MC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08676&json=true","fetch_graph":"https://pith.science/api/pith-number/CVXKF6MCMNZWMLG2DAT2JM6OV3/graph.json","fetch_events":"https://pith.science/api/pith-number/CVXKF6MCMNZWMLG2DAT2JM6OV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3/action/storage_attestation","attest_author":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3/action/author_attestation","sign_citation":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3/action/citation_signature","submit_replication":"https://pith.science/pith/CVXKF6MCMNZWMLG2DAT2JM6OV3/action/replication_record"}},"created_at":"2026-05-18T00:15:25.456692+00:00","updated_at":"2026-05-18T00:15:25.456692+00:00"}