Learn More
We discuss reliable transmission of a discrete memoryless source over a discrete memoryless broadcast channel, where each receiver has side information (of arbitrary quality) about the source unknown to the sender. When there are K=2 receivers, the optimum coding strategy using separate and stand-alone source and channel codes is to build two independent(More)
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either their ability to reduce the data set that needs to be examined, or their ability to reduce the representation size of each data object. We first propose modifications to wellknown(More)
Flexibility and efficiency of coding, content extraction, and content-based search are key research topics in the field of interactive multimedia. Ongoing ISO MPEG-4 and MPEG-7 activities are targeting standardization to facilitate such services. European COST Telecommunications activities provide a framework for research collaboration. COST 211 and COST(More)
A two-way relay channel in which two users communicate with each other over a relay terminal is considered. In particular, a ldquoseparatedrdquo two-way relay channel, in which the users do not receive each other's signals is studied. Various achievable schemes are proposed and corresponding achievable rate regions are characterized. Specifically, a(More)
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based technique called VAle has been proposed for indexing high dimensional data. It has been shown that the VAle is an e ective technique compared to the current approaches based on space and(More)
The asymptotic tradeoff between the number of distinguishable objects and the necessary storage space (or equivalently, the search complexity) in an identification system is investigated. In the discussed scenario, high-dimensional (and noisy) feature vectors extracted from objects are first compressed and then enrolled in the database. When the user(More)
We consider coding for transmission of a source through a channel without error when the receiver has side information about the source. We show that separate source and channel coding is asymptotically suboptimal in general. By contrast, in the case of vanishingly small probability of error, separate source and channel coding is known to be asymptotically(More)
This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper(More)
A lossy coding scheme is proposed for separate encoding and joint decoding of two correlated sequences. The algorithm simultaneously exploits the correlation between the sequences (using a binning-based quantization scheme) and that between the samples of each sequence (using linear prediction). Under the proposed coding regime, optimal prediction filter(More)
The classical result of Blahut, which characterizes achievable error exponents in binary hypothesis testing, is generalized in two different directions. First, in M-ary hypothesis testing, the tradeoff of all M(M-1) types of error exponents and corresponding optimal decision schemes are explored. Then, motivated by a power-constrained distributed detection(More)