| 摘要 |
PROBLEM TO BE SOLVED: To enable efficient layout analysis processing. SOLUTION: Processing in which the whole collection of rectangle areas is separated into at least one or more areas based on the maximum white rectangle sequence extracted from the whole collection of rectangle areas and is stored therein, then each of the areas is separated into one or more subareas based on the maximum white rectangle sequence which is extracted again from each of the relevant area is repeated recursively. Thereby, hierarchical processing is performed from sparsity to density by the recursive separation with a termination condition of extracting the maximum white rectangle sequence set so that the layout analysis processing can be performed efficiently. COPYRIGHT: (C)2006,JPO&NCIPI
|
