• 제목/요약/키워드: initial matrices

검색결과 89건 처리시간 0.029초

An Application of a Parallel Algorithm on an Image Recognition

  • Baik, Ran
    • Journal of Multimedia Information System
    • /
    • 제4권4호
    • /
    • pp.219-224
    • /
    • 2017
  • This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

Binary Sequence Family for Chaotic Compressed Sensing

  • Lu, Cunbo;Chen, Wengu;Xu, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4645-4664
    • /
    • 2019
  • It is significant to construct deterministic measurement matrices with easy hardware implementation, good sensing performance and good cryptographic property for practical compressed sensing (CS) applications. In this paper, a deterministic construction method of bipolar chaotic measurement matrices is presented based on binary sequence family (BSF) and Chebyshev chaotic sequence. The column vectors of these matrices are the sequences of BSF, where 1 is substituted with -1 and 0 is with 1. The proposed matrices, which exploit the pseudo-randomness of Chebyshev sequence, are sensitive to the initial state. The performance of proposed matrices is analyzed from the perspective of coherence. Theoretical analysis and simulation experiments show that the proposed matrices have limited influence on the recovery accuracy in different initial states and they outperform their Gaussian and Bernoulli counterparts in recovery accuracy. The proposed matrices can make the hardware implement easy by means of linear feedback shift register (LFSR) structures and numeric converter, which is conducive to practical CS.

Differential Space Time Coding based on Different Unitary Matrices Sets

  • Lee, Kwang-Jae;Kim, Chang-Joo;Yoo, Hyun-Seok;Kim, Sung-Hun;Lee, Moon-Ho
    • Journal of electromagnetic engineering and science
    • /
    • 제6권4호
    • /
    • pp.209-216
    • /
    • 2006
  • This paper investigates a distinct set of complex unitary matrices for QPSK differential space time coding. After properly selecting the initial transmission matrix and unitary matrices we find that the different combinations of them could lead different BER performance over slow/fast Rayleigh fading channels and antennas correlated channels. The numerical results show that the proper selection of the initial transmission matrix and the set of unitary matrices can efficiently improve the bit error rate performance, especially for the antennas correlated fading channel. The computer simulations are evaluated over slow and fast Rayleigh fading channels.

Explicit incremental matrices for the postbuckling analysis of thin plates with small initial curvature

  • Jayachandran, S. Arul;Gopalakrishnan, S.;Narayanan, R.
    • Structural Engineering and Mechanics
    • /
    • 제12권3호
    • /
    • pp.283-295
    • /
    • 2001
  • The postbuckling behaviour of thin plates is an important phenomenon in the design of thin plated structures. In reality plates possess small imperfections and the behaviour of such imperfect plates is of great interest. To numerically study the postbuckling behaviour of imperfect plates explicit incremental or secant matrices have been presented in this paper. These matrices can be used in combination with any thin plate element. The secant matrices are shown to be very accurate in tracing the postbuckling behaviour of thin plates.

Marguerre shell type secant matrices for the postbuckling analysis of thin, shallow composite shells

  • Arul Jayachandran, S.;Kalyanaraman, V.;Narayanan, R.
    • Structural Engineering and Mechanics
    • /
    • 제18권1호
    • /
    • pp.41-58
    • /
    • 2004
  • The postbuckling behaviour of thin shells has fascinated researchers because the theoretical prediction and their experimental verification are often different. In reality, shell panels possess small imperfections and these can cause large reduction in static buckling strength. This is more relevant in thin laminated composite shells. To study the postbuckling behaviour of thin, imperfect laminated composite shells using finite elements, explicit incremental or secant matrices have been presented in this paper. These incremental matrices which are derived using Marguerre's shallow shell theory can be used in combination with any thin plate/shell finite element (Classical Laminated Plate Theory - CLPT) and can be easily extended to the First Order Shear deformation Theory (FOST). The advantage of the present formulation is that it involves no numerical approximation in forming total potential energy of the shell during large deformations as opposed to earlier approximate formulations published in the literature. The initial imperfection in shells could be modeled by simply adjusting the ordinate of the shell forms. The present formulation is very easy to implement in any existing finite element codes. The secant matrices presented in this paper are shown to be very accurate in tracing the postbuckling behaviour of thin isotropic and laminated composite shells with general initial imperfections.

