• Title/Summary/Keyword: Moving Sequence

Search Result 290, Processing Time 0.026 seconds

A Moving Camera Localization using Perspective Transform and Klt Tracking in Sequence Images (순차영상에서 투영변환과 KLT추적을 이용한 이동 카메라의 위치 및 방향 산출)

  • Jang, Hyo-Jong;Cha, Jeong-Hee;Kim, Gye-Young
    • The KIPS Transactions:PartB
    • /
    • v.14B no.3 s.113
    • /
    • pp.163-170
    • /
    • 2007
  • In autonomous navigation of a mobile vehicle or a mobile robot, localization calculated from recognizing its environment is most important factor. Generally, we can determine position and pose of a camera equipped mobile vehicle or mobile robot using INS and GPS but, in this case, we must use enough known ground landmark for accurate localization. hi contrast with homography method to calculate position and pose of a camera by only using the relation of two dimensional feature point between two frames, in this paper, we propose a method to calculate the position and the pose of a camera using relation between the location to predict through perspective transform of 3D feature points obtained by overlaying 3D model with previous frame using GPS and INS input and the location of corresponding feature point calculated using KLT tracking method in current frame. For the purpose of the performance evaluation, we use wireless-controlled vehicle mounted CCD camera, GPS and INS, and performed the test to calculate the location and the rotation angle of the camera with the video sequence stream obtained at 15Hz frame rate.

Compression of 3D color integral images using 2D referencing technique (2차원 참조 기법을 이용한 3D 컬러 집적 영상의 압축)

  • Kim, Jong-Ho;Yoo, Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2693-2700
    • /
    • 2009
  • This paper proposes an effective compression method to utilize the 3D integral image with large amount of data obtained by a lens array in various applications. The conventional compression methods for still images exhibit low performance in terms of coding efficiency and visual quality, since they cannot remove the correlation between elemental images. In the moving picture compression methods, 1D scanning techniques that produce a sequence of elemental images are not enough to remove the directional correlation between elemental images. The proposed method effectively sequences the elemental images from an integral image by the 2D referencing technique and compresses them using the multi-frame referencing of H.264/AVC. The proposed 2D referencing technique selects the optimal reference image according to vertical, horizontal, and diagonal correlation between elemental images. Experimental results show that compression with the sequence of elemental images presents better coding efficiency than that of still image compression. Moreover, the proposed 2D referencing technique is superior to the 1D scanning methods in terms of the objective performance and visual quality.

Fast Motion Estimation Technique using Revolved Diamond Search Pattern (회전하는 다이아몬드 패턴을 이용한 고속 움직임 추정 기법)

  • Oh, Changjouibull;Lee, Kang-Jun;Yang, Si-Young;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1C
    • /
    • pp.23-33
    • /
    • 2007
  • Video compression is essential technique for fast and efficient transmission of a large amount of video data maintaining high quality. Also, motion estimation and motion compensation is most important technique for efficient video compression. A proposed method is improved diamond search method which uses split diamond pattern and rotated diamond pattern. In particular, the proposed method shows superb result when it is used for the sequence with a direction of camera moving. Moreover when it is used for the sequence with little motion, complexity is reduced considerably by using fewer search points. Also, by varying the number of initial search points, the propose method can provide several options in terms of duality or speed. Simulation results shows that the proposed method sustains better visual quality compared with diamond search method and HEXBS even by using fewer search points. Besides, compared with existing methods, it is able to conduct a motion estimation more efficiently by changing the number of search points adaptively according to motion of video data.

A Relative for Finite Element Nonlinear Structural Analysis (상대절점좌표를 이용한 비선형 유한요소해석법)

  • Kang, Ki-Rang;Cho, Heui-Je;Bae, Dae-Sung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.788-791
    • /
    • 2005
  • Nodal displacements are referred to the Initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian formulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid fer structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacements and traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One closed loop structure undergoing large deformations is analyzed to demonstrate the efficiency and validity of the proposed method.

  • PDF

Video Image Mosaicing Technique Using 3 Dimensional Multi Base Lines (3차원 다중 기선을 사용만 비데오 영상 모자이크 기술)

  • 전재춘;서용철
    • Korean Journal of Remote Sensing
    • /
    • v.20 no.2
    • /
    • pp.125-137
    • /
    • 2004
  • In case of using image sequence taken from a moving camera along a road in an urban area, general video mosaicing technique based on a single baseline cannot create 2-D image mosaics. To solve the drawback, this paper proposed a new image mosaicing technique through 3-D multi-baselines that can create image mosaics in 3-D space. The core of the proposed method is that each image frame has a dependent baseline, an equation of first order, calculated by using ground control point (GCP) of optical flows. The proposed algorithm consists of 4 steps: calculation of optical flows using hierarchical strategy, calculation of camera exterior orientation, determination of multi-baselines, and seamless image mosaics. This paper realized and showed the proposed algorithm that can create efficient image mosaics in 3-D space from real image sequence.

