In this paper, a novel de-interlacing algorithm in spatial domain is proposed based on an edge orientation optimizing strategy. Taking advantage of the resolution invariant character of edge orientation, we calculate the edge orientation in interlaced image by minimizing the cost function, sum of absolute difference (SAD). Under the assumption that edge orientation in local area is stationary, SAD stands for the possibilities of each edge orientation. Interpolation in the orientation with the least SAD will bring in the continuous value of missing pixels. In addition, a threshold is set to distinguish the texture area from edge or plain area, which makes the algorithm more robust.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Spatial Deinterlacing Algorithm Based on Edge Orientation Optimized in Local Area


    Contributors:
    Wang, Chen (author) / Han, Hua (author) / Peng, Silong (author)


    Publication date :

    2008-05-01


    Size :

    411270 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Edi-Based Deinterlacing using Edge Patterns

    Byun, M. / Park, M. K. / Kang, M. G. | British Library Conference Proceedings | 2005


    EDI-based deinterlacing using edge patterns

    Min Byun, / Min Kyu Park, / Moon Gi Kang, | IEEE | 2005


    Edge-dependent interpolation-based deinterlacing using edge patterns

    Park, M. K. / Byun, M. / Park, J. H. et al. | British Library Online Contents | 2006


    Deinterlacing algorithm using gradient-regularized modular neural networks

    Zhang, H. / Wang, R. / Liu, W. et al. | British Library Online Contents | 2014


    Design and implementation for deinterlacing using the edge-based correlation adaptive method

    Tsai, T.-H. / Lin, H.-L. | British Library Online Contents | 2009