Efficient method of pixel neighborhood traversal

• Verfasst von: Pyatykh, Stanislav [VerfasserIn]
• Verfasst von: Zheng, Lei [VerfasserIn]
• Verfasst von: Hesser, Jürgen [VerfasserIn]
• Titel: Efficient method of pixel neighborhood traversal
• Verf.angabe: Stanislav Pyatykh, Lei Zheng, Jürgen Hesser
• E-Jahr: 2012
• Jahr: 3 April 2012
• Umfang: 10 S.
• Fussnoten: Gesehen am 25.05.2018
• Titel Quelle: Enthalten in: Journal of visual communication and image representation
• Ort Quelle: Orlando, Fla. : Academic Press, 1990
• Jahr Quelle: 2012
• Band/Heft Quelle: 23(2012), 5, Seite 719-728
• ISSN Quelle: 1047-3203
• DOI: doi:10.1016/j.jvcir.2012.03.008
• Datenträger: Online-Ressource
• Sprache: eng
• Sach-SW: Boundary condition
• Sach-SW: Code optimization
• Sach-SW: Generic programming
• Sach-SW: Image filtering
• Sach-SW: Image processing
• Sach-SW: Image processing library
• Sach-SW: Image traversal
• Sach-SW: Neighborhood traversal
• K10plus-PPN: 1575528770

Abstract

The processing of a pixel neighborhood is a common operation in image processing. Therefore, a flexible, computationally efficient and easy-to-use strategy for neighborhood traversal is required. In this paper, a new neighborhood traversal method and its implementation in C++ are presented. In the proposed method, the pixel neighbor access is organized without boundary checks and without image extension, which yields to significant improvements of computational efficiency. The method is based on a partition of the image domain, for which valid neighbor pixel offsets can be precomputed for each subset. The proposed C++ implementation is based on generic programming and can handle images of arbitrary dimensionality. It hides all implementation details from the user and can be extended in order to support additional boundary conditions. The evaluation demonstrates that the proposed method is considerably faster than neighborhood traversal implementations from other libraries.