PolyU Institutional Repository >
Electronic and Information Engineering >
EIE Journal/Magazine Articles >
Please use this identifier to cite or link to this item:
|Title: ||New adaptive partial distortion search using clustered pixel matching error characteristic|
|Authors: ||Hui, Ko-cheung|
|Subjects: ||Motion estimation|
Partial distortion search (PDS)
|Issue Date: ||May-2005 |
|Citation: ||IEEE transactions on image processing, May 2005, v. 14, no. 5, p. 597-607|
|Abstract: ||In order to reduce the computation load, many conventional fast block-matching algorithms have been developed to reduce the set of possible searching points in the search window. All of these algorithms produce some quality degradation of a predicted image. Alternatively, another kind of fast block-matching algorithms which do not introduce any prediction
error as compared with the full-search algorithm is to reduce the number of necessary matching evaluations for every searching point in the search window. The partial distortion search (PDS) is a well-known technique of the second kind of algorithms. In the literature, many researches tried to improve both lossy and lossless block-matching algorithms by making use of an assumption that pixels with larger gradient magnitudes have larger matching errors on average. Based on a simple analysis, it is found that, on average, pixel matching errors with similar magnitudes tend to appear in clusters for natural video sequences. By using this
clustering characteristic, we propose an adaptive PDS algorithm which significantly improves the computation efficiency of the
original PDS. This approach is much better than other algorithms which make use of the pixel gradients. Furthermore, the proposed
algorithm is most suitable for motion estimation of both opaque and boundary macroblocks of an arbitrary-shaped object in
|Rights: ||© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Journal/Magazine Article|
|Appears in Collections:||EIE Journal/Magazine Articles|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.