The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
With an explosion in the proliferation of user-generated content in communities, information overload is increasing and quality of readily available online content is deterioratin...
We introduce a new wavelet image coder which is the forward-adaptive counterpart of the state-of-the-art backward-adaptive Estimation-Quantization coder. The variance field associ...
Anthony F. Docimo, Kannan Ramchandran, Mehmet Kiva...
TV commercials recognition is a need for advertisers in order to check the ful llment of their contracts with TV stations. In this paper we present an approach to this problem base...
Abstract. Compared with the color histogram, where the position information of each pixel is ignored, a simplified color correlogram (SCC) representation encodes the spatial inform...