• Title/Summary/Keyword: 공간계층

Search Result 809, Processing Time 0.026 seconds

Image Retrieval Using Hierarchical Block and Color Histogram (계층적 블록과 컬러 히스토그램을 이용한 영상검색)

  • 송현석;안명석;조석제
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.37-40
    • /
    • 2000
  • 영상검색에서 컬러 히스토그램은 폭넓게 사용되고 있으며, 여러 가지 장점이 있음에도 불구하고 공간정보를 포함하지 못하는 문제점이 있다. 본 논문에서는 컬러 히스토그램에 공간정보를 포함시키기 위해 영상을 몇 개의 블록으로 나누어 계층적으로 컬러 히스토그램을 비교하는 방법을 제안하였다. 실험을 통하여 제안한 방법이 컬러 히스토그램을 이용한 방법보다 더 좋은 결과를 나타냄을 확인하였다.

  • PDF

A Hierarchical Bitmap-based Spatial Index for Efficient Spatial Query Processing on Air (무선환경에서 효과적인 공간질의 처리를 위한 계층적 비트맵 기반 공간 색인)

  • Song, Doo-Hee;Park, Kwang-Jin
    • Journal of Internet Computing and Services
    • /
    • v.12 no.6
    • /
    • pp.43-51
    • /
    • 2011
  • The recent development of the technology for wireless mobile computing and applied technology for location-based services has made it possible to support query processing faster than that in the past. However, some technological limitations on hardware and software still exist. The most critical aspects of query processing are accuracy and speed. For improving the accuracy, it is required that detailed information on the data involved in query processing be saved. In this case, the amount of information on the data increases, which decreases the speed. On the other hand, for increasing the speed, it is necessary to reduce the broadcast cycle, which enables rapid data acquisition as desired. In this case, because of insufficient index information, the listen time for the client increases, which may cause unnecessary energy consumption. Therefore, a trade-off occurs between the accuracy and speed. This paper proposes a hierarchical bitmap-based spatial index (HBI) as a solution for the aforementioned problems. HBI describes an object with 0 and 1 on the Hilbert curve map. It reduces the broadcast cycle by decreasing the index size on the basis of bit information and tree structure. Therefore, it is able to shorten the listen time and query processing time. In addition, HBI enables the detection of the locations of all the objects so that it is possible selectively listen to a broadcast. A performance evaluation of the proposed technique demonstrates that it is excellent.

Hierarchical Visualization of the Space of Facial Expressions (얼굴 표정공간의 계층적 가시화)

  • Kim Sung-Ho;Jung Moon-Ryul
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.12
    • /
    • pp.726-734
    • /
    • 2004
  • This paper presents a facial animation method that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically Our system creates the facial expression space from about 2400 captured facial frames. To represent the state of each expression, we use the distance matrix that represents the distance between pairs of feature points on the face. The shortest trajectories are found by dynamic programming. The space of facial expressions is multidimensional. To navigate this space, we visualize the space of expressions in 2D space by using the multidimensional scaling(MDS). But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 10 clusters from the space of 2400 facial expressions. Every tine the level increases, the system doubles the number of clusters. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. The user selects new key frames along the navigation path of the previous level. At the maximum level, the user completes key frame specification. We let animators use the system to create example animations, and evaluate the system based on the results.

A Study on Revitalization of Library Service for the Alienated Class (정보취약계층을 위한 도서관 서비스 활성화 방안에 관한 연구)

  • Nam, Young-Joon
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.41 no.4
    • /
    • pp.49-68
    • /
    • 2007
  • To promote information service and to encourage active participation from the group categorized as the alienated class(group of people) this study suggests the basic concepts and strategy for the information services to alienated class who does not have full public library services. The paper classifies three separate groups of alienated groups, handicapped. poor(economically unfortunate group) and elderly group. The service shall consider their needs from their own Point of concern and interests. There are three distinctive considerations, infra structure(facility building, space. place). administrative consideration, and equipments. Infra-structure includes the planning of the space to facilitate the equipments and reference materials which will be control)ed and moderated by a librarian. Administrative service includes the development for the educational system between the end users and external experts. It also includes the individualized education system for each group Material and equipment consideration should include the each group's specific needs such as the infra-structures which is provided for the handicapped person.

