{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:24IC4FA5DYNCHXIUEPLQMHOHUP","short_pith_number":"pith:24IC4FA5","schema_version":"1.0","canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","source":{"kind":"arxiv","id":"1105.1429","version":2},"attestation_state":"computed","paper":{"title":"Application of the level-set model with constraints in image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG"],"primary_cat":"math.NA","authors_text":"Daniel \\v{S}ev\\v{c}ovi\\v{c}, Tom\\'a\\v{s} Oberhuber, Vladim\\'ir Klement","submitted_at":"2011-05-07T09:53:14Z","abstract_excerpt":"We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper and lower constraints prescribed for the level-set function. Constraints have the same conceptual meaning as initial seeds of the popular graph-cuts based methods for image segmentation. A numerical approximation scheme is based on the complementary-finite volumes method combined "},"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":"1105.1429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-07T09:53:14Z","cross_cats_sorted":["math.DG"],"title_canon_sha256":"047eabf4e0ebccbde917e1398fd2c9696221769df20bec6adda28e89fc0b10d2","abstract_canon_sha256":"245849d6c482f3ddab853ca8cd37254720ce470702151a84d822940531dba126"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:01.516504Z","signature_b64":"6nVdkoE5H2fVzbDLXl/sGRpRYkAx6XZRV69V6wRnvKYsXolwhVdFop4tx6g+ig+tJgUCl4zA9ecELIEe2m7pAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7102e141d1e1a23dd1423d7061dc7a3fd55876676bcef542b9f2880f35837cc","last_reissued_at":"2026-05-18T02:30:01.516111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:01.516111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Application of the level-set model with constraints in image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG"],"primary_cat":"math.NA","authors_text":"Daniel \\v{S}ev\\v{c}ovi\\v{c}, Tom\\'a\\v{s} Oberhuber, Vladim\\'ir Klement","submitted_at":"2011-05-07T09:53:14Z","abstract_excerpt":"We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper and lower constraints prescribed for the level-set function. Constraints have the same conceptual meaning as initial seeds of the popular graph-cuts based methods for image segmentation. A numerical approximation scheme is based on the complementary-finite volumes method combined "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1429","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":"1105.1429","created_at":"2026-05-18T02:30:01.516170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1429v2","created_at":"2026-05-18T02:30:01.516170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1429","created_at":"2026-05-18T02:30:01.516170+00:00"},{"alias_kind":"pith_short_12","alias_value":"24IC4FA5DYNC","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"24IC4FA5DYNCHXIU","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"24IC4FA5","created_at":"2026-05-18T12:26:18.847500+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/24IC4FA5DYNCHXIUEPLQMHOHUP","json":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP.json","graph_json":"https://pith.science/api/pith-number/24IC4FA5DYNCHXIUEPLQMHOHUP/graph.json","events_json":"https://pith.science/api/pith-number/24IC4FA5DYNCHXIUEPLQMHOHUP/events.json","paper":"https://pith.science/paper/24IC4FA5"},"agent_actions":{"view_html":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP","download_json":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP.json","view_paper":"https://pith.science/paper/24IC4FA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1429&json=true","fetch_graph":"https://pith.science/api/pith-number/24IC4FA5DYNCHXIUEPLQMHOHUP/graph.json","fetch_events":"https://pith.science/api/pith-number/24IC4FA5DYNCHXIUEPLQMHOHUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/action/storage_attestation","attest_author":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/action/author_attestation","sign_citation":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/action/citation_signature","submit_replication":"https://pith.science/pith/24IC4FA5DYNCHXIUEPLQMHOHUP/action/replication_record"}},"created_at":"2026-05-18T02:30:01.516170+00:00","updated_at":"2026-05-18T02:30:01.516170+00:00"}