• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.034 seconds

Analysis on Optimal Threshold Value for Infrared Video Flame Detection (적외선 영상의 화염 검출을 위한 최적 문턱치 분석)

  • Jeong, Soo-Young;Kim, Won-Ho
    • Journal of Satellite, Information and Communications
    • /
    • v.8 no.4
    • /
    • pp.100-104
    • /
    • 2013
  • In this paper, we present an optimal threshold setting method for flame detection of infrared thermal image. Conventional infrared flame detection methods used fixed intensity threshold to segment candidate flame regions and further processing is performed to decide correct flame detection. So flame region segmentation step using the threshold is important processing for fire detection algorithm. The threshold should be change in input image depends on camera types and operation conditions. We have analyzed the conventional thresholds composed of fixed-intensity, average, standard deviation, maximum value. Finally, we extracted that the optimal threshold value is more than summation of average and standard deviation, and less than maximum value. it will be enhance flame detection rate than conventional fixed-threshold method.

Multiple Objection and Tracking based on Morphological Region Merging from Real-time Video Sequences (실시간 비디오 시퀀스로부터 형태학적 영역 병합에 기반 한 다중 객체 검출 및 추적)

  • Park Jong-Hyun;Baek Seung-Cheol;Toan Nguyen Dinh;Lee Guee-Sang
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.2
    • /
    • pp.40-50
    • /
    • 2007
  • In this paper, we propose an efficient method for detecting and tracking multiple moving objects based on morphological region merging from real-time video sequences. The proposed approach consists of adaptive threshold extraction, morphological region merging and detecting and tracking of objects. Firstly, input frame is separated into moving regions and static regions using the difference of images between two consecutive frames. Secondly, objects are segmented with a reference background image and adaptive threshold values, then, the segmentation result is refined by morphological region merge algorithm. Lastly, each object segmented in a previous step is assigned a consistent identification over time, based on its spatio-temporal information. The experimental results show that a proposed method is efficient and useful in terms of real-time multiple objects detecting and tracking.

3D View Controlling by Using Eye Gaze Tracking in First Person Shooting Game (1 인칭 슈팅 게임에서 눈동자 시선 추적에 의한 3차원 화면 조정)

  • Lee, Eui-Chul;Cho, Yong-Joo;Park, Kang-Ryoung
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.10
    • /
    • pp.1293-1305
    • /
    • 2005
  • In this paper, we propose the method of manipulating the gaze direction of 3D FPS game's character by using eye gaze detection from the successive images captured by USB camera, which is attached beneath HMD. The proposed method is composed of 3 parts. In the first fart, we detect user's pupil center by real-time image processing algorithm from the successive input images. In the second part of calibration, the geometric relationship is determined between the monitor gazing position and the detected eye position gazing at the monitor position. In the last fart, the final gaze position on the HMB monitor is tracked and the 3D view in game is control]ed by the gaze position based on the calibration information. Experimental results show that our method can be used for the handicapped game player who cannot use his (or her) hand. Also, it can increase the interest and immersion by synchronizing the gaze direction of game player and that of game character.

  • PDF

GIS-Based Design Flood Estimation of Ungauged Watershed (논문 - GIS기반의 미계측 유역 설계홍수량 산정)

  • Hong, Seong-Min;Jung, In-Kyun;Park, Jong-Yoon;Lee, Mi-Seon;Kim, Seong-Joon
    • KCID journal
    • /
    • v.18 no.2
    • /
    • pp.87-100
    • /
    • 2011
  • This study is to delineate the watershed hydrological parameters such as area, slope, rain gauge weight, NRCS-CN and time of concentration (Tc) by using the Geographic Information Sytem (GIS) technique, and estimation of design flood for an ungauged watershed. Especially, we attempted to determine the Tc of ungauged watershed and develop simple program using the cell-based algorithm to calculates upstream or downstream flow time along a flow path for each cell. For a $19km^2$ watershed of tributary of Nakdong river (Seupmoon), the parameters including flow direction, flow accumulation, watershed boundary, stream network and Tc map were extracted from 30m Agreeburn DEM (Digital Elevation Model) and landcover map. And NRCS-CN was extracted from 30m landcover map and soil map. Design rainfall estimation for two rainfall gauge which are Sunsan and Jangcheon using FARD2006 that developed by National Institute for Disaster Prevention (NIDP). Using the parameters as input data of HEC-l model, the design flood was estimated by applying Clark unit hydrograph method. The results showed that the design flood of 50 year frequency of this study was $8m^3/sec$ less than that of the previous fundamental plan in 1994. The value difference came from the different application of watershed parameter, different rainfall distribution (Huff quartile vs. Mononobe) and critical durations. We could infer that the GIS-based parameter preparation is more reasonable than the previous hand-made extraction of watershed parameters.

  • PDF

Mobile Gesture Recognition using Dynamic Time Warping with Localized Template (지역화된 템플릿기반 동적 시간정합을 이용한 모바일 제스처인식)

  • Choe, Bong-Whan;Min, Jun-Ki;Jo, Seong-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.482-486
    • /
    • 2010
  • Recently, gesture recognition methods based on dynamic time warping (DTW) have been actively investigated as more mobile devices have equipped the accelerometer. DTW has no additional training step since it uses given samples as the matching templates. However, it is difficult to apply the DTW on mobile environments because of its computational complexity of matching step where the input pattern has to be compared with every templates. In order to address the problem, this paper proposes a gesture recognition method based on DTW that uses localized subset of templates. Here, the k-means clustering algorithm is used to divide each class into subclasses in which the most centered sample in each subclass is employed as the localized template. It increases the recognition speed by reducing the number of matches while it minimizes the errors by preserving the diversities of the training patterns. Experimental results showed that the proposed method was about five times faster than the DTW with all training samples, and more stable than the randomly selected templates.

