• Title/Summary/Keyword: Information matrix

Search Result 3,491, Processing Time 0.033 seconds

A NMF-Based Speech Enhancement Method Using a Prior Time Varying Information and Gain Function (시간 변화에 따른 사전 정보와 이득 함수를 적용한 NMF 기반 음성 향상 기법)

  • Kwon, Kisoo;Jin, Yu Gwang;Bae, Soo Hyun;Kim, Nam Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.6
    • /
    • pp.503-511
    • /
    • 2013
  • This paper presents a speech enhancement method using non-negative matrix factorization. In training phase, we can obtain each basis matrix from speech and specific noise database. After training phase, the noisy signal is separated from the speech and noise estimate using basis matrix in enhancement phase. In order to improve the performance, we model the change of encoding matrix from training phase to enhancement phase using independent Gaussian distribution models, and then use the constraint of the objective function almost same as that of the above Gaussian models. Also, we perform a smoothing operation to the encoding matrix by taking into account previous value. Last, we apply the Log-Spectral Amplitude type algorithm as gain function.

MDS code Creation Confirmation Algorithms in Permutation Layer of a Block Cipher (블록 암호에서 교환 계층의 MDS 코드 생성 확인 알고리즘)

  • 박창수;조경연
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1462-1470
    • /
    • 2003
  • According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

New Construction for Visual Cryptography Using the Cumulative Matrix (누적행렬을 이용한 ( k, n) 시각암호의 새로운 구성)

  • 김문수;박지환
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.6
    • /
    • pp.15-26
    • /
    • 2001
  • Visual cryptography is a simple method in which secret information can be directly decoded in human visual system without any cryptographic computations. When the secret image is scattered to n random shares(slides), this scheme has some week point such as pixel expansion and contrast degradation. Therefore, it is necessary to reduce the pixel expansion and improve the contrast in recovered image. In this paper, we propose a new construction method for (k, n) visual cryptography using the cumulative matrix. In case k is odd, we can construct the cumulative matrix perfectly. For even k, the contrast of special pair in decoded image can be achieved best by permitting multiple contract. The proposed method is more simple than that of S. Droste\`s in construction and the average contrast of decoded image is improved for the most part. Also, we show that the basis matrices depending on the cumulative matrix are able to be applied for the general access structure.

Delay-dependent Stabilization for Systems with Multiple Unknown Time-varying Delays

  • Wu, Min;He, Yong;She, Jin-Hua
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.6
    • /
    • pp.682-688
    • /
    • 2006
  • This paper deals with the delay-dependent and rate-independent stabilization of systems with multiple unknown time-varying delays and time-varying structured uncertainties. All the linear matrix inequalities based conditions are derived by employing free-weighting matrices to express the relationships between the terms in the Leibniz-Newton formula. The criteria do not require any tuning parameters. Numerical examples demonstrate the validity of the method.

α-SCALAR CURVATURE OF THE t-MANIFOLD

  • Cho, Bong-Sik;Jung, Sun-Young
    • Honam Mathematical Journal
    • /
    • v.33 no.4
    • /
    • pp.487-493
    • /
    • 2011
  • The Fisher information matrix plays a significant role in statistical inference in connection with estimation and properties of variance of estimators. In this paper, we define the parameter space of the t-manifold using its Fisher's matrix and characterize the t-manifold from the viewpoint of information geometry. The ${\alpha}$-scalar curvatures to the t-manifold are calculated.

Fuzzy Controller Design for Markovian Jump Nonlinear Systems

  • Dong, Jiuxiang;Yang, Guang-Hong
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.6
    • /
    • pp.712-717
    • /
    • 2007
  • This paper is concerned with the problem of state feedback control of continuous-time nonlinear Markovian jump systems, which are represented by Takagi-Sugeno fuzzy models. A new method for designing state feedback stabilizing controllers is presented in terms of solvability of a set of linear matrix inequalities (LMIs), and it is shown that the new design method provides better or at least the same results of the existing method in the literature. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.

Variable sampling interval control charts for variance-covariance matrix

  • Chang, Duk-Joon;Shin, Jae-Kyoung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.4
    • /
    • pp.741-747
    • /
    • 2009
  • Properties of multivariate Shewhart and EWMA (Exponentially Weighted Moving Average) control charts for monitoring variance-covariance matrix of quality variables are investigated. Performances of the proposed charts are evaluated for matched fixed sampling interval (FSI) and variable sampling interval (VSI) charts in terms of average time to signal (ATS) and average number of samples to signal (ANSS). Average number of swiches (ANSW) of the proposed VSI charts are also investigated.

  • PDF

A Study on Two-Dimensional Positioning Algorithms Based on GPS Pseudorange Technique

  • Ko, Kwang-Soob;Choi, Chang-Mook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.705-708
    • /
    • 2010
  • In the paper, we have studied on algorithms for two-dimensional positioning based on GPS pseudorange Technique. First, the linearized state equation was mathematically derived based on GPS pseudorange technique. Second, the geometry model with respect to triangles formed using unit-vectors were proposed for investigation of land-based radio positioning. Finally, the corresponding mathematical formulations for DOP values and covariance matrix were designed for two-dimensional positioning.

  • PDF

Properties of VSI CUSUM Chart for Monitoring Dispersion Matrix

  • Chang, Duk-Joon;Shin, Jae-Kyoung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.4
    • /
    • pp.1003-1010
    • /
    • 2004
  • Properties of the variable sampling interval(VSI) CUSUM chart for monitoring dispersion matrix of related quality characteristics are investigated. Performances of the proposed charts are evaluated for matched fixed sampling interval(FSI) and VSI charts in terms of average time to signal(ATS) and average number of samples to signal (ANSS). Average number of swiches(ANSW) of the proposed VSI Shewhart and CUSUM charts are also investigated.

  • PDF

IMAGE RESIZING IN AN ARBITRARY TRANSFORM DOMAIN

  • Oh, Hyung-Suk;Kim, Won-Ha
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.44-48
    • /
    • 2009
  • This paper develops a methodology for resizing image resolutions in an arbitrary block transform domain. To accomplish this, we represent the procedures resizing images in an arbitrary transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces the reliable performances without increasing the computational complexity, compared to conventional methods when applied to various transforms.

  • PDF