• Title/Summary/Keyword: 궤적 군집화

Search Result 11, Processing Time 0.03 seconds

Detection of Moving Objects in Crowded Scenes using Trajectory Clustering via Conditional Random Fields Framework (Conditional Random Fields 구조에서 궤적군집화를 이용한 혼잡 영상의 이동 객체 검출)

  • Kim, Hyeong-Ki;Lee, Gwang-Gook;Kim, Whoi-Yul
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1128-1141
    • /
    • 2010
  • This paper proposes a method of moving object detection in crowded scene using clustered trajectory. Unlike previous appearance based approaches, the proposed method employes motion information only to isolate moving objects. In the proposed method, feature points are extracted from input frames first and then feature tracking is followed to create feature trajectories. Based on an assumption that feature points originated from the same objects shows similar motion as the object moves, the proposed method detects moving objects by clustering trajectories of similar motions. For this purpose an energy function based on spatial proximity, motion coherence, and temporal continuity is defined to measure the similarity between two trajectories and the clustering is achieved by minimizing the energy function in CRFs (conditional random fields). Compared to previous methods, which are unable to separate falsely merged trajectories during the clustering process, the proposed method is able to rearrange the falsely merged trajectories during iteration because the clustering is solved my energy minimization in CRFs. Experiment results with three different crowded scenes show about 94% detection rate with 7% false alarm rate.

Discretizing Spatio-Temporal Data using Data Reduction and Clustering (데이타 축소와 군집화를 사용하는 시공간 데이타의 이산화 기법)

  • Kang, Ju-Young;Yong, Hwan-Seung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.57-61
    • /
    • 2009
  • To increase the efficiency of mining process and derive accurate spatio-temporal patterns, continuous values of attributes should be discretized prior to mining process. In this paper, we propose a discretization method which improves the mining efficiency by reducing the data size without losing the correlations in the data. The proposed method first s original trajectories into approximations using line simplification and then groups them into similar clusters. Our experiments show that the proposed approach improves the mining efficiency as well as extracts more intuitive patterns compared to existing discretization methods.

Speech Synthesis using Diphone Clustering and Improved Spectral Smoothing (다이폰 군집화와 개선된 스펙트럼 완만화에 의한 음성합성)

  • Jang, Hyo-Jong;Kim, Kwan-Jung;Kim, Gye-Young;Choi, Hyung-Il
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.665-672
    • /
    • 2003
  • This paper describes a speech synthesis technique by concatenating unit phoneme. At that time, a major problem is that discontinuity is happened from connection part between unit phonemes, especially from connection part between unit phonemes recorded by different persons. To solve the problem, this paper uses clustered diphone, and proposes a spectral smoothing technique, not only using formant trajectory and distribution characteristic of spectrum but also reflecting human's acoustic characteristic. That is, the proposed technique performs unit phoneme clustering using distribution characteristic of spectrum at connection part between unit phonemes and decides a quantity and a scope for the smoothing by considering human's acoustic characteristic at the connection part of unit phonemes, and then performs the spectral smoothing using weights calculated along a time axes at the border of two diphones. The proposed technique removes the discontinuity and minimizes the distortion which can be occurred by spectrum smoothing. For the purpose of the performance evaluation, we test on five hundred diphones which are extracted from twenty sentences recorded by five persons, and show the experimental results.

Moving object segmentation and tracking using feature based motion flow (특징 기반 움직임 플로우를 이용한 이동 물체의 검출 및 추적)

  • 이규원;김학수;전준근;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.1998-2009
    • /
    • 1998
  • An effective algorithm for tracking rigid or non-rigid moving object(s) which segments local moving parts from image sequence in the presence of backgraound motion by camera movenment, predicts the direction of it, and tracks the object is proposed. It requires no camera calibration and no knowledge of the installed position of camera. In order to segment the moving object, feature points configuring the shape of moving object are firstly selected, feature flow field composed of motion vectors of the feature points is computed, and moving object(s) is (are) segmented by clustering the feature flow field in the multi-dimensional feature space. Also, we propose IRMAS, an efficient algorithm that finds the convex hull in order to cinstruct the shape of moving object(s) from clustered feature points. And, for the purpose of robjst tracking the objects whose movement characteristics bring about the abrupt change of moving trajectory, an improved order adaptive lattice structured linear predictor is used.

  • PDF

