• Title/Summary/Keyword: Spatial Search

Search Result 569, Processing Time 0.028 seconds

Comparison research of the Spatial Indexing Methods for ORDBMS in Embedded Systems (임베디드 시스템의 객체 관계형 DBMS에 적합한 공간 인덱스 방법 비교 연구)

  • Lee, Min-Woo;Park, Soo-Hong
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.8 no.1
    • /
    • pp.63-74
    • /
    • 2005
  • The telematics device, which is a typical embedded system on the transportation or vehicle, requires the embedded spatial DBMS based on RTOS (Real Time Operating System) for processing the huge spatial data in real time. This spatial DBMS can be developed very easily by SQL3 functions of the ORDBMS such as UDT (user-defined type) and UDF (user-defined function). However, developing index suitable for the embedded spatial DBMS is very difficult. This is due to the fact that there is no built-in SQL3 functions to construct spatial indexes. In this study, we compare and analyze both Generalized Search Tree and Relational Indexing methods which are suggested as common ways of developing User-Defined Indexes nowadays. Two implementations of R-Tree based on each method were done and region query performance test results were evaluated for suggesting a suitable indexing method of an embedded spatial DBMS, especially for telematics devices.

  • PDF

New Fast Block-Matching Motion Estimation using Temporal and Spatial Correlation of Motion Vectors (움직임 벡터의 시공간 상관성을 이용한 새로운 고속 블럭 정합 움직임 추정 방식)

  • 남재열;서재수;곽진석;이명호;송근원
    • Journal of Broadcast Engineering
    • /
    • v.5 no.2
    • /
    • pp.247-259
    • /
    • 2000
  • This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

  • PDF

Algorithm for Finding K-Nearest Object Pairs in Circular Search Spaces (순환검색공간에서 K-최근접객체 쌍을 찾는 알고리즘에 관한 연구)

  • Seon, Hwi-Joon;Kim, Hong-Ki
    • Spatial Information Research
    • /
    • v.20 no.2
    • /
    • pp.165-172
    • /
    • 2012
  • The query of the K closest object pairs between two object sets frequently occurs at recently retrieval systems. The circular location property of objects should be considered for efficiently process queries finding such a K nearest object pair. In this paper, we propose the optimal algorithm finding the K object pairs which are closest to each other in a search space with a circular domain and show its performance by experiments. The proposed algorithm optimizes the cost of finding the K nearest object pairs by using the circular search distances which is much applied the circular location property.

A UIS-based System Development to Express the Damage History Information of Natural Disasters

  • Jeon, Tae-Gun;Hwang, Hyun-Suk;Kim, Chang-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.12
    • /
    • pp.1739-1747
    • /
    • 2010
  • The damage of natural disasters has occurred on huge scale more frequently than before. The damage caused by the disasters are summarized and are analyzed, and are managed as a very general type of documentation, not showing the position of previous damage records and related information such as weather, facilities of CCTV, hospitals, and gas station on the maps. Therefore, it needs to provide map-based searching systems considering damaged area as well as search key-words. This paper focuses on the development of a search system based on the map to manage previous disaster records and related information each disaster using spatial databases. This system consists of three modules, which are databases to store disaster data, the SQL procedure-based search module to extract needed information from the constructed databases, and the map module to express the search results on the map. This paper will contribute to provide framework of a system development for managing the disaster information according to each year and disaster based on the maps and to be utilized as the basic framework in developing damage prediction and prevention systems for disasters in future.

An Analysis of Search Log from a Story Database Service and a New Story Search Method based on Story Map (스토리 검색 서비스의 사용자 기록 분석 및 스토리맵에 의한 새로운 스토리 검색 방법)

  • Kim, Myoung-Jun
    • Journal of Digital Contents Society
    • /
    • v.16 no.5
    • /
    • pp.795-803
    • /
    • 2015
  • is a service providing story synopsis that matches user's query. This paper analyzes the user log of and shows the tendency distribution of user creation in comparison to stories in database. We also investigate the log to see possible improvements on search method. This paper proposes a concept of Story Map, in which the query-answer information is projected into spatial coordinates, and a new story search UI based on it. Using the Story Map, users are able to see entire spatial distribution of story database so that they can quickly and intuitively find a story on the map.

A Study on the Change of Campus Circumference Transversal Spatial Configuration (Focusing on the back-street of Kangwon University Campus) (캠퍼스 주변 가로공간구조 변화에 관한 연구 (강원대학교 캠퍼스 후문을 중심으로))

  • Hwang, Dong-Keun;Kim, Young-Ook;Lee, Nak-Woon
    • Journal of Industrial Technology
    • /
    • v.29 no.B
    • /
    • pp.47-56
    • /
    • 2009
  • University is very big scale among urban facilities as for single facilities and there is characteristic that accompany various university support functions in contiguity area. Width that have diverse spatial configuration generally our country university campus around was formed, this does function that connect university and ambit. Specially, formation enables change of spatial configuration that existent width system has if is new around university campus. Also, can form more animate and lively width spatial configuration by forming more various and complex width spatial configuration in width had formed in existing. It is that search special quality of university surrounding width spatial configuration analyzing existing width spatial configuration of Kangwon National University back gate by formation if this study is new in city and forecasts the change, and used space syntax by spatial configuration analysis method.

  • PDF

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

Implementation of Content-based Image Retrieval System using Color Spatial and Shape Information (칼라 공간과 형태 정보를 이용한 내용기반 이미지 검색 시스템 구현)

  • Ban, Hong-Oh;Kang, Mun-Ju;Choi, Heyung-Jin
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.681-686
    • /
    • 2003
  • In recent years automatic image indexing and retrieval have been increasingly studied. However, content-based retrieval techniques for general images are still inadequate for many purposes. The novelty and originality of this thesis are the definition and use of a spatial information model as a contribution to the accuracy and efficiency of image search. In addition, the model is applied to represent color and shape image contents as a vector using the method of image features extraction, which was inspired by the previous work on the study of human visual perception. The indexing scheme using the color, shape and spatial model shows the potential of being applied with the well-developed algorithms of features extraction and image search, like ranking operations. To conclude, user can retrieved more similar images with high precision and fast speed using the proposed system.

A Study on Improvement of Digital National Survey Map System (디지털국토통계지도 시스템 개선에 관한 연구)

  • Lee, Jong-Yong;An, Jung-Cheon;Cho, Sung-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.9 no.4
    • /
    • pp.60-70
    • /
    • 2006
  • National atlas map for provide various information is one part of National territorial Statatics Survey but National atlas map in 2004 year don't have stability and ability. National territorial Statatics Survey in 2005 years have octuple data compare with data in 2004 years but have only one map. One map is going to provide with stability and ability. We don't use DBMS, But We make a similarly struct in file based program. We programmed system of dynamic-linked data with spatial data. To dynamic-linked system, we make search engine to based index struct and make combobox search system. spatial data only have index codes(year, national terrial indicator, area). If spatial data request specfied data, search engine search index code and provide DB data. New system is middle step of using DBMS. We redraw map for display real Korea area (with dokdo). New map is shape and similar Korea map.

  • PDF