Abstract
Image registration is a fundamental and important task in image processing. It essentially estimates a transformation that aligns two images. Cramer Rao lower bound has recently been used to establish the performance limit of image registration algorithms. However, it is known to be a weak lower bound for some problems. In this paper, we analyze the mean square error performance of transformation estimation in image registration problems. We focus on rigid body transformations, and derive a set of tighter alternatives, namely the Bhattacharya bound and the Ziv-Zakai bound. Experimental results demonstrate the validity of our performance bounds
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.