Speech Recognition of Korean Phonemes 'ㅅ', 'ㅈ', 'ㅊ' based on Volatility and Turning Points (변동성과 전환점에 기반한 한국어 음소 'ㅅ', 'ㅈ', 'ㅊ' 음성 인식)

  • Lee, Jae Won
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.11
    • /
    • pp.579-585
    • /
    • 2014
  • A phoneme is the minimal unit of speech, and it plays a very important role in speech recognition. This paper proposes a novel method that can be used to recognize 'ㅅ', 'ㅈ', and 'ㅊ' among Korean phonemes. The proposed method is based on a volatility indicator and a turning point indicator that are calculated for each constituting block of the input speech signal. The volatility indicator is the sum of the differences between the values of each two samples adjacent in a block, and the turning point indicator is the number of extremal points at which the direction of the increment or decrement of the values of the sample are inverted in a block. A phoneme recognition algorithm combines the two indicators to finally determine the positions at which the three target phonemes mentioned above are recognized by utilizing optimized thresholds related with those indicators. The experimental results show that the proposed method can markedly reduce the error rate of the existing methods both in terms of the false reject rate and the false accept rate.

A Study on the Highly Parallel Multiple-Valued Logic Circuit Design with DTG Properties (DTG의 性質을 갖는 高速竝列多値論理回路의 設計에 관한 硏究)

  • Na, Gi-Su;Shin, Boo-Sik;Choi, Jai-Sok;Park, Chun-Myoung;Kim, Heung-Soo
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.6
    • /
    • pp.27-36
    • /
    • 1999
  • This paper proposes algorithms that design the highly parallel multiple-valued logic circuit of DTG(Directed Tree Graph) to be represented by tree structure relationship between input and output of nodes. The conventional Nakajima's algorithms have some problems so that this paper introduce the concept of mathematical analysis based on tree structure to design optimized locally computable circuit. Using the proposed circuit design algorithms in this paper it is possible to design circuit in that DTG have any node number - not to design by Nakajima's algorithms. Also, making a comparison between the circuit design using Nakajim's algorithms and this paper's, we testify that proposed algorithms in this paper optimizes circuit design all case of DTG. Some examples are shown to demonstrate the usefulness of the circuit design algorithm.

  • PDF

Linear Scratch Detection and Removal Technique for Old Film Sequences Using Wavelet Shrinkage and Interpolation (고전 영화 복원을 위한 웨이블릿 계수축소와 보간법을 이용한 선형 스크래치 검출 및 제거 기술)

  • Kang, Won-Seok;Lee, Eun-Sung;Kim, Sang-Jin;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.5
    • /
    • pp.1-9
    • /
    • 2011
  • This paper presents a novel scratch detection and removal approach for old film images in wavelet-domain. Various scratch detection and removal algorithms have been proposed for past decades. However, accurate scratch detection and removal with a moderate amount of computing effort is still a problem because of trade off between the quality of the film and computational load. For overcoming this problem, we first decompose an input image using a 3-level wavelet transform, and then remove the scratch by shrinking wavelet coefficients using linear interpolation. Experimental results show that the proposed algorithm can efficiently detect and remove the scratch in damaged films, and also be incorporated into old film restoration systems.

Modal Analysis of the Vector Triggering Random Decrement Function (벡터 트리거조건에 의한 Random Decrement 함수의 모우드 해석)

  • 정범석;이외득
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.2
    • /
    • pp.209-218
    • /
    • 2002
  • The Vector Random Decrement technique has been developed as an efficient method for transforming ambient responses into free decays of linear structures. It is shown that the VRD functions nay contain as much information about the modes as the really measured free decay responses. In this paper, the theory of the VRD technique is extended by applying the concept of the mode shape ratio into the Ibrahim Time Domain modal parameter identification algorithm. The VRD function is not shifted in the correction procedures for constant time shifts of the proposed VRD technique. Thus, a number of points equal to the largest of the time shifts used in the vector triggering condition are not deleted. In the VRD functions, any influence of the input to the system is averaged out. The proposed technique is compared with the traditional VRD technique by assessment of the modal parameters. The applicability of the VRD technique has been justified through a simulation study and a study of the response of a laboratory beam model subject to ambient loads.

Low-power Structure for H.264 Deblocking Filter (H.264용 디블로킹 필터의 저전력 구조)

  • Jang Young-Beom;Oh Se-Man;Park Jin-Su;Han Kyu-Hoon;Kim Soo-Hong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.92-99
    • /
    • 2006
  • In this paper, a low-power deblocking filter structure for H.264 video coding algorithm is proposed. By sharing addition hardware for common filter coefficients, we have designed an efficient deblocking filter structure. Proposed deblocking filter utilizes MUX and DEMUX circuits for input data sharing and shows 44.2% reduction for add operation. In the HDL coding simulation and FPGA implementation, we achieved 19.5% and 19.4% gate count reduction, respectively, comparison with the conventional deblocking filter structure. Due to its efficient processing scheme, the proposed structure can be widely used in H.264 encoding and decoding SoC.