• Title/Summary/Keyword: Real-time Filtering

Search Result 430, Processing Time 0.03 seconds

Face Detection based on Matched Filtering with Mobile Device (모바일 기기를 이용한 정합필터 기반의 얼굴 검출)

  • Yeom, Seok-Won;Lee, Dong-Su
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.3
    • /
    • pp.76-79
    • /
    • 2014
  • Face recognition is very challenging because of the unexpected changes of pose, expression, and illumination. Facial detection in the mobile environments has additional difficulty since the computational resources are very limited. This paper discusses face detection based on frequency domain matched filtering in the mobile environments. Face detection is performed by a linear or phase-only matched filter and sequential verification stages. The candidate window regions are selected by a number of peaks of the matched filtering outputs. The sequential stages comprise a skin-color test and an edge mask filtering tests, which aim to remove false alarms among selected candidate windows. The algorithms are built with JAVA language on the mobile device operated by the Android platform. The simulation and experimental results show that real-time face detection can be performed successfully in the mobile environments.

Efficient Similarity Joins by Adaptive Prefix Filtering (맞춤 접두 필터링을 이용한 효율적인 유사도 조인)

  • Park, Jong Soo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.4
    • /
    • pp.267-272
    • /
    • 2013
  • As an important operation with many applications such as data cleaning and duplicate detection, the similarity join is a challenging issue, which finds all pairs of records whose similarities are above a given threshold in a dataset. We propose a new algorithm that uses the prefix filtering principle as strong constraints on generation of candidate pairs for fast similarity joins. The candidate pair is generated only when the current prefix token of a probing record shares one prefix token of an indexing record within the constrained prefix tokens by the principle. This generation method needs not to compute an upper bound of the overlap between two records, which results in reduction of execution time. Experimental results show that our algorithm significantly outperforms the previous prefix filtering-based algorithms on real datasets.

A Study on Quality Classification of Injection Molding Process by Kalman Filter (Kalman Filter를 이용한 사출성형 제품의 품질 분류에 대한 연구)

  • Shin, Bong Deug;Oh, Hyuk Jun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.12
    • /
    • pp.635-640
    • /
    • 2016
  • It is important factors for a production system to get a profitable result in quality and reliability process. For this reason, there's are various type of research papers in a certain type of data acquisition and application to reliability and quality of the level of M2M devices. In general, a classification problem of slightly different signal such as sensing data is difficult to do with classical statistical methods. There's required real-time and instantaneous calculation properties in machine process. Especially a type of injection molding machine which has a property to be decided in accordance with short-term cycle process needs a solution that can be done a certain type of decision like as good or bad quality immediately. This paper presents a simple application of Kalman Filtering by single sensing data to injection molding process in order to get a correct answer from the real time sensing data.

The Embodiment of the Real-Time Face Recognition System Using PCA-based LDA Mixture Algorithm (PCA 기반 LDA 혼합 알고리즘을 이용한 실시간 얼굴인식 시스템 구현)

  • 장혜경;오선문;강대성
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.4
    • /
    • pp.45-50
    • /
    • 2004
  • In this paper, we propose a new PCA-based LDA Mixture Algorithm(PLMA) for real-time face recognition system. This system greatly consists of the two parts: 1) face extraction part; 2) face recognition part. In the face extraction part we applied subtraction image, color filtering, eyes and mouth region detection, and normalization method, and in the face recognition part we used the method mixing PCA and LDA in extracted face candidate region images. The existing recognition system using only PCA showed low recognition rates, and it is hard in the recognition system using only LDA to apply LDA to the input images as it is when the number of image pixels ire small as compared with the training set. To overcome these shortcomings, we reduced dimension as we apply PCA to the normalized images, and apply LDA to the compressed images, therefore it is possible for us to do real-time recognition, and we are also capable of improving recognition rates. We have experimented using self-organized DAUface database to evaluate the performance of the proposed system. The experimental results show that the proposed method outperform PCA, LDA and ICA method within the framework of recognition accuracy.

Implementation of a Real-Time Spatio-Temporal Noise Reduction System (실시간 시공 노이즈 제거 시스템 구현)

  • Hong, Hye-Jeong;Kim, Hyun-Jin;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.74-80
    • /
    • 2008
  • Spatio-temporal filters are capable of reducing noise from moving pictures, which cannot be dealt with by spatial filters. However, the algorithm is too complicated to be realized as hardware. We implemented a real-time spatio-temporal noise reduction system, using at most three frames, based upon adaptive mean filter algorithm. Some factors which interfere with hardware implementation were modified. Noise estimated from the previous frame was used to filter the current frame so that filtering could be conducted in parallel with noise estimation. This speeds up the system thereby enabling real-time execution. The form of filtering windows was also modified to facilitate synchronization. The proposed structure was implemented on Virtex 4 XC4VLX60, occupying 66% of total slices with 80MHz of the maximum operation frequency.