Spatial Aggregations for Spatial Analysis in a Spatial Data Warehouse (공간 데이터 웨어하우스에서 공간 분석을 위한 공간 집계연산)

  • You, Byeong-Seob;Kim, Gyoung-Bae;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.1-16
    • /
    • 2007
  • A spatial data warehouse is a system to support decision making using a spatial data cube. A spatial data cube is composed of a dimension table and a fact table. For decision support using this spatial data cube, the concept hierarchy of spatial dimension and the summarized information of spatial fact should be provided. In the previous researches, however, spatial summarized information is deficient. In this paper, the spatial aggregation for spatial summarized information in a spatial data warehouse is proposed. The proposed spatial aggregation is separated of both the numerical aggregation and the object aggregation. The numerical aggregation is the operation to return a numerical data as a result of spatial analysis and the object aggregation returns the result represented to object. We provide the extended struct of spatial data for spatial aggregation and so our proposed method is efficient.

  • PDF

Response Time Simulation for 2-tier and 3-tier C/S System (2-계층과 3-계층 C/S 시스템의 응답시간 시뮬레이션)

  • Kim Yong-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.3
    • /
    • pp.45-53
    • /
    • 2004
  • The fact that the end-user response time could become unacceptable in the 2-tier C/S system has been well known to C/S system developers. But inexperienced new developers who want to provide mobile solutions using PDA sometimes do not realize the ominous consequences of the 2-tier C/S systems. Except for the easy of development. the 2-tier C/S system has many weak points like in application deployment, security, scalability, application reuse, heterogeneous DBMS support, availability. and response time. This paper analyzes the response time in the 2-tier and 3-tier C/S systems through simulation. Although the problem space is confined to the 2 and 3 tiers, the result could be equally applied to any multi-tier systems.

  • PDF

Collision Detection for Large-Scaled Environments (넓은 가상공간에서의 충돌검출)

  • 이승욱;박경환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.217-219
    • /
    • 2003
  • 본 논문에서는 실시간으로 상호작용이 가능한 광범위한 3차원의 넓은 외부영역을 렌더링하기 위해 공간문할 방법으로 제한적 옥트리를 이용하고, 충돌검출 방법으로 계층적 경계상자를 사용하여 효과적으로 충돌검출을 하는 방법을 소개한다. 넓은 외부 영역을 동적으로 빠르게 처리하기 위해 공간을 분할시켜 처리영역을 축소하고 3차원 공간을 고정볼륨 바운드를 구축한 후 이를 처리 값으로 이용한 계층적 경계상자를 이용하여 충돌처리를 한다. 옥트리는 정적인 물체에 대한 정확한 표현 시 주로 사용되나 본 논문에서는 이를 동적인 환경에 이용하기 위하여 제한적 OSF를 사용한다. 또한 폴리곤의 충돌검사를 모두 하지 않고 빠른 시간에 충돌검출을 판단할 수 있는 방법과 경계상자의 충돌검출에 대한 비용이 3차원 개체 개수에 대해 비례하여 증가하는 데에 대한 개선 방법을 제안한다.

  • PDF

Hierarchical QoS Architecture for Virtual Dancing Environment (분산 가상현실을 위한 계층적 QoS 지원 기법)

  • 김진용;원유집;김범은;박종일;박용진
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.11
    • /
    • pp.675-690
    • /
    • 2003
  • In this paper, we present the virtual dancing studio for distributed virtual environment. In this system, geographically distributed user shares the virtual dancing hall and interacts with each other. The participating object can be a graphical avatar or a live video stream. It allows the coexistence of graphic objects and real images in the shared virtual space. One of the main technical challenges in developing the distributed virtual environment is to handle excessive network traffic. In an effort to effectively reduce the network traffic, we propose a scheme to adjust the QoS of each object with respect to the distance from the observer in the virtual space. The server maintains the QoS vector for each client's shared space and controls the packet traffic to individual clients based on its QoS vectors. We develop a proto-type virtual dancing environment. Java based development enables the client to be platform independent. The result of experiment shows that the adoption of hierarchical QoS management significantly reduces the overall network traffic.

