{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R5GPKUDD2TBM4UCN6BPOQFNV5Y","short_pith_number":"pith:R5GPKUDD","schema_version":"1.0","canonical_sha256":"8f4cf55063d4c2ce504df05ee815b5ee059e86c3158db917e03cc9233c1ad445","source":{"kind":"arxiv","id":"1812.04816","version":1},"attestation_state":"computed","paper":{"title":"Image Segmentation Based on Multiscale Fast Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Chenjian Wu, Chongyang Zhang, Guofeng Zhu, Hong Chen, Minxin Chen","submitted_at":"2018-12-12T05:50:06Z","abstract_excerpt":"In recent years, spectral clustering has become one of the most popular clustering algorithms for image segmentation. However, it has restricted applicability to large-scale images due to its high computational complexity. In this paper, we first propose a novel algorithm called Fast Spectral Clustering based on quad-tree decomposition. The algorithm focuses on the spectral clustering at superpixel level and its computational complexity is O(nlogn) + O(m) + O(m^(3/2)); its memory cost is O(m), where n and m are the numbers of pixels and the superpixels of a image. Then we propose Multiscale Fa"},"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":"1812.04816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-12-12T05:50:06Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"287b47b48ea6d4c729cdde78cce565b07728143fc54d79db685748da293fb639","abstract_canon_sha256":"609d109460cb5a57226e62a714728bbf11d5102768617348bf21b0a2c1ce366b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:27.266959Z","signature_b64":"EGnD0e5U5XZecZ//Ej4rD64C65ds8Vhc4mwOKaVDRDublLfnqcfbDH02AI77MAvnAAGAXO27h4hXFVVvrdNHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f4cf55063d4c2ce504df05ee815b5ee059e86c3158db917e03cc9233c1ad445","last_reissued_at":"2026-05-17T23:58:27.266224Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:27.266224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Image Segmentation Based on Multiscale Fast Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Chenjian Wu, Chongyang Zhang, Guofeng Zhu, Hong Chen, Minxin Chen","submitted_at":"2018-12-12T05:50:06Z","abstract_excerpt":"In recent years, spectral clustering has become one of the most popular clustering algorithms for image segmentation. However, it has restricted applicability to large-scale images due to its high computational complexity. In this paper, we first propose a novel algorithm called Fast Spectral Clustering based on quad-tree decomposition. The algorithm focuses on the spectral clustering at superpixel level and its computational complexity is O(nlogn) + O(m) + O(m^(3/2)); its memory cost is O(m), where n and m are the numbers of pixels and the superpixels of a image. Then we propose Multiscale Fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04816","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":"1812.04816","created_at":"2026-05-17T23:58:27.266341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04816v1","created_at":"2026-05-17T23:58:27.266341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04816","created_at":"2026-05-17T23:58:27.266341+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5GPKUDD2TBM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5GPKUDD2TBM4UCN","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5GPKUDD","created_at":"2026-05-18T12:32:50.500415+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/R5GPKUDD2TBM4UCN6BPOQFNV5Y","json":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y.json","graph_json":"https://pith.science/api/pith-number/R5GPKUDD2TBM4UCN6BPOQFNV5Y/graph.json","events_json":"https://pith.science/api/pith-number/R5GPKUDD2TBM4UCN6BPOQFNV5Y/events.json","paper":"https://pith.science/paper/R5GPKUDD"},"agent_actions":{"view_html":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y","download_json":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y.json","view_paper":"https://pith.science/paper/R5GPKUDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04816&json=true","fetch_graph":"https://pith.science/api/pith-number/R5GPKUDD2TBM4UCN6BPOQFNV5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/R5GPKUDD2TBM4UCN6BPOQFNV5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y/action/storage_attestation","attest_author":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y/action/author_attestation","sign_citation":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y/action/citation_signature","submit_replication":"https://pith.science/pith/R5GPKUDD2TBM4UCN6BPOQFNV5Y/action/replication_record"}},"created_at":"2026-05-17T23:58:27.266341+00:00","updated_at":"2026-05-17T23:58:27.266341+00:00"}