• Title/Summary/Keyword: Location update

Search Result 244, Processing Time 0.025 seconds

An Efficient Spatial Index Technique based on Flash-Memory (플래시 메모리 기반의 효율적인 공간 인덱스 기법)

  • Kim, Joung-Joon;Sim, Hee-Joung;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.133-142
    • /
    • 2009
  • Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

  • PDF

An Approach Using LSTM Model to Forecasting Customer Congestion Based on Indoor Human Tracking (실내 사람 위치 추적 기반 LSTM 모델을 이용한 고객 혼잡 예측 연구)

  • Hee-ju Chae;Kyeong-heon Kwak;Da-yeon Lee;Eunkyung Kim
    • Journal of the Korea Society for Simulation
    • /
    • v.32 no.3
    • /
    • pp.43-53
    • /
    • 2023
  • In this detailed and comprehensive study, our primary focus has been placed on accurately gauging the number of visitors and their real-time locations in commercial spaces. Particularly, in a real cafe, using security cameras, we have developed a system that can offer live updates on available seating and predict future congestion levels. By employing YOLO, a real-time object detection and tracking algorithm, the number of visitors and their respective locations in real-time are also monitored. This information is then used to update a cafe's indoor map, thereby enabling users to easily identify available seating. Moreover, we developed a model that predicts the congestion of a cafe in real time. The sophisticated model, designed to learn visitor count and movement patterns over diverse time intervals, is based on Long Short Term Memory (LSTM) to address the vanishing gradient problem and Sequence-to-Sequence (Seq2Seq) for processing data with temporal relationships. This innovative system has the potential to significantly improve cafe management efficiency and customer satisfaction by delivering reliable predictions of cafe congestion to all users. Our groundbreaking research not only demonstrates the effectiveness and utility of indoor location tracking technology implemented through security cameras but also proposes potential applications in other commercial spaces.

A High-speed Packet Filtering System Architecture in Signature-based Network Intrusion Prevention (시그내쳐 기반의 네트워크 침입 방지에서 고속의 패킷 필터링을 위한 시스템 구조)

  • Kim, Dae-Young;Kim, Sun-Il;Lee, Jun-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.2
    • /
    • pp.73-83
    • /
    • 2007
  • In network intrusion prevention, attack packets are detected and filtered out based on their attack signatures. Pattern matching is extensively used to find attack signatures and the most time-consuming execution part of Network Intrusion Prevention Systems(NIPS). Pattern matching is usually accelerated by hardware and should be performed at wire speed in NIPS. However, that alone is not good enough. First, pattern matching hardware should be able to generate sufficient pattern match information including the pattern index number and the location of the match found at wire speed. Second, it should support pattern grouping to reduce unnecessary pattern matches. Third, it should always have a constant worst-case performance even if the number of patterns is increased. Finally it should be able to update patterns in a few minutes or seconds without stopping its operations, We propose a system architecture to meet the above requirement. The system architecture can process multiple pattern characters in parallel and employs a pipeline architecture to achieve high speed. Using Xilinx FPGA simulation, we show that the new system stales well to achieve a high speed oner 10Gbps and satisfies all of the above requirements.

Prediction of Blooming Dates of Spring Flowers by Using Digital Temperature Forecasts and Phenology Models (동네예보와 생물계절모형을 이용한 봄꽃개화일 예측)

  • Kim, Jin-Hee;Lee, Eun-Jung;Yun, Jin I.
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.15 no.1
    • /
    • pp.40-49
    • /
    • 2013
  • Current service system of the Korea Meteorological Administration (KMA) for blooming date forecasting in spring depends on regression equations derived from long term observations in both temperature and phenology at a given station. This regression based system does not allow a timely correction or update of forecasts that are highly sensitive to fluctuating weather conditions. Furthermore, the system cannot afford plant responses to climate extremes which were not observed before. Most of all, this method may not be applicable to locations other than that which the regression equations were derived from. This note suggests a way to replace the location restricted regression equations with a thermal time based phenology model to complement the KMA blooming forecast system. Necessary parameters such as reference temperature, chilling requirement and heating requirement were derived from phenology data for forsythia, azaleas and Japanese cherry at 29 KMA stations for the 1951-1980 period to optimize spring phenology prediction model for each species. Best fit models for each species were used to predict blooming dates and the results were compared with the observed dates to produce a correction grid across the whole nation. The models were driven by the KMA's daily temperature data at a 5km grid spacing and subsequently adjusted by the correction grid to produce the blooming date maps. Validation with the 1971-2012 period data showed the RMSE of 2-3 days for Japanese cherry, showing a feasibility of operational service; whereas higher RMSE values were observed with forsythia and azaleas.