Design and Implementation of Mobile RFID Middleware Modules for the Mobile Environments (모바일 환경을 위한 모바일 RFID 미들웨어 모듈 설계 및 구현)

  • Park, Byoung-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.9
    • /
    • pp.10-18
    • /
    • 2008
  • The most critical element in the real-time operation of RFID application programs that are suitable for the mobile environment is the RFID middleware, made exclusively for mobile handsets, which processes collected data on a real-time basis and sends only the useful information to the application client. In this paper, we intend to design and implement a mobile RFID middleware system that supports the mobile handset environment for real-time based processing of the necessary data in the mobile environment. The proposed mobile RFID middleware system includes a mobile reader interface that collects the tag data, a mobile filtering engine that processes the tag data into more meaningful data that is sent to the application interface, and finally the mobile application interface that supports the m-SOAP application access protocol for interfacing with existing mobile applications. The filtering speed of the newly-developed middleware engine was found to be suitable for the characteristics of mobile handsets.

Development of Vision Control Scheme of Extended Kalman filtering for Robot's Position Control (실시간 로봇 위치 제어를 위한 확장 칼만 필터링의 비젼 저어 기법 개발)

  • Jang, W.S.;Kim, K.S.;Park, S.I.;Kim, K.Y.
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.23 no.1
    • /
    • pp.21-29
    • /
    • 2003
  • It is very important to reduce the computational time in estimating the parameters of vision control algorithm for robot's position control in real time. Unfortunately, the batch estimation commonly used requires too murk computational time because it is iteration method. So, the batch estimation has difficulty for robot's position control in real time. On the other hand, the Extended Kalman Filtering(EKF) has many advantages to calculate the parameters of vision system in that it is a simple and efficient recursive procedures. Thus, this study is to develop the EKF algorithm for the robot's vision control in real time. The vision system model used in this study involves six parameters to account for the inner(orientation, focal length etc) and outer (the relative location between robot and camera) parameters of camera. Then, EKF has been first applied to estimate these parameters, and then with these estimated parameters, also to estimate the robot's joint angles used for robot's operation. finally, the practicality of vision control scheme based on the EKF has been experimentally verified by performing the robot's position control.

A Heuristic Outlier Filtering Algorithm for Generating Link Travel Time using Taxi GPS Probes in Urban Arterial (링크통행시간 생성을 위한 이상치 제거 알고리즘 개발)

  • Choi, Keechoo;Choi, Yoon-Hyuk
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.5D
    • /
    • pp.731-738
    • /
    • 2006
  • Facing congestion, people want to know traffic information about their routes, especially real-time link travel time (LTT). In this paper, as a sequel paper of the previous non-taxi based LTT generating study by Choi et al. (1998), taxi based GPS probes have been tried to produce LTT for urban arterials. Taxis in itself are good deployment mode of GPS probes although it by nature experiences boarding and alighting time noises which should be accounted. A heuristic real-time dynamic outlier filter algorithm for taxi GPS probe has been developed focusing on urban arterials. An actual traffic survey for dynamic link travel times has been conducted using license plate method for the test arterials of Seoul city transportation network. With the algorithm, it is estimated that 70% of outliers have been filtered and the relative error has been improved by 73.7%. The filtering algorithm developed here would be expected to be in use for other spatial sites with some calibration efforts. Some limitations and future research agenda have also been discussed.

Implementation of Real-Time Communication in CAN for a Humanoid Robot (CAN 기반 휴머노이드 로봇의 실시간 데이터 통신 구현)

  • Kwon Sun-Ku;Kim Byung-Yoon;Kim Jin-Hwan;Huh Uk-Youl
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.1
    • /
    • pp.24-30
    • /
    • 2006
  • The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. When the stuff bits are generated by bit-stuffing mechanism in the CAN network, it causes jitter including variations in response time and delay In order to eliminate this jitter, stuff bits must be controlled to minimize the response time and to reduce the variation of data transmission time. This paper proposes the method to reduce the stuff bits by restriction of available identifier and bit mask using exclusive OR operation. This da manipulation method are pretty useful to the real-time control strategy with respect to performance. However, the CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO(Inha Semvung Humanoid Robot).

Computational Complexity Comparison of Second-Order Volterrra Filtering Algorithms

  • Im, Sungin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.2E
    • /
    • pp.38-46
    • /
    • 1997
  • The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

  • PDF