Sub-pixel registration is a crucial step for applications such as super-resolution in remote sensing, motion compensation in magnetic resonance imaging, and non-destructive testing in manufacturing, to name a few. Recently, these technologies have been trending towards wavelet encoded imaging and sparse/compressive sensing. The former plays a crucial role in reducing imaging artifacts, while the latter significantly increases the acquisition speed. In view of these new emerging needs for applications of wavelet encoded imaging, we propose a sub-pixel registration method that can achieve direct wavelet domain registration from a sparse set of coefficients. We make the following contributions: (i) We devise a method of decoupling scale, rotation, and translation parameters in the Haar wavelet domain, (ii) We derive explicit mathematical expressions that define in-band sub-pixel registration in terms of wavelet coefficients, (iii) Using the derived expressions, we propose an approach to achieve in-band subpixel registration, avoiding back and forth transformations. (iv) Our solution remains highly accurate even when a sparse set of coefficients are used, which is due to localization of signals in a sparse set of wavelet coefficients. We demonstrate the accuracy of our method, and show that it outperforms the state-of-the-art on simulated and real data, even when the data is sparse. Index Terms Subpixel Registration Wavelet Decomposition Haar Wavelets Image PyramidsRecently, there has been a trend in various imaging modalities and applications such as non-destructive testing and Magnetic Resonance Imaging (MRI) to adopt wavelet-encoded imaging [81], [82] and sparse sensing [83]- [85], with the aim of achieving better resolution, reduced distortions, higher SNR, and quick acquisition time, which are crucial for these applications. Subpixel registration is an integral step of various applications involving these wavelet-encoded compressive imaging technologies. Therefore, in this paper, our goal is to obtain a wavelet domain sub-pixel registration method that can achieve highly accurate results from a sparse set of wavelet coefficients. We make the following major contributions towards this goal: (i) We devise a method of decoupling scale, rotation, and translation parameters in the Haar wavelet domain, (ii) We derive explicit mathematical expressions that define in-band sub-pixel registration in terms of Haar wavelet coefficients, (iii) Using the derived expressions, we propose a multiscale approach to achieve in-band sub-pixel registration, avoiding back and forth transformations. (iv) Our solution remains highly accurate even when a sparse set of coefficients are used, due to signal energy localization in a sparse set of wavelet coefficients. Extensive experiments are used to validate our method both on simulated and real data under various scenarios. II. RELATED WORKThe earliest methods related to our work are based on image pyramids, with the aim of reducing computational time and avoiding local extrema. Examples ...
Downsampling performed prior to encoding in video compression discards the high-frequency information of the original video frames. This necessitates super resolution (SR) to recover the lost information after decoding. In this paper, we propose a framework for the downsampling-based video compression problem along with a method for wavelet-based SR. We develop a framework by integrating the downsampling and transform steps of the conventional models. We then use the proposed SR method implemented directly on the wavelet sub-bands at the decoder side. Experimental results demonstrate the superiority of the proposed method in comparison with the conventional techniques employed for resolution enhancement of decoded videos.
One of the main goals of video coding is to reduce the required bitrate to encode a video file to be transmitted or stored. Central to the video coding research is the concept of motion compensation, which has a required pre-processing step of motion estimation. Motion estimation methods used in video coding can be categorized into two groups employing either one (i.e. uni-directional) or twodirectional (i.e. bi-directional) search algorithms. Although the uni-directional algorithms are faster than the bi-directional ones, the latter methods have the advantage of recovering objects affected by occlusion which in turn helps to increase the quality of reconstructed video sequences in the decoder side and to reduce the required bitrate to encode a video file. Therefore, our focus in this paper is to analyze the impact of a bi-directional wavelet-based motion estimation algorithm for motion compensation. The proposed method is performed in the wavelet domain using the relationship between wavelet subbands which decrease the computational cost of the search technique by reducing the size of the video frames with the wavelet decomposition. Experimental results demonstrate that the proposed technique outperforms both uni-and bi-directional motion estimation methods in reducing the required bits to be encoded both in spatial and wavelet domains.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.