![]() ![]() Pipelines can be structured in various ways to take advantage of different methods of breaking down operations into suboperations. ![]() Ordinarily n is much greater than m or k, so that the total processing time is not much greater than that needed to do a single operation (the slowest one). If there are m operations and the image size is n × n, the total processing time required is then n 2 t + ( m − 1) kt. Let t be the longest time required to perform an operation at one pixel, and let kt be the average delay required, after an operation begins, before the next operation can start. Since each processor has available to it the output value of its operation at every pixel, it can also compute statistics of these values, if desired. As soon as the first pixel and its neighbors have been processed, the second processor begins to perform the second operation, and so on. ![]() The first processor performs the first operation on the image, pixel by pixel. Such sequences of operations can be performed in parallel using a pipeline of processors, each operating on the output of the preceding one. Image processing and analysis often require fixed sequences of local operations to be performed at each pixel of an image. Rama Chellappa, Azriel Rosenfeld, in Encyclopedia of Physical Science and Technology (Third Edition), 2003 XIV.A Pipelines ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |