• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.5
• /
• pp.3378-3384
• /
• 2015

The problem of fast search for raman spectrum has attracted much attention recently. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet codeword. To overcome this problem, The fast codeword search algorithm based on the mean pyramids of codewords is currently used in image coding applications. In this paper, we present three new methods for the fast algorithm to search for the closet codeword. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely codewords and save a great deal of computation time. The Experiment results show about 42.8-55.2% performance improvement for the 1DMPS+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.49-57
• /
• 2012

This paper presents a fast multiple-image-based deblurring method that decreases the computation loads in the image deblurring, enhancing the sharpness of the textures or edges of the restored images. First, two blurred images with some blurring artifacts and one noisy image including severe noises are consecutively captured under a relatively long and short exposures, respectively. To improve the processing speeds, the captured multiple images are downsampled at the ratio of two, and then a way of estimating the point spread function(PSF) based on the image or edge patches extracted from the whole images, is introduced. The method enables to effectively reduce the computation time taken in the PSF prediction. Next, the texture-enhanced image deblurring method of supplementing the ability of the texture representation degraded by the downsampling of the input images, is developed and then applied. Finally, to get the same image size as the original input images, an upsampling method of utilizing the sharp edges of the captured noisy image is applied. By using the proposed method, the processing times taken in the image deblurring, which is the main obstacle of its application to the digital cameras, can be shortened, while recovering the fine details of the textures or edge components.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.6
• /
• pp.22-31
• /
• 2000

In this paper, we propose a method for removing noise components in the feature extraction process for robust speech recognition. This method is based on blind separation using independent component analysis (ICA). Given two noisy speech recordings the algorithm linearly separates speech from the unwanted noise signal. To apply ICA as closely as possible to the feature level for recognition, a new spectral analysis is presented. It modifies the computation of band energies by previously averaging out fast Fourier transform (FFT) points in several divided ranges within one met-scaled band. The simple analysis using sample variances of band energies of speech and noise, and recognition experiments showed its noise robustness. For noisy speech signals recorded in real environments, the proposed method which applies ICA to the new spectral analysis improved the recognition performances to a considerable extent, and was particularly effective for low signal-to-noise ratios (SNRs). This method gives some insights into applying ICA to feature levels and appears useful for robust speech recognition.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.548-559
• /
• 2009

The cascade face detector learned by Adaboost algorithm, which was proposed by Viola and Jones, is state of the art face detector due to its great speed and accuracy. In spite of its great performance, it still suffers from false alarms, and more computation is required to reduce them. In this paper, we want to reduce false alarms with less computation using facial color. Using facial color information, proposed face detection model scans sub-window efficiently and adapts a fast face/non-face classifier at the first stage of cascade face detector. This makes face detection faster and reduces false alarms. For facial color filtering, we define a facial color membership function, and facial color filtering image is obtained using that. An integral image is calculated from facial color filtering image. Using this integral image, its density of subwindow could be obtained very fast. The proposed scanning method skips over sub-windows that do not contain possible faces based on this density. And the face/non-face classifier at the first stage of cascade detector rejects a non-face quickly. By experiment, we show that the proposed face detection model reduces false alarms and is faster than the original cascade face detector.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.141-148
• /
• 2011

Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.

• Journal of the Korean Institute of Gas
• /
• v.22 no.6
• /
• pp.136-143
• /
• 2018

Cellular automata have been applied to simulations in many fields such as astrophysics, social phenomena, fire spread, and evacuation. Using cellular automata, this study develops a model for consequence analysis of the dispersion of hazardous chemicals, which is required for risk assessments of and emergency responses for frequent chemical accidents. Unlike in cases of detailed plant safety design, real-time accident responses require fast and iterative calculations to reduce the uncertainty of the distribution of damage within the affected area. EPA ALOHA and KORA of National Institute of Chemical Safety have been popular choices for these analyses. However, this study proposes an initiative to supplement the model and code continuously and is different in its development of free software, specialized for small and medium enterprises. Compared to the full-scale computational fluid dynamics (CFD), which requires large amounts of computation time, the relative accuracy loss is compromised, and the convenience of the general user is improved. Using Python open-source libraries as well as meteorological information linkage, it is made possible to expand and update the functions continuously. Users can easily obtain the results by simply inputting the layout of the plant and the materials used. Accuracy is verified against full-scale CFD simulations, and it will be distributed as open source software, supporting GPU-accelerated computing for fast computation.

• Journal of Advanced Navigation Technology
• /
• v.5 no.1
• /
• pp.1-10
• /
• 2001

Speech has a good characteristics of which car drivers busy to concern with miscellaneous operation can make use in convenient handling and manipulating of devices. By utilizing this, this works proposes a speaker verification method for protecting cars from being stolen and identifying a person trying to access critical on-line services. In this, continuant phonemes recognition which uses language information of speech and MLP(mult-layer perceptron) which has some advantages against previous stochastic methods are adopted. The recognition method, though, involves huge computation amount for learning, so it is somewhat difficult to adopt this in speaker verification application in which speakers should enroll themselves at real time. To relieve this problem, this works presents a solution that introduces speaker cohort models from speaker verification score normalization technique established before, dividing background speakers into small cohorts in advance. As a result, this enables computation burden to be reduced through classifying the enrolling speaker into one of those cohorts and going through enrollment for only that cohort.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.91-100
• /
• 2016

In FPGA-based real-time image warping systems, image caches are utilized for fast readout of image pixel data and reduction of memory access rate. However, a cache algorithm for a general computer system is not suitable for real-time performance because of time delays from cache misses and on-line computation complexity. In this paper, a simple image cache algorithm is presented for a FPGA-based real-time image warping system. Considering that pixel data access sequence is determined from the 2D coordinate transformation and repeated identically at every image frame, a cache load sequence is off-line programmed to guarantee no cache miss condition, and reduced on-line computation results in a simple cache controller. An overall system structure using a FPGA is presented, and experimental results are provided to show accuracy and validity of the proposed cache algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.261-269
• /
• 2014

There are many researches on fast exponentiation algorithm which is used to implement a public key cryptosystem such as RSA. On the other hand, the malicious attacker has tried various side-channel attacks to extract the secret key. In these attacks, an attacker uses the power consumption or electromagnetic radiation of cryptographic devices which is measured during computation of exponentiation algorithm. In this paper, we propose a novel simple power analysis attack on m-ary exponentiation implementation. The core idea of our attack on m-ary exponentiation with pre-computation process is that an attacker controls the input message to identify the power consumption patterns which are related with secret key. Furthermore, we implement the m-ary exponentiation on evaluation board and apply our simple power analysis attack to it. As a result, we verify that the secret key can be revealed in experimental environment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.1
• /
• pp.18-24
• /
• 2017

This paper is a part of developing a computer code that can be used to generate synthetic IR images by calculating the outgoing infrared signal from objects. To predict the reflected component that is a part of the outgoing IR signal, such as those components reflected from the target surface by the solar and sky irradiations, it is necessary to calculate the complicated BRDF values for considering the directional surface reflection characteristics. Since the calculation of reflectance using the BRDF requires a large amount of computation time due to the hemispherical integral term, it is frequently restricted in applying for a real-time prediction of IR signal. In this research, the simplified method for calculating IR reflected component has been proposed by replacing the integral terms into two parts, a directionally uniform component and a step function representing the specular component, to reduce computation time. The proposed method is proved to result in very fast calculation of the BRDF (up to 600 times faster calculations) for most of the surfaces with minimal loss of the accuracy.