An Efficient MBR Compression Technique for Main Memory Multi-dimensional Indexes (메인 메모리 다차원 인덱스를 위한 효율적인 MBR 압축 기법)

  • Kim, Joung-Joon;Kang, Hong-Koo;Kim, Dong-Oh;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.13-23
    • /
    • 2007
  • Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

A Study on Developing GIS-based Marine Exploration Data Management System using XML (GIS 기반의 XML을 이용한 해양탐사 데이터 관리 시스템 개발에 관한 연구)

  • Song, Hyun-Oh;Kim, Kye-Hyun;Kim, Mu-Jun
    • Spatial Information Research
    • /
    • v.18 no.4
    • /
    • pp.65-73
    • /
    • 2010
  • Recently, the importance of the ocean has been increasing internationally as the new source for mineral resources following the exhausted land resources that arc becoming scarce. On a long-term aspect, growth of nations by gaining competitiveness on marine resources was considered a paradigm. Because dominating the development right of marine resources came up as the main concern. South Korea has also been interested in marine resources and this is the reason why massive amounts of marine exploration data arc annually created through surveying and drilling around the Korean Peninsula. but the data has not been systematically managed very well because of its economic costs. Therefore, this research is mainly focused on systematical data managing methods. For Systematical data management. the exploration data is integrated and organized by using XML tables. This can be a systematical data management. because the methods release dependency between data and system, and it also enables to update existing data and renew the data. In the future, the constructed database from this study could definitely contribute to enhancing data management. As well, the developed system in this research can provide various spatial analysis and searching techniques to enable easier data provision of various exploration areas. Furthermore. this will be very useful to extend functions of the system and to adopt other types of DBMS. In addition, the spatial analysis and search function of location based service can be utilized through GIS. and it can support sustainable and systematic management in a long term.

Localizing Head and Shoulder Line Using Statistical Learning (통계학적 학습을 이용한 머리와 어깨선의 위치 찾기)

  • Kwon, Mu-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2C
    • /
    • pp.141-149
    • /
    • 2007
  • Associating the shoulder line with head location of the human body is useful in verifying, localizing and tracking persons in an image. Since the head line and the shoulder line, what we call ${\Omega}$-shape, move together in a consistent way within a limited range of deformation, we can build a statistical shape model using Active Shape Model (ASM). However, when the conventional ASM is applied to ${\Omega}$-shape fitting, it is very sensitive to background edges and clutter because it relies only on the local edge or gradient. Even though appearance is a good alternative feature for matching the target object to image, it is difficult to learn the appearance of the ${\Omega}$-shape because of the significant difference between people's skin, hair and clothes, and because appearance does not remain the same throughout the entire video. Therefore, instead of teaming appearance or updating appearance as it changes, we model the discriminative appearance where each pixel is classified into head, torso and background classes, and update the classifier to obtain the appropriate discriminative appearance in the current frame. Accordingly, we make use of two features in fitting ${\Omega}$-shape, edge gradient which is used for localization, and discriminative appearance which contributes to stability of the tracker. The simulation results show that the proposed method is very robust to pose change, occlusion, and illumination change in tracking the head and shoulder line of people. Another advantage is that the proposed method operates in real time.

