• Title/Summary/Keyword: 반경 검색

Search Result 28, Processing Time 0.034 seconds

Applying the L-index for Analyzing the Density of Point Features (점사상 밀도 분석을 위한 L-지표의 적용)

  • Lee, Byoung-Kil
    • Spatial Information Research
    • /
    • v.16 no.2
    • /
    • pp.237-247
    • /
    • 2008
  • Statistical analysis of the coordinate information is regarded as one of the major GIS functions. Among them, one of the most fundamental analysis is density analysis of point features. For analyzing the density appropriately, determining the search radius, kernel radius, has critical importance. In this study, using L-index, known as its usefulness for choosing the kernel radius in previous researches, radius for density analysis of various point features are estimated, and the behavior of L-index is studied based on the estimated results. As results, L-index is not suitable to determine the search radius for the point features that are evenly distributed with small clusters, because the pattern of the L-index is depends on the size of the study area. But for the point features with small number of highly clustered areas, L-index is suitable, because the pattern of the L-index is not affected by the size of study area.

  • PDF

Development of Radius Search System based on Raster Map in the Flash Environment (플래시 환경에서 래스터 지도를 기반으로 한 반경 검색 시스템 개발)

  • Kim, Sung-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.4
    • /
    • pp.39-47
    • /
    • 2008
  • This paper describes the life GIS(Geographic Information System) system that enables users to look up the final destination on a map automatically by setting up a random radius of threshold under the present user position. Various information systems based on the existing GIS have disadvantage that a search is difficult when the destination location is not clear. And it is inefficient that the processing time is delay due to a complex configuration and large amount of informations based on the target of special business supports. Therefore, this paper improves these problems and proposes the customized life GIS which is for the general user in the Flash(Action Script) environment. The customized life GIS confirms the detail items from search results, which is destinations fitting for a condition in the suitable radius of threshold from the present user position. And the user can look up the suitable final destination on a map easily using the customized information system. The result of this paper, which is based on the sample of the large unit locations, will be expected to be able to guide more detail, extensive and various informations.

Restaurant Recommendation System Using GPS in Smartphones (스마트폰의 GPS를 이용한 음식점 추천 시스템)

  • Kwon, O-Deuk;Lee, Hyun-Woo;Kim, Young-Ah;Park, Doo-Soon
    • Annual Conference of KIPS
    • /
    • 2012.04a
    • /
    • pp.1330-1332
    • /
    • 2012
  • 휴대전화에 인터넷 통신과 정보검색 등 컴퓨터 지원 기능을 추가한 스마트폰이라 불리는 지능형 단말기가 등장하여 우리의 일상생활에 깊이 관여하고 생활의 패턴을 바꾸는 큰 변화를 불러왔다. 현재 음식추천 어플리케이션들은 대부분 주변의 음식점의 위치나 메뉴 정보 등을 제공하고 있다. 본 논문에서는 음식 추천방식에 룰렛을 이용하여 게임 형식의 음식추천이 가능하게 하였으며 구글 맵 기능을 활용하여 현재위치에서 내가 찾는 음식점 중에 반경을 입력하면 그 반경 안에 있는 음식점들을 검색하도록 Android 운영체제를 기반으로 한 어플리케이션을 개발하였다.

A Study on Cultural properties and Historical Region Management System construction Using Geo-Spatial Information System (GSIS를 이용한 문화유적지 관리시스템 구축방안에 관한 연구)

  • Kim Kam-Rae;Kim Hoon-Jung;Kim Myoung-Bae;Lee Ka-Hyoung
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2006.04a
    • /
    • pp.353-358
    • /
    • 2006
  • 지자체에 보유하고 있는 문화유적에 대한 현황이 표시된 종이도면에 대해 스캐닝을 통한 벡터라이징을 수행하여 자료를 전산화하고 지적도와 중첩 표시 되어있는 현황에 맞게 동일좌표계로 데이터를 구축한다. 이러한 기초데이터에 대해 사용자의 질의 및 이에 의한 검색을 수행하기 위해 개발도구는 Visual C++, Visual Basic과 지도에 대한 질의 및 화면도시를 위한 기초엔진을 Map Object를 통해 최적화 시켰다. 본 연구를 통해 구축된 시스템의 중요기능으로는 문화유적에 대해 지번 및 반경입력을 통해 유적에 영향을 미치는 영향권 분석, 선택지번에서 최단거리에 있는 문화재 검색, 최단경로 분석, 문화재에 대한 다양한 정보 및 관리대장에 대한 관리기능 등의 주요기능이며 부수적으로 다양한 검색 및 출력을 위해 지번 및 소유자검색, 대장검색, 문화재검색, 도면 및 대장출력, 출력물 연동, 화면이미지 저장 등을 수행하도록 시스템을 구축하였다.

  • PDF

A Direction Computation and Media Retrieval Method of Moving Object using Weighted Vector Sum (가중치 벡터합을 이용한 이동객체의 방향계산 및 미디어 검색방법)

  • Suh, Chang-Duk;Han, Gi-Tae
    • The KIPS Transactions:PartD
    • /
    • v.15D no.3
    • /
    • pp.399-410
    • /
    • 2008
  • This paper suggests a new retrieval method using weighted vector sum to resolve a problem of traditional location-based retrieval method, nearest neighbor (NN) query, and NN query using direction. The proposed method filters out data with the radius, and then the remained retrieval area is filtered by a direction information compounded of a user's moving direction, a pre-fixed interesting direction, and a pre-fixed retrieval angle. The moving direction is computed from a vector or a weighted vector sum of several vectors using a weight to adopt several cases. The retrieval angle can be set from traditional $360^{\circ}$ to any degree you want. The retrieval data for this method can be a still and moving image recorded shooting location, and also several type of media like text, web, picture offering to customer with location of company or resort. The suggested method guarantees more accurate retrieval than traditional location-based retrieval methods because that the method selects data within the radius and then removes data of useless areas like passed areas or an area of different direction. Moreover, this method is more flexible and includes the direction based NN.

