Abstract

This work is focused on the computational complexity (CC) reduction of the locally-adaptive processing of 3D tensor images, based on recursive approaches. As a basis, a local averaging operation is used, implemented as a sliding mean 3D filter (SM3DF) with a central symmetric 3D kernel. Symmetry plays a very important role in constructing the working window. The presented theoretical approach could be adopted in various algorithms for locally-adaptive processing, such as additive noise reduction, sharpness enhancement, texture segmentation, etc. The basic characteristics of the recursive SM3DF are analyzed, together with the main features of the adaptive algorithms for filtration of Gaussian noises and unsharp masking where the filter is aimed at. In the paper, the ability of SM3DF implementation through recursive sliding mean 1D filters, sequentially bonded together, is also introduced. The computational complexity of the algorithms is evaluated for the recursive and non-recursive mode. The recursive SM3DF also suits the 3D convolutional neural networks which comprise sliding locally-adaptive 3D filtration in their layers. As a result of the lower CC, a promising opportunity is opened for higher efficiency of the 3D image processing through tensor neural networks.

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.