• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.254-262
• /
• 2005

This paper presents a new sequential indexing method called segment-page indexing (SP-indexing) for multidimensional range queries. The design objectives of SP-indexing are twofold:(1) improving the range query performance of multidimensional indexing methods (MIMs) and (2) providing a compromise between optimal index clustering and the full index reorganization overhead. Although more than ten years of database research has resulted in a great variety of MIMs, most efforts have focused on data-level clustering and there has been less attempt to cluster indexes. As a result, most relevant index nodes are widely scattered on a disk and many random disk accesses are required during the search. SP-indexing avoids such scattering by storing the relevant nodes contiguously in a segment that contains a sequence of contiguous disk pages and improves performance by offering sequential access within a segment. Experimental results demonstrate that SP-indexing improves query performance up to several times compared with traditional MIMs using small disk pages with respect to total elapsed time and it reduces waste of disk bandwidth due to the use of simple large pages.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.35-44
• /
• 2004

With increase in digitalmedia data, various video indexing and video sequence matching algorithms have been proposed to efficiently manage and utilize digital media. In this paper, we propose a robust video indexing algorithm to detect scene changes for video sequences with abrupt luminance variations and an efficient video sequence matching algorithm for video sequence query. To improve the accuracy and to reduce the computational complexity for video indexing with abrupt luminance variations, the proposed algorithm utilizes edge features as well as color features, which yields a remarkably better performance than conventional algorithms. In the proposed algorithm first we extract the candidate shot boundaries using color histograms and then determine using edge matching and luminance compensation if they are shot boundaries or luminance changes. If the scene contains trivial brighness variations, the edge matching and luminance compensation are performed only for shot boundaries. In experimental results, the proposed method gives remarkably a high performance and efficiency than the conventional methods with the similar computational complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.247-252
• /
• 2004

This paper proposes a matching algorithm using Voronoi diagram for rotation and translation invariant fingerprint identification. The proposed algorithm extracts geometrical structures that are derived from Voronoi diagram of a fingerprint image. Then two features, distances and angles are extracted from the geometrical structures and saved as indexing form for fingerprint matching. This matching algerian has a lower error rate than indexing based methods of old times.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.148-155
• /
• 2008

In this paper, we constructed the noise robust content-based music retrieval system in mobile environment. The performance of the proposed system was verified with ZCPA feature which is blown to have noise robust characteristic in speech recognition application. In addition, new indexing and fast retrieval method are proposed to improve retrieval speed about 99% compare to exhaustive retrieval for large music DB. From the computer simulation results in noise environment of 15dB - 0dB SNR, we confirm the superior performance of the proposed system about 5% - 30% compared to MFCC and FBE(filter bank energy) feature.

• Genomics & Informatics
• /
• v.18 no.2
• /
• pp.22.1-22.3
• /
• 2020

The Medical Subject Headings (MeSH) thesaurus is a controlled vocabulary for indexing biomedical documents that is used for document retrieval and other natural language processing purposes. However, although the oariginal English MeSH is freely available, its Japanese translation has a restricted license. We attempted to create an open alternative, and for this purpose we made a script for assigning MeSH UIDs to Japanese medical terms using Japanese-English glossaries. From the MeSpEn glossary and MEDUTX dictionary, we generated a 12,457-word Japanese-MeSH dictionary.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.28-30
• /
• 2002

시간에 따라 연속적으로 위치가 변화하는 객체를 이동체라 한다. 기존의 R-Tree를 사용한 이동체 색인에 관한 연구에서는 현재 위치 질의 시 고비용의 연산이 요구되고, 시간축의 값이 증가하는 방향으로 보고되는 이동체의 위치데이터의 특징을 고려한 노드 분할 정책이 제안되지 않았다. 이 논문에서는 이동체의 현재 위치 및 과거 위치에 대한 색인 방법인 CPTR-Tree(Current Position and Trajectory R-Tree)를 제안한다. 특히, 제안 방법에서 이동체의 현재 위치에 대한 공간차원의 PMBR(Point MBR)을 유지함으로써, 현재 위치 질의 처리시 불필요한 노드 접근 횟수를 줄일 수 있어 성능향상을 할 수 있다. 그리고, 시간축의 값이 증가하는 형태로 보고되는 이동체 위치 데이터의 특징을 고려하여 시간축 분할시 SP(Split Parameter) 분할 방법을 제공함으로써 노드 공간 활용률을 높여 색인의 크기를 줄이고, 공간축 분할시 노드 겹침을 줄이는 동적 클리핑 분할 정책을 제시하여 이동체 과거 위치 검색 효율을 높인다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.10-19
• /
• 2003

Caption information in news videos can be useful for video indexing and retrieval since it usually suggests or implies the contents of the video very well. In this paper, a new algorithm for extracting and recognizing characters from news video is proposed, without a priori knowledge such as font type, color, size of character. In the process of text region extraction, in order to improve the recognition rate for videos with complex background at low resolution, continuous frames with identical text regions are automatically detected to compose an average frame. The image of the averaged frame is projected to horizontal and vertical direction, and we apply region filling to remove backgrounds to produce the character. Then, K-means color clustering is applied to remove remaining backgrounds to produce the final text image. In the process of character recognition, simple features such as white run and zero-one transition from the center, are extracted from unknown characters. These feature are compared with the pre-composed character feature set to recognize the characters. Experimental results tested on various news videos show that the proposed method is superior in terms of caption extraction ability and character recognition rate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.29-34
• /
• 2000

This paper presents a new indexing technique, for the fast content-based image browsing and retrieval in a database. By applying the rosette pattern that has more sample lines in the vicinity of center than those m the outer parts, we can get global gray distribution features as well as local positional information. These features are transformed into histogram and used as database indices. From the simulation results, the proposed method clearly shows the validity and the efficiency in respect of memory space as well as a good retrieval performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.23-32
• /
• 2011

In this paper, we develop a method for generating thumbnail images at hybrid domain combined the spatial domain and transform domain. The proposed method generates a pixel of a thumbnail image by adding a DC value of residual transform coefficients and an average value of an estimate block. For effectively calculating average values of estimate blocks, we propose a method for reconstructing the boundary pixels of a block. In comparison to the conventional method of decoding the bit stream then scaling down the decoded images, the developed method reduces the complexity by more than 60% while producing identical thumbnail images.