We address the problem of high-rank matrix completion with side information. In contrast to existing work dealing with side information, which assume that the data matrix is low-rank, we consider the more general scenario where the columns of the data matrix are drawn from a union of lowdimensional subspaces, which can lead to a high rank matrix. Our goal is to complete the matrix while taking ...

Bayesian treatment of matrix factorization has been successfully applied to the problem of collaborative prediction, where unknown ratings are determined by the predictive distribution, inferring posterior distributions over user and item factor matrices that are used to approximate the user-item matrix as their product. In practice, however, Bayesian matrix factorization suffers from cold-star...

Security is an important performance of watermarking system. In this paper, the idea of side information is introduced into the security domain of watermarking system, and a secure fragile digital watermarking algorithm with side information is proposed associating with the idea of cryptography. In the proposed algorithm, the original image is segmented into blocks and the watermark is segmente...

We introduce the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. We show that such distortion side information is not only useful at the encoder, but that under certain conditions, knowing it at only the encoder is as good as knowing it at both encoder and decoder, and knowing it at only the decoder is useless. Thus d...

We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding with feedforward (the dual of channel coding with feedback) introduced by Pradhan [8]. We use this duality to develop a linear complexity algorithm which achieves the rate-distortion bound for any memoryless finite alphab...

Our temporally compressive imaging system reconstructs a high-speed image sequence from a single, coded snapshot. The reconstruction quality, similar to that of other compressive sensing systems, often depends on the structure of the measurement, as well as the choice of regularization. In this paper, we report a compressive video system that also captures the side information to aid in the rec...

Robustness is a key issue for many prospective applications of data hiding technologies. The proposal to take into account side information at the encoder has meant a noteworthy advance in the quest for better data hiding methods. Still, the true impact of the advantages theoretically derived from this groundbreaking idea has not been sufficiently founded in practice. Departing from this situat...

We explore a new learning setting, in which each randomly generated sample gives rise to an additional deterministic sample, called side information, that is also classified by the oracle. Hence a learning algorithm utilizing side information chooses from a smaller and more accurate set of concepts, and is expected to operate more efficiently. In general, side information learning utilizes depe...

We consider the problem of repeated bidding in online advertising auctions when some side information (e.g. browser cookies) is available ahead of submitting a bid in the form of a d-dimensional vector. The goal for the advertiser is to maximize the total utility (e.g. the total number of clicks) derived from displaying ads given that a limited budget B is allocated for a given time horizon T ....

This paper presents results on generalized public key cryptography with exponentials modulo primes and composite numbers where the mapping is not one-to-one and the uniqueness is achieved by additional side information. Such transformations may be used for oblivious transfer and generate events of specific probabilities. Introduction This paper presents generalized public key transformations th...