Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Camera Shake Elimination Using Weighted Fourier Burst Accumulation


Affiliations
1 Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, India
2 Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, India
     

   Subscribe/Renew Journal


Camera shakes during exposure leads to objectionable image blur and ruins many photographs.If the photographer takes a lots of images, a modality available in virtually all modern digital cameras, we show that it is possible to combine the images to get a clear sharp version. This is done without explicitly solving any blur estimation and subsequent inverse problem. In previous method they have used blind de-convolution algorithm. Most blind de-convolution algorithms try to estimate the latent image without any other input than the noisy blurred image itself. In our proposed system we implement the new method called Fourier Burst Accumulation. It performs a weighted average in the Fourier domain, with weights depending on the Fourier spectrum magnitude. We directly compute the corresponding Fourier transforms. Since camera shake motion kernels have a small spatial support, their Fourier spectrum magnitudes vary very smoothly. Thus, can apply low pass filter before computing the weights, with filter of standard deviation σ. The strength of the low pass filter (controlled by the parameter σ) should depend on the assumed kernel size (the smaller the kernel the more regular its Fourier spectrum magnitude). Although this low pass filter is important, the results are not too sensitive to the value of σ. The final Fourier burst aggregation is (note that the smoothing is only applied to the weights calculation).The extension to color images is straightforward. The accumulation is done channel by channel using the same Fourier weights for all channels. Then the weights are computed by arithmetically averaging the Fourier magnitude of the channels before the low pass filtering.


Keywords

SIFT, FFT, CCD, HSV.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 142

PDF Views: 3




  • Camera Shake Elimination Using Weighted Fourier Burst Accumulation

Abstract Views: 142  |  PDF Views: 3

Authors

T. Nagamani
Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, India
M. Kaviya
Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, India
Ancena Joseph
Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, India
M. Kaviya
Department of Computer Science and Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode, India

Abstract


Camera shakes during exposure leads to objectionable image blur and ruins many photographs.If the photographer takes a lots of images, a modality available in virtually all modern digital cameras, we show that it is possible to combine the images to get a clear sharp version. This is done without explicitly solving any blur estimation and subsequent inverse problem. In previous method they have used blind de-convolution algorithm. Most blind de-convolution algorithms try to estimate the latent image without any other input than the noisy blurred image itself. In our proposed system we implement the new method called Fourier Burst Accumulation. It performs a weighted average in the Fourier domain, with weights depending on the Fourier spectrum magnitude. We directly compute the corresponding Fourier transforms. Since camera shake motion kernels have a small spatial support, their Fourier spectrum magnitudes vary very smoothly. Thus, can apply low pass filter before computing the weights, with filter of standard deviation σ. The strength of the low pass filter (controlled by the parameter σ) should depend on the assumed kernel size (the smaller the kernel the more regular its Fourier spectrum magnitude). Although this low pass filter is important, the results are not too sensitive to the value of σ. The final Fourier burst aggregation is (note that the smoothing is only applied to the weights calculation).The extension to color images is straightforward. The accumulation is done channel by channel using the same Fourier weights for all channels. Then the weights are computed by arithmetically averaging the Fourier magnitude of the channels before the low pass filtering.


Keywords


SIFT, FFT, CCD, HSV.