• Title/Summary/Keyword: Spatial Query Process

Search Result 73, Processing Time 0.03 seconds

Emotion from Color images and Its Application to Content-based Image Retrievals (칼라영상의 감성평가와 이를 이용한 내용기반 영상검색)

  • Park, Joong-Soo;Eum, Kyoung-Bae;Shin, Kyung-Hae;Lee, Joon-Whoan;Park, Dong-Sun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.2
    • /
    • pp.179-188
    • /
    • 2003
  • In content-based image retrieval, the query is an image itself and the retrieval process is the process that seeking the similar images to the given query image. In this way of retrieval, the user has to know the basic physical features of target images that he wants to retrieve. But it has some restriction because to retrieve the target image he has to know the basic physical feature space such as color, texture, shape and spatial relationship. In this paper, we propose an emotion-based retrieval system. It uses the emotion that color images have. It is different from past emotion-based image retrieval in point of view that it uses relevance feedback to estimate the users intend and it is easily combined with past content-based image retrieval system. To test the performance of our proposed system, we use MPEG-7 color descriptor and emotion language such as "warm", "clean", "bright" and "delight" We test about 1500 wallpaper images and get successful result.lpaper images and get successful result.

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.

API Extension of RTLS Middleware for Efficient Asynchronous Transmission (효율적인 비동기 전송을 지원하기 위한 RTLS 미들웨어의 확장)

  • Park, Jae-Kwan;Hong, Bong-Hee;Lee, Seung-Chul
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.111-118
    • /
    • 2009
  • Recently many global enterprises build RTLS system for their environments. RTLS is used to detect object at real tim e. Unlike RFID, RTLS tags are read automatically and continuously, independent of the process that moves the tags. The proposed functionality of standard API has two problems. When middleware provides data to application, it sends a huge amount of data that may be useless. When only an application requests for data, the middleware replies result data in synchronous mode. This paper proposes a method to reduce an amount of data transferring from middleware to application and an addition communication mode to support real-time event processing in the middleware. Also, we designed and implemented an RTLS middleware applying the proposed methods.

  • PDF

Query Operations for Fuzzy Spatiotemporal Databases (퍼지 시공간 데이터베이스를 위한 질의 연산)

  • Nhan Vu Thi Hong;Chi Jeong-Hee;Ryu Keun-Ho
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2004.12a
    • /
    • pp.81-88
    • /
    • 2004
  • GIS (geographic information system) applications increasingly require the representation of geospatial objects with fuzzy extent and querying of time-varying information. In this paper, we Introduce a FSTDB (fuzzy spatiotemporal database) to represent and manage states and events causing changes of dynamic fuzzy objects using fuzzy set theory. We also propose the algorithms for the operators to be included in a GIS to make it able to answer queries depending on fuzzy predicates during a time interval and a method to identify the development process of objects during a certain period based on the designed database. They can be used in application areas handling time-varying geospatial data, including global change (as in climate or land cover change) and social (demographic, health, ect.) application.

  • PDF

Development of a Geo Semantic Web System (Geo Semantic Web 시스템의 개발)

  • Kim, Joung-Joon;Shin, In-Su;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.18 no.5
    • /
    • pp.83-92
    • /
    • 2010
  • Recently, as the Geospatial Web is combined with the Semantic Web in order to keep pace with the recent trends of information technology emphasizing interoperability, intelligence and individualization, the Geo Semantic Web was proposed, which is an intelligent geographical information Web service technology that can provide users with suitable information by connecting and integrating various types of spatial information and extensive aspatial information on the Web efficiently. For the Geo Semantic Web service, we need to develop Geo Ontology processing technologies that enable computers to process knowledge and information scattered around in the Web environment automatically. However, standards for Geo Ontology processing technologies have nod been established yet, and standardization organizations and various groups and agencies are conducting relevant studies. This paper analyzed various base theories and technologies related to Geo Ontology and developed a Geo Semantic Web system. The Geo Semantic Web system comprises Query Processing Manager that analyzes and processes Geo Semantic queries and manages sessions, Ontology Manager that generates and queries Geo Ontology and extracts spatial/aspatial data, and Clients. Finally, this paper proved the utility of the Geo Semantic Web system by applying it to a hypothetical scenario where Geo Semantic queries are required.

Design and Implementation of Web GIS Server Using Node.js (Node.js를 활용한 웹GIS 서버의 설계와 구현)

  • Jun, Sang Hwan;Doh, Kyoung Tae
    • Spatial Information Research
    • /
    • v.21 no.3
    • /
    • pp.45-53
    • /
    • 2013
  • Web GIS, based on the latest web-technology, has evolved to provide efficient and accurate spatial information to users. Furthermore, Web GIS Server has improved the performance constantly to respond user web requests and to offer spatial information service. This research aims to create a designed and implemented Web GIS Server that is named as Nodemap which uses the emergent technology, Node.js, which has been issued for an event-oriented, non-blocking I/O model framework for coding JavaScript on the server development. Basically, NodeMap is Web GIS Server that supports OGC implementation specification. It is designed to process GIS data by using DBMS, which supports spatial index and standard spatial query function. And NodeMap uses Node-Canvas module supported HTML5 canvas to render spatial information on tile map. Lastly, NodeMap uses Express module based connect module framework. NodaMap performance demonstration confirmed a possibility of applying Node.js as a (next/future) Web GIS Server development technology through the benchmarking. Having completed its quality test of NodeMap, this study has shown the compatibility and potential for Node.js as a Web GIS server development technology, and has shown the bright future of internet GIS service.

