Please use this identifier to cite or link to this item:
|Title:||Reducing the complexity of multiscale error diffusion|
Parallel processing systems
Real time systems
|Source:||TENCON 2006 : 2006 IEEE Region 10 Conference : Hong Kong, China, 14-17 November 2006, p. [1-4].|
|Abstract:||Multiscale error diffusion (MED) is superior to conventional error diffusion algorithms as it can eliminate directional hysteresis completely. However, the complexity of this frame-oriented process is much higher and makes it not suitable for real-time applications. In this paper, a fast MED algorithm is proposed. The complexity of this algorithm is remarkably reduced as compared with conventional MED algorithms. It also supports parallel processing.|
|Rights:||© 2006 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.
|Appears in Collections:||EIE Conference Papers & Presentations|
Files in This Item:
|Reducing complexity of multiscale error diffusion_06.pdf||5.53 MB||Adobe PDF||View/Open|
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.