In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
In this paper, we presentan approach to clustering images for efficient retrieval using relative entropy. We start with the assumption that visual features are represented by prob...
This paper provides a brief overview of recent progress of peer-to-peer (P2P) technologies for multimedia applications. We provide an overview of the technical challenges, creativ...
In this paper, we first present an Object Composition Petri Nets (OCPN) based model methodology for describing the dynamic behaviour of the multiple video objects and user interac...
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...