Fast Deconvolution for Motion Blur Along the Blurring Paths
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we propose a deconvolution method which removes the motion blur along the blurring paths. The 2-D blurred image is transformed into 1-D horizontal blurred vectors along the blurring paths. Hence, the deconvolution of stacked horizontal blurred vectors is implemented in an iterative deconvolution process by a 1-D image restoration method that saves computation time. The deconvolution process is usually implemented in the frequency domain by fast Fourier transform (FFT). The computation time of FFT used in the 1-D image restoration method for the blurred vectors is about two-fifths of that of 2-D FFT used in the common image restoration method. To get stacked horizontal blurred vectors, we first incorporate orthogonal Chebyshev polynomial into the proposed method to extract pixels along the blurring paths. Then, we expand horizontal blurred vectors smoothly to reduce boundary artifacts. At last, we add a nonquadratic regularization term to the Richardson-Lucy algorithm, which adaptively penalizes the image gradients, to avoid oversmoothing of details. Experimental results for real motion-blurred images demonstrate that our approach runs much faster than the 2-D deblurring algorithm, while achieving as high restoration accuracy and visual perception as the 2-D deconvolution algorithm.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it