In this paper, adaptive fast matching algorithms are proposed based on the sub-block ordering. Proposed two
algorithms for the lossless fast matching only reduce the unnecessary matching complexity of motion estimation in the
video coding. By observing the expectation of the sum of absolute differences between the current sub-block and a
reference sub-block in the pixel domain, we derive an absolute difference model which indicates the relationship
between the sub-block distortion and the intra sub-block complexity. In the same way, we consider the inter complexity
among all sub-block with the absolute difference model. From the absolute difference model, we derive the transform
coefficient model for measuring the sub-block complexity in the transform domain based on the Parseval's theorem.
Experimental results show the proposed fast matching algorithms reduce the unnecessary complexity of the full search
algorithm about 20% on average without any loss of image quality.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.