메뉴 건너뛰기




Volumn 50, Issue 8, 2004, Pages 1584-1604

Network vector quantization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DECODING; IMAGE CODING; MARKOV PROCESSES; MATHEMATICAL MODELS; SIGNAL DISTORTION; THEOREM PROVING; VECTOR QUANTIZATION;

EID: 3943075859     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.831832     Document Type: Article
Times cited : (71)

References (48)
  • 2
    • 0001853737 scopus 로고
    • Hierarchical coding of discrete sources
    • V. Koshelev, "Hierarchical coding of discrete sources," Probl. Pered. Inform., vol. 17, no. 3, pp. 20-33, 1981.
    • (1981) Probl. Pered. Inform. , vol.17 , Issue.3 , pp. 20-33
    • Koshelev, V.1
  • 3
    • 0026120037 scopus 로고
    • Successive refinement of information
    • Mar
    • W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, Mar. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 269-275
    • Equitz, W.H.R.1    Cover, T.M.2
  • 4
    • 0016130289 scopus 로고
    • Source coding for a simple network
    • Nov
    • R. M. Gray and A. D. Wyner, "Source coding for a simple network," Bell Syst. Tech. J., vol. 53, no. 9, pp. 1681-1721, Nov. 1974.
    • (1974) Bell Syst. Tech. J. , vol.53 , Issue.9 , pp. 1681-1721
    • Gray, R.M.1    Wyner, A.D.2
  • 5
    • 0033307128 scopus 로고    scopus 로고
    • Broadcast system source codes: A new paradigm for data compression
    • Pacific Grove, CA, Oct
    • Q. Zhao and M. Effros, "Broadcast system source codes: A new paradigm for data compression," in Conf. Rec. 33rd Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Oct. 1999, pp. 337-341.
    • (1999) Conf. Rec. 33rd Asilomar Conf. Signals, Systems, and Computers , pp. 337-341
    • Zhao, Q.1    Effros, M.2
  • 6
    • 0015648934 scopus 로고
    • Noiseless coding of correlated information sources
    • July
    • D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inform. Theory, vol. IT-19, pp. 471-480, July 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 471-480
    • Slepian, D.1    Wolf, J.K.2
  • 7
    • 0016882596 scopus 로고
    • The rate-distortion function for source coding with side information at the decoder
    • Jan
    • A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-22, pp. 1-10, Jan. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 1-10
    • Wyner, A.D.1    Ziv, J.2
  • 8
    • 49349120031 scopus 로고
    • The rate-distortion function for source coding with side information at the decoder-II: General sources
    • A. D. Wyner, "The rate-distortion function for source coding with side information at the decoder-II: General sources," Inform. Contr., vol. 38, pp. 60-80, 1978.
    • (1978) Inform. Contr. , vol.38 , pp. 60-80
    • Wyner, A.D.1
  • 9
    • 0019070330 scopus 로고
    • Source coding for multiple descriptions
    • Oct
    • J. K. Wolf, A. D. Wyner, and J. Ziv, "Source coding for multiple descriptions," Bell Syst. Tech. J., vol. 59, pp. 1417-1426, Oct. 1980.
    • (1980) Bell Syst. Tech. J. , vol.59 , pp. 1417-1426
    • Wolf, J.K.1    Wyner, A.D.2    Ziv, J.3
  • 10
    • 0019178773 scopus 로고
    • On a source coding problem with two channels and three receivers
    • Dec
    • L. Ozarow, "On a source coding problem with two channels and three receivers," Bell Syst. Tech. J., vol. 59, pp. 446-472, Dec. 1980.
    • (1980) Bell Syst. Tech. J. , vol.59 , pp. 446-472
    • Ozarow, L.1
  • 11
    • 84948588467 scopus 로고
    • Achievable rates for multiple descriptions
    • Nov
    • A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-28, pp. 851-857, Nov. 1982.
    • (1982) IEEE Trans. Inform. Theory , vol.IT-28 , pp. 851-857
    • El Gamal, A.1    Cover, T.M.2
  • 12
    • 0034188670 scopus 로고    scopus 로고
    • Channel-matched hierarchical table-lookup vector quantization
    • May
    • H. Jafarkhani and N. Farvardin, "Channel-matched hierarchical table-lookup vector quantization," IEEE Trans. Inform. Theory, vol. 46, pp. 1121-1125, May 2000.
    • (2000) IEEE Trans. Inform. Theory , vol.46 , pp. 1121-1125
    • Jafarkhani, H.1    Farvardin, N.2
  • 13
    • 0018918171 scopus 로고
    • An algorithm for vector quantizer design
    • Jan
    • Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. COM-28, pp. 84-95, Jan. 1980.
    • (1980) IEEE Trans. Commun. , vol.COM-28 , pp. 84-95
    • Linde, Y.1    Buzo, A.2    Gray, R.M.3
  • 16
    • 0026260871 scopus 로고
    • A greedy tree growing algorithm for the design of variable rate vector quantizers
    • Nov
    • E. A. Riskin and R. M. Gray, "A greedy tree growing algorithm for the design of variable rate vector quantizers," IEEE Trans. Signal Processing, vol. 39, pp. 2500-2507, Nov. 1991.
    • (1991) IEEE Trans. Signal Processing , vol.39 , pp. 2500-2507
    • Riskin, E.A.1    Gray, R.M.2
  • 17
    • 0029708302 scopus 로고    scopus 로고
    • Fixed-rate successively refinable scalar quantizers
    • Snowbird, UT, Apr
    • H. Brunk and N. Farvardin, "Fixed-rate successively refinable scalar quantizers," in Proc. IEEE Data Compression Conf., Snowbird, UT, Apr. 1996, pp. 250-259.
    • (1996) Proc. IEEE Data Compression Conf. , pp. 250-259
    • Brunk, H.1    Farvardin, N.2
  • 18
    • 0030675160 scopus 로고    scopus 로고
    • Entropy-constrained successively refinable scalar quantization
    • Snowbird, UT, Mar
    • H. Jafarkhani, H. Brunk, and N. Farvardin, "Entropy-constrained successively refinable scalar quantization," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 1997, pp. 337-346.
    • (1997) Proc. IEEE Data Compression Conf. , pp. 337-346
    • Jafarkhani, H.1    Brunk, H.2    Farvardin, N.3
  • 19
    • 0031705156 scopus 로고    scopus 로고
    • Practical multi-resolution source coding: TSVQ revisited
    • Snowbird, UT, Mar
    • M. Effros, "Practical multi-resolution source coding: TSVQ revisited," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 1998, pp. 53-62.
    • (1998) Proc. IEEE Data Compression Conf. , pp. 53-62
    • Effros, M.1
  • 20
    • 10644252848 scopus 로고    scopus 로고
    • Multiresolution vector quantization
    • submitted for publication
    • M. Effros and D. Dugatkin, "Multiresolution vector quantization," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
    • Effros, M.1    Dugatkin, D.2
  • 22
    • 0027597173 scopus 로고
    • Design of multiple description scalar quantizers
    • May
    • V. A. Vaishampayan, "Design of multiple description scalar quantizers," IEEE Trans. Inform. Theory, vol. 39, pp. 821-834, May 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 821-834
    • Vaishampayan, V.A.1
  • 23
    • 0028325709 scopus 로고
    • Design of entropy-constrained multiple description scalar quantizers
    • Jan
    • V. A. Vaishampayan and J. Domaszewicz, "Design of entropy-constrained multiple description scalar quantizers," IEEE Trans. Inform. Theory, vol. 40, pp. 245-250, Jan. 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 245-250
    • Vaishampayan, V.A.1    Domaszewicz, J.2
  • 24
    • 3943068975 scopus 로고    scopus 로고
    • Rapid near-optimal VQ design with a deterministic data net
    • Chicago, IL, June
    • M. Effros and L. Schulman, "Rapid near-optimal VQ design with a deterministic data net," in Proc. IEEE Int. Symp. Inform. Theory, Chicago, IL, June 2004, p. 298.
    • (2004) Proc. IEEE Int. Symp. Inform. Theory , pp. 298
    • Effros, M.1    Schulman, L.2
  • 25
    • 0032633805 scopus 로고    scopus 로고
    • Generalized multiple description vector quantization
    • Snowbird, UT, Mar
    • M. Fleming and M. Effros, "Generalized multiple description vector quantization," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 1999, pp. 3-12.
    • (1999) Proc. IEEE Data Compression Conf. , pp. 3-12
    • Fleming, M.1    Effros, M.2
  • 26
    • 0033905291 scopus 로고    scopus 로고
    • Lossless and lossy broadcast system source codes: Theoretical limits, optimal design, and empirical performance
    • Snowbird, UT, Mar
    • Q. Zhao and M. Effros, "Lossless and lossy broadcast system source codes: Theoretical limits, optimal design, and empirical performance," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2000, pp. 63-72.
    • (2000) Proc. IEEE Data Compression Conf. , pp. 63-72
    • Zhao, Q.1    Effros, M.2
  • 29
    • 0023670154 scopus 로고
    • Encoding of correlated observations
    • Nov
    • T. J. Flynn and R. M. Gray, "Encoding of correlated observations," IEEE Trans. Inform. Theory, vol. IT-33, pp. 773-787, Nov. 1987.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , pp. 773-787
    • Flynn, T.J.1    Gray, R.M.2
  • 30
    • 0015992185 scopus 로고
    • Recent results in Shannon theory
    • Jan
    • A. D. Wyner, "Recent results in Shannon theory," IEEE Trans. Inform. Theory, vol. IT-20, pp. 2-10, Jan. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 2-10
    • Wyner, A.D.1
  • 31
    • 0036611624 scopus 로고    scopus 로고
    • Nested linear/lattice codes for structured multiterminal binning
    • June
    • R. Zamir, S. Shamai (Shitz), and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inform. Theory, vol. 48, pp. 1250-76, June 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 1250-1276
    • Zamir, R.1    Shamai, S.2    Erez, U.3
  • 33
    • 0029407972 scopus 로고
    • Necessary conditions for the optimality of variable-rate residual vector quantizers
    • Nov
    • F. Kossentini, M. J. T. Smith, and C. F. Barnes, "Necessary conditions for the optimality of variable-rate residual vector quantizers," IEEE Trans. Inform. Theory, vol. 41, pp. 1903-14, Nov. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 1903-1914
    • Kossentini, F.1    Smith, M.J.T.2    Barnes, C.F.3
  • 34
    • 0001467577 scopus 로고
    • The zero-error side information problem and chromatic numbers
    • Sept
    • H. S. Witsenhausen, "The zero-error side information problem and chromatic numbers," IEEE Trans. Inform. Theory, vol. IT-22, pp. 592-593, Sept. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 592-593
    • Witsenhausen, H.S.1
  • 35
    • 0030241020 scopus 로고    scopus 로고
    • Source coding and graph entropies
    • Sept
    • N. Alon and A. Orlitsky, "Source coding and graph entropies," IEEE Trans. Inform. Theory, vol. 42, pp. 1329-1339, Sept. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1329-1339
    • Alon, N.1    Orlitsky, A.2
  • 36
    • 0032182852 scopus 로고    scopus 로고
    • Zero-error information theory
    • Oct
    • J. Körner and A. Orlitsky, "Zero-error information theory," IEEE Trans. Inform. Theory, vol. 44, pp. 2207-2228, Oct. 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 2207-2228
    • Körner, J.1    Orlitsky, A.2
  • 37
    • 0032651629 scopus 로고    scopus 로고
    • Distributed source coding using syndromes (DISCUS): Design and construction
    • Snowbird, UT, Mar
    • S. S. Pradhan and K. Ramchandran, "Distributed source coding using syndromes (DISCUS): Design and construction," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 1999, pp. 158-167.
    • (1999) Proc. IEEE Data Compression Conf. , pp. 158-167
    • Pradhan, S.S.1    Ramchandran, K.2
  • 38
    • 0034448069 scopus 로고    scopus 로고
    • On instantaneous codes for zero-error coding of two correlated sources
    • Sorrento, Italy, June
    • Y. Yan and T. Berger, "On instantaneous codes for zero-error coding of two correlated sources," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 344.
    • (2000) Proc. IEEE Int. Symp. Information Theory , pp. 344
    • Yan, Y.1    Berger, T.2
  • 40
    • 0037271940 scopus 로고    scopus 로고
    • Lossless and near-lossless source coding for multiple access networks
    • Jan
    • Q. Zhao and M. Effros, "Lossless and near-lossless source coding for multiple access networks," IEEE Trans. Inform. Theory, vol. 49, pp. 112-128, Jan. 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.49 , pp. 112-128
    • Zhao, Q.1    Effros, M.2
  • 41
    • 0035000235 scopus 로고    scopus 로고
    • Optimal code design for lossless and near-lossless source coding in multiple access networks
    • Snowbird, UT, Mar
    • Q. Zhao, "Optimal code design for lossless and near-lossless source coding in multiple access networks," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2001, pp. 263-272.
    • (2001) Proc. IEEE Data Compression Conf. , pp. 263-272
    • Zhao, Q.1
  • 43
    • 0016486048 scopus 로고
    • A proof of the data compression theorem of Slepian and Wolf for ergodic sources
    • Mar
    • T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inform. Theory, vol. IT-22, pp. 226-228, Mar. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 226-228
    • Cover, T.M.1
  • 44
    • 84942245925 scopus 로고    scopus 로고
    • Low complexity code design for lossless and near lossless side information source codes
    • Snowbird, UT, Mar
    • Q. Zhao and M. Effros, "Low complexity code design for lossless and near lossless side information source codes," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2003, pp. 3-12.
    • (2003) Proc. IEEE Data Compression Conf. , pp. 3-12
    • Zhao, Q.1    Effros, M.2
  • 45
    • 0031076920 scopus 로고    scopus 로고
    • Cluster-based probability model and its application to image and texture processing
    • Feb
    • K. Popat and R. W. Picard, "Cluster-based probability model and its application to image and texture processing," IEEE Trans. Image Processing, vol. 6, pp. 268-284, Feb. 1997.
    • (1997) IEEE Trans. Image Processing , vol.6 , pp. 268-284
    • Popat, K.1    Picard, R.W.2
  • 46
    • 0026821563 scopus 로고
    • Globally optimal vector quantization design by stochastic relaxation
    • Feb
    • K. Zeger and A. Gersho, "Globally optimal vector quantization design by stochastic relaxation," IEEE Trans. Signal Processing, vol. 40, pp. 310-22, Feb. 1992.
    • (1992) IEEE Trans. Signal Processing , vol.40 , pp. 310-322
    • Zeger, K.1    Gersho, A.2
  • 47
    • 84899025015 scopus 로고
    • Vector quantization by deterministic annealing
    • July
    • K. Rose, E. Gurewitz, and G. C. Fox, "Vector quantization by deterministic annealing," IEEE Trans. Inform. Theory, vol. 38, pp. 1249-57, July 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , pp. 1249-1257
    • Rose, K.1    Gurewitz, E.2    Fox, G.C.3
  • 48
    • 0016576623 scopus 로고
    • Source coding with side information and a converse for degraded broadcast channels
    • Nov
    • R. Ahlswede and J. Körner, "Source coding with side information and a converse for degraded broadcast channels," IEEE Trans. Inform. Theory, vol. IT-21, pp. 629-637, Nov. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 629-637
    • Ahlswede, R.1    Körner, J.2


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