메뉴 건너뛰기




Volumn , Issue , 2011, Pages 153-162

Image compression by 2D motif basis

Author keywords

2D motif basis; 2D patches; image compression

Indexed keywords

2D MOTIF BASIS; 2D PATCHES; COMPACT SETS; IMAGE COMPRESSION TECHNIQUES; INCREMENTAL PARSING; SOLID BLOCKS;

EID: 79955746719     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2011.22     Document Type: Conference Paper
Times cited : (8)

References (13)
  • 2
    • 33751217458 scopus 로고    scopus 로고
    • Faster two-dimensional pattern matching with rotations
    • DOI 10.1016/j.tcs.2006.09.012, PII S0304397506006153
    • A. Amir, O. Kapah, and D. Tsur. Faster two-dimensional pattern matching with rotations. Theoretical Computer Science, 368(3):196-204, 2006. (Pubitemid 44781137)
    • (2006) Theoretical Computer Science , vol.368 , Issue.3 , pp. 196-204
    • Amir, A.1    Kapah, O.2    Tsur, D.3
  • 3
  • 4
    • 37349016870 scopus 로고    scopus 로고
    • Motif patterns in 2D
    • DOI 10.1016/j.tcs.2007.10.019, PII S0304397507007645
    • A. Apostolico, L. Parida, and S. E. Rombo. Motif patterns in 2D. Theoretical Computer Science, 390(1):40-55, 2008. (Pubitemid 350309472)
    • (2008) Theoretical Computer Science , vol.390 , Issue.1 , pp. 40-55
    • Apostolico, A.1    Parida, L.2    Rombo, S.E.3
  • 6
    • 0037962552 scopus 로고    scopus 로고
    • Suffix tree data structures for matrices
    • A. Apostolico and Z. Galil, editors chapter 10
    • R. Giancarlo and R. Grossi. Suffix tree data structures for matrices. In A. Apostolico and Z. Galil, editors, Pattern matching algorithms, chapter 10, pages 293-340. 1997.
    • (1997) Pattern Matching Algorithms , pp. 293-340
    • Giancarlo, R.1    Grossi, R.2
  • 7
    • 70349948853 scopus 로고    scopus 로고
    • A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
    • C. Hundt, M. Liskiewicz, and R. Nevries. A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. Theoretical Computer Science, 410(51):5317-5333, 2009.
    • (2009) Theoretical Computer Science , vol.410 , Issue.51 , pp. 5317-5333
    • Hundt, C.1    Liskiewicz, M.2    Nevries, R.3
  • 10
    • 67650034254 scopus 로고    scopus 로고
    • Optimal extraction of motif patterns in 2D
    • S. E. Rombo. Optimal extraction of motif patterns in 2D. Information Processing Letters, 109(17):1015-1020, 2009.
    • (2009) Information Processing Letters , vol.109 , Issue.17 , pp. 1015-1020
    • Rombo, S.E.1
  • 11
    • 0004799251 scopus 로고
    • On the optimal asymptotic performance of universal ordering and discrimination of individual sequences
    • M. J. Weinberger, J. Ziv, and A. Lempel. On the optimal asymptotic performance of universal ordering and discrimination of individual sequences. In Data Compression Conference, pages 239-246, 1991.
    • (1991) Data Compression Conference , pp. 239-246
    • Weinberger, M.J.1    Ziv, J.2    Lempel, A.3
  • 12
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 13
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding
    • J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978. (Pubitemid 8631609)
    • (1978) IEEE Transactions on Information Theory , vol.IT-24 , Issue.5 , pp. 530-536
    • Ziv Jacob1    Lempel Abraham2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.