Abstract
Picture processing includes a variety of algorithms employed at different stages within a recognition process. Although single parallel algorithms have been suggested, no systematic comparison with sequential algorithms is available. We propose here some parallel algorithms solving a selected set of picture-processing tasks and compare their speed, when implemented on a CLIP machine, with that of the equivalent sequential algorithms implemented on a standard minicomputer. It is shown that parallel algorithms are faster than the sequential ones by a factor depending on the size of the digitization matrix, even when arithmetical operations are widely involved.
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.
