• Title/Summary/Keyword: Condensation algorithm

Search Result 47, Processing Time 0.025 seconds

A Real-Time Face Detection/Tracking Methodology Using Haar-wavelets and Skin Color (Haar 웨이블릿 특징과 피부색 정보를 이용한 실시간 얼굴 검출 및 추적 방법)

  • Park Young-Kyung;Seo Hae-Jong;Min Kyoung-Won;Kim Joong-Kyu
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3 s.106
    • /
    • pp.283-294
    • /
    • 2006
  • In this paper, we propose a real-time face detection/tracking methodology with Haar wavelets and skin color. The proposed method boosts face detection and face tracking performance by combining skin color and Haar wavelets in an efficient way. The proposed method resolves the problem such as rotation and occlusion due to the characteristic of the condensation algorithm based on sampling despite it uses same features in both detection and tracking. In particular, it can be applied to a variety of applications such as face recognition and facial expression recognition which need an exact position and size of face since it not only keeps track of the position of a face, but also covers the size variation. Our test results show that our method performs well even in a complex background, a scene with varying face orientation and so on.

A STUDY ON A MULTI-LEVEL SUBSTRUCTURING METHOD FOR COMPUTATIONS OF FLUID FLOW (유동계산을 위한 다단계 부분 구조법에 대한 연구)

  • Kim J.W.
    • Journal of computational fluids engineering
    • /
    • v.10 no.2
    • /
    • pp.38-47
    • /
    • 2005
  • Substructuring methods are often used in finite element structural analyses. In this study a multi-level substructuring(MLSS) algorithm is developed and proposed as a possible candidate for finite element fluid solvers. The present algorithm consists of four stages such as a gathering, a condensing, a solving and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At the highest level, each sub-domain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each sub-domain has been replaced by a sequential static condensation of gathered element matrices. The global algebraic system arising from the assembly of each sub-domain matrices is solved using a well-known iterative solver such as the conjugare gradient(CG) or the conjugate gradient squared(CGS) method. A time comparison with CG has been performed on a 2-D Poisson problem. With one domain the computing time by MLSS is comparable with that by CG up to about 260,000 d.o.f. For 263,169 d.o.f using 8 x 8 sub-domains, the time by MLSS is reduced to a value less than $30\%$ of that by CG. The lid-driven cavity problem has been solved for Re = 3200 using the element interpolation degree(Deg.) up to cubic. in this case, preconditioning techniques usually accompanied by iterative solvers are not needed. Finite element formulation for the incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et al.[9].

Directional Particle Filter Using Online Threshold Adaptation for Vehicle Tracking

  • Yildirim, Mustafa Eren;Salman, Yucel Batu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.710-726
    • /
    • 2018
  • This paper presents an extended particle filter to increase the accuracy and decrease the computation load of vehicle tracking. Particle filter has been the subject of extensive interest in video-based tracking which is capable of solving nonlinear and non-Gaussian problems. However, there still exist problems such as preventing unnecessary particle consumption, reducing the computational burden, and increasing the accuracy. We aim to increase the accuracy without an increase in computation load. In proposed method, we calculate the direction angle of the target vehicle. The angular difference between the direction of the target vehicle and each particle of the particle filter is observed. Particles are filtered and weighted, based on their angular difference. Particles with angular difference greater than a threshold is eliminated and the remaining are stored with greater weights in order to increase their probability for state estimation. Threshold value is very critical for performance. Thus, instead of having a constant threshold value, proposed algorithm updates it online. The first advantage of our algorithm is that it prevents the system from failures caused by insufficient amount of particles. Second advantage is to reduce the risk of using unnecessary number of particles in tracking which causes computation load. Proposed algorithm is compared against camshift, direction-based particle filter and condensation algorithms. Results show that the proposed algorithm outperforms the other methods in terms of accuracy, tracking duration and particle consumption.

SIMMER extension for multigroup energy structure search using genetic algorithm with different fitness functions

  • Massone, Mattia;Gabrielli, Fabrizio;Rineiski, Andrei
    • Nuclear Engineering and Technology
    • /
    • v.49 no.6
    • /
    • pp.1250-1258
    • /
    • 2017
  • The multigroup transport theory is the basis for many neutronics modules. A significant point of the cross-section (XS) generation procedure is the choice of the energy groups' boundaries in the XS libraries, which must be carefully selected as an unsuitable energy meshing can easily lead to inaccurate results. This decision can require considerable effort and is particularly difficult for the common user, especially if not well-versed in reactor physics. This work investigates a genetic algorithm-based tool which selects an appropriate XS energy structure (ES) specific for the considered problem, to be used for the condensation of a fine multigroup library. The procedure is accelerated by results storage and fitness calculation speedup and can be easily parallelized. The extension is applied to the coupled code SIMMER and tested on the European Sustainable Nuclear Industrial Initiative (ESNII+) Advanced Sodium Technological Reactor for Industrial Demonstration (ASTRID)-like reactor system with different fitness functions. The results show that, when the libraries are condensed based on the ESs suggested by the algorithm, the code actually returns the correct multiplication factor, in both reference and voided conditions. The computational effort reduction obtained by using the condensed library rather than the fine one is assessed and is much higher than the time required for the ES search.

