Fingerprint Image Deblurring via Iterative Projection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current deblurring methods for fingerprint images are inefficient and require significant computation time, especially when dealing with various types of blur, and are sensitive to errors in point spread function data, leading to artifacts and slow convergence rates.
Innovation Solution
A method using an iterative projection algorithm with a Tikhonov functional expressed as a sum of L2 and L1 terms, implemented through a proximal operator and Nesterov minimization, which does not rely on a regularization parameter, allowing for efficient processing of all types of blurry images.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If traditional deconvolution methods (linear, non-linear, statistical, wavelet-based) are used, then deblurring can be achieved, but computation time becomes excessively long and the system becomes complex
Solution Approach 1:
The patent segments the deblurring problem into two distinct components: a linear deconvolution step using Fourier transforms to handle the blur, and a non-linear denoising step using wavelet thresholding to remove artifacts. This segmentation allows each component to be optimized independently, reducing overall computation time while maintaining image quality.
Solution Approach 2:
The patent merges Fourier-based deconvolution and wavelet-based denoising into a unified iterative algorithm. By combining these two approaches, the system achieves both efficient computation (from Fourier methods) and effective artifact removal (from wavelet methods), resolving the contradiction between speed and quality.
2Adaptability or versatility
If wavelet-based deconvolution methods are used, then both motion blur and defocus blur can be handled, but convergence rate becomes very slow when the problem is poorly conditioned
Solution Approach 1:
The patent implements a dynamic iterative algorithm that adaptively adjusts processing parameters based on the specific characteristics of the input image and blur type. The algorithm dynamically switches between different processing strategies for motion blur versus defocus blur, optimizing convergence speed for each case while maintaining versatility across different blur types.
3Ease of manufacture
If linear deconvolution methods are used, then implementation is simple, but the system becomes very sensitive to errors in point spread function data, producing artifacts
Solution Approach 1:
The patent introduces wavelet thresholding as an intermediary step between deconvolution and final image output. This intermediary process acts as a filter that removes artifacts caused by PSF errors while preserving genuine image features. The wavelet transform serves as a mediator that separates signal from noise, reducing sensitivity to inaccuracies in the point spread function data.
Data Source
AI summary
A method of deblurring an observed image acquired by an image sensor in order to determine an observable image corresponding to the deblurred observed image. The observable image and the observed image each are formed by a set of pixels defined by at least one numerical value. The method involves expressing the observable image as a solution minimizing a Tikhonov functional defined by the observed image, applying a spreading function at the point of the image sensor and applying a wavelet transform operator. The Tikhonov functional is expressed as a sum of at least two terms. The method further involves determining the observable image by implementing an iterative projection algorithm released on a closed convex, at each iteration of which, the successive application of a projection operator associated with each of the terms of the Tikhonov functional.