The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
alization is a combination of abstract generated forms and found imagery. The frequency, amplitude, and percentage differences between samples of incoming data are mapped to forms ...
This paper proposes a visual representation named scene tunnel to archive and visualize urban scenes for Internet based virtual tour. We scan cityscapes using multiple cameras on ...
In this paper, a teleservice for archiving and retrieving multimedia documents using public networks is described. This teleservice encourages a broad range of commercially applic...
An optimized scheme of multiplexing coded mesh and texture data to facilitate progressive transmission of 3D textured models is proposed in this work. The mesh and texture data of...