{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KYQAWD4RSWVWGKXN6IQGN2UK66","short_pith_number":"pith:KYQAWD4R","schema_version":"1.0","canonical_sha256":"56200b0f9195ab632aedf22066ea8af7a5e42030549e6ee654c572f8ba271a72","source":{"kind":"arxiv","id":"1801.10041","version":1},"attestation_state":"computed","paper":{"title":"An Iterative Spanning Forest Framework for Superpixel Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexandre X. Falc\\~ao, Ananda S. Chowdhury, Eduardo B. Alexandre, Felipe L. Galv\\~ao, John E. Vargas-Mu\\~noz, Paulo A. Vechiatto Miranda","submitted_at":"2018-01-30T15:05:38Z","abstract_excerpt":"Superpixel segmentation has become an important research problem in image processing. In this paper, we propose an Iterative Spanning Forest (ISF) framework, based on sequences of Image Foresting Transforms, where one can choose i) a seed sampling strategy, ii) a connectivity function, iii) an adjacency relation, and iv) a seed pixel recomputation procedure to generate improved sets of connected superpixels (supervoxels in 3D) per iteration. The superpixels in ISF structurally correspond to spanning trees rooted at those seeds. We present five ISF methods to illustrate different choices of its"},"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":"1801.10041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-30T15:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"3437b15f3cc1c10baae6c6f4895130103b8e82c17ce7c296e1fa9857a979d904","abstract_canon_sha256":"3559d8fce99fd1593297e1fae51c49967e0c2d2c37baef6ca1787f76734d9ceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:40.175909Z","signature_b64":"jGo2X3QjwuEcI3Yzg61bD8zds6AdIciulMwzitLn6ACwnmxAkgpbCj5ThVXD9F6EbC/0Y6G38Uaj4r/lvDAxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56200b0f9195ab632aedf22066ea8af7a5e42030549e6ee654c572f8ba271a72","last_reissued_at":"2026-05-17T23:47:40.175530Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:40.175530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Iterative Spanning Forest Framework for Superpixel Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexandre X. Falc\\~ao, Ananda S. Chowdhury, Eduardo B. Alexandre, Felipe L. Galv\\~ao, John E. Vargas-Mu\\~noz, Paulo A. Vechiatto Miranda","submitted_at":"2018-01-30T15:05:38Z","abstract_excerpt":"Superpixel segmentation has become an important research problem in image processing. In this paper, we propose an Iterative Spanning Forest (ISF) framework, based on sequences of Image Foresting Transforms, where one can choose i) a seed sampling strategy, ii) a connectivity function, iii) an adjacency relation, and iv) a seed pixel recomputation procedure to generate improved sets of connected superpixels (supervoxels in 3D) per iteration. The superpixels in ISF structurally correspond to spanning trees rooted at those seeds. We present five ISF methods to illustrate different choices of its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10041","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":"1801.10041","created_at":"2026-05-17T23:47:40.175586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10041v1","created_at":"2026-05-17T23:47:40.175586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10041","created_at":"2026-05-17T23:47:40.175586+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYQAWD4RSWVW","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYQAWD4RSWVWGKXN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYQAWD4R","created_at":"2026-05-18T12:32:33.847187+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/KYQAWD4RSWVWGKXN6IQGN2UK66","json":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66.json","graph_json":"https://pith.science/api/pith-number/KYQAWD4RSWVWGKXN6IQGN2UK66/graph.json","events_json":"https://pith.science/api/pith-number/KYQAWD4RSWVWGKXN6IQGN2UK66/events.json","paper":"https://pith.science/paper/KYQAWD4R"},"agent_actions":{"view_html":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66","download_json":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66.json","view_paper":"https://pith.science/paper/KYQAWD4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10041&json=true","fetch_graph":"https://pith.science/api/pith-number/KYQAWD4RSWVWGKXN6IQGN2UK66/graph.json","fetch_events":"https://pith.science/api/pith-number/KYQAWD4RSWVWGKXN6IQGN2UK66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66/action/storage_attestation","attest_author":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66/action/author_attestation","sign_citation":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66/action/citation_signature","submit_replication":"https://pith.science/pith/KYQAWD4RSWVWGKXN6IQGN2UK66/action/replication_record"}},"created_at":"2026-05-17T23:47:40.175586+00:00","updated_at":"2026-05-17T23:47:40.175586+00:00"}