Design and Performance Evaluation of a Flash Compression Layer for NAND-type Flash Memory Systems (NAND형 플래시메모리를 위한 플래시 압축 계층의 설계 및 성능평가)

  • Yim Keun Soo;Bahn Hyokyung;Koh Kern
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.4
    • /
    • pp.177-185
    • /
    • 2005
  • NAND-type flash memory is becoming increasingly popular as a large data storage for mobile computing devices. Since flash memory is an order of magnitude more expensive than magnetic disks, data compression can be effectively used in managing flash memory based storage systems. However, compressed data management in NAND-type flash memory is challenging because it supports only page-based I/Os. For example, when the size of compressed data is smaller than the page size. internal fragmentation occurs and this degrades the effectiveness of compression seriously. In this paper, we present an efficient flash compression layer (FCL) for NAND-type flash memory which stores several small compressed pages into one physical page by using a write buffer Based on prototype implementation and simulation studies, we show that the proposed scheme offers the storage of flash memory more than $140\%$ of its original size and expands the write bandwidth significantly.

Analysis of Waterfront Utilization Index Using Multi Criteria Decision Making (다기준의사결정을 이용한 친수공간 이용지수 분석)

  • Kim, Byeong-Chan;Kim, Man-Sik;Maeng, Bong-Jae
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2011.05a
    • /
    • pp.195-195
    • /
    • 2011
  • 국가하천의 주변지역을 체계적이고 계획적으로 조성 이용하여 난개발을 방지하고 지속가능한 발전을 도모하며, 그에 따른 이익을 하천의 정비 및 관리 등에 활용함으로써 공공복리의 증진에 기여함을 목적으로 하는 친수구역활용에 관한 특별법이 곧 시행될 예정이다. 친수는 단순히 하천 보전과 상대되는 수변이용의 측면이 아니라 하천의 경관, 생태계, 물 등 전체적인 하천공간에서 이루어지는 인간의 활동과 심리적 만족감으로 해석할 수 있다. 이러한 친수활동 유형을 정립하기 위하여 전문가 및 실무자들의 도움으로 설문지를 작성하고, 조사하였다. 또한 평가 항목간의 중요도를 합리적으로 부여하고자 전문가 집단 활용을 통한 다기준의사결정 기법 중 계층분석과정 AHP(Analytic Hierarchy Process)와 이의 일반적인 형태인 ANP(Analytic Network Process) 기법을 이용하여 비교 분석하여 보았다. AHP는 의사결정의 목표 또는 평가기준이 다수이며 복합적인 경우, 다수의 속성들을 계층적으로 분류하여 각 속성의 중요도를 파악함으로써 최적 대안을 선정하는 기법으로 다수의 목표, 다수의 평가기준, 다수의 의사결정주체가 포함되어 있는 의사결정 문제를 계층화하여 해결한다. 그러나 의사결정 문제는 대부분 요소들 간의 수평적 상호작용과 수직종속성이 존재하기 때문에 단순히 계층적 구조만으로는 설명할 수 없는 경우가 있다. ANP는 AHP 분석을 확장한 개념으로 평가 요소가 계층구조를 가지고 있으면서 각 평가 요소간 네트워크 구조를 가지는 경우에 해당한다. 즉, 시스템 분석, 통합 및 조정을 위한 방법으로 요소들 간의 비선형 관계를 모델화하는 복잡한 의사결정에 적용이 가능하다. ANP는 AHP의 기본 공리인 독립성이 유지되지 않을 때도 적용할 수 있는 의사결정 방법이기 때문이다. AHP와 ANP 분석을 위해 평가기준은 하천특성, 생태환경특성, 인문환경특성, 경관, 유지관리 등으로 분류하였으며, 세부평가항목은 하천의 물리 생태학적 특성, 개발여건과 관련된 특성, 경관의 이용가치, 유지관리 용이성 등 20여 개로 나누었다. AHP와 ANP를 이용하여 친수공간 이용지수 가중치를 산정한 결과, 두 기법은 큰 차이를 보이지 않았다. 그러나 ANP를 이용하여 가중치를 결정하는 방법은 최종 결정의 공정성이나 신뢰성을 확보하는데 기여를 하는 것으로 나타났다.

  • PDF