Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
The creation of a cognitive perception systems capable of inferring higher-level semantic information from low-level feature and event information for a given type of multimedia co...
Ilias Kolonias, William J. Christmas, Josef Kittle...
With recent advances in storage and network technology it is now possible to provide movie on demand (MOD) service, eliminating the inflexibility inherent in todays broadcast cabl...
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...