In this paper, we present a texture classification procedure that makes use of a blind deconvolution approach. Specifically, the texture is modeled as the output of a linear system driven by a binary excitation. We show that features computed from one-dimensional slices extracted from the two-dimensional autocorrelation function (ACF) of the binary excitation allows representing the texture for rotation-invariant classification purposes. The two-dimensional classification problem is thus reconduced to a more simple one-dimensional one, which leads to a significant reduction of the classification procedure computational complexity.
Campisi, P., S., C., G., P., G., S. (2006). Reduced complexity rotation-invariant texture classification using a blind deconvolution approach. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 28, 145-149 [10.1109/TPAMI.2006.24].
Reduced complexity rotation-invariant texture classification using a blind deconvolution approach
CAMPISI, PATRIZIO;
2006-01-01
Abstract
In this paper, we present a texture classification procedure that makes use of a blind deconvolution approach. Specifically, the texture is modeled as the output of a linear system driven by a binary excitation. We show that features computed from one-dimensional slices extracted from the two-dimensional autocorrelation function (ACF) of the binary excitation allows representing the texture for rotation-invariant classification purposes. The two-dimensional classification problem is thus reconduced to a more simple one-dimensional one, which leads to a significant reduction of the classification procedure computational complexity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.