메뉴 건너뛰기




Volumn 57, Issue 6, 2009, Pages 2258-2274

M-description lattice vector quantization: Index assignment and analysis

Author keywords

Index assignment; Lattice; Lattice vector quantization; Multiple description coding; Sublattice; Transportation problem

Indexed keywords

INDEX ASSIGNMENT; LATTICE; LATTICE VECTOR QUANTIZATION; MULTIPLE DESCRIPTION CODING; SUBLATTICE; TRANSPORTATION PROBLEM;

EID: 66849118746     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2009.2016873     Document Type: Article
Times cited : (20)

References (20)
  • 2
    • 0035396395 scopus 로고    scopus 로고
    • Multiple-description vector quantization with lattice codebooks: Design and analysis
    • Jul
    • V. A. Vaishampayan, N. J. A. Sloane, and S. D. Servetto, "Multiple-description vector quantization with lattice codebooks: Design and analysis," IEEE Trans. Inf. Theory, vol. 47, pp. 1718-1734, Jul. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , pp. 1718-1734
    • Vaishampayan, V.A.1    Sloane, N.J.A.2    Servetto, S.D.3
  • 3
    • 0036163284 scopus 로고    scopus 로고
    • Asymmetric multiple description lattice vector quantizers
    • Jan
    • S. N. Diggavi, N. J. A. Sloane, and V. A. Vaishampayan, "Asymmetric multiple description lattice vector quantizers," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 174-191, Jan. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.1 , pp. 174-191
    • Diggavi, S.N.1    Sloane, N.J.A.2    Vaishampayan, V.A.3
  • 4
    • 66849099213 scopus 로고    scopus 로고
    • Multiple description lattice vector quantization,
    • Ph.D. dissertation, Delft Univ. of Technology, Delft, The Netherlands
    • J. Otergaard, "Multiple description lattice vector quantization," Ph.D. dissertation, Delft Univ. of Technology, Delft, The Netherlands, 2007.
    • (2007)
    • Otergaard, J.1
  • 6
    • 33646030265 scopus 로고    scopus 로고
    • n-channel entropy-constrained multiple-description lattice vector quantization
    • May
    • J. Ostergaard, J. Jensen, and R. Heusdens, "n-channel entropy-constrained multiple-description lattice vector quantization," IEEE Trans. Inf. Theory, vol. 52, pp. 1956-1973, May 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , pp. 1956-1973
    • Ostergaard, J.1    Jensen, J.2    Heusdens, R.3
  • 7
    • 34547633986 scopus 로고    scopus 로고
    • Multiple-description coding by dithered delta-sigma quantization
    • Mar
    • J. Otergaard and R. Zamir, "Multiple-description coding by dithered delta-sigma quantization," in Proc. IEEE Data Compression Conf. 2007 (DCC), Mar. 2007, pp. 63-72.
    • (2007) Proc. IEEE Data Compression Conf. 2007 , vol.700 , pp. 63-72
    • Otergaard, J.1    Zamir, R.2
  • 8
    • 33947413944 scopus 로고    scopus 로고
    • Multiple description quantization via Gram-Schmidt orthogonalization
    • Dec
    • J. Chen, C. Tian, T. Berger, and S. S. Hemami, "Multiple description quantization via Gram-Schmidt orthogonalization," IEEE Trans. Inf. Theory, vol. 52, pp. 5197-5217, Dec. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , pp. 5197-5217
    • Chen, J.1    Tian, C.2    Berger, T.3    Hemami, S.S.4
  • 9
    • 46749134720 scopus 로고    scopus 로고
    • Optimal index assignment for multiple description lattice vector quantization
    • Mar
    • X. Huang and X. Wu, "Optimal index assignment for multiple description lattice vector quantization," in Proc. IEEE Data Compression Conf. 2006 (DCC), Mar. 2006, pp. 272-281.
    • (2006) Proc. IEEE Data Compression Conf. 2006 , vol.700 , pp. 272-281
    • Huang, X.1    Wu, X.2
  • 10
    • 66849128887 scopus 로고    scopus 로고
    • Multiple description lattice vector quantization,
    • M.A.Sc. thesis, Electr. Comput. Eng. Dept, McMaster Univ, Hamilton, ON, Canada
    • X. Huang, "Multiple description lattice vector quantization," M.A.Sc. thesis, Electr. Comput. Eng. Dept., McMaster Univ., Hamilton, ON, Canada, 2006.
    • (2006)
    • Huang, X.1
  • 11
    • 34547297343 scopus 로고    scopus 로고
    • Index assignment design for three-description lattice vector quantization
    • May
    • M. Liu, C. Zhu, and X. Wu, "Index assignment design for three-description lattice vector quantization," in Proc. IEEE Int. Symp. Circuits Systems 2006 (ISCAS), May 2006, pp. 3101-3104.
    • (2006) Proc. IEEE Int. Symp. Circuits Systems 2006 (ISCAS) , pp. 3101-3104
    • Liu, M.1    Zhu, C.2    Wu, X.3
  • 12
    • 34547431702 scopus 로고    scopus 로고
    • Optimized multiple description lattice vector quantization for wavelet image coding
    • Jul
    • H. Bai, C. Zhu, and Y. Zhao, "Optimized multiple description lattice vector quantization for wavelet image coding," IEEE Trans. Circuits Syst. Video Technol., vol. 17, no. 7, pp. 912-917, Jul. 2007.
    • (2007) IEEE Trans. Circuits Syst. Video Technol , vol.17 , Issue.7 , pp. 912-917
    • Bai, H.1    Zhu, C.2    Zhao, Y.3
  • 16
    • 84898938361 scopus 로고
    • A faster strongly polynomial minimum cost algorithm
    • J. Orlin, "A faster strongly polynomial minimum cost algorithm," in Proc. 20th ACM STOC, 1988, pp. 377-387.
    • (1988) Proc. 20th ACM STOC , pp. 377-387
    • Orlin, J.1
  • 17
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • H. W. Kuhn, "The hungarian method for the assignment problem," Naval Res. Logist. Quart., vol. 2, pp. 83-97, 1955.
    • (1955) Naval Res. Logist. Quart , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 18
    • 0001009871 scopus 로고
    • 5/2) algorithm for maximum matchings in bipartite graphs
    • 5/2) algorithm for maximum matchings in bipartite graphs," SIAM J. Comput., vol. 2, no. 4, pp. 225-231, 1973.
    • (1973) SIAM J. Comput , vol.2 , Issue.4 , pp. 225-231
    • Hopcroft, J.1    Karp, R.2
  • 19
    • 0029322412 scopus 로고
    • Efficient algorithms for the Hitchcock transportation problem
    • Jun
    • T. Tokuyama and J. Nakano, "Efficient algorithms for the Hitchcock transportation problem," SIAM J. Comput., vol. 24, pp. 563-578, Jun. 1995.
    • (1995) SIAM J. Comput , vol.24 , pp. 563-578
    • Tokuyama, T.1    Nakano, J.2


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