The Method for Real-time Complex Event Detection of Unstructured Big data (비정형 빅데이터의 실시간 복합 이벤트 탐지를 위한 기법)

  • Lee, Jun Heui;Baek, Sung Ha;Lee, Soon Jo;Bae, Hae Young
    • Spatial Information Research
    • /
    • v.20 no.5
    • /
    • pp.99-109
    • /
    • 2012
  • Recently, due to the growth of social media and spread of smart-phone, the amount of data has considerably increased by full use of SNS (Social Network Service). According to it, the Big Data concept is come up and many researchers are seeking solutions to make the best use of big data. To maximize the creative value of the big data held by many companies, it is required to combine them with existing data. The physical and theoretical storage structures of data sources are so different that a system which can integrate and manage them is needed. In order to process big data, MapReduce is developed as a system which has advantages over processing data fast by distributed processing. However, it is difficult to construct and store a system for all key words. Due to the process of storage and search, it is to some extent difficult to do real-time processing. And it makes extra expenses to process complex event without structure of processing different data. In order to solve this problem, the existing Complex Event Processing System is supposed to be used. When it comes to complex event processing system, it gets data from different sources and combines them with each other to make it possible to do complex event processing that is useful for real-time processing specially in stream data. Nevertheless, unstructured data based on text of SNS and internet articles is managed as text type and there is a need to compare strings every time the query processing should be done. And it results in poor performance. Therefore, we try to make it possible to manage unstructured data and do query process fast in complex event processing system. And we extend the data complex function for giving theoretical schema of string. It is completed by changing the string key word into integer type with filtering which uses keyword set. In addition, by using the Complex Event Processing System and processing stream data at real-time of in-memory, we try to reduce the time of reading the query processing after it is stored in the disk.

Application of GIS to Select Viewpoints for Landscape Analysis (경관분석 조망점 선정을 위한 GIS의 적용방안)

  • Kang, Tae-Hyun;Leem, Youn-Taik;Lee, Sang-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.16 no.2
    • /
    • pp.101-113
    • /
    • 2013
  • The concern on environmental quality makes the landscape analysis more important than before ever. For the landscape analysis, selection of viewpoint is one of most important stage. Because of its subjectiveness, the conventional viewpoint selection method often missed some viewpoints of importance. The purpose of this study is to develop a viewpoint selection method for landscape analysis using GIS data and techniques. During the viewpoint selection process, spatial and attribute data from several GIS systems were hired. Query and overlay methods were mainly adapted for analysis to find out meaningful viewpoints. The 3D simulation analysis on DEM(Digital Elevation Model) was used for every selected viewpoint to examine wether the view target is screened out or not. Application study at a sample site showed some omissions of good viewpoints without any screening. It also exhibited the possibility to reduce time and cost for the viewpoint selection process of landscape analysis. For the progress of applicability, GIS data analysis process have to be improved and more modules such as automatic screening analysis system on selected viewpoint have to be developed.

MRI Image Retrieval Using Wavelet with Mahalanobis Distance Measurement

  • Rajakumar, K.;Muttan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.5
    • /
    • pp.1188-1193
    • /
    • 2013
  • In content based image retrieval (CBIR) system, the images are represented based upon its feature such as color, texture, shape, and spatial relationship etc. In this paper, we propose a MRI Image Retrieval using wavelet transform with mahalanobis distance measurement. Wavelet transformation can also be easily extended to 2-D (image) or 3-D (volume) data by successively applying 1-D transformation on different dimensions. The proposed algorithm has tested using wavelet transform and performance analysis have done with HH and $H^*$ elimination methods. The retrieval image is the relevance between a query image and any database image, the relevance similarity is ranked according to the closest similar measures computed by the mahalanobis distance measurement. An adaptive similarity synthesis approach based on a linear combination of individual feature level similarities are analyzed and presented in this paper. The feature weights are calculated by considering both the precision and recall rate of the top retrieved relevant images as predicted by our enhanced technique. Hence, to produce effective results the weights are dynamically updated for robust searching process. The experimental results show that the proposed algorithm is easily identifies target object and reduces the influence of background in the image and thus improves the performance of MRI image retrieval.

An Implementation of distributed Real-time Location Data Server based on the GALIS Architecture (GALIS 구조 기반 실시간 분산 위치 데이타 서버 구현)

  • Lee, Joon-Woo;Lee, Woon-Ju;Lee, Ho;Nah, Yun-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.1 s.13
    • /
    • pp.53-62
    • /
    • 2005
  • A challenging task in the LBS system engineering is to implement a highly scalable system architecture which can manage moderate-size configurations handling thousands of moving items as well as upper-end configurations handling distributed computing system architecture that consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. In this paper, we explain a prototype location data server structuring major components of GALIS by employing the TMO programming scheme, including the execution engine middleware developed to support real-time distributed object programming and real-time distributed computing system design. We present how to generate realistic location sensing reports and how to process such location reports and location-related queries. Some experimental results showing performance factors regarding distributed query processing are also explained.

  • PDF