Inplace 2D matching in compressed images

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 853-862

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

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

^c POLYTECHNIC UNIVERSITY   (United States)

^d BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTER RECOGNITION; IMAGE COMPRESSION; OPTIMIZATION; TWO DIMENSIONAL;

LEMPEL-ZIV IMAGES; TWO DIMENSIONAL COMPRESSION; TWO DIMENSIONAL MATCHING;

PATTERN MATCHING;

EID: 0037739867     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A. Amir and G. Benson. Efficient two dimensional compressed matching. Proc. of Data Compression Conference, Snow Bird, Utah, pages 279-288, Mar 1992.
2. A. Amir and G. Benson. Two-dimensional periodicity and its application. SIAM J. Comp., 27(1):90-106, February.
3. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Technical Report GIT-CC-93/42, Georgia Institute of Technology, June 1993.
4. A. Amir, G. Benson, and M. Farach. An alphabet independent approach to two dimensional pattern matching. SIAM J. Comp., 23(2):313-323, 1994.
5. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in z-compressed files. Journal of Computer and System Sciences, 52(2):299-307, 1996.
6. A. Amir, G. Benson, and M. Farach. Optimal two-dimensional compressed matching. Journal of Algorithms, 24(2):354-379, August 1997.
7. A. Amir, G. M. Landau, and D. Sokol. Inplace run-length 2-dimensional compressed search. Theoretical Computer Science, 2002. to appear.
8. P. Berman, M. Karpinski, L. Larmore, W. Plandowski, and W. Ryter. On the complexity of pattern matching for highly compressed two dimensional texts. In Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97), pages 40-51. LNCS 1264, Springer, 1997.
9. M. Farch and M. Thorup. String matching in Lempel-Ziv compressed strings. Proc. 27th Annual ACM Symposium on the Theory of Computing, pages 703 712, 1995.
10. Z. Galil and K. Park. Alphabet-independent two-dimensional witness computation. SIAM J. Computing, 25(5):907-935, October 1996.
11. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Randomized efficient algorithms for compressed strings: The finger-print approach. In Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 96), pages 39-49. LNCS 1075, Springer, 1996.
12. L. Gasienec and W. Rytter. Almost optimal fully compressed pattern matching. In Data Compression Conference (DCC), Snow Bird, Utah, pages 434-443, 1999.
13. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Computing, 6:323-350, 1977.
14. A. Lempel and J. Ziv. Compression of two-dimensional images. In Z. Galil A. Apostolico, editor, Combinatorial Algorithms on Words, volume 12, pages 141-154. NATO ASI Series F, 1985.
15. W.Plandowski L.Gasieniec and W.Rytter. Constant-space string matching with smaller number of comparisons: sequential sampling. In Proc. 6th Annual Symposium on Combinatorial Pattern Matching (CPM 95). LNCS, Springer, 1995.
16. N. Memon, D. Neuhoff, and S. Shende. An analysis of some common scanning techniques for lossless image coding. http://citeseer.nj.nec.com/23495.html.
17. J. Ziv. personal communication. 1995.
18. J. Ziv and A. Lempel. Compression of individual sequences via variable rate coding. IEEE Trans. on Information Theory, IT-24:530-536, 1978.