DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Chung, Chin-Wan | - |
dc.contributor.advisor | 정진완 | - |
dc.contributor.author | Lee, Seok-Lyong | - |
dc.contributor.author | 이석룡 | - |
dc.date.accessioned | 2011-12-14T02:25:15Z | - |
dc.date.available | 2011-12-14T02:25:15Z | - |
dc.date.issued | 2001 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=169496&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/39833 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 정보및통신공학학제전공, 2001.8, [ viii, 106 p. ] | - |
dc.description.abstract | Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications such as data mining and data warehousing. In this thesis, we first extend the traditional similarity search methods on one-dimensional time-series data to support a multidimensional data sequence (MDS), such as digital signals, audio, and video streams. We investigate the similarity search methods for generalized multidimensional sequences from a large database. To prune irrelevant sequences in a database with respect to a given query, we introduce correct and efficient similarity functions. Both data sequences and query sequences are partitioned into subsequences, and each of them is represented by a minimum bounding rectangle (MBR). The query processing is based upon these MBRs, instead of scanning data elements of entire sequences. The method is designed (1) to select candidate sequences in a database, and (2) to find the subsequences of a selected sequence, each of which falls under the given threshold. The latter is of special importance in the case of retrieving subsequences from large and complex sequences. By using it, we do not need to browse the whole of the selected sequence, but just browse the sub-streams to find a part we want. Next, we investigate the similarity search methods for the specialized video domain using the concept of an MDS. A video clip, a sequence of video frames describing a particular event, is represented by an MDS which is partitioned into video segments considering temporal relationship among frames, and then similar segments of the clip are grouped into video clusters. We present the effective video segmentation and clustering algorithm that guarantees the clustering quality to such an extent that satisfies predefined conditions. Based on video segments and clusters generated by the algorithm, we define various similarity functions and present the effective similarity search methods to find relevant vi... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Video Retrieval | - |
dc.subject | Clustering | - |
dc.subject | Multidimensional Data Sequence | - |
dc.subject | Video database | - |
dc.subject | Similarity Search | - |
dc.subject | 유사성 검색 | - |
dc.subject | 비디오 검색 | - |
dc.subject | 클러스터링 | - |
dc.subject | 다차원 데이터 시퀀스 | - |
dc.subject | 비디오 데이터베이스 | - |
dc.title | Similarity search for multidimensional data sequences | - |
dc.title.alternative | 다차원 데이터 시퀀스에 대한 유사성 검색 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 169496/325007 | - |
dc.description.department | 한국과학기술원 : 정보및통신공학학제전공, | - |
dc.identifier.uid | 000959030 | - |
dc.contributor.localauthor | Chung, Chin-Wan | - |
dc.contributor.localauthor | 정진완 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.