Picture Indexing and Abstraction Techniques for Pictorial Databases

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-6, Issue 4, 1984, Pages 475-484

  Chang, Shi KUO ^a   Liu, Shao HUNG ^b  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Database abstraction; pictorial database; pictorial information retrieval; picture indexing

Indexed keywords

DATABASE SYSTEMS;

PICTORIAL INFORMATION SYSTEMS; PICTURE INDEXING;

INFORMATION RETRIEVAL SYSTEMS;

EID: 0021455887     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1984.4767552     Document Type: Article

References (36)

1. R. B. Banerji and T. M. Mitchell, “Description languages anc learning algorithms,” Int. J. Policy Anal. Informtoxp. Syst., p. 202 June 1980.
2. J. R. Bitner, “Heuristics that dynamically organize data structures,” SIAM J. Compute vol. 8, pp. 104–107, Feb. 1979.
3. M. R. Brown, “A partial analysis of random height-balanced trees,” SIAM J. Comput., vol. 8, pp. 37–39, Feb. 1979.
4. N. S. Chang and K. S. Fu, “A relational database system fo] images,” Dep. Elec. Eng., Purdue University, Tech. Rep. TR-EE 79–28, May 1978.
5. S. K. Chang, J. Reuss, and B. H. McCormick, “Design considera tions of a pictorial database system,” Int. J. Policy Anal. Inform. Syst., vol. 1, pp. 49–70, Jan. 1978.
6. S. K. Chang, B. S. Lin, and R. Walser, “A generalized zooming technique for pictorial database systems,” in Proc. Nat. Comput. Conf. AFIPS, vol. 48, 1979, pp. 147–156.
7. S. K. Chang and W. H. Cheng, “A methodology for structured data base decomposition,” IEEE Trans. Software Eng., vol. SE-6 pp. 205–218, Mar. 1980.
8. S. K. Chang, “A methodology for picture indexing and encoding,'' in Picture Engineering, K. S. Fu and K. L. Kunii, Eds. Berlin: Springer-Verlag, 1982, pp. 33–53.
9. S. K, Chang and S. H. Liu, “Indexing and abstraction techniques for a pictorial database,” in Proc. Int. Conf Pattern Recognition Image Processing, Las Vegas, NV, June 14–17, 1982, pp. 422–431.
10. S. K. Chang et al., “IPL-An image processing language and programming environment,” in Proc. IEEE Workshop Languages Automat. Chicago, IL, Nov. 9–11, 1983, pp. 78–84.
11. Y. T. Chien, “Hierarchical data structures for picture storage, retrieval and classification,” in Pictorial Information Systems, Chang and Fu, Eds. Berlin: Springer-Verlag, 1980.
12. C, J. Date, Introduction To Database Systems. Reading, MA: Addison-Wesley, 1979.
13. T, G. Dietterich and R. S. Michalski, “Inductive learning of structural descriptions,” Artificial Intell., vol. 16, 1981, pp. 262–289.
14. R. Fagin, A. O. Mendelzon, and J. D. Ullman, “A simplified universal relation assumption and its properties,” Rep. RJ2900, San Jose, CA, Nov. 1980, p. 7.
15. D. H. Fishman and J. Minker, “7r-representation: Clause representation for parallel search,” Artificial Intell., vol. 6, no. 2, pp. 102-127,1975.
16. L. Gotlieb, “Optimal multi-way search trees,” SIAM J. Comput., vol. 10, p. 422, Aug. 1981.
17. F. Hayes-Roth and J. McDermott, “An interference matching technique for inducing abstractions,” Commun. ACM, vol. 21, pp. 401–410, 1978.
18. J. J. King, “Query optimization by semantic reasoning,” Dep. Comput. Sci. Stanford Univ., Rep. STAN-CS-81-857, May 1981.
19. S. H. Liu and S. K. Chang, “Picture covering by 2-D AH encoding,” in Proc. IEEE Workshop Comput. Architecture Pattern Anal. Image Database Management, Hot Springs, VA, Nov. 11–13, 1981.
20. D. M. McKeown Jr. and D. J. Reddy, “A hierarchical symbolic representation for image database,” in Proc. IEEE Workshop Picture Data Description Management, IEEE Computer Society, Apr. 1977, pp. 40–44.
21. D. Maier, “An efficient method for storing ancestor information in trees,” SIAM J. Comput., vol. 8, pp. 599–618, Nov. 1979.
22. E. Mendelson, Introduction to Mathematical Logic. New York: Van Nostrand Reinhold, 1979, pp. 59–85 and 173–176.
23. R. S. Michalski and R. L. Chilausky, “Developing an expert system for soybean disease diagnosis,” Int. J. Policy Anal. Inform, Syst., p. 128, Dec. 1980.
24. J. Minker, “An experimental relational data base system based on logic,” in Logic and Data Bases, H. Gallaire and J. Minker, Eds. New York: Plenum, 1978, p. 107.
25. P„ B. Powell and P. Thompson, “Natural languages and voice output for relational data base systems,” in Proc. Nat. Conf ACM, 1978, pp. 585–595.
26. R. Reiter, “Deductive question-answering on relational data bases,” in Logic and Data Bases. New York: Plenum, 1978, p. 150.
27. J. L, Reuss and S. K. Chang, “Picture paging for efficient image processing,” in Proc. IEEE Comput. Soc. Conf. Pattern Recognition Image Processing, IEEE Computer Society, May 1978, pp.69-74.
28. R. Rogers, Mathematical Logic and Formalized Theories. Amsterdam: North-Holland, 1971, p. 99.
29. L. G. Shapiro and R. M. Haralick, “A spatial data structure,” Dept. Comput. Sci., Virginia Polytech. Inst. State Univ., Tech. Rep. CS 79005-R, Aug. 1979, p. 35.
30. J. M. Smith and D. C. P. Smith, “Database abstraction: Aggregation and generalization,” ACM Trans. Database Syst., vol. 2, no. 2, pp. 105–133, 1977.
31. S. W. P. Steen, Mathematical Logic. London: Cambridge, 1972, pp.115-119.
32. S. L. Tanimoto, “An iconic/symbolic data structuring scheme,” in Pattern Recognition and Artificial Intelligence. New York: Academic, 1976, pp. 452–471.
33. V. K. Zaishnavi, H. P. Kriegel, and D. Wood, “Optimum multiway search trees, Acta Informat., vol. 14, pp. 119–133, 1980.
34. S. A. Vere, “Induction of concepts in the predicate calculus,” in Proc. 4th Int. Joint Conf. Artificial Intell., 1975, pp. 281–287.
35. K. Yamaguchi and T. Kunii, “A data structure for picture database computers,” in Picture Engineering (Software Engineering Series No. 3). Japan: IBM, pp. 199–254.
36. L. A. Zadeh, “A theory of approximate reasoning, ” Machine Intelligence, vol. 9. New York: Halsted, 1979, pp. 172–177.