Abstract
Multispectral images contain several wavelength bands and hence have rich information. All the methods for grayscale images can be applied to multispectral images by processing each band separately. However, it requires a vast computational time, especially for the task of looking for overlapping patches that are similar to a given query patch. To address this problem, we propose cube matching using orthogonal tree-structured Haar transform (OTSHT) for multispectral images. By using three-dimensional integral images, we reduce computational complexity significantly. We demonstrate superior performance of the proposed cube matching.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
