• 한국수자원학회논문집
• /
• 제42권4호
• /
• pp.331-341
• /
• 2009

본 연구에서는 generalized logistic(GL) 분포의 최우도 추정량(maximum likelihood estimate)에 대한 불확실성 추정을 위하여 사용되는 관측정보행렬(observed information matrix)과 Fisher 정보행렬(Fisher information matrix)의 정확도를 비교해 보고자 하였다. 타 분포형에 대한 기존의 연구결과에서 표본의 크기가 클 경우 매개변수 추정시 관측정보행렬이 동시에 추정되어 계산시간도 단축되고 Fisher 정보행렬의 정확도와도 차이도 거의 없어 관측정보행렬의 사용이 추천된 바 있으나, 최근 사용이 증가되고 있는 GL 분포에 대한 연구결과는 아직 전무한 실정이며 기존 연구문헌의 결과를 토대로 구체적인 연구 없이 관측정보행렬을 사용하고 있는 상황이다. 따라서 본 연구에서는 이를 위해 모의실험을 수행하였으며, 모의 결과 최우도법에 의한 매개변수의 분산 및 공분산은 기존의 연구 결과와 비슷한 결과를 보이나, quantile에 대한 불확실성 추정에는 관측정보행렬보다 Fisher 정보행렬의 사용이 더 적절할 것으로 판단되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권2호
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권10호
• /
• pp.3482-3497
• /
• 2021

Artificial intelligence has emerged as the core of the 4th industrial revolution, and large amounts of data processing, such as big data technology and rapid data analysis, are inevitable. The most fundamental and universal data interpretation technique is an analysis of information through regression, which is also the basis of machine learning. Ridge regression is a technique of regression that decreases sensitivity to unique or outlier information. The time-consuming calculation portion of the matrix computation, however, basically includes the introduction of an inverse matrix. As the size of the matrix expands, the matrix solution method becomes a major challenge. In this paper, a new algorithm is introduced to enhance the speed of ridge regression estimator calculation through series expansion and computation recycle without adopting an inverse matrix in the calculation process or other factorization methods. In addition, the performances of the proposed algorithm and the existing algorithm were compared according to the matrix size. Overall, excellent speed-up of the proposed algorithm with good accuracy was demonstrated.

• Journal of Communications and Networks
• /
• 제12권6호
• /
• pp.624-631
• /
• 2010

Effective traffic matrix estimation is the basis of efficient traffic engineering, and therefore, quality of service provision support in IP networks. In this study, traffic matrix estimation is investigated in IP networks and an Elman neural network-based traffic matrix inference (ENNTMI) method is proposed. In ENNTMI, the conventional Elman neural network is modified to capture the spatio-temporal correlations and the time-varying property, and certain side information is introduced to help estimate traffic matrix in a network accurately. The regular parameter is further introduced into the optimal equation. Thus, the highly ill-posed nature of traffic matrix estimation is overcome effectively and efficiently.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2015년도 제52차 하계학술대회논문집 23권2호
• /
• pp.107-108
• /
• 2015

본 논문에서는 조용히 해야 할 공간에서 사용할 수 있는 LED Matrix를 이용한 스마트 폰 알림 시스템에 대해 기술 하고자 한다. 스마트 폰 알림 시스템은 스마트 폰과 LED Matrix와 블루투스로 연결된 상태에서 평상시에는 날씨 패턴이나 온도패턴 등 LED Matrix에 표시되고, 스마트 폰에 전화가 왔을 시 LED Matrix가 전화패턴으로 바뀌면서 알려주게 되고 문자가 왔을 때 또한 문자패턴이 표시된다. 만약 전화나 문자 온 것을 인지 못 했을 시 왼쪽 위 끝에 LED로 부재중 표시가 된다. 또한, 실시간 패턴 그리기로 패턴을 사용자가 직접 만들 수도 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3348-3364
• /
• 2021

Magic matrix-based data hiding schemes are applied to transmit secret information through open communication channels safely. With the development of various magic matrices, some higher dimensional magic matrices are proposed for improving the security level. However, with the limitation of computing resource and the requirement of real time processing, these higher dimensional magic matrix-based methods are not advantageous. Hence, a kind of data hiding scheme based on a single or a group of multi-dimensional flexible magic matrices is proposed in this paper, whose magic matrix can be expanded to higher dimensional ones with less computing resource. Furthermore, an adaptive mechanism is proposed to reduce the embedding distortion. Adapting to the secret data, the magic matrix with least distortion is chosen to embed the data and a marker bit is exploited to record the choice. Experimental results confirm that the proposed scheme hides data with high security and a better visual quality.

• Journal of Ubiquitous Convergence Technology
• /
• 제2권1호
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5616-5630
• /
• 2019

Fully homomorphic encryption allows a third-party to perform arbitrary computation over encrypted data and is especially suitable for secure outsourced computation. This paper investigates secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption. Our work significantly improves the latest Mishra et al.'s work. We improve Mishra et al.'s matrix encoding method by introducing a column-order matrix encoding method which requires smaller parameter. This enables us to develop a binary multiplication method for multiple matrix multiplication, which multiplies pairwise two adjacent matrices in the tree structure instead of Mishra et al.'s sequential matrix multiplication from left to right. The binary multiplication method results in a logarithmic-depth circuit, thus is much more efficient than the sequential matrix multiplication method with linear-depth circuit. Experimental results show that for the product of ten 32×32 (64×64) square matrices our method takes only several thousand seconds while Mishra et al.'s method will take about tens of thousands of years which is astonishingly impractical. In addition, we further generalize our result from square matrix to non-square matrix. Experimental results show that the binary multiplication method and the classical dynamic programming method have a similar performance for ten non-square matrices multiplication.

• Journal of the Korean Data and Information Science Society
• /
• 제22권4호
• /
• pp.727-733
• /
• 2011

주식수익률간의 상관행렬 분석을 통해 유의미한 정보를 추출 활용하는 것은 주식시장을 이해하는데 매우 중요하다. 최근 확률행렬이론을 이용 상관행렬을 분석하는 연구들이 많이 진행되어 왔는데, 본 논문에서는 단일 요인 모형을 확률행렬이론에 적용 한국주식시장에서 주식수익률간의 상관행렬에 관한 유의미한 정보를 추출하였다. 특히 단일 요인을 도입 상관행렬을 분석한 결과가 실제 데이터를 잘 설명함을 관찰하였고, 단일 요인 모형의 유용성을 확인하였다.

• Journal of the Korean Data and Information Science Society
• /
• 제14권4호
• /
• pp.1007-1012
• /
• 2003

A recursive procedure for finding the Cholesky root of the inverse of sample covariance matrix, leading to a direct solution for the inverse of a positive definite matrix, is developed using the likelihood equation for the maximum likelihood estimation of the Cholesky root under normality assumptions. An example of the Hilbert matrix is considered for an illustration of the procedure.