CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.02 - February
Issue No.02 - February (2011 vol.33)
Georgios K. Ouzounis , IPSC—Joint Research Centre—European Commission, Ispra
Michael H.F. Wilkinson , University of Groningen, Groningen
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2010.74
In this paper, we present a new method for attribute filtering, combining contrast and structural information. Using hyperconnectivity based on k-flat zones, we improve the ability of attribute filters to retain internal details in detected objects. Simultaneously, we improve the suppression of small, unwanted detail in the background. We extend the theory of attribute filters to hyperconnectivity and provide a fast algorithm to implement the new method. The new version is only marginally slower than the standard Max-Tree algorithm for connected attribute filters, and linear in the number of pixels or voxels. It is two orders of magnitude faster than anisotropic diffusion. The method is implemented in the form of a filtering rule suitable for handling both increasing (size) and nonincreasing (shape) attributes. We test this new framework on nonincreasing shape filters on both 2D images from astronomy, document processing, and microscopy, and 3D CT scans, and show increased robustness to noise while maintaining the advantages of previous methods.
Image enhancement, object detection, hyperconnectivity, connectivity, Max-Tree, document processing, anisotropic diffusion, attribute filter.
Georgios K. Ouzounis, Michael H.F. Wilkinson, "Hyperconnected Attribute Filters Based on k-Flat Zones", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 2, pp. 224-239, February 2011, doi:10.1109/TPAMI.2010.74