A SAT-based parser and completer for pictures specified by tiling

Pattern Recognition

Volumn 41, Issue 2, 2008, Pages 555-566

  Pradella, Matteo ^a   Crespi Reghizzi, Stefano ^a,b  

^a CNR   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

Picture languages; Picture image generation and interpolation; SAT solvers; Syntactic pattern recognition; Tiling systems; Two dimensional grammars and languages; Wang tiles

Indexed keywords

CELLULAR AUTOMATA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GRAMMARS; IMAGE ANALYSIS; PIXELS; PROBLEM SOLVING;

IMAGE GENERATION; IMAGE INTERPOLATION; PICTURE LANGUAGES; SAT-SOLVERS; SYNTACTIC PATTERN RECOGNITION; TILING SYSTEMS; TWO DIMENSIONAL GRAMMARS; WANG TILES;

PATTERN RECOGNITION;

EID: 34848881021     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2007.06.018     Document Type: Article

References (20)

1. Tanaka E. Theoretical aspects of syntactic pattern recognition. Pattern Recognition 28 7 (1995) 1053-1061
2. Fu K.S. Syntactic Pattern Recognition and Applications (1982), Prentice-Hall, Englewood Cliffs, NJ
3. Bourbakis N.G. Special issue on languages for image processing and pattern recognition. Pattern Recognition 32 2 (1999) 253
4. Morita K., and Imai K. Uniquely parsable array grammars for generating and parsing connected patterns. Pattern Recognition 32 2 (1999) 269-276
5. D. Giammarresi, A. Restivo, Two-dimensional languages, in: A. Salomaa, G. Rozenberg (Eds.), Handbook of Formal Languages, vol. 3, Beyond Words, Springer, Berlin, 1997, pp. 215-267.
6. Siromoney R., Subramanian K., Dare V., and Thomas D. Some results on picture languages. Pattern Recognition 32 2 (1999) 295-304
7. Cherubini A., Crespi Reghizzi S., Pradella M., and San Pietro P. Picture languages: tiling systems versus tile rewriting grammars. Theor. Comput. Sci. 356 1-2 (2006) 90-103
8. Allauzen C., and Durand B. Tiling problems. In: Borger E., and Gradel E. (Eds). The Classical Decision Problem (1997), Springer, Berlin
9. M. Cohen, J. Shade, S. Hiller, O. Deussen, Wang tiles for image and texture generation, in: Siggraph'03 Conference Proceedings of ACM Transactions on Graphics, vol. 22(3), 2003, pp. 287-294.
10. Dersanambika K.S., Krithivasan K., Martín-Vide C., and Subramanian K.G. Local and recognizable hexagonal picture languages. Int. J. Pattern Recognition Artif. Intell. 19 7 (2005) 853-871
11. Inoue K., and Nakamura A. Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci. 13 (1977) 95-121
12. Blum M., and Hewitt C. Automata on a two-dimensional tape. IEEE Symposium on Switching and Automata Theory (1967) 155-160
13. Giammarresi D., and Restivo A. Recognizable picture languages. Int. J. Pattern Recognition Artif. Intell. 6 2-3 (1992) 241-256 special issue on Parallel Image Processing
14. Lewis H. Complexity of solvable cases of the decision problem for predicate calculus. Proceedings of the 19th Symposium on Foundations of Computer Science (1978) 35-47
15. Lindgren K., Moore C., and Nordahl M. Complexity of two-dimensional patterns. J. Statist. Phys. 91 5-6 (1998) 909-951
16. Clarke E., Grumberg O., and Peled D. Model Checking (1999), MIT Press, Cambridge, MA
17. N. Eén, N. Sörensson, An extensible SAT-solver, in: SAT 2003: Sixth International Conference on Theory and Applications of Satisfiability Testing, 2003.
18. Davis M., Logemann G., and Loveland D. A machine program for theorem proving. Commun. ACM 5 7 (1962) 394-397
19. A. Biere, A. Cimatti, E. Clarke, Y. Zhu, Symbolic model checking without BDDs, in: Lecture Notes in Computer Science, vol. 1579, 1999, pp. 193-207.
20. Alekhnovich M., Hirsch E., and Itsykson D. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Proceedings of ICALP 2004, Lecture Notes in Computer Science vol. 3142 (2004), Springer, Berlin 84-96