Abstract
Computation of local axial moments from images in a running mode (per pixel) is computationally very extensive procedure, especially, when the local moments must be computed for many orientation angles and for a large window size at the same time. This paper considers efficient computation of local axial moments by using the concept of primitive kernel functions. It allows to reduce the computation time from O(L2) to O(1) per pixel, where LxL is the window size.KeywordsWindow SizeOrientation AngleKernel SizeErent AngleLocal MomentThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.