A Study on LIFS Image Coding via Gram-Schmidt Orthogonalization - Fast Coding Algorithm - (Gram-Schmidt 직교화를 이용한 LIFS 영상 부호화법에 관한 연구 -부호화 고속 알고리즘-)

  • 유현배
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.2
    • /
    • pp.96-101
    • /
    • 2003
  • Recently, Fractal Image Coding has been studied as a way of efficient data compressing scheme. In the beginning, Fractal Image Coding has been studied for the data compressing in black & white images and linear images. A. E. Jacquin suggested LIFS which expends to Fractal Image Coding for a gray scale image. Currently, YTKT's LIFS scheme which is using Gram-Schmidt is so efficient that enough to compete with the JPEG which is the national standards. This paper investigates the way of greatly reduced calculation for the orthogonalization algorithm.

  • PDF

Color Landmark Based Self-Localization for Indoor Mobile Robots (이동 로봇을 위한 컬러 표식 기반 자기 위치 추정 기법)

  • Yoon, Kuk-Jin;Jang, Gi-Jeong;Kim, Sung-Ho;Kweon, In-So
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.9
    • /
    • pp.749-757
    • /
    • 2001
  • We present a simple artificial landmark model and robust landmark tracking algorithm for mobile robot localization. The landmark model, consisting of symmetric and repetitive color patches, produces color histograms that are invariant under the geometric and photometric distortions. A stochastic approach based on the CONDENSATION tracks the landmark model robustly even under the varying illumination conditions. After the landmark detection, relative position of the mobile robot to the landmark is calculated. Experimental results show that the proposed landmark model is effective and can be detected and tracked in a clustered scene robustly. With the tracked single landmark, we extract geometrical information than achieve accurate localization.

  • PDF

An Realtime People Tracking Algorithm using Particle Filter (파티클 필터를 이용한 실시간 인물추적 알고리즘 구현)

  • Park, Jung-Hoon;Park, Jin-Bae;Yoon, Tae-Sung
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2768-2770
    • /
    • 2005
  • 컴퓨터 비젼은 지난 30년간 빠른 속도로 발전해왔다. 1970년대 초에는 인공지능분야가 굉장히 다양하게 연구되었는데, 그중 Condensation 알고리즘으로 알려진 블레이크 교수의 연구를 시작으로 많은 연구자들이 이 알고리즘을 연구하기 시작했다. 초기 단계에서 이 알고리즘은 파티클 필터라고 알려져 있고, 근래 신호처리 분야에서 두각을 나타내고 있다 하지만 파티클 필터는 내부적인 계산과정 때문에 FrameGrabber가 필요하게 되어 하드웨어 없이는 실시간 처리가 힘들고, 1분에 30프레임의 동영상 규격보다 훨씬 더 많은 50프레임을 사용하고 있다. 이에 본 논문에서는 동영상처리기법에 있어서 DirectX 기반의 제안된 프레임 컨트롤이라는 기법을 사용하여, 변화하는 동영상에 능동적으로 반응하는 하드웨어 없는 프레임 레이트(Framerate) 컨트롤 엔진을 사용하여, 실시간 인물 추적 알고리즘을 구현하려 한다.

  • PDF

Visual Object Tracking based on Real-time Particle Filters

  • Lee, Dong- Hun;Jo, Yong-Gun;Kang, Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1524-1529
    • /
    • 2005
  • Particle filter is a kind of conditional density propagation model. Its similar characteristics to both selection and mutation operator of evolutionary strategy (ES) due to its Bayesian inference rule structure, shows better performance than any other tracking algorithms. When a new object is entering the region of interest, particle filter sets which have been swarming around the existing objects have to move and track the new one instantaneously. Moreover, there is another problem that it could not track multiple objects well if they were moving away from each other after having been overlapped. To resolve reinitialization problem, we use competitive-AVQ algorithm of neural network. And we regard interfarme difference (IFD) of background images as potential field and give priority to the particles according to this IFD to track multiple objects independently. In this paper, we showed that the possibility of real-time object tracking as intelligent interfaces by simulating the deformable contour particle filters.

  • PDF

Numerical Analysis on HVAC Characteristics of Mugunghwa Passenger Car (무궁화 객차 HVAC 열유동 특성 해석)

  • 남성원
    • Proceedings of the KSR Conference
    • /
    • 2000.11a
    • /
    • pp.514-520
    • /
    • 2000
  • Numerical simulation is conducted to clarify the heat transfer and fluid flow characteristics of HVAC(Heating, Ventilating and Air-Conditioning) for Mugunghwa passenger car. The HVAC system is installed under the floor of carbody. This new HVAC system has a lot of merits in respect of the center of gravity of carbody, flow induced noise and reduction of condensation water etc. The standard k-epsilon turbulent model and SIMPLEC algorithm based on finite volume method are used to solve the physical HVAC model. To assure convergence, QUICK scheme for momentum equation and the first order upwind scheme for turbulent equations are used. From the results of simulation, the temperature and velocity magnitude are also distributed uniformly in the interior of car.

  • PDF

Structural Design Optimization using Distributed Structural Analysis (분산구조해석을 이용한 구조설계최적화)

  • 박종희;정진덕;전한규;황진하
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.10a
    • /
    • pp.124-132
    • /
    • 2000
  • Distributed processing approach for structural optimization is presented in this study. It is implemented on network of personal computers. The validity and efficiency of this approach are demonstrated and verified by test model of truss. Repeated structural analysis algorithm, which spend a lot of overall structural optimization processes, are based on substructuring scheme with domain-wise parallelism and converted to be adapted to hardware and software environments. The design information data are modularized and assigned to each computer in order to minize the communication cost. The communications between nodes are limited to static condensation and constraint-related data collection.

  • PDF