{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M3BEXQKVJKEZIR5ISZDU54NIPL","short_pith_number":"pith:M3BEXQKV","schema_version":"1.0","canonical_sha256":"66c24bc1554a899447a896474ef1a87af5d96eb68868b4a06f10b235c0eb0c3d","source":{"kind":"arxiv","id":"1605.08881","version":1},"attestation_state":"computed","paper":{"title":"Sparse Coding and Counting for Robust Visual Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jing Wang, Risheng Liu, Yiyang Wang, Yu Cai, Zhixun Su","submitted_at":"2016-05-28T12:09:53Z","abstract_excerpt":"In this paper, we propose a novel sparse coding and counting method under Bayesian framwork for visual tracking. In contrast to existing methods, the proposed method employs the combination of L0 and L1 norm to regularize the linear coefficients of incrementally updated linear basis. The sparsity constraint enables the tracker to effectively handle difficult challenges, such as occlusion or image corruption. To achieve realtime processing, we propose a fast and efficient numerical algorithm for solving the proposed model. Although it is an NP-hard problem, the proposed accelerated proximal gra"},"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":"1605.08881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-05-28T12:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"384df5562be028e8a9aa2f444c4f2d1b9f4765bc357725abe6fb637d5a69596f","abstract_canon_sha256":"d25728626a2afd54f1ba7d975b490f46d9d36bbd39b55085dd8a281b47d9417f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:17.333764Z","signature_b64":"dHVNvxrYRyZsYMUxC+k1taNrdQFFBnk/LX2eF1Veo1UiwPtACQXF0DXXrX4vd5TCxkhFY3lpHygulEw5yAqxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c24bc1554a899447a896474ef1a87af5d96eb68868b4a06f10b235c0eb0c3d","last_reissued_at":"2026-05-18T00:51:17.333102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:17.333102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Coding and Counting for Robust Visual Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jing Wang, Risheng Liu, Yiyang Wang, Yu Cai, Zhixun Su","submitted_at":"2016-05-28T12:09:53Z","abstract_excerpt":"In this paper, we propose a novel sparse coding and counting method under Bayesian framwork for visual tracking. In contrast to existing methods, the proposed method employs the combination of L0 and L1 norm to regularize the linear coefficients of incrementally updated linear basis. The sparsity constraint enables the tracker to effectively handle difficult challenges, such as occlusion or image corruption. To achieve realtime processing, we propose a fast and efficient numerical algorithm for solving the proposed model. Although it is an NP-hard problem, the proposed accelerated proximal gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08881","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":"1605.08881","created_at":"2026-05-18T00:51:17.333217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08881v1","created_at":"2026-05-18T00:51:17.333217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08881","created_at":"2026-05-18T00:51:17.333217+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3BEXQKVJKEZ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3BEXQKVJKEZIR5I","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3BEXQKV","created_at":"2026-05-18T12:30:29.479603+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/M3BEXQKVJKEZIR5ISZDU54NIPL","json":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL.json","graph_json":"https://pith.science/api/pith-number/M3BEXQKVJKEZIR5ISZDU54NIPL/graph.json","events_json":"https://pith.science/api/pith-number/M3BEXQKVJKEZIR5ISZDU54NIPL/events.json","paper":"https://pith.science/paper/M3BEXQKV"},"agent_actions":{"view_html":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL","download_json":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL.json","view_paper":"https://pith.science/paper/M3BEXQKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08881&json=true","fetch_graph":"https://pith.science/api/pith-number/M3BEXQKVJKEZIR5ISZDU54NIPL/graph.json","fetch_events":"https://pith.science/api/pith-number/M3BEXQKVJKEZIR5ISZDU54NIPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL/action/storage_attestation","attest_author":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL/action/author_attestation","sign_citation":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL/action/citation_signature","submit_replication":"https://pith.science/pith/M3BEXQKVJKEZIR5ISZDU54NIPL/action/replication_record"}},"created_at":"2026-05-18T00:51:17.333217+00:00","updated_at":"2026-05-18T00:51:17.333217+00:00"}