Abstract

Texture recognition is an important task in computer vision and, as most problems in the area nowadays, has benefited from the use of deep convolutional neural networks. Nevertheless, typical architectures designed for object recognition usually do not perform optimally in such tasks. One of the most important elements of deep architectures in this application concerns the pooling operation. In particular, the well established global average pooling fails to capture more complex, multiscale and non-linear relation among the output activations. In this context, we propose fractal pooling, where the average is replaced by fractal dimension of the feature map. The new module is coupled with a convolutional backbone and a trainable residual block. The method is evaluated on texture classification, both on benchmark databases and on a real-world problem in botany. Our results are competitive with the state-of-the-art in texture classification, outperforming several modern deep learning approaches in terms of classification accuracy with the addition of minimal computational burden. The results suggest the potential of the proposed methodology for texture recognition in general and that using complexity measures is a promising strategy to perform pooling of deep features for this type of image.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.