Sanan Srakaew

Learn More
In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using a weighted cascade. [4] Each multimedia data type can be viewed as k-dimensional (k-d) data in spatio-temporal domain. [3] Each dimension of the data is separated into small blocks and then formed into a multidimensional tree structure,(More)
In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using multiresolution processing. Each multimedia data type can be represented by k-dimensional (k-d) signals in the spatio-temporal domain. [1] These k-d signals are separated into small blocks and then formed into a multidimensional tree(More)
Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for " contains " , not " is ". This paper presents an) (logn O algorithm, called the " generalized virtual node (GVN) " algorithm; the GVN algorithm is a search algorithm for data(More)
– In this paper, we propose a parallel model for content-based retrieval form a multimedia database using a heterogeneous cluster system. The proposed parallel unified model [6] was used to represent multimedia data. All types of multimedia data in the unified model are represented by k-dimensional signals. Each dimension of k-d data is separated into small(More)
In this paper, we propose a data partitioning scheme for content-based retrieval from a multimedia database using a heterogeneous cluster system. The proposed parallel unified model [6] was used to represent multimedia data. All types of multimedia data in the unified model are represented by k-dimensional(k-d) signals. Each dimension of k-d data is(More)
In this paper, we propose a static data partitioning scheme for content-based multimedia data retrieval using a heterogeneous cluster system. Multimedia data is represented by unified k-tree structure of k-dimensional(k-d) signals proposed in [6]. Each dimension of k-d data is separated into small blocks and then formed into a hierarchical multidimensional(More)
In this paper, we propose a model for the fast retrieval image data using multiple features based on multiresolution processing. We demonstrate our performance results by searching an image database of approximately 30,000 24-bit color photographic images. We use identical structures to build the index keys from the two features using histogram generation(More)
The huge data sizes of images, the enormous number of images in a typical image database, coupled with the inexact nature, and subjective interpretations of images have called for content-based retrievals, which place enormous demands on computation. Network of workstations (NOWs) are a cost-eeective way of providing the much needed computational power in(More)
modelling the various kind of fluid based on Smoothed Particle Hydrodynamics (SPH) in modelling and simulating the gas flow with free surfaces. The modelling technique uses particle system together with molecular dynamics and also any possible external forces. The fluid equations previously used to model compressible fluid are now used to model(More)