An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Copy-move forgeries are parts of the image that are duplicated elsewhere into the same image, often after being modified by geometrical transformations. In this paper we present a...
Edoardo Ardizzone, Alessandro Bruno, Giuseppe Mazz...
We address the joint problem of clustering heterogenous clients and allocating scalable video source rate and FEC redundancy in IPTV systems. We propose a streaming solution that ...
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
Increasing applications are demanding effective and efficient support to perform retrieval in large collections of digital images. The work presented here is an early stage resear...
Giovanna Castellano, Gianluca Sforza, Maria Alessa...