Choon-Bo Shim’s research while affiliated with Catholic University of Pusan and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (4)


Design and Performance Analysis of Signature-Based Hybrid Spill-Tree for Indexing High Dimensional Vector Data
  • Article

January 2009

·

43 Reads

·

1 Citation

Journal of Internet Computing and services

·

Seung-Tae Hong

·

So-Ra Na

·

[...]

·

Choon-Bo Shim

Recently, video data has attracted many interest. That is the reason why efficient indexing schemes are required to support the content-based retrieval of video data. But most indexing schemes are not suitable for indexing a high-dimensional data except Hybrid Spill-Tree. In this paper, we propose an efficient high-dimensional indexing scheme to support the content-based retrieval of video data. For this, we extend Hybrid Spill-Tree by using a newly designed clustering technique and by adopting a signature method. Finally, we show that proposed signature-based high dimensional indexing scheme achieves better retrieval performance than existing M-Tree and Hybrid Spill-Tree.


Signature-based Indexing Scheme for Similar Sub-Trajectory Retrieval of Moving Objects

April 2004

·

6 Reads

·

1 Citation

The KIPS Transactions PartD

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.


Content-based video retrieval using moving objects' trajectories

January 2004

·

4 Reads

·

1 Citation

Lecture Notes in Computer Science

In this paper, we present a content-based video retrieval using moving objects' trajectories. For this, we first present a spatio-temporal representation scheme for modeling moving objects. Secondly, we describe an efficient similar sub-trajectory retrieval scheme based on a new k-warping distance algorithm. To show the efficiency of our similar sub-trajectory retrieval scheme, we perform the performance comparison of our scheme with the existing sub-trajectory retrieval schemes.


Similar sub-trajectory retrieval for moving objects in spatio-temporal databases

January 2003

·

51 Reads

·

13 Citations

Lecture Notes in Computer Science

Moving objects' trajectories play an important role in doing efficient retrieval in spatial-temporal databases. In this paper, we propose a spatio-temporal representation scheme for modeling the trajectory of moving objects. Our spatio-temporal representation scheme effectively describes not only the single trajectory of a moving object but also the multiple trajectories of two or more moving objects. For measuring similarity between two trajectories, we propose a new k-warping distance algorithm which enhances the existing time warping distance algorithm by permitting up to k replications for an arbitrary motion of a query trajectory. Our k-warping distance algorithm provides an approximate matching between two trajectories as well as an exact matching between them. Based on our k-warping distance algorithm, we also present a similarity measure scheme for both the single trajectory and the multiple trajectories in spatio-temporal databases. Finally, we show from our experiment that our similarity measure scheme based on the k-warping distance outperforms Li's one (no-warping) and Shan's one (infinite-warping) in terms of precision and recall measures.

Citations (3)


... Chang J et al. [12] proposed a signature-based trajectory indexing scheme for moving the object's trajectory, which has better performance than the TB-tree and FNR-tree. Shim et al. [13] introduced a new signature-based indexing scheme that supports similar sub-trajectory retrieval. Scanning and filtering all signatures before accessing the trajectory data reduces a large number of disk accesses thus achieving better performance. ...

Reference:

Query the trajectory based on the precise track: a Bloom filter-based approach
Signature-based Indexing Scheme for Similar Sub-Trajectory Retrieval of Moving Objects
  • Citing Article
  • April 2004

The KIPS Transactions PartD

... To measure the similarity between trajectories, a similarity function must be selected. Albeit many trajectory similarity functions have been proposed [6,7,11,14,39,40,42,46,48,55,56,58,63,64], as demonstrated experimentally [6,7,48,64]), every similarity function has its own advantages and disadvantages. In other words, there is no "best" trajectory similarity function, and the choice depends on the application scenario. ...

Similar sub-trajectory retrieval for moving objects in spatio-temporal databases
  • Citing Conference Paper
  • January 2003

Lecture Notes in Computer Science

... The features can be expressed in terms of high-dimensional vector data which can be compared with a given query for similarity between them. Although most of the index structures suffer from the so-called curse of dimensionality, some of them are proved to be well designed for feature based information retrieval under some circumstance, such as X-Tree [4], which is suitable for medium dimensional spaces, TV-Tree [5], M-Tree [6], Spill-Tree [7], and Hybrid Spill-Tree [8]. However, most index structures, except Hybrid Spill-Tree, are not efficient in terms of retrieval performance because they are weak in either retrieval accuracy or retrieval time. ...

Design and Performance Analysis of Signature-Based Hybrid Spill-Tree for Indexing High Dimensional Vector Data
  • Citing Article
  • January 2009

Journal of Internet Computing and services