Feature-based Object Tracking using an Active Camera (능동카메라를 이용한 특징기반의 물체추적)

  • 정영기;호요성
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.3
    • /
    • pp.694-701
    • /
    • 2004
  • In this paper, we proposed a feature-based tracking system that traces moving objects with a pan-tilt camera after separating the global motion of an active camera and the local motion of moving objects. The tracking system traces only the local motion of the comer features in the foreground objects by finding the block motions between two consecutive frames using a block-based motion estimation and eliminating the global motion from the block motions. For the robust estimation of the camera motion using only the background motion, we suggest a dominant motion extraction to classify the background motions from the block motions. We also propose an efficient clustering algorithm based on the attributes of motion trajectories of corner features to remove the motions of noise objects from the separated local motion. The proposed tracking system has demonstrated good performance for several test video sequences.

An Algorithm of Identifying Roaming Pedestrians' Trajectories using LiDAR Sensor (LiDAR 센서를 활용한 배회 동선 검출 알고리즘 개발)

  • Jeong, Eunbi;You, So-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.16 no.6
    • /
    • pp.1-15
    • /
    • 2017
  • Recently terrorism targets unspecified masses and causes massive destruction, which is so-called Super Terrorism. Many countries have tried hard to protect their citizens with various preparation and safety net. With inexpensive and advanced technologies of sensors, the surveillance systems have been paid attention, but few studies associated with the classification of the pedestrians' trajectories and the difference among themselves have attempted. Therefore, we collected individual trajectories at Samseoung Station using an analytical solution (system) of pedestrian trajectory by LiDAR sensor. Based on the collected trajectory data, a comprehensive framework of classifying the types of pedestrians' trajectories has been developed with data normalization and "trajectory association rule-based algorithm." As a result, trajectories with low similarity within the very same cluster is possibly detected.

Motion Simplification using Joint Posture Clustering (JPC) (관절 자세 군집화(JPC)를 활용한 모션 단순화 기법)

  • Ahn, Jung-Hyun;Wohn, Kwang-Yun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.10 no.2
    • /
    • pp.42-50
    • /
    • 2004
  • 캐릭터 애니메이션 기술의 발달로 가상공간에 애니메이트되는 캐릭터의 수가 점점 증가되고 있으며, 캐릭터 자체 골격구조의 관절 개수와 캐릭터를 덮고 있는 메쉬의 폴리곤 개수도 점점 증가하는 추세이다. 따라서, 실시간 가상환경에서 다수의 캐릭터를 전처리 과정 없이 시뮬레이션할 경우 전체 군중시스템 성능의 저하가 예상된다. 본 논문에서는, 이러한 문제점을 해결하기 위해 모션 다단계(motion level-of-detail) 기법을 제시한다. 모션 단순화 기법은 캐릭터의 움직임을 제어하는 골격(관절)구조와 캐릭터의 형태를 시각적으로 표현하는 기하(메쉬)구조를 단순화 하는 방법으로 기존 동작과 단순화된 동작의 차이를 최소화 한다. 골격구조 단순화를 위한 JPC(joint posture clustering)방법은 특정 관절의 연속된 모션 시퀀스에서의 유사 자세 집단을 추출하여 하나의 자세로 표현하는 방법으로, 모션의 특성에 따라 동적으로 관절을 단순화하여 관절 시뮬레이션 시간을 줄이는 방법이다. JPC방법은 골격구조가 시간에 따라 동적으로 변형되기 때문에 골격구조의 계층구조를 재 구축할 시간이 필요하지만, 기존 동작과 유사성을 잃지 않는 단순화된 동작 생성이 가능하다. 유사 자세 집단을 추출하기 위해 전체 모션 시퀀스에서 관절의 프레임간 자세 차이를 수식화하여 테이블 형태로 구성하고 이를 통해 기존 동작의 유사성을 잃지 않으며 관절의 단순화 율을 최대화 할 수 있는 알고리즘을 제시한다. 또한, 실시간 군중 환경의 성능을 더욱 향상시키기 위해 시간에 따라 변형되는 캐릭터 메쉬의 단순화 기법을 적용한다. 실험결과 모션 다단계 기법은 실시간 군중환경에서 캐릭터의 수가 많고 복잡한 골격구조와 기하구조로 구성된 관절 궤적의 변화가 심하지 않은 동작에 대해 특히 효율적이다.

  • PDF

