• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06b
• /
• pp.45-50
• /
• 1999

이진 영상의 압축은 디지털 도서관, 팩시밀리 전송, 문서 입출력 시스템과 같이 한정된 대역폭과 저장 공간을 가진 응용 분야에서 절실히 요구되고 있다. 현재 많은 영상 압축 알고리즘이 채택하고 있는 대역분할 기법을 문서와 같은 이진 영상의 압축에 적용한다면, 점진적 전송, 축소영상을 통한 빠른 검색 등의 장점을 얻을 수 있다. 그러나, 이진 영상 신호가 두 단계의 휘도 값을 가지므로, 이에 적합한 대역분할 방법과 산술부호기를 선택하여야 한다. 본 논문에서는 표본화-XOR 대역분할 기법을 선택하여, 알파벳 수의 증가를 막고 공간영역에서 국부적인 성질을 얻을 수 있다 또한, 넓은 단일-색 영역을 Zerotree로 대표하여 부호화 되는 신호의 수를 줄이고, 대역분할 구조에서 예측성의 저하를 막기 위한 적절한 조건화문맥과 새로운 부호를 선택한다. 이진 영상에 적합한 대역분할 방법과 산술부호기를 선택하여, 대역분할의 장점과 우수한 압축 성능을 달성할 수 있다.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.88-95
• /
• 2008

In this paper, we present an efficient indoor rendering method using BSP(Binary Space Partitioning) and PVS(Potentially Visible Space) algorithms. The proposed method displays efficiently the objects by including the objects in the process of separating the number of BSP area, by jointly using BSP and PVS algorithms. Also, the screen which is checked by PVS from player's location is displayed. From the simulation, we can see that the proposed method improves the rendering speed because of processing the objects with the edges of BSP and PVS.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.59-68
• /
• 2016

Many researchers have paid attention to contents generation within the area of game artificial intelligence these days with various reasons. Efforts on automatic contents generation without game level designers' help were continuously progressed in various game contents. This study suggests an automatic map generation without an isolated cave using cellular automation enhanced by binary space partitioning(BSP). In other words, BSP makes it possible to specify the number of desired area and cellular automation reduces the time to search a path. Based upon our preliminary simulation results, we show the usefulness of our automatic map generation by applying the contents generation using cell automation, which is enhanced by BSP to games.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.75-82
• /
• 2006

In this paper, a space-frequency coded orthogonal frequency division multiplexing (SFC-OFDM) scheme with dual Viterbi decoder is proposed and analyzed. Here, two independent half-rate OFDM symbols are generated after convolutional coding of the binary source code. A dual Viterbi decoder is exploited to decode the demodulated sequences independently in the receiver, and their path metrics are compared. Accordingly, the recovered binary data in the proposed scheme are composed of the combination of the sequences having larger path metrics while those in a conventional system are simply the output of single Viterbi decoder. As a result, the proposed SFC-OFDM scheme has a better performance than the conventional one for all signal-to-noise power ratio.

• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.365-371
• /
• 2015

CB tree represents the binary trie by a compact binary sequence. However, retrieval time grows fast since the more keys stored in the trie, longer the binary sequences are. In addition it is inefficient for frequent key insertion/deletion. HCB tree is a hierarchical CB tree consisting of small binary tries. However it can not avoid shift operations and have to scan an additional table to refer child or parent trie. In order to improve retrieval performance and avoid shift operations when keys are inserted or deleted, we in this paper represent each separated trie by a full binary trie and then assign the unique identifier to it. Finally the theoretical evaluations show that both the proposed approach and HCB tree provides better than CB tree for key retrieval. The proposed approach shows the highest performance in case of key insertion/deletion and moreover requires only 71%~89% of storage as compared with CB tree.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.37-48
• /
• 2010

In this paper, we analyze the shortcomings of the previous declustering methods, which are based on grid-like partitioning and a mapping function from a cell to a disk number, for high-dimensional space and propose a solution. The problems arise from the fact that the number of splitting is small(for the most part, binary-partitioning is sufficient), and the side length of a range query whose selectivity is small is quite large. To solve this problem, we propose a mathematical model to estimate the performance of a grid-like partitioning method. With the proposed estimation model, we can choose a good grid-like partitioning method among the possible schemes and this results in overall improvement in declustering performance. Several experimental results show that we can improve the performance of a previous declustering method up to 2.7 times.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.213-216
• /
• 2013

본 논문에서는 객체 위주의 컬러 영상 검색을 위하여 영상의 saliency map을 이용해 객체 중심의 영상을 생성하고, 객체와 그 주변 영역에서의 대표 색상이 가지는 통계적 특성과 공간적 분포 정보를 이용하는 방법을 제안한다. 먼저, 영상의 saliency map을 이진화하여 영상을 객체/배경으로 분할하고 객체를 중심으로 객체/배경의 비율이 일정한 일정 크기의 영상을 생성한다. 생성된 영상에서 대표 색상을 추출하고, 각 색상이 영상에서 어떻게 분포하는가를 나타내는 이진 공간분포 지도를 형성한다. 그 후 영상 간의 대표 색상마다 이진 공간분포의 차이를 비교함으로써, 색상의 통계적 특성과 공간적 분포가 동시에 반영된 특징으로 영상을 검색한다. 본 논문에서 제안한 saliency map을 이용한 대표 색상 기반의 영상 검색 기법은 기존의 대표 색상 기반의 영상 검색보다 우수한 성능을 보여준다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.25-30
• /
• 2005

This paper generalizes the concept of the signal space detection to construct a fixed delay tree search (FDTS) detector which estimates a block of n channel symbols at a time. This technique is applicable to high speed implementation. Two approaches are discussed both of which are based on efficient signal space partitioning. In the first approach, symbol detection is performed based on a multi-class partitioning of the signal space. This approach is a generalization of binary symbol detection based on a two-class pattern classification. In the second approach, binary signal detection is combined with a look-ahead technique, resulting in a highly parallel detector architecture.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.220-222
• /
• 2001

최근 데이터베이스의 응용 분야에서는 3차원 그래픽 등과 같은 멀티미디어 데이터를 이용하는 응용분야가 점점 늘어나고 있다. 그러나 아직은 3차원 그래픽에 대한 연구는 시각화 부분에만 집중되어 있고 검색에 대한 연구는 시작 단계에 있다. 본 논문에서 검색의 대상이 되는 assembled 객체는 기본 객체와 사용자 정의 객체로 구성된다. 이와같은 모델링 기법을 이용하여 구축된 3차원 그래픽 데이타베이스 환경에서 공간 분할 이진 트리를 이용한 객체의 모양에 대한 유사성 검색과 3D 스트링을 이용한 공간관계 검색 기법을 제안한다.