Inplace 2D matching in compressed images

Journal of Algorithms

Volumn 49, Issue 2, 2003, Pages 240-261

  Amir, Amihood ^a,b   Landau, Gad M ^c,d   Sokol, Dina ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PATTERN MATCHING;

PREPROCESSING TIME;

IMAGE COMPRESSION;

EID: 0242456326     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00088-9     Document Type: Article

References (24)

1. A. Amir, G. Benson, Efficient two dimensional compressed matching, in: Proc. of Data Compression Conference, Snow Bird, Utah, March, 1992, pp. 279-288.
2. A. Amir, G. Benson, Two-dimensional periodicity and its application, SIAM J. Comput. 27 (1) (1998) 90-106.
3. A. Amir, G. Benson, M. Farach, An alphabet independent approach to two dimensional pattern matching, SIAM J. Comput. 23 (2) (1994) 313-323.
4. A. Amir, G. Benson, M. Farach, Let sleeping files lie: Pattern matching in z-compressed files, J. Comput. System Sci. 52 (2) (1996) 299-307.
5. A. Amir, G. Benson, M. Farach, Optimal two-dimensional compressed matching, J. Algorithms 24 (2) (1997) 354-379.
6. A. Amir, G.M. Landau, D. Sokol, Inplace run-length 2-dimensional compressed search, Theoret. Comput. Sci. 290 (3) (2003) 1361-1383.
7. E. Antebi, Error free compression of Markov pictures, Master's thesis, The Technion-Israel Institute of Technology, Department of Electrical Engineering, 1987.
8. P. Berman, M. Karpinski, L. Larmore, W. Plandowski, W. Rytter, On the complexity of pattern matching for highly compressed two dimensional texts, in: Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM '97), in: Lecture Notes in Comput. Sci., Vol. 1264, Springer, 1997, pp. 40-51.
9. M. Crochemore, L. Gasieniec, W. Plandowski, W. Rytter, Two-dimensional pattern matching in linear time and small space, in: Proceedings of 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS '95), 1995, pp. 181-192.
10. M. Farach, M. Thorup, String matching in Lempel-Ziv compressed strings, in: Proc. 27th Annual ACM Symposium on the Theory of Computing, 1995, pp. 703-712.
11. Z. Galil, K. Park, Alphabet-independent two-dimensional witness computation, SIAM J. Comput. 25 (5) (1996) 907-935.
12. L. Gasieniec, M. Karpinski, W. Plandowski, W. Rytter, Randomized efficient algorithms for compressed strings: The finger-print approach, in: Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 96), in: Lecture Notes in Comput. Sci., Vol. 1075, Springer, 1996, pp. 39-49.
13. L. Gasieniec, W. Plandowski, W. Rytter, Constant-space string matching with smaller number of comparisons: sequential sampling, in: Proc. 6th Annual Symposium on Combinatorial Pattern Matching (CPM '95), in: Lecture Notes in Comput. Sci., Springer, 1995.
14. L. Gasieniec, W. Rytter, Almost optimal fully compressed pattern matching, in: Data Compression Conference (DCC), Snow Bird, Utah, 1999, pp. 434-443.
15. C. Gotsman, M. Lindenbaum, On the metric properties of discrete space-filling curves, IEEE Trans. Image Process. 5 (5) (1996) 794-797.
16. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
17. A. Lempel, J. Ziv, Compression of two-dimensional images, in: Z. Galil, A. Apostolico (Eds.), Combinatorial Algorithms on Words, in: NATO ASI Ser. F, Vol. 12, 1985, pp. 141-154.
18. N. Memon, D. Neuhoff, S. Shende, An analysis of some common scanning techniques for lossless image coding, http://citeseer.nj.nec.com/23495.html.
19. A. Orni, Measuring the locality of space-filling curves, Master's thesis. The Technion-Israel Institute of Technology, Department of Mathematics and Computer Science, 1998.
20. U. Vishkin, Optimal parallel pattern matching in strings, in: Proc. 12th ICALP, 1985, pp. 91-113.
21. U. Vishkin, Deterministic sampling - a new technique for fast pattern matching, SIAM J. Comput. 20(1991) 303-314.
22. T.A. Welch, A technique for high-performance data compression, IEEE Comput. 17 (1984) 8-19.
23. J. Ziv, Personal communication, 1995.
24. J. Ziv, A. Lempel, Compression of individual sequences via variable rate coding, IEEE Trans. Inform. Theory IT-24 (1978) 530-536.