• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.632-634
• /
• 2004

First for high-qualify images and reducing process-error and driving speed, the designed 8-bit data driving circuit consists of a constant transconductance bias circuit, D-F/Fs by shift registers using static transmission gates, 1st latch and 2nd latch by tristate inverters, level shifters, current steering segmented D/A converters by 4MSB thermometer decoder and 4LSB weighted type. Second, we designed gray amp for power saving. These data driving circuits are designed with $0.35-{\mu}m$ CMOS technologies at 3.3 V and 18 V power supplies and simulated with HSPICE.

• 대한음성학회지:말소리
• /
• 제55권
• /
• pp.93-102
• /
• 2005

In this paper, sub-stream based eigenvoice method is proposed to overcome the weak points of conventional eigenvoice and dimensional eigenvoice. In the proposed method, sub-streams are automatically constructed by the statistical clustering analysis that uses the correlation information between dimensions. To obtain the reliable distance matrix from covariance matrix for dividing into optimal sub-streams, MAP adaptation technique is employed to the covariance matrix of training data and the sample covariance of adaptation data. According to our experiments, the proposed method shows $41\%$ error rate reduction when the number of adaptation data is 50.

• 대한치과의사협회지
• /
• 제54권11호
• /
• pp.850-864
• /
• 2016

The Generalized Estimating Equations (GEE) approach is a widely used statistical method for analyzing longitudinal data and clustered data in clinical studies. In dentistry, due to multiple outcomes obtained from one patient, the outcomes produced from an individual patient are correlated with one another. This study focused on the basic ideas of GEE and introduced the types of covariance matrix and working correlation matrix. The quasi-likelihood information criterion (QIC) and quasi-likelihood information criterion approximation ($QIC_u$) were used to select the best working correlation matrix and the best fitting model for the correlated outcomes. The purpose of this study is to show a detailed process for the GEE analysis using SPSS software along with an orthodontic miniscrew example, and to help understand how to use GEE analysis in dental research.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.63-66
• /
• 1998

In the implementation of the simplex method program, the representation and the maintenance of basis matrix is very important, In the experimental study, we investigates Suhl's idea in the LU factorization and LU update of basis matrix. First, the triangularization of basis matrix is implemented and its efficiency is shown. Second, various technique in the dynamic Markowitz's ordering and threshold pivoting are presented. Third, modified Forrest-Tomlin LU update method exploiting sparsity is presented. Fourth, as a storage scheme of LU factors, Gustavson data structure is explained. Fifth, efficient timing of reinversion is developed. Finally, we show that modified Forrest-Tomlin method with Gustavson data structure is superior more than 30% to the Reid method with linked list data structure.

• Journal of electromagnetic engineering and science
• /
• 제13권3호
• /
• pp.151-157
• /
• 2013

Marine radars are affected by sea and rain clutters, which can make target discrimination difficult. The clutter standard deviation and improvement factor are applied using multiple parameters-moving speed of radar, antenna speed, angle, etc. When a radar signal is processed, a Data Matrix Bank (DMB) filter can be applied to remove sea clutters. This filter allows detection of a target, and since it is not affected by changes in adjacent clutters resulting from a multi- target signal, sea state clutters can be removed. In this paper, we study the level for clutter removal and the method for target detection. In addition, we design a signal processing algorithm for marine radars, analyze the performance of the DMB filter algorithm, and provide a DMB filter algorithm design. We also perform a DMB filter algorithm analysis and simulation, and then apply this to the DMB filter and cell-average constant false alarm rate design to show comparative results.

• 대한수학회지
• /
• 제57권2호
• /
• pp.401-414
• /
• 2020

It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.

• 기술사
• /
• 제16권4호
• /
• pp.15-19
• /
• 1983

Therefore the use of Hadamard transform in the image processing requires only the real number operations and results in the computational advantages. Recently, however, certain degradation aspects have been reported. In this paper we propose a WH matrixtwhich retains the main properties of Hadamard matrix. The actual improvement of the image transmission in the inner part of the picture has been demonstrated by the computer simulated image developments. The orthogonal transforms such as Hadamard transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assignment of bits for each data must increase exponentially. Thus the SNR of the image tends to decline accordingly. As an attempt to increase the SNR, we propose the WH matrix whose elements are made of ${\pm}$1, ${\pm}$2, ${\pm}$3, ${\pm}$4, and the unitform is 8${\times}$8 matrix.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 춘계정기학술대회
• /
• pp.351-355
• /
• 2001

2차원 바코드는 2차원인 점자식 코드로서 낮은 공간점유, 높은 정보, 다양한 정보처리 기능이 가능한 차세대 라벨링 기법이다. 즉, 2차원(2D) 심볼로지는 양축(X 방향, Y 방향)으로 데이터를 배열시켜 평면화 시킨것으로서 기존의 일차원(1D) 바코드 심볼로지가 가지는 문제점인 데이터 표현의 제한성, 즉 선적용 패키지와 같은 로트 번호, 구매 주문 번호, 수취자, 수랑 기타 정보 등의 다양한 내용을 바코드로 표현하여 대상물에 부착하거나 동반시킴으로써 1750년대 중반에 등장하게 되었고, 현재 많은 부분에서 사용하고 있다. 본 논문에서는 현재 많이 쓰이는 2 차원 바코드 중 하나인 Data Matrix 의 구성과 디코딩 알고리즘을 제안한다. Data Matrix는 데이터를 효율적으로 나타내기 위하며 각 정보의 교환에 따라 다른 인코딩 방식을 사용하고 있다. 디코딩 알고리즘은 그에 따라서 구현되었다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2007년도 추계학술대회
• /
• pp.489-498
• /
• 2007

For better predictions and classifications in customer recommendation, this study proposes an integrative model that efficiently combines the currently-in-use statistical and artificial intelligence models. In particular, by integrating the models such as Association Rule, Frequency Matrix, and Rule Induction, this study suggests an integrative prediction model. The data set for the tests is collected from a convenience store G, which is the number one in its brand in S. Korea. This data set contains sales information on customer transactions from September 1, 2005 to December 7, 2005. About 1,000 transactions are selected for a specific item. Using this data set, it suggests an integrated model predicting whether a customer buys or not buys a specific product for target marketing strategy. The performance of integrated model is compared with that of other models. The results from the experiments show that the performance of integrated model is superior to that of all other models such as Association Rule, Frequency Matrix, and Rule Induction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3778-3793
• /
• 2019

Image steganography is one of the key types of steganography where a message to be sent is hidden inside the cover image. The most commonly used techniques for image steganography rely on LSB steganography. In this paper, a novel image steganography technique based on blocks matrix determinant method is proposed. Under this method, a cover image is divided into blocks of size $2{\times}2$ pixels and the determinant of each block is calculated. The comparison of the determinant values and corresponding data bits yields a delicate way for the embedment of data bits. The main aim of the proposed technique is to ensure concealment of secret data inside an image without affecting the cover image quality. When the proposed steganography method is compared with other existing LSB steganography methods, it is observed that it not only provides higher PSNR, lower MSE but also guarantees better quality of the stego image.