{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JQOFFYHQOVGV7X4SFMA6U2UYQ7","short_pith_number":"pith:JQOFFYHQ","schema_version":"1.0","canonical_sha256":"4c1c52e0f0754d5fdf922b01ea6a9887ec60601be69aee3c0b7b270068b1a349","source":{"kind":"arxiv","id":"1810.05438","version":1},"attestation_state":"computed","paper":{"title":"MPTV: Matching Pursuit Based Total Variation Minimization for Image Deconvolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Dong Gong, Mingkui Tan, Qinfeng Shi, Yanning Zhang","submitted_at":"2018-10-12T10:07:05Z","abstract_excerpt":"Total variation (TV) regularization has proven effective for a range of computer vision tasks through its preferential weighting of sharp image edges. Existing TV-based methods, however, often suffer from the over-smoothing issue and solution bias caused by the homogeneous penalization. In this paper, we consider addressing these issues by applying inhomogeneous regularization on different image components. We formulate the inhomogeneous TV minimization problem as a convex quadratic constrained linear programming problem. Relying on this new model, we propose a matching pursuit based total var"},"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":"1810.05438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-12T10:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"c3d39807200df6600611d0ba585bb7fde017ea1f32c9c60a2cd90d8b4dac9712","abstract_canon_sha256":"52b85cb8d6bbf5f77cb8a096923dead63337504bab5e7bc406675d7bcda424af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:39.679303Z","signature_b64":"hg1gzyKL/tbdxC2UNKbApi8MMzafc/EvGcIibTCZ9lOPpz8sRny05d8Hbxl3KK9SAM8tRGUZ/8CwrlH6BbfHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c1c52e0f0754d5fdf922b01ea6a9887ec60601be69aee3c0b7b270068b1a349","last_reissued_at":"2026-05-17T23:57:39.678838Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:39.678838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MPTV: Matching Pursuit Based Total Variation Minimization for Image Deconvolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Dong Gong, Mingkui Tan, Qinfeng Shi, Yanning Zhang","submitted_at":"2018-10-12T10:07:05Z","abstract_excerpt":"Total variation (TV) regularization has proven effective for a range of computer vision tasks through its preferential weighting of sharp image edges. Existing TV-based methods, however, often suffer from the over-smoothing issue and solution bias caused by the homogeneous penalization. In this paper, we consider addressing these issues by applying inhomogeneous regularization on different image components. We formulate the inhomogeneous TV minimization problem as a convex quadratic constrained linear programming problem. Relying on this new model, we propose a matching pursuit based total var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05438","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":"1810.05438","created_at":"2026-05-17T23:57:39.678905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05438v1","created_at":"2026-05-17T23:57:39.678905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05438","created_at":"2026-05-17T23:57:39.678905+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQOFFYHQOVGV","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQOFFYHQOVGV7X4S","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQOFFYHQ","created_at":"2026-05-18T12:32:31.084164+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/JQOFFYHQOVGV7X4SFMA6U2UYQ7","json":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7.json","graph_json":"https://pith.science/api/pith-number/JQOFFYHQOVGV7X4SFMA6U2UYQ7/graph.json","events_json":"https://pith.science/api/pith-number/JQOFFYHQOVGV7X4SFMA6U2UYQ7/events.json","paper":"https://pith.science/paper/JQOFFYHQ"},"agent_actions":{"view_html":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7","download_json":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7.json","view_paper":"https://pith.science/paper/JQOFFYHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05438&json=true","fetch_graph":"https://pith.science/api/pith-number/JQOFFYHQOVGV7X4SFMA6U2UYQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/JQOFFYHQOVGV7X4SFMA6U2UYQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7/action/storage_attestation","attest_author":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7/action/author_attestation","sign_citation":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7/action/citation_signature","submit_replication":"https://pith.science/pith/JQOFFYHQOVGV7X4SFMA6U2UYQ7/action/replication_record"}},"created_at":"2026-05-17T23:57:39.678905+00:00","updated_at":"2026-05-17T23:57:39.678905+00:00"}