Combined Image Retrieval System using Clustering and Condensation Method (클러스터링과 차원축약 기법을 통합한 영상 검색 시스템)

  • Lee Se-Han;Cho Jungwon;Choi Byung-Uk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.53-66
    • /
    • 2006
  • This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.

The Consensus String Problem based on Radius is NP-complete (거리반경기반 대표문자열 문제의 NP-완전)

  • Na, Joong-Chae;Sim, Jeong-Seop
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.3
    • /
    • pp.135-139
    • /
    • 2009
  • The problems to compute the distances or similarities of multiple strings have been vigorously studied in such diverse fields as pattern matching, web searching, bioinformatics, computer security, etc. One well-known method to compare multiple strings in the given set is finding a consensus string which is a representative of the given set. There are two objective functions that are frequently used to find a consensus string, one is the radius and the other is the consensus error. The radius of a string x with respect to a set S of strings is the smallest number r such that the distance between the string x and each string in S is at most r. A consensus string based on radius is a string that minimizes the radius with respect to a given set. The consensus error of a string with respect to a given set S is the sum of the distances between x and all the strings in S. A consensus string of S based on consensus error is a string that minimizes the consensus error with respect to S. In this paper, we show that the problem of finding a consensus string based on radius is NP-complete when the distance function is a metric.

Efficient Flooding Algorithm for Mobile P2P Systems using Super Peer (슈퍼피어를 이용한 모바일 P2P시스템을 위한 효율적인 플러딩 알고리즘)

  • Kang, So-Young;Lee, Kwang-Jo;Yang, Sung-Bong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.2
    • /
    • pp.217-221
    • /
    • 2010
  • As the appearances of various new mobile devices and the explosive growth of mobile device users, many researches related to mobile P2P systems have been proceeded actively. In this paper, we propose a new search algorithm for the double-layered super peer system in the mobile environment. For the proposed search algorithm, we divide the entire experiment region into a grid of cells, each of which has the same size. The grid is configured properly by considering the communication range of a mobile device and the number of peers in the system. The proposed search algorithm is a partial flooding search method based on the directions of cells involved with the search. It reduces successfully the network traffic, but shows a low search hit ratio. To enhance the search hit ratio, we introduce a bridge-peer table for a super peer and utilize an n-way search. The experimental results show that the proposed algorithm made an average of 20~30% reduction in the number of message packets over the double-layered system. The success ratio was also improved about 2~5% over the double-layered system.

Valley Search Application Using Android Smart Phones (안드로이드 스마트폰을 이용한 계곡검색 애플리케이션)

  • Lee, Tae-Kwon;Kwon, DooWy;Park, SuHyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.536-537
    • /
    • 2014
  • In this paper, it suggested Android smart phone application for users who want to find valley at summer. To provide correct information, we used Korea Tourism Organization's tourism information database and to provide tourism information and map service at once we linked Naver map. Search valley application can search valley by using country's region name and keyword by using map and GPS. we can find restaurants accomodations around your location. we can get restaurants and accommodations by control distance so we can get phone number, pictures and detail information about searched data. Also, you can bookmark valley where you want to go and you can search of delete bookmarked valley whenever you want. you can share opinion by writing postscribe about the valley where application user went. for developer and users amicable communication we made Q&A board.

  • PDF

GIS를 이용한 철도 연변 낙석, 산사태 정보시스템 개발

  • 이사로;송원경;박종휘
    • Proceedings of the Korean Society for Rock Mechanics Conference
    • /
    • 2001.03a
    • /
    • pp.221-230
    • /
    • 2001
  • 본 연구에서는 지리정보시스템(GIS)을 이용하여 철도 연변 낙석, 산사태 관련 공간정보를 검색 및 출력 등 관리할 수 있는 정보시스템을 개발하였다. 이를 위해 전국 철도 노선 중 낙석 및 산사태 발생 가능성이 높은 경춘선, 영동선, 중앙선, 태백선, 정선선의 2.5km 혹은 5km 반경 지역에 대해 철도 관련 정보, 각종 지도 관련 정보, 지형분석 정보, 수문기상 정보, 현장 조사된 낙석 관련 정보 등 각종 공간 데이터베이스를 구축하였다. 그리고 구축된 공간 데이터베이스를 관리하는 철도 연변 낙석, 산사태 정보시스템을 개발하였다. 본 정보시스템은 보기환경, 테이블환경, 차트환경, 레이아웃환경, 프로젝트환경 등 5개로 구성되어 있다. 본 정보시스템의 기능은 구축된 공간 데이터베이스를 입력, 검색, 출력 뿐 아니라 자료 변환, 자료 및 범례 편집, 라벨 생성, 화면 확대, 축소, 지도 작성, 그림 편집, 문자 DB 관리, 차트작성, 도움말 등 다양하다. 본 정보시스템은 ArcView의 스크립트 언어인 Avenue를 이용하여 개발되었고 풀다운 메뉴 및 아이콘 방식을 채택하여 사용자가 사용하기 쉽게 개발되었다. 구축된 공간 데이터베이스와 개발된 정보시스템은 낙석 및 산사태 관리 및 분석을 위한 기본 자료 및 도구로 사용될 수 있다.

  • PDF