{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DQPGFU6GTARV2H7PONOVJEGA6Y","short_pith_number":"pith:DQPGFU6G","schema_version":"1.0","canonical_sha256":"1c1e62d3c698235d1fef735d5490c0f6105b3a4516724c8d84a222ceb035b226","source":{"kind":"arxiv","id":"1710.08124","version":1},"attestation_state":"computed","paper":{"title":"Accelerating GMM-based patch priors for image restoration: Three ingredients for a 100$\\times$ speed-up","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Charles-Alban Deledalle (IMB, IOGS), Lo\\\"ic Denis (UJM, Shibin Parameswaran (UC San Diego), Truong Q. Nguyen (UC San Diego), UC San Diego)","submitted_at":"2017-10-23T07:39:35Z","abstract_excerpt":"Image restoration methods aim to recover the underlying clean image from corrupted observations. The Expected Patch Log-likelihood (EPLL) algorithm is a powerful image restoration method that uses a Gaussian mixture model (GMM) prior on the patches of natural images. Although it is very effective for restoring images, its high runtime complexity makes EPLL ill-suited for most practical applications. In this paper, we propose three approximations to the original EPLL algorithm. The resulting algorithm, which we call the fast-EPLL (FEPLL), attains a dramatic speed-up of two orders of magnitude o"},"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":"1710.08124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-23T07:39:35Z","cross_cats_sorted":[],"title_canon_sha256":"8a854728719886c081a28cbd2545392a2d805c374bf060f6932f44c3cad07af1","abstract_canon_sha256":"0f94f86ccd8d9c8f87a3e0c8b7ccc5b84dd477b41e0c6162795025f394bd9777"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:17.125122Z","signature_b64":"5RJfMfxySKw7T5Wl0RyZymOzCv0pTgTOnRVZfKQvbaOgEVbBDd1LFd6skjpbwH3/6DJo8wxJNFonJS9k/AgNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1e62d3c698235d1fef735d5490c0f6105b3a4516724c8d84a222ceb035b226","last_reissued_at":"2026-05-18T00:32:17.124578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:17.124578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating GMM-based patch priors for image restoration: Three ingredients for a 100$\\times$ speed-up","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Charles-Alban Deledalle (IMB, IOGS), Lo\\\"ic Denis (UJM, Shibin Parameswaran (UC San Diego), Truong Q. Nguyen (UC San Diego), UC San Diego)","submitted_at":"2017-10-23T07:39:35Z","abstract_excerpt":"Image restoration methods aim to recover the underlying clean image from corrupted observations. The Expected Patch Log-likelihood (EPLL) algorithm is a powerful image restoration method that uses a Gaussian mixture model (GMM) prior on the patches of natural images. Although it is very effective for restoring images, its high runtime complexity makes EPLL ill-suited for most practical applications. In this paper, we propose three approximations to the original EPLL algorithm. The resulting algorithm, which we call the fast-EPLL (FEPLL), attains a dramatic speed-up of two orders of magnitude o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08124","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":"1710.08124","created_at":"2026-05-18T00:32:17.124671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08124v1","created_at":"2026-05-18T00:32:17.124671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08124","created_at":"2026-05-18T00:32:17.124671+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQPGFU6GTARV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQPGFU6GTARV2H7P","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQPGFU6G","created_at":"2026-05-18T12:31:12.930513+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/DQPGFU6GTARV2H7PONOVJEGA6Y","json":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y.json","graph_json":"https://pith.science/api/pith-number/DQPGFU6GTARV2H7PONOVJEGA6Y/graph.json","events_json":"https://pith.science/api/pith-number/DQPGFU6GTARV2H7PONOVJEGA6Y/events.json","paper":"https://pith.science/paper/DQPGFU6G"},"agent_actions":{"view_html":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y","download_json":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y.json","view_paper":"https://pith.science/paper/DQPGFU6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08124&json=true","fetch_graph":"https://pith.science/api/pith-number/DQPGFU6GTARV2H7PONOVJEGA6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/DQPGFU6GTARV2H7PONOVJEGA6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y/action/storage_attestation","attest_author":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y/action/author_attestation","sign_citation":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y/action/citation_signature","submit_replication":"https://pith.science/pith/DQPGFU6GTARV2H7PONOVJEGA6Y/action/replication_record"}},"created_at":"2026-05-18T00:32:17.124671+00:00","updated_at":"2026-05-18T00:32:17.124671+00:00"}