• Title/Summary/Keyword: 이동 시퀀스

Search Result 121, Processing Time 0.029 seconds

Behavior Recognition of Moving Object based on Multi-Fusion Network (다중 융합 네트워크 기반 이동 객체 행동 인식)

  • Kim, Jinah;Moon, Nammee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.641-642
    • /
    • 2022
  • 단일 데이터로부터의 이동 객체에 대한 행동 인식 연구는 데이터 수집 과정에서 발생하는 노이즈의 영향을 크게 받는다. 본 논문은 영상 데이터와 센서 데이터를 이용하여 다중 융합 네트워크 기반 이동 객체 행동 인식 방법을 제안한다. 영상으로부터 객체가 감지된 영역의 추출과 센서 데이터의 이상치 제거 및 결측치 보간을 통해 전처리된 데이터들을 융합하여 시퀀스를 생성한다. 생성된 시퀀스는 CNN(Convolutional Neural Networks)과 LSTM(Long Short Term Memory)기반 다중 융합 네트워크 모델을 통해 시계열에 따른 행동 특징들을 추출하고, 깊은 FC(Fully Connected) 계층을 통해 특징들을 융합하여 행동을 예측한다. 본 연구에서 제시된 방법은 사람을 포함한 동물, 로봇 등의 다양한 객체에 적용될 수 있다.

Shape-Based Subsequence Retrieval Supporting Multiple Models in Time-Series Databases (시계열 데이터베이스에서 복수의 모델을 지원하는 모양 기반 서브시퀀스 검색)

  • Won, Jung-Im;Yoon, Jee-Hee;Kim, Sang-Wook;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.577-590
    • /
    • 2003
  • The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

Shape-Based Retrieval of Similar Subsequences in Time-Series Databases (시계열 데이타베이스에서 유사한 서브시퀀스의 모양 기반 검색)

  • Yun, Ji-Hui;Kim, Sang-Uk;Kim, Tae-Hun;Park, Sang-Hyeon
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.381-392
    • /
    • 2002
  • This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searches for the (sub)sequences whose shapes are similar to that of a given query sequence regardless of their actual element values. In this paper, we propose an effective and efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval based on the similarity model, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup up to around 66 times compared with the sequential scan method.

Mining Sequential Patterns Using Multi-level Linear Location Tree (단계 선형 배치 트리를 이용한 순차 패턴 추출)

  • 최현화;이동하;이전영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.70-72
    • /
    • 2003
  • 대용량 데이터베이스로부터 순차 패턴을 발견하는 문제는 지식 발견 또는 데이터 마이닝(Data Mining) 분야에서 주요한 패턴 추출 문제이다. 순차 패턴은 추출 기법에 있어 연관 규칙의 Apriori 알고리즘과 비슷한 방식을 사용하며 그 과정에서 시퀀스는 해쉬 트리 구조를 통해 다루어 진다. 이러한 해쉬 트리 구조는 항목들의 정렬과 데이터 시퀀스의 지역성을 무시한 저장 구조로 단순 검색을 통한 다수의 복잡한 포인터 연산수행을 기반으로 한다. 본 논문에서는 이러한 해쉬 트리 구조의 단정을 보완한 다단게 선형 배치 트리(MLLT, Multi-level Linear Location Tree)를 제안하고, 다단계 선형 배치 트리를 이용한 효율적인 마이닝 메소드(MLLT-Join)를 소개한다.

  • PDF

Location Generalization of Moving Objects for the Extraction of Significant Patterns (의미 패턴 추출을 위한 이동 객체의 위치 일반화)

  • Lee, Yon-Sik;Ko, Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.1
    • /
    • pp.451-458
    • /
    • 2011
  • In order to provide the optimal location based services such as the optimal moving path search or the scheduling pattern prediction, the extraction of significant moving pattern which is considered the temporal and spatial properties of the location-based historical data of the moving objects is essential. In this paper, for the extraction of significant moving pattern we propose the location generalization method which translates the location attributes of moving object into the spatial scope information based on $R^*$-tree for more efficient patterning the continuous changes of the location of moving objects and for indexing to the 2-dimensional spatial scope. The proposed method generates the moving sequences which is satisfied the constraints of the time interval between the spatial scopes using the generalized spatial data, and extracts the significant moving patterns using them. And it can be an efficient method for the temporal pattern mining or the analysis of moving transition of the moving objects to provide the optimal location based services.

