Abstract
Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image recovery method that exploits the information redundancy in a block-coded broken image to find similar content which it then uses to repair or conceal errors. On a high-definition image BNM requires a relatively long time and so is not suitable for real-time or high volume use. In this paper, a rotate-based BNM algorithm is proposed and implemented which searches the best matching block from the broken block to the outside in a rotating style and dynamically detects and cuts the search range for a damaged block. Experiment results show that our approach can speed up BNM more than twenty times without any obvious loss of accuracy.
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.
