A low complexity block-based video de-interlacing algorithm for SIMD processors

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A low complexity video de-interlacing algorithm is presented in this paper which is suitable for SIMD (Single Instruction Multiple Data) processors to be used as a pre-/post-processing option in low-cost consumer electronic devices. It is a block-based motion-adaptive technique that converts an interlaced video to progressive, preserving the details in static or low motion areas while leaving no combing artifacts or without introducing any ghosting artifacts. It adapts to the content and chooses one amongst temporal, spatiotemporal or spatial filtering for de-interlacing on a block by block basis analyzing characteristics such as the extent of motion and the correlation across fields. The proposed scheme has been benchmarked against a recent low complexity motion-adaptive algorithm and the performance has been measured across a number of real and synthetic video sequences. The proposed algorithm offers an order of magnitude complexity reduction on SIMD processors over the reference low complexity algorithm while providing a significantly better fidelity towards the progressive source. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Gupta, Y., & Sethuraman, S. (2007). A low complexity block-based video de-interlacing algorithm for SIMD processors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4810 LNCS, pp. 409–412). Springer Verlag. https://doi.org/10.1007/978-3-540-77255-2_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free