• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.180-184
• /
• 2009

The memory is very sensitive to the soft error because the integration of the memory increases under low power environment. Error correcting codes (ECCs) are commonly used to protect against the soft errors. This paper proposes a new genetic ECC design method which reduces power consumption. Power is minimized using the degrees of freedom in selecting the parity check matrix of the ECCs. Therefore, the genetic algorithm which has the novel genetic operators tailored for this formulation is employed to solve the non-linear power optimization problem. Experiments are performed with Hamming code and Hsiao code to illustrate the performance of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.60-67
• /
• 1990

This paper proposes a model-based fault detection method for linear/nonlinear system having modelling errors, nonlinearities and measurement noise. The system model is represented by the unified operator [5] in order to apply to both the continuous-time and discrete-time problems. The fault detection method suggested here accounts for the effects of noise, model mismatch and nonlinearities. Modelling errors are depicted by additive forms and the nominal model denominator is fixed via prior experiments in order to quantify the nucertainty bound on the parameter estima-tion. The least square method is used to estimate the numerator parameters of the nominal model. performance than traditional methods.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.17-26
• /
• 2008

This paper has for its object to propose AFOD(Adaptive First-Order Decimator) which sets a value of decimated element as an average of a value of neighbor intelligible component and a output value of FOD(First-Order Decimator) for the target pixel, and to analyze its performance in terms of subjective image quality and hardware complexity. In the proposed AFOD, a target pixel located at the center of sliding window is selected first, then the gradient amplitudes of its right neighbor pixel and its lower neighbor pixel are calculated using first order derivative operator respectively. Secondly, each gradient amplitude is divided by the summation result of two gradient amplitudes to generate each local intelligible weight. Next, a value of neighbor intelligible component is defined by adding a value of the right neighbor pixel times its local intelligible weight to a value of the lower neighbor pixel times its intelligible weight. Since the proposed method adaptively reflects neighbor intelligible informations of neighbor pixels on the decimated element according to each local intelligible weight, it can effectively suppress the blurring effect being the demerit of FOD. It also possesses the advantages that it can keep the merits of FOD with the good results on average but also lower computational cost.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.587-590
• /
• 2003

얼굴영역을 분할하기 위해서 Watershed Algorithm 와 Object Grouping 을 이용한 얼굴영역 분할기법을 제안한다. 영상분할에 단점은 단일 알고리즘으로 영역분할이 어렵고, 또한 복잡한 영상에서 정확한 영역을 분할하기가 어렵다는 것이다. 그래서 본 논문에서는 Watershed Segmentation 기법과 Grouping 작업을 통한 병합, 그리고 색상의 선형회귀분석을 이용한 분석법을 적용하여 분할하고자 한다. 얼굴영역 분할방법을 전처리 과정과 영역 병합 그리고 얼굴 부분을 추출하는 3 단계의 과정으로 나누고, 전처리 과정에서는 수리형태학적(Mophological) 연산자를 이용한 영상 분할기법을 이용하여 분할한 후 얼굴 후보 영역을 검출, 영역병합과정에서 기존의 학습데이터와의 유사도를 측정, 얼굴객체추출 조건에 맞지 않는 객체들을 모두 제거함으로써, 정확한 얼굴부분을 분할해 낸다. 실험결과 제안한 방법을 통해 비교적 정확한 얼굴영역을 분할 할 수 있었다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.6
• /
• pp.289-300
• /
• 2001

본 논문에서는 유한 필드 GF(2$_{m}$ ) 상에서 모듈러 곱셈 A($\chi$)B($\chi$) mod P($\chi$)을 수행하는 새로운 선형 문제-크기(full-size) 시스톨릭 어레이 구조인 LSB-first 곱셈기를 제안한다. 피연산자 B($\chi$)의 LSB(least significant bit)를 먼저 사용하는 LSB-first 모듈러 곱셈 알고리즘으로부터 새로운 비트별 순환 방정식을 구한다. 데이터의 흐름이 규칙적인 순환 방정식을 공간-시간 변환으로 새로운 시스톨릭 곱셈기를 설계하고 분석한다. 기존의 곱셈기와 비교할 때 제안한 곱셈기의 면적-시간 성능이 각각 10%와 18% 향상됨을 보여준다. 또한 같은 설계방법으로 곱셈과 제곱연산을 동시에 수행하는 새로운 시스톨릭 곱셈/제곱기를 제안한다. 유한 필드상의 지수연산을 위해서 제안한 시스톨릭 곱셈/제곱기를 사용할 때 곱셈기만을 사용 할 때보다 면적-시간 성능이 약 26% 향상됨을 보여준다.

• Journal of the Korean Vacuum Society
• /
• v.21 no.3
• /
• pp.171-177
• /
• 2012

The computer program (EPR-NMR program version 6.2) employed here sets up the spin Hamiltonian matrices and determines their eigenvalues using exact diagonalization. We study the electron spin resonance for $Mn^{2+}$ in ferroelectric $LiNbO_3$ single crystals. The self-energy is obtained using the projection operator method developed by Argyres and Sigel. The self-energy is calculated to be axially symmetric about the by the spin Hamiltonian. The line-widths decreased as the temperature increased; we assume that the hyperfine structure transition is a more dominant scattering than the other transitions. We conclude that the calculation process presented in this study is useful for quantum optical transitions.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.455-461
• /
• 2002

This paper presents a new parametric log line equation of polar form for Hough transform in log-polar plane, in which it can remove the well-known unboundedness problem of Hough parameters. Bolduc's method is used to generate a log-polar image dividing the fovea and periphery from a Cartesian image. Edges of the fovea and periphery are detected by using the Sobel mask and the proposed space-variant gradient mask, and are combined in the log-polar plane. The sampled points that might constitute a log line are quite sparse in a deep peripheral region due to severe under-sampling, which is an inherent property of LPM. To cope with such under-sampling, we determine the values of cumulative cells in Hough space by using the space-variant weighting. In our experiments, the proposed method demonstrates its validity of detecting not only the lines passing through both the fovea and periphery but also the lines in a deep periphery.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.194-200
• /
• 2013

In this paper, we propose a multi-scale crack detection method using scaling. It is based on morphology algorithm, crack features, and scaling. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use a scaling method. We use bilinear interpolation for scaling. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.139-145
• /
• 2006

Feature extraction technique in digital images has many applications such as robot vision, medical diagnostic system, and motion video transmission, etc. There are several methods for extracting features in digital images for example nonlinear gradient, nonlinear laplacian, and entropy convolutional filter. However, conventional convolutional filters are usually not efficient to extract features in an image because image feature formation in eyes is more sensitive to dark regions than to bright regions. A few nonlinear filters using difference between arithmetic mean and harmonic mean in a window for extracting sketch features are described in this paper They have some advantages, for example simple computation, dependence on local intensities and less sensitive to small intensity changes in very dark regions. Experimental results demonstrate more successful features extraction than other conventional filters over a wide variety of intensity variations.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1521-1530
• /
• 2004

In this paper, we present effective quantization noise reduction algorithm using signal adaptive filter and linear combination between blocks in multimedia system. In the proposed method, all of the blocks are classified into low frequency blocks, high frequency blocks, and midrange blocks according to DCT coefficients. Ringing artifacts are shown in high frequency blocks. So ringing artifact reduction algorithm is performed in high frequency blocks using a signal adaptive filter. And the blocking artifact reduction is performed by replacing the pixel value of blocky blocks using linear combination between blocky block and remote unblocky block. The simulation results shows better performance in respective of the subjective and objective image quality than the conventional method.