Digital Signal Processing

    

Least-cost Deconvolution

Authors: Warren D. Smith

I formulate the "least cost deconvolution" problem for images, and within my formulation show that with any particular cost-function choices, it (1) has a unique solution, and (2) that solution may be found (for N-pixel images, each pixel value in [0,2V), to D-decimal accuracy) by a polynomial(N,V,D)-time algorithm. "Deconvolution" algorithms have been around since the work of W.H.Richardson, L.B.Lucy, and Jan Högbom in the early 1970s, but it annoyed me that uniqueness and computational-efficiency theorems had not been stated in that literature (at least that I noticed); and indeed some of the prior algorithms had indications to the contrary, e.g. Liu et al 2025, and/or schemes producing local but prpbably non-global cost-minima.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2025-07-14 19:43:03

Unique-IP document downloads: 192 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus