• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1689-1698
• /
• 1998

In this paper, we present a new method for estimating the parameters of transient-type signal in additive white Gaussian noise. This method makes use of the truncated singular value decomposition of an extended-order auto-correlation-like matrix based on the linear-prediction model. The method is tested on data consisting of two exponentially dampled sinusoidal signals with the same damping factor and different damping factor. Simulation results are illustrated to demonstrate the better performance of the method applied to the auto-correlation-like matrix than that applied to the data matrix.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.340-346
• /
• 1996

In this paper, we propose a ne weighted backward covariance matrix method to enhance the resolution for direction-of-arrival(DOA) estimation. The proposed method (MEVM:modified eigenvector method) is an enhanced covariance matrix method which is an extended form of the conventional covariance matrix. We analyze the effect of using the weighted forward-baskward covariance matrix on the performance of the eigenvector method(EVM). By comparing the perturbation angle of the noise-subspace, we show that the spectral estimate obtained using the proposed method is less distorted than the spectral estimate obtained using the conventional EVM. The simulation results show that the new method is more accurate and has better resolution than the conventional EVM under the same noise conditions.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.133-136
• /
• 2004

We are going to procedure various view from two frontal image using trifocal tensor. We found that warping is effective to produce synthesized poses of a face with the small number of mesh point of a given image in previous research[1]. For this research, fundamental matrix is important to calculate trifocal tensor. So, in this paper, we investigate two existing algorithms: Hartley's[2] and Kanatani's[3]. As an experimental result, Kenichi Kantani's algorithm has better performance of fundamental matrix than Harley's algorithm. Then we use the fundamental matrix of Kenichi Kantani's algorithm to calculate trifocal tensor. From trifocal tensor we calculate new trifocal tensor with rotation input and translation input and we use warping to produce new virtual views.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.6
• /
• pp.1593-1600
• /
• 2015

A control chart is very useful in monitoring various production process. There are many situations in which the simultaneous control of two or more related quality variables is necessary. We construct bivariate Shewhart control charts based on the trace of the product of the estimated variance-covariance matrix and the inverse of the in-control matrix and investigate the properties of bivariate Shewart control charts with VSI procedure for monitoring covariance matrix in term of ATS (Average time to signal) and ANSW (Average number of switch) and probability of switch, ASI (Average sampling interval). Numerical results show that ATS is smaller than ARL. From examining the properties of switching in changing covariances and variances in ${\Sigma}$, ANSW values show that it does not switch frequently and does not matter to use VSI procedure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.226-230
• /
• 2002

This paper proposes a method of improvement of accuracy of projective transformation matrix for Image Mosaicing. Using shift theorem, we extracted global translation components between images and using translation components, we found matching points between images so we solve general matching point problem we extracted highly trusted matching point using RANSAC algorithm. we normalized matching point coordinates and improved accuracy of projective transformation matrix.

• Annual Conference of KIPS
• /
• 2013.11a
• /
• pp.768-770
• /
• 2013

We propose a symmetric key based cryptography algorithm to encode and decode the text data with limited length using 3-dimensional magic square matrix. To encode the plain text message, input text will be translated into an index of the number stored in the key matrix. Then, Caesar's shift with pre-defined constant value is fabricated to finalize an encryption algorithm. In decode process, Caesar's shift is applied first, and the generated key matrix is used with 2D magic squares to replace the index numbers in ciphertext to restore an original text.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.3
• /
• pp.558-575
• /
• 2013

The purpose of a data leakage prevention system is to protect corporate information assets. The system monitors the packet exchanges between internal systems and the Internet, filters packets according to the data security policy defined by each company, or discretionarily deletes important data included in packets in order to prevent leakage of corporate information. However, the problem arises that the system may monitor employees' personal information, thus allowing their privacy to be violated. Therefore, it is necessary to find not only a solution for detecting leakage of significant information, but also a way to minimize the leakage of internal users' personal information. In this paper, we propose two models for representing the level of personal information disclosure during data leakage detection. One model measures only the disclosure frequencies of keywords that are defined as personal data. These frequencies are used to indicate the privacy violation level. The other model represents the context of privacy violation using a private data matrix. Each row of the matrix represents the disclosure counts for personal data keywords in a given time period, and each column represents the disclosure count of a certain keyword during the entire observation interval. Using the suggested matrix model, we can represent an abstracted context of the privacy violation situation. Experiments on the privacy violation situation to demonstrate the usability of the suggested models are also presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.21 no.2
• /
• pp.44-55
• /
• 2018

The importance of establishing a greenhouse gas inventory is emerging for policymaking and its implementation to cope with climate change. Thus, it is needed to establish Approach 3 level Land Use, Land-Use Change and Forestry (LULUCF) matrix that is spatially explicit regarding land use classifications and changes. In this study, four types of spatial information suitable for establishing the LULUCF matrix were analyzed - Cadastral Map, Land Cover Map, Forest Map, and Biotope Map. This research analyzed the classification properties of each type of spatial information and compared the quantitative and qualitative characteristics of the maps in Boryeong city. Drawn from the conclusions of the quantitative comparison, the forest area showed the maximum difference of 50.42% ($303.79km^2$) in the forest map and 46.09%($276.65km^2$) in the cadastral map. The qualitative comparison drew five qualitative characteristics: data construction scope difference, data construction purpose difference, classification standard difference, and classification item difference. As a result of the study, it was evident that the biotope map was the most appropriate spatial information for the establishment of the LULUCF matrix. In addition, if the LULUCF matrix is made by integrating the biotope, the forest map, and the land cover map, the limitations of each spatial information would be improved. The accuracy of the LULUCF matrix is expected to be improved when the map of the level-3 land cover map and the biotope map of 1:5,000 covering the whole country are completed.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1145-1148
• /
• 2003

We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.