This paper describes the design and the implementation of a framework for multimedia information management. The framework is built upon two notions. The one notion is a model that describes multimedia information management by (1) de ning foundation objects that de nes di erent aspects of multimedia management and by (2) providing a composition that brings those di erent aspects together in a ...

Suppose, we are given a set of n elements to be clustered into k (unknown) clusters, and an oracle/expert labeler that can interactively answer pair-wise queries of the form, “do two elements u and v belong to the same cluster?”. The goal is to recover the optimum clustering by asking the minimum number of queries. In this paper, we provide a rigorous theoretical study of this basic problem of ...

In this paper, we propose an improved autocorrelation function (ACF) based watermarking. The autocorrelation function based watermarking has been known to be one of the effective watermarking schemes that are resilient to geometric transform attacks. In this watermarking scheme, both the peaks in the autocorrelation function of a marked image and the embedded watermark should survive after vari...

The problem of extracting the relevant aspects of data, in face of multiple conflicting structures, is inherent to modeling of complex data. Extracting structure in one random variable that is relevant for another variable has been principally addressed recently via the information bottleneck method [15]. However, such auxiliary variables often contain more information than is actually required...

We study the matrix completion problem with side information. Side information has been considered in several matrix completion applications, and has been empirically shown to be useful in many cases. Recently, researchers studied the effect of side information for matrix completion from a theoretical viewpoint, showing that sample complexity can be significantly reduced given completely clean ...

The basic problem that we will be looking at can be described as follows and is illustrated in Figure 1. The overall objective (as usual) is to reliably communicate a message m ∈ {1, . . . , 2nR} from the encoder to the decoder using the channel n times. The largest rate R for which this is possible is called the capacity of the channel. The channel that we can use is described by a conditional...

In this report, we study source coding problems with decoder side information (SI). Source coding problems with decoder side information are a special case of distributed source coding problems. We outline the relation between various distributed source coding problems in Table 1 with the help of Figure 1. For reference, we also include the standard single-source lossless and lossy compression ...

With the popularity of applications like Internet, sensor network and social network, which generate graph data in stream form, graph stream classification has become an important problem. Many applications are generating side information associated with graph stream, such as terms and keywords in authorship graph of research papers or IP addresses and time spent on browsing in web click graph ...

Top-N recommendation systems are useful in many real world applications such as E-commerce platforms. Most previous methods produce top-N recommendations based on the observed user purchase or recommendation activities. Recently, it has been noticed that side information that describes the items can be produced from auxiliary sources and help to improve the performance of top-N recommendation s...

In the paper we advocate image compression technique in the scope of distributed source coding framework. The novelty of the proposed approach is twofold: classical image compression is considered from the positions of source coding with side information and, contrarily to the existing scenarios, where side information is given explicitly, side information is created based on deterministic appr...