On PSF for lined motion blurred image

Author(s):  
Zhang Chaoyang ◽  
Liao Guangjun ◽  
Qi Qifeng
Keyword(s):  
2012 ◽  
Vol 132 (2) ◽  
pp. 284-290
Author(s):  
Yuka Nagashima ◽  
Shigeru Omatu ◽  
Michifumi Yoshioka

Author(s):  
Suresha .M ◽  
. Sandeep

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.


2021 ◽  
Vol 18 (2) ◽  
pp. 172988142199958
Author(s):  
Shundao Xie ◽  
Hong-Zhou Tan

In recent years, the application of two-dimensional (2D) barcode is more and more extensive and has been used as landmarks for robots to detect and peruse the information. However, it is hard to obtain a sharp 2D barcode image because of the moving robot, and the common solution is to deblur the blurry image before decoding the barcode. Image deblurring is an ill-posed problem, where ringing artifacts are commonly presented in the deblurred image, which causes the increase of decoding time and the limited improvement of decoding accuracy. In this article, a novel approach is proposed using blur-invariant shape and geometric features to make a blur-readable (BR) 2D barcode, which can be directly decoded even when seriously blurred. The finder patterns of BR code consist of two concentric rings and five disjoint disks, whose centroids form two triangles. The outer edges of the concentric rings can be regarded as blur-invariant shapes, which enable BR code to be quickly located even in a blurred image. The inner angles of the triangle are of blur-invariant geometric features, which can be used to store the format information of BR code. When suffering from severe defocus blur, the BR code can not only reduce the decoding time by skipping the deblurring process but also improve the decoding accuracy. With the defocus blur described by circular disk point-spread function, simulation results verify the performance of blur-invariant shape and the performance of BR code under blurred image situation.


2011 ◽  
Author(s):  
Sheng Zhong ◽  
Mingzhi Jin ◽  
Luxin Yan ◽  
Tianxu Zhang

2018 ◽  
Vol 35 (10) ◽  
pp. 1373-1391 ◽  
Author(s):  
Bahman Sadeghi ◽  
Kamal Jamshidi ◽  
Abbas Vafaei ◽  
S. Amirhassan Monadjemi

Author(s):  
Jian-Jiun Ding ◽  
Wei-Sheng Lai ◽  
Hao-Hsuan Chang ◽  
Chir-Weei Chang ◽  
Chuan-Chung Chang

2019 ◽  
Vol 8 (4) ◽  
pp. 8231-8236

A restoration and classification computation for blurred image which depends on obscure identification and characterization is proposed in this paper. Initially, new obscure location calculation is proposed to recognize the Gaussian, Motion and Defocus based blurred locales in the image. The degradation-restoration model referred with pre-processing followed by binarization and features extraction/classification algorithm applied on obscure images. At this point, support vector machine (SVM) classification algorithm is proposed to cluster the blurred images. Once the obscure class of the locales is affirmed, the structure of the obscure kernels of the blurred images are affirmed. At that point, the obscure kernel estimation techniques are embraced to appraise the obscure kernels. At last, the blurred locales are re-established utilizing nonblind image deblurring calculation and supplant the blurred images with the restored images. The simulation results demonstrate that the proposed calculation performs well


Sign in / Sign up

Export Citation Format

Share Document