[ { "id": "authors:5e388-90h02", "collection": "authors", "collection_id": "5e388-90h02", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENisit05", "type": "book_section", "title": "On the rate loss and construction of source codes for broadcast channels", "book_title": "International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "abstract": "In this paper, we first define and bound the rate loss of source codes for broadcast channels. Our broadcast channel model comprises one transmitter and two receivers; the transmitter is connected to each receiver by a private channel and to both receivers by a common channel. The transmitter sends a description of source (X, Y) through these channels, receiver 1 reconstructs X with distortion D1, and receiver 2 reconstructs Y with distortion D2. Suppose the rates of the common channel and private channels 1 and 2 are R0, R1, and R2, respectively. The work of Gray and Wyner gives a complete characterization of all achievable rate triples (R0,R1,R2) given any distortion pair (D1,D2). In this paper, we define the rate loss as the gap between the achievable region and the outer bound composed by the rate-distortion functions, i.e., R0+R1+R2 \u2265 RX,Y (D1,D2), R0 + R1 \u2265 RX(D1), and R0 + R2 \u2265 RY (D2). We upper bound the rate loss for general sources by functions of distortions and upper bound the rate loss for Gaussian sources by constants, which implies that though the outer bound is generally not achievable, it may be quite close to the achievable region. This also bounds the gap between the achievable region and the inner bound proposed by Gray and Wyner and bounds the performance penalty associated with using separate decoders rather than joint decoders. We then construct such source codes using entropy-constrained dithered quantizers. The resulting implementation has low complexity and performance close to the theoretical optimum. In particular, the gap between its performance and the theoretical optimum can be bounded from above by constants for Gaussian sources.", "doi": "10.1109/ISIT.2005.1523297", "isbn": "0-7803-9151-9", "publisher": "IEEE", "publication_date": "2005-10-31", "pages": "82-86" }, { "id": "authors:7p492-y2y60", "collection": "authors", "collection_id": "7p492-y2y60", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04", "type": "book_section", "title": "Multiresolution source coding using entropy constrained dithered scalar quantization", "book_title": "Data Compression Conference (DCC '04), Snowbird, UT, 23-25 March 2004", "author": [ { "family_name": "Zhao", "given_name": "Qian", "clpid": "Zhao-Q" }, { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "contributor": [ { "family_name": "Storer", "given_name": "James A." }, { "family_name": "Cohn", "given_name": "Martin" } ], "abstract": "In this paper, we build multiresolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followed by uniform scalar quantization and then by entropy coding achieves performance close to the n-dimensional optimum for a multiresolution source code. Based on this result, we propose a practical code design algorithm and compare its performance with that of the set partitioning in hierarchical trees (SPIHT) algorithm on natural images.", "doi": "10.1109/DCC.2004.1281447", "isbn": "0769520820", "publisher": "IEEE", "place_of_publication": "Los Alamitos, CA", "publication_date": "2004-08-24", "pages": "22-31" }, { "id": "authors:gkrvq-9jr73", "collection": "authors", "collection_id": "gkrvq-9jr73", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENisit02", "type": "book_section", "title": "On the rate loss of multiple description source codes and additive successive refinement codes", "book_title": "IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "abstract": "The rate loss of a multi-resolution source code (MRSC) describes the difference between the rate needed to achieve distortion D/sub i/ in resolution i and the rate-distortion function R(D/sub i/). We generalize the rate loss definition and bound the rate losses of multiple description source codes (MDSCs) and additive MRSCs (AMRSCs). For a 2-description MDSC (2DSC), the rate loss of description i with distortion D/sub i/ is defined as L/sub i/=R/sub i/-R(D/sub i/), i=1, 2, where R/sub i/ is the rate of the ith description; the rate loss associated with decoding the two descriptions together to achieve central distortion D/sub 0/ is measured as L/sub 0/=R/sub 1/+R/sub 2/-R(D/sub 0/) or as L/sub 12/=L/sub 1/+L/sub 2/. We show that given an arbitrary source with variance /spl sigma//sup 2/, there exists a 2DSC with L/sub 1//spl les/0.5 and (a) L/sub 0//spl les/1 if D/sub 0//spl les/D/sub 1/+D/sub 2/-/spl sigma//sup 2/, (b) L/sub 12//spl les/1 if 1/D/sub 0//spl les/1/D/sub 1/+1/D/sub 2/-1//spl sigma//sup 2/, (c) L/sub 0//spl les/L/sub G0/+1.5 and L/sub 12//spl les/L/sub G12/+1 otherwise, where L/sub G0/ and L/sub G12/ are the joint rate losses of a normal (0, /spl sigma//sup 2/) source. An AMRSC is an MRSC with the kth-resolution reconstruction equal to the sum of the first k side reproductions of an MDSC. We obtain one bound on the rate loss of an AMRSC.", "doi": "10.1109/ISIT.2002.1023366", "isbn": "0-7803-7501-7", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2004-02-26", "pages": "94" }, { "id": "authors:71dvy-a0m53", "collection": "authors", "collection_id": "71dvy-a0m53", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENisit03", "type": "book_section", "title": "On the achievable region for multiple description source codes on Gaussian sources", "book_title": "IEEE International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June-4 July, 2003", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "abstract": "We demonstrate inconsistencies in prior results on the achievable region for multiple description (MD) source codes on i.i.d. Gaussian sources with the squared error distortion measure. We then describe the complete region.", "doi": "10.1109/ISIT.2003.1228209", "isbn": "0-7803-7728-1", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2003-09-15", "pages": "195" }, { "id": "authors:h6rj0-em450", "collection": "authors", "collection_id": "h6rj0-em450", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENdcc03", "type": "book_section", "title": "Network source coding using entropy constrained dithered quantization", "book_title": "Data Compression Conference (DCC '03), Snowbird, UT, 25-27 March 2003", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Zhao", "given_name": "Qian", "clpid": "Zhao-Q" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "contributor": [ { "family_name": "Storer", "given_name": "James A." }, { "family_name": "Cohn", "given_name": "Martin" } ], "abstract": "Assuming the squared error distortion measure, we bound the performance achieved by using scalar entropy constrained dithered quantization (SECDQ) [1] to build multi-resolution (MR), multiple access (MA), and broadcast system (BS) source codes.", "doi": "10.1109/DCC.2003.1194046", "isbn": "0-7695-1896-6", "publisher": "IEEE", "place_of_publication": "Los Alamitos, CA", "publication_date": "2003-04-22", "pages": "427" }, { "id": "authors:0g0tw-eex30", "collection": "authors", "collection_id": "0g0tw-eex30", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc03", "type": "book_section", "title": "Suboptimality of the Karhunen-Lo\u00e8ve transform for transform coding", "book_title": "DCC 2003, Data Compression Conference, Snowbird, UT, 23-25 March 2003", "author": [ { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" }, { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Zeger", "given_name": "Kenneth", "clpid": "Zeger-K" } ], "contributor": [ { "family_name": "Storer", "given_name": "James A." }, { "family_name": "Cohn", "given_name": "Martin" } ], "abstract": "We examine the performance of the KLT for transform coding applications. The KLT has long been viewed as the best available block transform for transform coding. This paper treats fixed-rate and variable-rate transform codes. The fixed-rate approach uses an optimal fixed-rate scalar quantizer followed by an optimal entropy code. Earlier work shows that for the variable-rate case there exist sources on which the KLT is not unique and the optimal transform code matched to a \"worst\" KLT yields performance as much as 1.5 dB worse than the optimal transform code matched to a \"best\" KLT. In this paper, we strengthen that result to show that in both the fixed-rate and the variable-rate coding frameworks there exist sources for which the performance penalty for a \"worst\" KLT can be made arbitrarily large. Further, we demonstrate in both frameworks that there exist sources for which even a best KLT gives suboptimal performance. Finally, we show that even for vector sources where the KLT yields independent coefficients, the KLT can be suboptimal for fixed-rate coding.", "doi": "10.1109/DCC.2003.1194020", "isbn": "0-7695-1896-6", "publisher": "IEEE", "place_of_publication": "Los Alamitos, CA", "publication_date": "2003-04-22", "pages": "293-302" }, { "id": "authors:0a876-csr79", "collection": "authors", "collection_id": "0a876-csr79", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENisit01", "type": "book_section", "title": "Improved bounds for the rate loss of multi-resolution source codes", "book_title": "IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "abstract": "In this paper, we present new bounds for the rate loss of multi-resolution source codes. Consider an M-resolution code with ith-resolution rate and distortion Ri and Di. The ith-resolution rate loss, defined as Li=Ri-R(Di), describes the performance degradation of the multi-resolution code compared to the best single-resolution code with the same distortion. For 2-resolution codes, there are three scenarios of particular interest: (i) both resolutions are equally important; (ii) the rate loss at the first resolution is 0; (iii) the rate loss at the second resolution is 0. Lastras and Berger (see IEEE Trans. Inform. Theory, vol.47, no.3, p.918-26, March 2001) give constant upper bounds for the rate loss of an arbitrary i.i.d. source in scenarios (i) and (ii) and an asymptotic bound for scenario (iii) as D2\u21920. In this paper, we: (a) prove that L2 \u2a7d1.1610 for all D2", "doi": "10.1109/ISIT.2001.936056", "isbn": "0-7803-7123-2", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2001", "pages": "193" }, { "id": "authors:x409e-y6m25", "collection": "authors", "collection_id": "x409e-y6m25", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENisit00", "type": "book_section", "title": "Multi-resolution channel codes", "book_title": "IEEE International Symposium on Information Theory (ISIT '00), Sorrento, Italy, 25-30 June 2000", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "abstract": "In this paper, we present a new approach for channel coding on unknown or time-varying channels. Given a family of possible channel characteristics, we define a multi-resolution channel code as a single channel coding codebook from which a collection of codes of increasing rates are extracted by choosing larger and larger nested subsets of the original set of codewords. We give an achievable rate region and a tight converse.", "doi": "10.1109/ISIT.2000.866785", "isbn": "0-7803-5857-0", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "2000", "pages": "487" }, { "id": "authors:c05z7-rm550", "collection": "authors", "collection_id": "c05z7-rm550", "cite_using_url": "https://resolver.caltech.edu/CaltechAUTHORS:FENicassp99", "type": "book_section", "title": "Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm", "book_title": "IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '99), Phoenix, AZ, 15-19 March 1999", "author": [ { "family_name": "Feng", "given_name": "Hanying", "clpid": "Feng-H" }, { "family_name": "Effros", "given_name": "Michelle", "clpid": "Effros-M" } ], "abstract": "The weighted universal transform code (WUTC) is a two-stage transform code that replaces JPEG's single, non-optimal transform code with a jointly designed collection of transform codes to achieve good performance across a broader class of possible sources. Unfortunately, the performance gains of WUTC are achieved at the expense of significant increases in computational complexity and larger codes. We here present a faster, more space-efficient WUTC algorithm. The new algorithm uses separable coding instead of direct KLT. While separable coding gives performance comparable to that of WUTC, it uses only 1/8 of the floating-point multiplications and 1/32 of storage of direct KLT. Experimental results included in this work compare the performance of new separable WUTC with both the WUTC and other fast variations of that algorithm.", "doi": "10.1109/ICASSP.1999.760622", "isbn": "0-7803-5041-3", "publisher": "IEEE", "place_of_publication": "Piscataway, NJ", "publication_date": "1999", "pages": "2435-2438" } ]