Image blind deblurring with half-quadratic penalty method

2015 ◽  
Vol 23 (7) ◽  
pp. 2086-2092 ◽  
Author(s):  
廖永忠 LIAO Yong-zhong ◽  
蔡自兴 CAI Zi-xing ◽  
何湘华 HE Xiang-hua
2014 ◽  
Vol 15 (3) ◽  
pp. 776-796 ◽  
Author(s):  
Zhengfang Zhang ◽  
Weifeng Chen ◽  
Xiaoliang Cheng

AbstractThis paper investigates the eigenmode optimization problem governed by the scalar Helmholtz equation in continuum system in which the computed eigenmode approaches the prescribed eigenmode in the whole domain. The first variation for the eigenmode optimization problem is evaluated by the quadratic penalty method, the adjoint variable method, and the formula based on sensitivity analysis. A penalty optimization algorithm is proposed, in which the density evolution is accomplished by introducing an artificial time term and solving an additional ordinary differential equation. The validity of the presented algorithm is confirmed by numerical results of the first and second eigenmode optimizations in 1Dand 2Dproblems.


2017 ◽  
Vol 70 (1) ◽  
pp. 237-259 ◽  
Author(s):  
Chunfeng Cui ◽  
Qingna Li ◽  
Liqun Qi ◽  
Hong Yan

Author(s):  
Raju Prajapati ◽  
Om Prakash Dubey ◽  
Ranjit Pradhan

Purpose: The present paper focuses on the Non-Linear Programming Problem (NLPP) with equality constraints. NLPP with constraints could be solved by penalty or barrier methods. Methodology: We apply the penalty method to the NLPP with equality constraints only. The non-quadratic penalty method is considered for this purpose. We considered a transcendental i.e. exponential function for imposing the penalty due to the constraint violation. The unconstrained NLPP obtained in this way is then processed for further solution. An improved version of evolutionary and famous meta-heuristic Particle Swarm Optimization (PSO) is used for the same. The method is tested with the help of some test problems and mathematical software SCILAB. The solution is compared with the solution of the quadratic penalty method. Results: The results are also compared with some existing results in the literature.


2018 ◽  
Vol 70 (3) ◽  
pp. 433-445 ◽  
Author(s):  
Zhihua Zhao ◽  
Fengmin Xu ◽  
Meihua Wang ◽  
Cheng-yi Zhang

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3484
Author(s):  
Shuhan Sun ◽  
Lizhen Duan ◽  
Zhiyong Xu ◽  
Jianlin Zhang

Blind image deblurring, also known as blind image deconvolution, is a long-standing challenge in the field of image processing and low-level vision. To restore a clear version of a severely degraded image, this paper proposes a blind deblurring algorithm based on the sigmoid function, which constructs novel blind deblurring estimators for both the original image and the degradation process by exploring the excellent property of sigmoid function and considering image derivative constraints. Owing to these symmetric and non-linear estimators of low computation complexity, high-quality images can be obtained by the algorithm. The algorithm is also extended to image sequences. The sigmoid function enables the proposed algorithm to achieve state-of-the-art performance in various scenarios, including natural, text, face, and low-illumination images. Furthermore, the method can be extended naturally to non-uniform deblurring. Quantitative and qualitative experimental evaluations indicate that the algorithm can remove the blur effect and improve the image quality of actual and simulated images. Finally, the use of sigmoid function provides a new approach to algorithm performance optimization in the field of image restoration.


Author(s):  
Denys Rozumnyi ◽  
Jan Kotera ◽  
Filip Šroubek ◽  
Jiří Matas

AbstractObjects moving at high speed along complex trajectories often appear in videos, especially videos of sports. Such objects travel a considerable distance during exposure time of a single frame, and therefore, their position in the frame is not well defined. They appear as semi-transparent streaks due to the motion blur and cannot be reliably tracked by general trackers. We propose a novel approach called Tracking by Deblatting based on the observation that motion blur is directly related to the intra-frame trajectory of an object. Blur is estimated by solving two intertwined inverse problems, blind deblurring and image matting, which we call deblatting. By postprocessing, non-causal Tracking by Deblatting estimates continuous, complete, and accurate object trajectories for the whole sequence. Tracked objects are precisely localized with higher temporal resolution than by conventional trackers. Energy minimization by dynamic programming is used to detect abrupt changes of motion, called bounces. High-order polynomials are then fitted to smooth trajectory segments between bounces. The output is a continuous trajectory function that assigns location for every real-valued time stamp from zero to the number of frames. The proposed algorithm was evaluated on a newly created dataset of videos from a high-speed camera using a novel Trajectory-IoU metric that generalizes the traditional Intersection over Union and measures the accuracy of the intra-frame trajectory. The proposed method outperforms the baselines both in recall and trajectory accuracy. Additionally, we show that from the trajectory function precise physical calculations are possible, such as radius, gravity, and sub-frame object velocity. Velocity estimation is compared to the high-speed camera measurements and radars. Results show high performance of the proposed method in terms of Trajectory-IoU, recall, and velocity estimation.


Sign in / Sign up

Export Citation Format

Share Document