PICCOLO Logic for a Picture Database Computer and Its Implementation
- 1 October 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (10) , 983-996
- https://doi.org/10.1109/tc.1982.1675907
Abstract
The logic named PICCOLO for a picture database computer and its implementation is presented. The logic is shown to have three major advantages. One advantage is that the computer design based on this logic can handle a universal variety of pictorial data structures. Another advantage is that a set of data generated by rules such as texture distribution rules is stored in the picture computer efficiently. The third advantage is that this logic can serve as the basis of a logic for parallel processing machines. For implementation of the logic, a new methodology named architecture engineering is introduced as an architecture/design oriented methodology. Implementation case studies show the usefulness of the methodology. Two implementations on an abstract machine that are also on a parallel LISP machine are reported.Keywords
This publication has 11 references indexed in Scilit:
- A graph-theoretical approach to region detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Query-by-pictorial-examplePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- PICCOLO Logic for a Picture Database Computer and Its ImplementationIEEE Transactions on Computers, 1982
- Software Reliability—Status and PerspectivesIEEE Transactions on Software Engineering, 1982
- Picture decomposition, tree data-structures, and identifying directional symmetries as node combinationsComputer Graphics and Image Processing, 1978
- Query-by-examplePublished by Association for Computing Machinery (ACM) ,1975
- PASCAL User Manual and ReportPublished by Springer Nature ,1975
- An interactive fashion design system "INFADS"Published by Association for Computing Machinery (ACM) ,1974
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956