| 摘要 |
PURPOSE:To simply search an area at high speed with the small number of registers by simultaneously retrieving two vertical lines adjacent in a Y direction. CONSTITUTION:The work 1 of a first line corresponding to a retrieval start point S and the word 2 of a second line are read from a memory, a '0' to '1'/'0' to '1' boundary point retrieval for retrieving a '0' to '1' boundary point to the first line and a '0' to '1' boundary point to the second line is carried out. Herein, since the boundary is not present in both the words, the next two words 3, 4 are read and the boundary point A of the first line is found in the word 3. The '1' to '0'/'0' to '1' boundary point retrieval from the A point to a left direction is carried out to the words 3 and 4, thereafter, a pair of words 5, 6 and a pair of words 7, 8 are sequentially read to continue the retrieval. When the boundary point is not found in the word 7 but the boundary point B is found only in the word 8, the A point is judged to be the boundary of the first line to complete the retrieval. Thereby, a wasteful retrieval is not executed but a processing can be executed at high speed. |