Turbulent mixing of suspended sediments in the Kelvin-Helmholtz instability using Large-eddy Simulation (켈빈-헬름홀츠 불안정성 내에서의 부유사 혼합 거동 모사)

  • Ku, Hyeyun;Hwan, Jin Hwan
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2015.05a
    • /
    • pp.386-386
    • /
    • 2015
  • 담수가 해수에서 흘러드는 하구에서는 성층이 관측되며 이것은 난류의 미세구조를 변화시키는 주요 원인으로 작용한다. 이러한 성층화 현상은 하구 내 부유사의 군집인 하구 최대혼탁수(Estuarine Turbidity Maximum, ETM)의 형성에 영향을 주게 된다. 본 연구는 성층의 하구 최대 혼탁수 생성 메커니즘에 관심을 두고 수치모델링을 활용한 미세 난류의 부유사 거동 분석에 초점을 두었다. 성층과 전단응력 사이의 난류 혼합을 대표하는 유동인 켈빈-헬름홀츠 불안정성(Kelvin-Helmholtz Instability)을 도입하고 성층 경계면 근처에서 부유사의 이송을 높은 레이놀즈수(Reynolds number) 유동에서 RANS(Reynolds-averaged Navier-Stokes Simulation)보다 다양한 규모의 에너지 획득이 가능하여 미세 난류 구조 재현에 장점을 갖는 Large-eddy Simulation(LES)를 활용하여 모사하였다. 여기에서, 부유사는 주위 유동의 물리적 특성 변화에 영향을 미치지 않는 Passive scalar로 가정하였으며 $6^{th}$-order Lagrangian 다항식 보간법을 적용하여 입자의 이동 속도를 계산하고 이를 시간에 대해 적분함으로써 이동 궤적을 추적하였다. 수치 모델 결과 Lock-exchange 유동 내에서 켈빈-헬름홀츠 불안정성이 발생함에 따라 경계면 주위에 위치한 부유사가 billow 내에서 트랩핑(trapping)되는 것을 보여주어 KH-billow 혹은 braids 내의 미세 난류에 의한 영향이 확인되었다. 본 연구에서는 LES를 활용하여 성층류 및 성층류 내의 부유사 혼합을 모사하여 난류의 정도에 따른 이동 궤적의 차이에 대해서 분석함으로써 성층의 난류 강도 저하에 따른 부유사의 군집으로의 영향에 대해 서술한다.

  • PDF

An Exploratory Methodology for Longitudinal Data Analysis Using SOM Clustering (자기조직화지도 클러스터링을 이용한 종단자료의 탐색적 분석방법론)

  • Cho, Yeong Bin
    • Journal of Convergence for Information Technology
    • /
    • v.12 no.5
    • /
    • pp.100-106
    • /
    • 2022
  • A longitudinal study refers to a research method based on longitudinal data repeatedly measured on the same object. Most of the longitudinal analysis methods are suitable for prediction or inference, and are often not suitable for use in exploratory study. In this study, an exploratory method to analyze longitudinal data is presented, which is to find the longitudinal trajectory after determining the best number of clusters by clustering longitudinal data using self-organizing map technique. The proposed methodology was applied to the longitudinal data of the Employment Information Service, and a total of 2,610 samples were analyzed. As a result of applying the methodology to the actual data applied, time-series clustering results were obtained for each panel. This indicates that it is more effective to cluster longitudinal data in advance and perform multilevel longitudinal analysis.

Multidimensional Scaling Using the Pseudo-Points Based on Partition Method (분할법에 의한 가상점을 활용한 다차원척도법)

  • Shin, Sang Min;Kim, Eun-Seong;Choi, Yong-Seok
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.6
    • /
    • pp.1171-1180
    • /
    • 2015
  • Multidimensional scaling (MDS) is a graphical technique of multivariate analysis to display dissimilarities among individuals into low-dimensional space. We often have two kinds of MDS which are metric MDS and non-metric MDS. Metric MDS can be applied to quantitative data; however, we need additional information about variables because it only shows relationships among individuals. Gower (1992) proposed a method that can represent variable information using trajectories of the pseudo-points for quantitative variables on the metric MDS space. We will call his method a 'replacement method'. However, the trajectory can not be represented even though metric MDS can be applied to binary data when we apply his method to binary data. Therefore, we propose a method to represent information of binary variables using pseudo-points called a 'partition method'. The proposed method partitions pseudo-points, accounting both the rate of zeroes and ones. Our metric MDS using the proposed partition method can show the relationship between individuals and variables for binary data.