• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.1-13
• /
• 1994

The Temporal Database Management Testbed supports valid and transaction time. In this paper, we discuss the design and implementation of a testbed of a temporal database management system in main memory. The testbed consists of a syntactic analyzer, a semantic analyzer, a code generator, and an interpreter. The syntactic analyzer builds a parse tree from a temporal query. The semantic analyzer then checks it for correctness against the system catalog. The code generator builds an execution tree termed ann update network. We employ an incremental view materialization for the execution tree. After building the execution tree, the interpreter activates each node of the execution tree. Also, the indexing structure and the concurrency control are discussed in the testbed.

• 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.

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

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

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

• 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.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.9
• /
• pp.898-903
• /
• 2010

Popularity of smartphones such as Google Android phones and Apple iphones, is increasing the demand on more reliable high performance file system for flash memory. In this paper, we propose two techniques to improve the performance of YAFFS (Yet Another Flash File System), while enhancing the reliability of the system. Specifically, we first propose to manage metadata and user data separately on segregated blocks and indexing information piggy-back technique for reducing mount time and also enhancing performance. Second, we tailor the wear-leveling to the segregated metadata and user data blocks. Performance evaluation results based on real hardware system with 1GB NAND flash memory show that the YAFFS with our proposed techniques realized outperforms the original YAFFS by six times in terms of mount speed and five times in terms of benchmark performance, while reducing the average erase count of blocks by 14%.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.203-216
• /
• 2004

In order to process video data effectively, it is required that the content information of video data is loaded in database and semantic- based retrieval method can be available for various query of users. Currently existent contents-based video retrieval systems search by single method such as annotation-based or feature-based retrieval, and show low search efficiency and requires many efforts of system administrator or annotator form less perfect automatic processing. In this paper, we propose semantic-based video retrieval system which support semantic retrieval of various users by feature-based retrieval and annotation-based retrieval of massive video data. By user's fundamental query and selection of image for key frame that extracted from query, the agent gives the detail shape for annotation of extracted key frame. Also, key frame selected by user become query image and searches the most similar key frame through feature based retrieval method that propose. Therefore, we design the system that can heighten retrieval efficiency of video data through semantic-based retrieval.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.71-78
• /
• 2008

Digital Broadcasting serves a variety of broadcasting services for satisfying the requirement of customers. One of main factors for new broadcasting environment is interoperability between providers and consumers. For this interoperability, metadata standards are proposed for the digital broadcasting and TV-Anytime metadata is one of these standards. On the one hand, there are some researches for efficiently managing the broadcasting metadata on Set-Top Box. This paper proposes the metadata management system for efficiently managing the broadcasting metadata based on the STB which is low-cost and low-setting. Our system consists of a storage engine to store the metadata and an XQuery engine to search the stored metadata and uses special index for storing and searching. We expect that our system will keep the interoperability amongst a variety of applications for broadcasting because we adopts the XQuery for searching the metadata and the XQuery is a standard language for searching XML data.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.720-732
• /
• 1996

Spatial match retrieval methods for iconic image databases recognize an image document as several icon symbols. Therefore the iconic symbols are used as primary keys to index the image document. When a user requires content-based retrieval ofimages, a spatial match retrieval method converts a query image into iconic symbols and then retrieves relevant images by accessing stored images. In order to support content-based image retrieval efficiently, we, in this paper, propose spatial match retrieval methods using signatures for iconic image databases. For this, we design new index representations of two-dimensional iconic images and explain implemented system.. In addition, we compare the conventional 9-DLT and our two-dimensional image retrieval method in terms of retrieval precision and recall ratio. We show that our method is more efficient than the conventional method.