사장교의 초기형상해석을 위한 탄성포물선요소 (Elastic porabolic element for initial shaping analysis of cable-stayed bridges)

  • 경용수;김호경;김문영
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
    • /
    • pp.481-488
    • /
    • 2005
  • This study presents a elastic parabolic cable element for initial shaping analysis of cable structures. First, the compatibility condition and the tangent stiffness matrices of the elastic catenary cable element are shortly summarized. Next the force-deformation relations and the tangent stiffness matrices of the elastic parabolic cable elements are derived from the assumption that sag configuration under self-weights is small. To confirm the accuracy of this element, initial shaping analysis of cable-stayed bridges under dead loads is executed. Finally, the accuracy and the validity of the analysis-results are compared and analyzed through numerical examples.

  • PDF

뇌성마비로 인한 마비말장애 성인의 자음 오류 분석 (Consonant Confusions Matrices in Adults with Dysarthria Associated with Cerebral Palsy)

  • 이영미;성지은;심현섭
    • 말소리와 음성과학
    • /
    • 제5권1호
    • /
    • pp.47-54
    • /
    • 2013
  • The aim of this study was to analyze consonant articulation errors produced by 90 speakers with cerebral palsy (CP). Phonetic transcriptions were made for 37 single-word utterances containing 70 phonemes: 48 initial consonants and 22 final consonants. Errors of substitution, omission, and distortion were analyzed using a confusion matrix paradigm showing the visualization of error patterns. Results showed that substitution errors in initial and final consonants were most frequent, followed by omission and distortion. Consonant omission occurred more frequently on final consonants. In both initial and final consonants, the within-place errors were more prominent than the within-manner errors. The current results suggest that consonant confusion matrices for dysarthric speech may provide useful information for evaluating speech intelligibility and developing automatic speech recognition system of adults with CP associated dysarthria.

ON A FAST ITERATIVE METHOD FOR APPROXIMATE INVERSE OF MATRICES

  • Soleymani, Fazlollah
    • 대한수학회논문집
    • /
    • 제28권2호
    • /
    • pp.407-418
    • /
    • 2013
  • This paper studies a computational iterative method to find accurate approximations for the inverse of real or complex matrices. The analysis of convergence reveals that the method reaches seventh-order convergence. Numerical results including the comparison with different existing methods in the literature will also be considered to manifest its superiority in different types of problems.

Poly(DL-lactide)로 피막된 고분자 매트릭스로부터 약물 방출 조절 I. pH 1.2 염산 용액에서 피막물질이 약물방출에 미치는 영향 (Control of Drug Release from Polymeric Matrices Coated with Poly(DL-lactide) I. Effect of Coasting Substance on the Drug Release in pH 1.2 Hydrochloride Solution)

  • 나재운;박영훈
    • KSBB Journal
    • /
    • 제14권3호
    • /
    • pp.297-302
    • /
    • 1999
  • Poly(DL-lactide)로 피막된 고분자 매트릭스를 약물전달시스템에 이용하기 위해 키토산, 키토산 염산염 및 술폰화 키토산으로 제조되었다. 모델 약물로 프레드니솔론을 사용하는 본 약물방출에 관한 연구는 pH 1.2 염산 용액에서 실험을 하였다. 약물 방출 속도는 고분자 매트릭스의 함유량이 증가할 수록 감소하였다. 피막된 고분자 매트릭스의 종류에 따라 지연된 약물의 방출시간은 키토산의 경우가 가장 길었으며, 술폰화 키토산, 키토산 염산염의 순서였다. DL-PLA로 피막된 고분자 매트릭스가 피막되지 않는 고분자 매트릭스 보다 약물 방출시간이 2배 정도의 지연되었을 뿐만 아니라 초기에 약물 과잉방출 현상도 작아 피막된 경우가 방출 조절형 제재로서 더 바람직한 결과를 보였다. 따라서 DL-PLA로 피막된 고분자 매트릭스는 장시간의 약물 방출을 위한 약물전달체로써의 응용이 기대된다.

  • PDF

ESTIMATING THE DOMAIN OF ATTRACTION VIA MOMENT MATRICES

  • Li, Chunji;Ryoo, Cheon-Seoung;Li, Ning;Cao, Lili
    • 대한수학회보
    • /
    • 제46권6호
    • /
    • pp.1237-1248
    • /
    • 2009
  • The domain of attraction of a nonlinear differential equations is the region of initial points of solution tending to the equilibrium points of the systems as the time going. Determining the domain of attraction is one of the most important problems to investigate nonlinear dynamical systems. In this article, we first present two algorithms to determine the domain of attraction by using the moment matrices. In addition, as an application we consider a class of SIRS infection model and discuss asymptotical stability by Lyapunov method, and also estimate the domain of attraction by using the algorithms.