High-level pyramidal control structures are introduced, and algorithms are proposed for symbolic picture matching on a pyramidal architecture. The algorithms are written in a Pascal-like language that is intended to be run by the host computer, which delegates the pyramid to execute the pyramidal constructs. The time complexity has been calculated by considering no overlap among the execution phase of the host computer and those of the single layers of the pyramid. Type-2, type-0 and type-1 matching problems are considered, and complexity considerations are discussed. The pyramidal architecture can also be used to generate the iconic index of a symbolic picture. The basic algorithm for parallel iconic indexing on a mesh-connected computer is presented. An extension to pyramid architecture is described, and pattern-matching algorithms on symbolic pyramids are presented.
PYRAMIDAL ALGORITHMS FOR ICONIC INDEXING
Tortora Genoveffa;Costagliola Gennaro;Chang Shi-Kuo
1987-01-01
Abstract
High-level pyramidal control structures are introduced, and algorithms are proposed for symbolic picture matching on a pyramidal architecture. The algorithms are written in a Pascal-like language that is intended to be run by the host computer, which delegates the pyramid to execute the pyramidal constructs. The time complexity has been calculated by considering no overlap among the execution phase of the host computer and those of the single layers of the pyramid. Type-2, type-0 and type-1 matching problems are considered, and complexity considerations are discussed. The pyramidal architecture can also be used to generate the iconic index of a symbolic picture. The basic algorithm for parallel iconic indexing on a mesh-connected computer is presented. An extension to pyramid architecture is described, and pattern-matching algorithms on symbolic pyramids are presented.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
