• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.683-695
• /
• 1996

In this paper, we implemented the content-based image retrieval system that indexes and retrieves the images by acquiring contour information of images and by extracting lines from the object. For this purpose, we proposed the advanced line extraction algorithm called FSLHT(Flexible SLHT) which covers drawback of SLHT(Straight Line Hough Transform)andapplied aDP(Dynamic Programming)algorithm to getadesirable similarity ofimages by lines. We estimated the contour features as a key value of sampled region to compensate for the problem that image contours are heavily depend on the noise. When performing the Hough transform we calculated the directionality based on the perceptual organization and transformed according to this direction to overcome the problem of time consuming and discontinuity.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.723-731
• /
• 2001

As XML has become and emerging standard for information exchange on the World Wide Web it has gained attention in database communities of extract information from XML seen as a database model. Data in XML can be mapped to semistructured dta model based on edge-labeled graph and queries can be processed against it Here we propose new query optimization techniques using DTDs(Document Type Definitions) which have the schema information about XML data. Our techniques reduce traditional index techniques Also, as they preserve source database structure, they can process many kinds of complex queries. we implemented our techniques and provided preliminary performance results.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.3
• /
• pp.17-21
• /
• 2010

As the compact and easily accessible handheld devices, such as cellular phones and MP3 players equipped with image acquisition functionality, are becoming widely available among common users, various applications of images are rapidly increasing. Image related services and software such as web-based image presentation and image manipulation for personal or commercial purpose enable users to view contents of remote image archive and to manipulate enormous amount of images in local or network based storage as well. It is necessary for users to identify the images efficiently so that the same images are perceived as one physical entity instead of recognizing them as different images as the trends are getting stronger. In order to support this environment, we propose a method that generates image identifiers or indexing for images within a solid and efficient manner. The proposed image identifier utilizes multiple index values. The integration of component index values creates a unique composite value that can be used as a file name, file system identifier, or database index. Our experimental results on generation of constituent index values have shown favorable results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.815-816
• /
• 2009

Owing to the development of computer technologies, to process data derived from various sensors is recently demanding. It is also increasing to demand the moving object based servies like the services of location based and mobile application services. That's why it is needed the processing of visualizing the services for education aspects. In this paper, we show the implemented results about $R^*$ tree algorithm to insert, delete and search a object in two dimension environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.771-772
• /
• 2009

최근 대표적인 공간 인덱스 구조인 R-tree를 기반으로 KD-tree나 Quad-tree와 같은 공간 분할 특성을 이용하여 인덱싱 성능을 향상시키기 위한 연구가 활발하다. 본 논문에서는 기존에 제시된 R-tree 기반 인덱스 구조인 SQR-tree와 PMR-tree의 특성을 결합하여 대용량 공간 데이타를 보다 효율적으로 처리하는 인덱스 구조인 MSQR-tree(Mapping-based SQR-tree)를 제시한다. SQR-tree는 Quad-tree를 확장한 SQ-tree와 각 SQ-tree 리프 노드마다 실제로 공간 객체를 저장하는 R-tree가 연계되어 있는 인덱스 구조이고, PMR-tree는 R-tree에 R-tree 리프 노드를 직접 접근할 수 있는 매핑 트리를 적용한 인덱스 구조이다. 본 논문에서 제시하는 MSQR-tree는 SQR-tree를 기본 구조로 가지고 R-tree마다 매핑 트리가 적용된 구조를 갖는다. 따라서, MSQR-tree에서는 SQR-tree와 같이 질의가 여러 R-tree에서 분산 처리되고, PMR-tree와 같이 매핑 트리를 통해 R-tree 리프 노드를 빠르게 접근할 수 있다. 마지막으로 성능 실험을 통해 MSQR-tree의 우수성을 입증하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.69-77
• /
• 2009

Stream service environment demands real-time query processing for voluminous data which are ceaselessly delivered from tremendous sources. Typical R-tree based query processing technologies cannot efficiently handle such situations, which require repetitive and inefficient exploration from the tree root on every data event. However, many stream data including sensor readings show high locality, which we exploit to reduce the search space of queries to explore. In this paper, we propose a query processing scheme exploiting the locality of stream data. From the simulation, we conclude that the proposed scheme performs much better than the traditional ones in terms of scalability and exploration efficiency.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.07a
• /
• pp.605-606
• /
• 2020

최근 방송 사용 음악에 대한 저작권료 배분의 투명성을 위하여 방송음악 식별 기술에 대한 관심이 커지고 있다. 음악 DNA라 부르는 음악의 신호적 특징을 이용하는 기존의 음악식별 기술이 존재하지만, 방송 배경음악의 특성으로 인해 방송 사용 음악 식별에 그대로 활용하기는 어렵다. 방송이나 영화에 사용되는 배경음악은 우리가 일상생활에서 주로 소비하는 가요나 팝과 같은 음악과 비교하여 그 수가 매우 많고, 하나의 음악 테마에 대하여 조금씩 다르게 편곡한 유사 음악들이 다수 존재한다. 즉, 방송 배경음악을 식별을 위해서는 유사한 음악이 많은 대규모 음악 DB를 대상으로 잡음이 섞여 있는 음악을 식별하여야 한다. 한편, 대부분의 음악 식별 시스템은 빠른 검색을 위하여 모든 데이터를 메모리에 올려두고 처리하는 방식으로 동작하는데, 대규모 음악 DB를 지원하기 위해서는 시스템 자원을 적게 사용하면서도 식별율이 떨어지지 않는 특징 추출 파라미터와 인덱싱 파라미터를 찾는 것이 중요하다. 본 논문에서는 이러한 요구사항을 만족하는 배경음악 특징의 추출방법과 이 특징을 효율적으로 검색할 수 있도록 하는 검색 구조를 기술한다.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.553-566
• /
• 2004

Some of the current main research areas involving techniques related to XML consist of storing XML documents, optimizing the query, and indexing. As such we may focus on the set of documents that are composed of various structures, but that are not shared with common structure such as the same DTD or XML Schema. In the case, it is essential to analyze structural similarities and differences among many documents. For example, when the documents from the Web or EDMS (Electronic Document Management System) are required to be merged or classified, it is very important to find the common structure for the process of handling documents. In this paper, we transformed sequential pattern mining algorithms(1) to extract maximal similar paths between two XML documents. Experiments with XML documents show that our transformed sequential pattern mining algorithms can exactly find common structures and maximal similar paths between them. For analyzing experimental results, similarity metrics based on maximal similar paths can exactly classify the types of XML documents.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.405-415
• /
• 2005

Indexing techniques are used to implement selective tuning in wireless environments Indices are broadcast together with data to help mobile clients locate the required information. As a result, clients stay in doze mode most of the time. The drawback of this solution is that broadcast cycles are lengthened due to additional index information. In location-aware mobile services(LAMSs), it is important to reduce the query response time, since a late query response nay contain out-of-date information. In this paper, we present a broadcast-based spatial query processing method (BBS) designed to support k-NN query processing. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.117-123
• /
• 2020

This study intended to develop the Performance Evaluation system for the modern pentathlon such as an Olympic sporting event. The performance evaluation index system for the modern pentathlon was developed by Microsoft Excel 2016 with Visual Basic for Application that it is able to be understandable for the practical field in sport. Consequently, the system for the performance evaluation index is able to be developed within the concept of performance analysis of sport such as a notational analysis of sport. And the performance indicators for the performance evaluation index were selected by the skills to make successful outcomes. Finally, the simulation with big data gathering by the developed system would be requested that systematic reviews on successful outcomes in other sporting events would be necessary.