• 제목/요약/키워드: Location정보

검색결과 5,610건 처리시간 0.035초

이동망을 위한 적응적 분산 위치 관리 알고리즘 (An Adaptive Distributed Location Management Algorithm for Mobile Networks)

  • 이주영;배인한
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
    • /
    • pp.550-552
    • /
    • 2001
  • 미래의 PCS 네트워크 설계에서 하나의 중요한 문제는 위치 정보의 효율적인 관리이다. 우리는 이동망내의 위치 정보 데이터베이스들의 공간 국소성과 원격 이동 호스트들에 의한 국부 이동 호스트들의 위치 질의 선호도를 고려한 적응적 분산 위치 관리 알고리즘을 제안하고, 그것의 성능을 분석적 모델로 평가한다.

An Eye Location based Head Posture Recognition Method and Its Application in Mouse Operation

  • Chen, Zhe;Yang, Bingbing;Yin, Fuliang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.1087-1104
    • /
    • 2015
  • An eye location based head posture recognition method is proposed in this paper. First, face is detected using skin color method, and eyebrow and eye areas are located based on gray gradient in face. Next, pupil circles are determined using edge detection circle method. Finally, head postures are recognized based on eye location information. The proposed method has high recognition precision and is robust for facial expressions and different head postures, and can be used in mouse operation. The experimental results reveal the validity of proposed method.

Minimizing the Average Distance of Separated Points on the Plane in the L1-Distance

  • Kim, Jae-Hoon
    • Journal of information and communication convergence engineering
    • /
    • 제10권1호
    • /
    • pp.1-4
    • /
    • 2012
  • Given separated points divided by a line, called a wall, in a plane, we aim to make a gate in the wall to connect the separated points to each other. In this setting, the problem is to find a location for the gate that minimizes the average distance between the points. The problem is a variant of the well-known facility location problem, which is extensively studied in the fields of operations research, location theory, theoretical computer science, and so on. In this paper, we consider the $L^1$-distance of the points in the plane. The points are projected onto the wall and so the problem is transformed to a proximity problem of points on a line. Then it is shown that the transformed problem is related to the weighted median problem of points on the line. Therefore, we obtain an O(n log n)-time algorithm to solve our problem.

