{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R7JUE5HRDOAPSUA2EQJM5ZCESQ","short_pith_number":"pith:R7JUE5HR","schema_version":"1.0","canonical_sha256":"8fd34274f11b80f9501a2412cee4449404b9d61008923f0ca547782c0f3f8444","source":{"kind":"arxiv","id":"1611.08983","version":12},"attestation_state":"computed","paper":{"title":"Analyzing the group sparsity based on the rank minimization methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Henglin Shi, Lan Tang, Qiong Wang, Xiaohua Huang, Xinggan Zhang, Xin Liu, Yingyue Xu, Zhiyuan Zha","submitted_at":"2016-11-28T05:11:52Z","abstract_excerpt":"Sparse coding has achieved a great success in various image processing studies. However, there is not any benchmark to measure the sparsity of image patch/group because sparse discriminant conditions cannot keep unchanged. This paper analyzes the sparsity of group based on the strategy of the rank minimization. Firstly, an adaptive dictionary for each group is designed. Then, we prove that group-based sparse coding is equivalent to the rank minimization problem, and thus the sparse coefficient of each group is measured by estimating the singular values of each group. Based on that measurement,"},"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":"1611.08983","kind":"arxiv","version":12},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2016-11-28T05:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"fbb6660cbbc19ff0ef9c46baf75e24bf388f39950e8a5e5c4285bf8fbb27c511","abstract_canon_sha256":"0ee7b8dc9ff5ab29a50e0da951cf703d40fe7cfb4ef22c87f199a76451ffd650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:34.980360Z","signature_b64":"Mk/OrREZzZSn8tiAobpi/zUz5RJxtTetiHDRL4Fp1MSxhipM0hqPFF+gMq0wIniopvXpLvtacZDNJEbKiY3yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd34274f11b80f9501a2412cee4449404b9d61008923f0ca547782c0f3f8444","last_reissued_at":"2026-05-18T00:42:34.979620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:34.979620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing the group sparsity based on the rank minimization methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Henglin Shi, Lan Tang, Qiong Wang, Xiaohua Huang, Xinggan Zhang, Xin Liu, Yingyue Xu, Zhiyuan Zha","submitted_at":"2016-11-28T05:11:52Z","abstract_excerpt":"Sparse coding has achieved a great success in various image processing studies. However, there is not any benchmark to measure the sparsity of image patch/group because sparse discriminant conditions cannot keep unchanged. This paper analyzes the sparsity of group based on the strategy of the rank minimization. Firstly, an adaptive dictionary for each group is designed. Then, we prove that group-based sparse coding is equivalent to the rank minimization problem, and thus the sparse coefficient of each group is measured by estimating the singular values of each group. Based on that measurement,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08983","kind":"arxiv","version":12},"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":"1611.08983","created_at":"2026-05-18T00:42:34.979726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08983v12","created_at":"2026-05-18T00:42:34.979726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08983","created_at":"2026-05-18T00:42:34.979726+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7JUE5HRDOAP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7JUE5HRDOAPSUA2","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7JUE5HR","created_at":"2026-05-18T12:30:41.710351+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/R7JUE5HRDOAPSUA2EQJM5ZCESQ","json":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ.json","graph_json":"https://pith.science/api/pith-number/R7JUE5HRDOAPSUA2EQJM5ZCESQ/graph.json","events_json":"https://pith.science/api/pith-number/R7JUE5HRDOAPSUA2EQJM5ZCESQ/events.json","paper":"https://pith.science/paper/R7JUE5HR"},"agent_actions":{"view_html":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ","download_json":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ.json","view_paper":"https://pith.science/paper/R7JUE5HR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08983&json=true","fetch_graph":"https://pith.science/api/pith-number/R7JUE5HRDOAPSUA2EQJM5ZCESQ/graph.json","fetch_events":"https://pith.science/api/pith-number/R7JUE5HRDOAPSUA2EQJM5ZCESQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ/action/storage_attestation","attest_author":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ/action/author_attestation","sign_citation":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ/action/citation_signature","submit_replication":"https://pith.science/pith/R7JUE5HRDOAPSUA2EQJM5ZCESQ/action/replication_record"}},"created_at":"2026-05-18T00:42:34.979726+00:00","updated_at":"2026-05-18T00:42:34.979726+00:00"}