Face and Hand Tracking using MAWUPC algorithm in Complex background (복잡한 배경에서 MAWUPC 알고리즘을 이용한 얼굴과 손의 추적)

  • Lee, Sang-Hwan;An, Sang-Cheol;Kim, Hyeong-Gon;Kim, Jae-Hui
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.39-49
    • /
    • 2002
  • This paper proposes the MAWUPC (Motion Adaptive Weighted Unmatched Pixel Count) algorithm to track multiple objects of similar color The MAWUPC algorithm has the new method that combines color and motion effectively. We apply the MAWUPC algorithm to face and hand tracking against complex background in an image sequence captured by using single camera. The MAWUPC algorithm is an improvement of previously proposed AWUPC (Adaptive weighted Unmatched Pixel Count) algorithm based on the concept of the Moving Color that combines effectively color and motion information. The proposed algorithm incorporates a color transform for enhancing a specific color, the UPC(Unmatched Pixel Count) operation for detecting motion, and the discrete Kalman filter for reflecting motion. The proposed algorithm has advantages in reducing the bad effect of occlusion among target objects and, at the same time, in rejecting static background objects that have a similar color to tracking objects's color. This paper shows the efficiency of the proposed MAWUPC algorithm by face and hands tracking experiments for several image sequences that have complex backgrounds, face-hand occlusion, and hands crossing.

Proposing a Connection Method for Measuring Differentiation of Tangent Vectors at Shape Manifold (형태 다양체에서 접벡터 변화량을 측정하기 위한 접속 방식 제안)

  • Hahn, Hee-Il
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.2
    • /
    • pp.160-168
    • /
    • 2013
  • In this paper an algorithm that represents shape sequences with moving frames parallel along the sequences are developed. According to Levi-Civita connection, it is not easy to measure the variation of the vector fields on non-Euclidean spaces without tools to parallel transport them. Thus, parallel transport of the vector fields along the shape sequences is implemented using the theories of principal frame bundle and analyzed via extensive simulation.

Classifying Alley Markets through Cluster Analysis Using Dynamic Time Warping and Analyzing Possibility of Opening New Stores

  • Kang, Hyun Mo;Lee, Sang-Kyeong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.5
    • /
    • pp.329-338
    • /
    • 2017
  • This study attempts to classify 1008 alley markets in Seoul through cluster analysis using Dynamic Time Warping, one of the methods used to analyze the similarity of time series, and evaluate the possibility of opening new stores. The sequence of the gross sales of an alley market and that of gross sales per store stand for the potential of growth and profitability of the market, respectively and are used as variables for cluster analysis. Five clusters are obtained for the gross sales and four clusters for the gross sales per store. These two types of clusters are again classified as rising and falling trends, respectively, and the combination of these trends produces four categories. These categories are used to evaluate the possibility of opening new stores in alley markets. The results show that the southeast which is relatively wealthy inferior to other regions in opening new stores. Alley markets in the northeast and the southwest are better than other regions such that opening a new store is justified. In the northwest, there are many markets with trend of gross sales and that of gross sales per store moving in opposite directions, and new store openings in these markets should be postponed.

Emotion Recognition by Hidden Markov Model at Driving Simulation (자동차 운행 시뮬레이션에서 Hidden Markov Model을 이용한 운전자 감성인식)

  • Park H.H.;Song S.H.;Ji Y.K.;Huh K.S.;Cho D.I.;Park J.H.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.1958-1962
    • /
    • 2005
  • A driver's emotion is a very important factor of safe driving. This paper classified a driver's emotion into 3 major emotions, can be occur when driving a car: Surprise, Joy, Tired. And It evaluated the classifier using Hidden Markov Models, which have observation sequence as bio-signals. It used the 2-D emotional plane to classfiy a human's general emotion state. The 2-D emotional plane has 2 axes of pleasure-displeasure and arsual-relaxztion. The used bio-signals are Galvanic Skin Response(GSR) and Heart Rate Variability(HRV), which are easy to acquire and reliable. We classified several moving pictures into 3 major emotions to evaluate our HMM system. As a result of driving simulations for each emotional situations, we can get recognition rates of 67% for surprise, 58% for joy and 52% for tired.

  • PDF

Quay Wall Scheduling of Ships Using Assignment Method and Tabu Search Algorithm (할당기법과 타부서치 알고리즘을 이용한 선박의 안벽배치 계획)

  • Lee, Sang Hyup;Hong, Soon Ik;Ha, Seung Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.1
    • /
    • pp.1-9
    • /
    • 2015
  • In shipbuling processes, a quay wall is a major resource for additional operations after an erection operation at dock. A quay wall is becoming a new bottleneck instead of docks, while ship types with long operation time at quay wall are increasing recently. We developed a quay wall scheduling algorithm for the quayside operations of ships in this paper. The objective function is to minimize the sum of not assigned days of ships which have to be assigned to any quay wall under limited numbers of quay walls. The scheduling algorithm is based on an assignment method to assign each ship to a quay wall among its alternative quay walls at the time of launching or moving to another quay wall. The scheduling algorithm is also using Tabu Search algorithm to optimize assignment sequence of ships. The experiment shows that the algorithms in this paper are effective to make schedule of the quayside operations of ships.