Please use this identifier to cite or link to this item:
|Title:||Hyperconnected Attribute Filters Based on k-Flat Zones|
|Authors:||OUZOUNIS GEORGIOS; WILKINSON Michael|
|Citation:||IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE vol. 33 no. 2 p. 224-239|
|Publisher:||IEEE COMPUTER SOC|
|Type:||Articles in periodicals and books|
|Abstract:||In this paper we present a new method for attribute filtering, combining contrast and structural information. Using hyperconnectivity based on k-fat 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 non-increasing 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.|
|JRC Institute:||Institute for the Protection and Security of the Citizen|
Files in This Item:
There are no files associated with this item.
Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.