Abstract
A polynomial approach is presented to the representation of binary, gray images for machine vision. It is shown that most of the standard image processing can be done by the template polynomial operations. Some operators which rely on the intrinsic properties of polynomials and can be done at a considerable advantage using the polynomial representation of images are developed. In particular, a parallel algorithm is developed by template decomposition; it uses the separability property of the template polynomial to reduce the time complexity. >
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