Stratigraphy of the Central Sub-basin of the Gunsan Basin, Offshore Western Korea (한국 서해 대륙붕 군산분지 중앙소분지의 층서)

  • Kim, Kyung-min;Ryu, In-chang
    • Economic and Environmental Geology
    • /
    • v.51 no.3
    • /
    • pp.233-248
    • /
    • 2018
  • Strata of the Central sub-basin in the Gunsan Basin, offshore, western Korea were analyzed by using integrated stratigraphy approach. As a result, five distinct unconformity-bounded units are recognized in the basin: Sequence I (Cretaceous or older(?)), Sequence II (Late Cretaceous), Sequence III (late Late Cretaceous or younger(?)), Sequence IV (Early Miocene or older(?)), Sequence V (Middle Miocene). Since the late Late Jurassic, along the Tan-Lu fault system wrench faults were developed and caused a series of small-scale strike-slip extensional basins. The sinistral movement of wrench faults continued until the Late Cretaceous forming a large-scale pull-apart basin. However, in the Early Tertiary, the orogenic event, called the Himalayan Orogeny, caused basin to be modified. From Late Eocene to Early Miocene, tectonic inversion accompanied by NW strike folds occurred in the East China. Therefore, the late Eocene to Oligocene was the main period of severe tectonic modification of the basin and Oligocene formation is hiatus. The rate of tectonic movements in Gunsan Basin slowed considerably. In that case, thermal subsidence up to the present has maintained with marine transgressions, which enable this area to change into the land part of the present basin.

Beam Tracking Technique for Communication with Multiple Unmanned Aircraft Vehicles(UAVs) (다중 무인 항공기 통신을 위한 빔 추적 기법)

  • Maeng, Sung Joon;Park, Haein;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1539-1548
    • /
    • 2016
  • Beamforming technique at the ground station is known to be effective in obtaining coverage extension or SNR gain for communication with unmanned aerial vehicle (UAV). When a UAV moves, periodic beam tracking is necessary to maintain beam gain. In order to track beams for multiple UAVs, the ground station needs to receive different preamble sequences from multiple UAVs. In this paper, a preamble sequence design technique is proposed for beam tracking in a GMSK-based communication system with multiple UAVs. Hadamard sequence is considered for the design of preamble sequence due to its ideal cross-correlation property. A preamble sequence appropriate for a GMSK communication system with multiple UAVs is proposed after analyzing the properties of received signal in a GMSK system with the input of Hadamard sequence.

Temporal Pattern Mining of Moving Objects for Location based Services (위치 기반 서비스를 위한 이동 객체의 시간 패턴 탐사 기법)

  • Lee, Jun-Uk;Baek, Ok-Hyeon;Ryu, Geun-Ho
    • Journal of KIISE:Databases
    • /
    • v.29 no.5
    • /
    • pp.335-346
    • /
    • 2002
  • LBS(Location Based Services) provide the location-based information to its mobile users. The primary functionality of these services is to provide useful information to its users at a minimum cost of resources. The functionality can be implemented through data mining techniques. However, conventional data mining researches have not been considered spatial and temporal aspects of data simultaneously. Therefore, these techniques are inappropriate to apply on the objects of LBS, which change spatial attributes over time. In this paper, we propose a new data mining technique for identifying the temporal patterns from the series of the locations of moving objects that have both temporal and spatial dimension. We use a spatial operation of contains to generalize the location of moving point and apply time constraints between the locations of a moving object to make a valid moving sequence. Finally, the spatio-temporal technique proposed in this paper is very practical approach in not only providing more useful knowledge to LBS, but also improving the quality of the services.

A Comparison of Performance between STMP/MST and Existing Spatio-Temporal Moving Pattern Mining Methods (STMP/MST와 기존의 시공간 이동 패턴 탐사 기법들과의 성능 비교)

  • Lee, Yon-Sik;Kim, Eun-A
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.49-63
    • /
    • 2009
  • The performance of spatio-temporal moving pattern mining depends on how to analyze and process the huge set of spatio-temporal data due to the nature of it. The several method was presented in order to solve the problems in which existing spatio-temporal moving pattern mining methods[1-10] have, such as increasing execution time and required memory size during the pattern mining, but they did not solve properly yet. Thus, we proposed the STMP/MST method[11] as a preceding research in order to extract effectively sequential and/or periodical frequent occurrence moving patterns from the huge set of spatio-temporal moving data. The proposed method reduces patterns mining execution time, using the moving sequence tree based on hash tree. And also, to minimize the required memory space, it generalizes detailed historical data including spatio-temporal attributes into the real world scopes of space and time by using spatio-temporal concept hierarchy. In this paper, in order to verify the effectiveness of the STMP/MST method, we compared and analyzed performance with existing spatio-temporal moving pattern mining methods based on the quantity of mining data and minimum support factor.

  • PDF

A Study on Tracking of Object in Image Sequence (동영상내의 물체 추적에 관한 연구)

  • Choi Ho-Jin;Park Seung-Kyu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.665-668
    • /
    • 2006
  • 이동 물체 검출 및 추적은 과중한 연산량에 의해 초당 처리할 수 있는 프레임의 수가 적게 되거나 정합 과정이 단순하여 추적을 실패하는 문제점들이 있다. 본 논문에서는 동영상내에서 이동 물체를 검출하고 추적하는 새로운 접근 방법을 제안한다. 입력된 영상으로부터 배경과 물체를 분리하기 위해 background subtraction을 이용하였고, 분리된 물체들은 이진 연결 요소 분석을 통하여 세그먼트 된다. 그리고 물체의 추적을 위하여 Kalman filter를 사용하였다. 본 논문의 실험에서는 야외에서 촬영한 비디오 시퀀스를 이용하였으며, 물체 검출 및 추적이 조명 변화, 그림자에도 잘 적응함을 증명하였다.

  • PDF