The purpose of this paper is twofold: On the one hand, we propose a fast waveletbased video codec which is implemented into a real-time video conferencing tool. The proposed codec uses temporal frame difference coding, a computationally low-complex 5/3 tap wavelet transform, and a fast entropy coding scheme based on Golomb–Rice codes. On the other hand, we present an application of the video co...

This paper presents a practical external hashing scheme that supports fast lookup (7 microseconds) for large datasets (millions to billions of items) with a small memory footprint (2.5 bits/item) and fast index construction (151 K items/s for 1-KiB key-value pairs). Our scheme combines three key techniques: (1) a new index data structure (Entropy-Coded Tries); (2) the use of sorting as the main...

The development and application of various remote sensing platforms result in the production of huge amounts of satellite image data. Therefore, there is an increasing need for effective querying and browsing in these image databases. In order to take advantage and make good use of satellite images data, we must be able to extract meaningful information from the imagery. Hence we proposed a new...

The top-k error is a common measure of performance in machine learning and computer vision. In practice, top-k classification is typically performed with deep neural networks trained with the cross-entropy loss. Theoretical results indeed suggest that cross-entropy is an optimal learning objective for such a task in the limit of infinite data. In the context of limited and noisy data however, t...

Spatially homogeneous batch reactor systems are characterized by the simultaneous presence of a wide range of time scales. When the dynamics of such reactive systems develop very-slow and very-fast time scales separated by a range of active time scales, with large gaps in the fast/active and slow/active time scales, then it is possible to achieve multi-scale adaptive model reduction along-with ...

© 2010 Euee Seon Jang et al. 163 A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding foll...