Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

A language for two-dimensional digital picture processing

Published: 26 April 1976 Publication History

Abstract

A new system, that of matrix grammars, for two-dimensional pattern processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and homomorphisms are investigated. It is found that the smallest class of these languages may serve as the class of regular arrays, which is defined as the smallest class of arrays closed under union, catenation (row and column) and Kleene's closure (row and column). Eight possible ways of defining a matrix language are discussed and it is suggested that one of them may lead to a normal form for matrix grammars. The method is advantageous over others on several points. Perhaps the most interesting of all is that it provides a compromise between sequential methods which take too much time for large arrays and parallel methods which usually take too much hardware for large arrays.

References

[1]
Chang, S.K., 'A Method for the Structural Analysis of Two-Dimensional Mathematical Expressions,' Information Sciences, v. 2 (1970), pp. 253-272
[2]
Chang, S.K., 'Picture Processing Grammar and its Applications,' Information Sciences, v. 3 (1971), pp. 121-148
[3]
Chomsky, N., 'Formal Properties of Grammars,' Handbook of Mathematical psychology, John Wiley and Sons, Inc., New York, v. 2 (1963), pp. 323-418
[4]
Dacey, M.F., 'A Two-Dimensional Language for a Class of Polygons,' Pattern Recognition, v. 3 (1971), pp. 197-208
[5]
Freeman, H., 'On the Encoding of Arbitrary Geometric Configurations,' IRE Transactions on Electronic Computers, EC-10 (1968), pp. 260-268
[6]
Fu, K.S. and Bhargava, B.K., 'Tree Systems for Syntactic Pattern Recognition,' IEEE Trans. on Computers, C-22 (1973), pp. 1087-1099
[7]
Ginsburg, S. and Greibach, S.A., 'Abstract Families of Languages,' Studies of Abstract Families of Languages, American Math. Soc. Memoirs, #87, American Math. Society, Providence, R.I. (1969), pp. 30-76
[8]
Grosky, W.I. and Tsui, F., 'Pattern Generation Generation in Non-Standard Tessellation Automata,' Proc. of the ACM National Conf. (1973), pp. 345-348
[9]
Grosky, W.I. and Tsui, F., 'Parallel-Sequential Processing of Finite Patterns,' Proc. of the Second Sagamore Computer Conference on Parallel Processing, Syracuse, New York (1973), pp. 61-68
[10]
Hopcroft, J.E. And Ullman, J.D., Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969
[11]
Kain, R.Y., Automata Theory: Machines and Languages, McGraw Hill, New York, 1972
[12]
Kirsch, R.A., 'Computer Interpretation of English Text and Picture Patterns,' IEEE Trans. on Computers, C-14 (1964), pp. 363-376
[13]
Kuroda, S.Y., 'Classes of Languages and Linear Bounded Automata,' Information and Control, v. 7 (1964), pp. 207-223
[14]
Ledley, R.S. et. al., FIDAC: Film Input to Digital Automatic Computer and Associated Syntax-Directed Pattern Recognition Programming System, MIT Press, Cambridge, Mass., 1965
[15]
Milgram, D.L. and Rosenfeld, A., 'Array Automata and Array Grammars,' Information processing (1971), pp. 69-74
[16]
Miller, W.F. and Shaw, A.C., 'Linguistic Methods in Picture Processing,' Proc. AFIPS FJCC (1968), p. 38
[17]
Narasimhan, R., 'Labelling Schemata and Syntactic Description of Pictures,' Information and Control, v. 7 (1964), pp. 151-179
[18]
Narasimhan, R., 'Syntax-Directed Interpretation of Classes of Pictures,' CACM, v. 9 (1966), pp. 166-173
[19]
Phaltz, J.L., Web Grammars and Picture Descriptions, TR-70-138, Computer Science Center, University of Maryland, 1970
[20]
Rosenfeld, A., 'Isotonic Grammars, Parallel Grammars and Picture Grammars,' Machine Intelligence, v. 4 (1971), pp. 281-294
[21]
Rosenfeld, A., 'Array Grammar Normal Forms,' Information and Control, v. 23 (1973), pp. 173-182
[22]
Rosenfeld, A. and Milgram, D.L., 'Parallel/Sequential Array Automata,' Information Processing Letters, v. 2 (1973), pp. 43-46
[23]
Rosenfeld, A. and Pfaltz, J.L., 'Sequential Operations in Digital Picture Processing,' JACM, v. 13 (1966), pp. 471-494
[24]
Salomaa, A., Formal Languages, Academic Press, New York, 1973
[25]
Selkow, S.M., 'One-Pass Complexity of Digital Picture Properties,' JACM, v. 19 (1972), pp. 283-295
[26]
Siromoney, G., Siromoney, R. and Krithivasan, K., 'Abstract Families of Matrices and Picture Languages,' Computer Graphics and Image Processing, v. 1 (1972), pp. 284-307
[27]
Siromoney, G., Siromoney, R. and Krithivasan, K., 'Picture Languages with Array Rewriting Rules,' Information and Control, v. 22 (1973), pp. 447-470
[28]
Siromoney, G., Siromoney, R. and Krithivasan, K., 'Parallel Context-Free Languages,' Information and Control, v. 24 (1974), pp. 155-162
[29]
Skyum, S., 'Parallel Context-Free Languages,' Information and Control, v. 26 (1974), pp. 280-285
[30]
Smith, R.A., 'Cellular Automata and Formal Languages,' IEEE Symposium on Switching and Automata Theory, v. 11 (1970), pp. 216-224
[31]
Smith, R.A., 'Real-Time Language Recognition by One-Dimensional Cellular Automata,' J. of Computer and System Sciences, v. 6 (1972), pp. 233-253
[32]
Smith, R.A., 'Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata,' IEEE Symp. on Switching and Automata Theory, v. 12 (1971), pp. 144-152
[33]
Uhr, L. and Jordon, S., 'The Learning of Parameters for Generating Compound Characterization for Pattern Recognition,' Proc. of International Conf. on Artificial Intelligence, v. 1 (1969)
[34]
Wang, S.P. and Grosky, W.I., 'SIMPARAG - Simultaneous Parallel Array Grammars,' Proc. of the. Sagamore Conf. on Parallel Processing, Syracuse, New York (1975), p. 171
[35]
Wang, S.P. and Grosky, W.I., 'The Relation Between Uniformly Structured Tessellation Automata and Parallel Array Grammars,' Proc. of Int. Symp. on Uniformly Structured Automata and Logic, Tokyo, Japan (1975), pp. 97-102
[36]
Williams, K., U-Tree Automata: Machines That Can Classify Patterns, TR 73-02, Department of Computer Science, Michigan State University, 1973
[37]
Yodokawa, E. and Honda, N., 'On Two-Dimensional Pattern Generating Grammars,' Systems, Computers, Control, v. 1 (1970), pp. 141-148

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGGRAPH Computer Graphics
ACM SIGGRAPH Computer Graphics  Volume 10, Issue 1
Spring 1976
128 pages
ISSN:0097-8930
DOI:10.1145/957197
Issue’s Table of Contents
  • cover image ACM Conferences
    The papers of the ACM symposium on Graphic languages
    April 1976
    132 pages
    ISBN:9781450374446
    DOI:10.1145/800143

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 April 1976
Published in SIGGRAPH Volume 10, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)68
  • Downloads (Last 6 weeks)11
Reflects downloads up to 04 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (1980)Computer graphics: A keyword-indexed bibliography for the years 1976, 1977, and 1978Computer Graphics and Image Processing10.1016/S0146-664X(80)80003-714:1(24-79)Online publication date: Sep-1980
  • (1986)Array Languages and Lindenmayer Systems —A SurveyThe Book of L10.1007/978-3-642-95486-3_35(413-426)Online publication date: 1986
  • (1976)Formal properties of sequential/parallel matrix languagesProceedings of the 1976 annual conference10.1145/800191.805515(12-16)Online publication date: 20-Oct-1976

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media