{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FM55CQYNG4PU2BDBMSXG224MWA","short_pith_number":"pith:FM55CQYN","schema_version":"1.0","canonical_sha256":"2b3bd1430d371f4d046164ae6d6b8cb0065cfe118f62fe8b625ec5dba6f80bd5","source":{"kind":"arxiv","id":"1502.00478","version":2},"attestation_state":"computed","paper":{"title":"Structured Occlusion Coding for Robust Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Meng Yang, Rui Hu, Weiyang Liu, Yandong Wen, Youjun Xiang, Yuli Fu","submitted_at":"2015-02-02T13:48:46Z","abstract_excerpt":"Occlusion in face recognition is a common yet challenging problem. While sparse representation based classification (SRC) has been shown promising performance in laboratory conditions (i.e. noiseless or random pixel corrupted), it performs much worse in practical scenarios. In this paper, we consider the practical face recognition problem, where the occlusions are predictable and available for sampling. We propose the structured occlusion coding (SOC) to address occlusion problems. The structured coding here lies in two folds. On one hand, we employ a structured dictionary for recognition. On "},"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":"1502.00478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-02-02T13:48:46Z","cross_cats_sorted":[],"title_canon_sha256":"42419e966b9de7ee6a4676e5a8c907bf86391226c517cd7a9b967589d1ead331","abstract_canon_sha256":"3fba61b1278ec715da5d22c4cdaed1125447c1d4d1f798344c54aa199a0d4950"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:20.129258Z","signature_b64":"IhIZccsJVUVuK/lZX5HVQtKmnrPrOtrP5HVyJpi0OQ1NZl8A9kcHMsLwZQBv0MMqC8NtTUpUpK3Yg5G38w0XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b3bd1430d371f4d046164ae6d6b8cb0065cfe118f62fe8b625ec5dba6f80bd5","last_reissued_at":"2026-05-18T01:36:20.128745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:20.128745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Occlusion Coding for Robust Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Meng Yang, Rui Hu, Weiyang Liu, Yandong Wen, Youjun Xiang, Yuli Fu","submitted_at":"2015-02-02T13:48:46Z","abstract_excerpt":"Occlusion in face recognition is a common yet challenging problem. While sparse representation based classification (SRC) has been shown promising performance in laboratory conditions (i.e. noiseless or random pixel corrupted), it performs much worse in practical scenarios. In this paper, we consider the practical face recognition problem, where the occlusions are predictable and available for sampling. We propose the structured occlusion coding (SOC) to address occlusion problems. The structured coding here lies in two folds. On one hand, we employ a structured dictionary for recognition. On "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00478","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":"1502.00478","created_at":"2026-05-18T01:36:20.128826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00478v2","created_at":"2026-05-18T01:36:20.128826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00478","created_at":"2026-05-18T01:36:20.128826+00:00"},{"alias_kind":"pith_short_12","alias_value":"FM55CQYNG4PU","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FM55CQYNG4PU2BDB","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FM55CQYN","created_at":"2026-05-18T12:29:19.899920+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/FM55CQYNG4PU2BDBMSXG224MWA","json":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA.json","graph_json":"https://pith.science/api/pith-number/FM55CQYNG4PU2BDBMSXG224MWA/graph.json","events_json":"https://pith.science/api/pith-number/FM55CQYNG4PU2BDBMSXG224MWA/events.json","paper":"https://pith.science/paper/FM55CQYN"},"agent_actions":{"view_html":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA","download_json":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA.json","view_paper":"https://pith.science/paper/FM55CQYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00478&json=true","fetch_graph":"https://pith.science/api/pith-number/FM55CQYNG4PU2BDBMSXG224MWA/graph.json","fetch_events":"https://pith.science/api/pith-number/FM55CQYNG4PU2BDBMSXG224MWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA/action/storage_attestation","attest_author":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA/action/author_attestation","sign_citation":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA/action/citation_signature","submit_replication":"https://pith.science/pith/FM55CQYNG4PU2BDBMSXG224MWA/action/replication_record"}},"created_at":"2026-05-18T01:36:20.128826+00:00","updated_at":"2026-05-18T01:36:20.128826+00:00"}