영상의 위치 정보를 위한 임베디드 지오코딩 시스템 구현 (Implementation of Embedded Geo-coding System for Image's Geo-Location)

  • 이용환;김영섭
    • 반도체디스플레이기술학회지
    • /
    • 제7권3호
    • /
    • pp.59-63
    • /
    • 2008
  • Geo-coding refers to the process of associating data with location information, and the system deals with geographic identifiers expressed as latitude and longitude or street addresses. Although many services have been launched, there still remains a problem for users to create geo-coded photo with manually labeling GPS(Global Positioning System) coordinate or synchronizing with separate devices. In this paper, we design and implement a geo-coding system which utilizes the time and location information embedded in digital photographs in order to automatically categorize a personal photo collection. An included GPS receiver labels a photograph with its corresponding GPS coordinates, and the position of the camera is automatically recorded into the photo image header at the moment of capture. The place and time where the photo was taken allows us to provide context metadata on the management and retrieval of information.

  • PDF

The Modeling Scheme of RFID Tags for Processing Regional Queries

  • Kim, Dong-Hyun;Hong, Bong-Hee
    • Journal of information and communication convergence engineering
    • /
    • 제6권1호
    • /
    • pp.110-116
    • /
    • 2008
  • A RFID is an automatic data collection system based on the radio frequency and is the key technology of ubiquitous computing environments. Since the locations of objects attached by RFID tags can be acquired by readers, it is possible to query the locations of tags. To query tags efficiently, the data of RFID tags should be modeled and indexed. However, since the location information of tags, the predicates of queries, are differ from coordinates of moving objects, it is difficult to model tags under the concept of moving objects, In this paper, we propose the location model of tags to represents the trajectories of tags. The location model is composed of the set and graph based approaches.

Distance Geometry-based Wireless Location Algorithms in Cellular Networks with NLOS Errors

  • Zhao, Junhui;Zhang, Hao;Ran, Rong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권6호
    • /
    • pp.2132-2143
    • /
    • 2015
  • This paper presents two distance geometry-based algorithms for wireless location in cellular network systems-distance geometry filtering (DGF) and distance geometry constraint (DGC). With time-of-arrival range measurements, the DGF algorithm estimates the mobile station position by selecting a set of measurements with relatively small NLOS (non-line-of-sight) errors, and the DGC algorithm optimizes the measurements first and then estimates the position using those optimized measurements. Simulation results show that the proposed algorithms can mitigate the impact of NLOS errors and effectively improve the accuracy of wireless location.

Identifying Unusual Days

  • Kim, Min-Kyong;Kotz, David
    • Journal of Computing Science and Engineering
    • /
    • 제5권1호
    • /
    • pp.71-84
    • /
    • 2011
  • Pervasive applications such as digital memories or patient monitors collect a vast amount of data. One key challenge in these systems is how to extract interesting or unusual information. Because users cannot anticipate their future interests in the data when the data is stored, it is hard to provide appropriate indexes. As location-tracking technologies, such as global positioning system, have become ubiquitous, digital cameras or other pervasive systems record location information along with the data. In this paper, we present an automatic approach to identify unusual data using location information. Given the location information, our system identifies unusual days, that is, days with unusual mobility patterns. We evaluated our detection system using a real wireless trace, collected at wireless access points, and demonstrated its capabilities. Using our system, we were able to identify days when mobility patterns changed and differentiate days when a user followed a regular pattern from the rest. We also discovered general mobility characteristics. For example, most users had one or more repeating mobility patterns, and repeating mobility patterns did not depend on certain days of the week, except that weekends were different from weekdays.

Improving JPEG-LS Performance Using Location Information

  • Woo, Jae Hyeon;Kim, Hyoung Joong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권11호
    • /
    • pp.5547-5562
    • /
    • 2016
  • JPEG-LS is an international standard for lossless or near-lossless image-compression algorithms. In this paper, a simple method is proposed to improve the performance of the lossless JPEG-LS algorithm. With respect to JPEG-LS and its supplementary explanation, Golomb-Rice (GR) coding is mainly used for entropy coding, but it is not used for long codewords. The proposed method replaces a set of long codewords with a set of shorter location map information. This paper shows how efficiently the location map guarantees reversibility and enhances the compression rate in terms of performance. Experiments have also been conducted to verify the efficiency of the proposed method.

지리적 위치 정보를 이용한 사진 영상 검색 (Photo Image Retrieval using Geo-location Information)

  • 이용환;김영섭
    • 반도체디스플레이기술학회지
    • /
    • 제7권4호
    • /
    • pp.57-62
    • /
    • 2008
  • Image retrieval is one of the most exciting and rapidly growing research issues in the field of multimedia technology. This paper proposes a new method that performs search the relevant images by using query-by-example. The proposed method for search and retrieval of images utilizes the location information where the image had been taken. The system associates the photo images with their corresponding GPS coordinates that are used as metadata for searching. Experimental results show that the proposed method demonstrates better performance improving up to 59% of average recall and 49% of average precision. Moreover, we learned from the experimental results geo-location information embedded within the image header is more effective and positive on the search and storage.

  • PDF

Objective Bayesian testing for the location parameters in the half-normal distributions

  • Kang, Sang-Gil;Kim, Dal-Ho;Lee, Woo-Dong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제22권6호
    • /
    • pp.1265-1273
    • /
    • 2011
  • This article deals with the problem of testing the equality of the location parameters in the half-normal distributions. We propose Bayesian hypothesis testing procedures for the equality of the location parameters under the noninformative prior. The non-informative prior is usually improper which yields a calibration problem that makes the Bayes factor to be defined up to arbitrary constants. This problem can be deal with the use of the fractional Bayes factor or intrinsic Bayes factor. So we propose the default Bayesian hypothesis testing procedures based on the fractional Bayes factor and the intrinsic Bayes factors under the reference priors. Simulation study and an example are provided.