Automated Construction Progress Management Using Computer Vision-based CNN Model and BIM (이미지 기반 기계 학습과 BIM을 활용한 자동화된 시공 진도 관리 - 합성곱 신경망 모델(CNN)과 실내측위기술, 4D BIM을 기반으로 -)

  • Rho, Juhee;Park, Moonseo;Lee, Hyun-Soo
    • Korean Journal of Construction Engineering and Management
    • /
    • v.21 no.5
    • /
    • pp.11-19
    • /
    • 2020
  • A daily progress monitoring and further schedule management of a construction project have a significant impact on the construction manager's decision making in schedule change and controlling field operation. However, a current site monitoring method highly relies on the manually recorded daily-log book by the person in charge of the work. For this reason, it is difficult to take a detached view and sometimes human error such as omission of contents may occur. In order to resolve these problems, previous researches have developed automated site monitoring method with the object recognition-based visualization or BIM data creation. Despite of the research results along with the related technology development, there are limitations in application targeting the practical construction projects due to the constraints in the experimental methods that assume the fixed equipment at a specific location. To overcome these limitations, some smart devices carried by the field workers can be employed as a medium for data creation. Specifically, the extracted information from the site picture by object recognition technology of CNN model, and positional information by GIPS are applied to update 4D BIM data. A standard CNN model is developed and BIM data modification experiments are conducted with the collected data to validate the research suggestion. Based on the experimental results, it is confirmed that the methods and performance are applicable to the construction site management and further it is expected to contribute speedy and precise data creation with the application of automated progress monitoring methods.

An Origin-Centric Communication Scheme to Support Sink Mobility for Continuous Object Detection in IWSNs (산업용 무선 센서망을 이용한 연속개체 탐지에서 이동 싱크 지원을 위한 발원점 중심의 통신방안)

  • Kim, Myung-Eun;Kim, Cheonyong;Yim, Yongbin;Kim, Sang-Ha;Son, Young-Sung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.12
    • /
    • pp.301-312
    • /
    • 2018
  • In industrial wireless sensor networks, the continuous object detection such as fire or toxic gas detection is one of major applications. A continuous object occurs at a specific point and then diffuses over a wide area. Therefore, many studies have focused on accurately detecting a continuous object and delivering data to a static sink with an energy-efficient way. Recently, some applications such as fire suppression require mobile sinks to provide real-time response. However, the sink mobility support in continuous object detection brings challenging issues. The existing approaches supporting sink mobility are designed for individual object detection, so they establish one-to-one communication between a source and a mobile sink for location update. But these approaches are not appropriate for a continuous object detection since a mobile sink should establish one-to-many communication with all sources. The one-to-many communication increases energy consumption and thus shortens the network lifetime. In this paper, we propose the origin-centric communication scheme to support sink mobility in a continuous object detection. Simulation results verify that the proposed scheme surpasses all the other work in terms of energy consumption.

Object-Based Road Extraction from VHR Satellite Image Using Improved Ant Colony Optimization (개선된 개미 군집 최적화를 이용한 고해상도 위성영상에서의 객체 기반 도로 추출)

  • Kim, Han Sae;Choi, Kang Hyeok;Kim, Yong Il;Kim, Duk-Jin;Jeong, Jae Joon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.3
    • /
    • pp.109-118
    • /
    • 2019
  • Road information is one of the most significant geospatial data for applications such as transportation, city planning, map generation, LBS (Location-Based Service), and GIS (Geographic Information System) database updates. Robust technologies to acquire and update accurate road information can contribute significantly to geospatial industries. In this study, we analyze the limitations of ACO (Ant Colony Optimization) road extraction, which is a recently introduced object-based road extraction method using high-resolution satellite images. Object-based ACO road extraction can efficiently extract road areas using both spectral and morphological information. This method, however, is highly dependent on object descriptor information and requires manual designations of descriptors. Moreover, reasonable iteration closing point needs to be specified. In this study, we perform improved ACO road extraction on VHR (Very High Resolution) optical satellite image by proposing an optimization stopping criteria and descriptors that complements the limitations of the existing method. The proposed method revealed 52.51% completeness, 6.12% correctness, and a 51.53% quality improvement over the existing algorithm.