• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1083-1097
• /
• 1998

The conventional geographic information systems(GIS) is a software which handles spatial and aspatial information of objects in the real world. The system can not support users time-varying information because it manipulates their snapshot data in the spatial database. Also even though it supports time-varying information, it is very limited and hs many difficulties in presenting and processing queries. This paper therefore describes an integrated spatiotemporal data model using loosely-coupled approach which is extended a time dimension for the previous spatial database and which handles time-varying historical information of spatial objects. Conclusionally this paper not only designed a data structure for spatiotemporal database, but also implemented spatial comparison operations varying over time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.125-128
• /
• 2004

최근 이동 통신 기술의 급속한 발달로 인해 휴대폰, PDA 등과 같은 휴대용 단말기의 사용이 보편화 되고 있다. 따라서 이동 객체의 시간에 따른 공간적인 위치정보를 활용하여 다양한 서비스를 제공하는 위치 기반 서비스(Location-Based Service)에 관한 많은 연구가 진행되고 있다. 위치 기반 서비스의 효율적 제공을 위하여 시간에 따라 지속적으로 변하는 이동 객체의 대용량 시공간 정보를 신속하게 저장, 관리, 검색할 수 있는 인덱싱 및 질의 처리 기술이 수반되어야 한다. 본 논문에서는 대용량 이동 객체 데이터베이스를 대상으로 한 효율적인 인덱스 구축을 위한 데이터 압축 표현 방식에 대하여 논한다. 이를 위해 본 논문에서는 기존의 주요 연구에서 2 차원 공간 좌표 (X, Y)로 표현되던 이동 객체의 공간 정보를 계층적 구조를 갖는 행정구역에 기반하여 1 차원의 공간 정보로 압축 표현하는 방식을 제안한다. 이를 이용하여 대용량의 공간정보를 저장하고 있는 이동 객체 데이터베이스의 인덱스 크기의 감소 및 질의 처리 시간의 향상 효과를 얻을 수 있다. 또한, 제안된 방식은 2 차원 공간 좌표를 1 차원의 행정구역 기반의 위치정보로 표현하기 때문에 이로 인한 데이터 손실이 발생할 수 있으나, 일정 공간 내의 객체분포를 필요로 하는 교통 상황 파악, 근사적(approximate) 공간 정보를 필요로 하는 사람${\cdot}$차량 위치 추적 서비스와 같은 위치 기반 서비스를 신속하게 처리하는데 유용하게 사용될 수 있다.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.2
• /
• pp.209-214
• /
• 2024

The purpose of this study is to analyze the spatial structure of laboring classes in Manchester in the 19th century. Manchester had districts where laboring classes lived in destitution. Elizabeth Gaskell's Mary Barton demonstrates the miserable state of laboring classes by depicting their small, dirty living residential spaces. Engels's The Condition of the Working Class in England analyzes the laboring classes in industrial areas in England, especially Manchester. The laboring classes' districts formed in a set pattern were separated from the area for bourgeois. It lied in the old district near commercial areas, while upper classes were outside areas. It was the dominant ideology that drove the transformation of Manchester as an industrial city characterized by separation.

• 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 Korean Society for Railway
• /
• v.11 no.1
• /
• pp.26-32
• /
• 2008

This paper discusses WBS (Work Breakdown Structure) that is known for technique of basic project management. The WBS use in domestic industries often exhibit errors in Its structure. The most common serious error is space-oriented breakdown structure of PBS (Product Breakdown Structure) that becomes the core element of the WBS. This paper proposes a method to correct the problem of space-oriented breakdown structure constructed in domestic railroad industry. DSM method was adopted to construct PBS containing function-oriented structure. The proposed process and method will contribute to minimize time that take to construct an accurate and useful PBS.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.345-353
• /
• 2019

Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.11a
• /
• pp.155-160
• /
• 2005

최근 이동체 또는 센서 데이터에 대한 연속 질의를 처리하기 위해 다양한 질의 색인 기법들이 연구되고 있다. 그러나 RFID 미들웨어는 이전 연구에서 고려되지 않은 특징이 존재한다. 첫째, 질의 색인에 삽입되는 질의는 Industry, Product, Serial의 세 부분으로 구성되며, 각 값은 범위 값으로 표현될 수 있기 때문에 색인 공간에서 비연속적인 간격의 조각들이 반복해서 나타난다. 둘째, TagID가 가지는 Industry, Product, Serial의 값은 포함관계를 가진다. 즉, 하나의 Industry에 여러 Product가 존재하며, 하나의 Product에 여러 Serial Item이 존재한다. 따라서 이러한 특징을 고려하지 못하는 기존의 질의 색인을 적용하면 다수의 질의 조각을 삽입하게 되어 색인의 성능이 급격히 저하되는 문제점이 있다. 이 논문에서는 RFID 미들웨어의 실시간 필터링 및 컬렉션을 위해서 Tag 스트림에 대한 질의 색인 기법을 제안한다. 이 논문은 ECSpec 필터링 범위의 3단계 계층구조 특징을 고려한 코드 분할(Code Segmented) 도메인을 제시하고 이를 위한 그리드 기반 색인 구조를 제안한다. 또한 ECSpec의 필터링 패턴 특징에 의해 나타나는 질의 조각의 반복 현상을 정의하고 이를 위한 질의 처리 기법을 제시한다.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.164-173
• /
• 2000

This paper presents an efficient bandwidth allocation method for multiple source in the two-layer video coding of different spatial resolution. We first investigate the model of bitrate distortion in the MPEG-2 spacial scalable coding,. By using approximated model parameters, than we propose an efficient bitrate control method in order to keep the same distortion level among coders and the constant quality ratio between layers. Simulation results show that the proposed method can satify the user requirement in comparison to the conventional method.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.13-22
• /
• 2004

With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).