• Title/Summary/Keyword: 대각 행렬

Search Result 90, Processing Time 0.027 seconds

Seismic Reflection Tomography by Cell Parameterization (셀 매개변수에 의한 탄성파 반사주시 토모그래피)

  • Seo, Young-Tak;Shin, Chang-Soo;Ko, Seung-Won
    • Geophysics and Geophysical Exploration
    • /
    • v.6 no.2
    • /
    • pp.95-100
    • /
    • 2003
  • In this study, we developed reflection tomography inversion algorithm using Straight Ray Technique (SRT) which can calculate travel time easily and fast for complex geological structure. The inversion process begins by setting the initial velocity model as a constant velocity model that hat only impedance boundaries. The inversion process searches a layer-interface structure model that is able to explain the given data satisfactorily by inverting to minimize data misfit. For getting optimal solution, we used Gauss-Newton method that needed constructing the approximate Hessian matrix. We also applied the Marquart-Levenberg regularization method to this inversion process to prevent solution diverging. The ability of the method to resolve typical target structures was tested in a synthetic salt dome inversion. Using the inverted velocity model, we obtained the migration image close to that of the true velocity model.

Application of Matrix Adaptive Regularization Method for Human Thorax Image Reconstruction (인체 흉부 영상 복원을 위한 행렬 적응 조정 방법의 적용)

  • Jeon, Min-Ho;Kim, Kyung-Youn
    • Journal of IKEEE
    • /
    • v.19 no.1
    • /
    • pp.33-40
    • /
    • 2015
  • Inverse problem in electrical impedance tomography (EIT) is highly ill-posed therefore prior information is used to mitigate the ill-posedness. Regularization methods are often adopted in solving EIT inverse problem to have satisfactory reconstruction performance. In solving the EIT inverse problem, iterative Gauss-Newton method is generally used due to its accuracy and fast convergence. However, its performance is still suboptimal and mainly depends on the selection of regularization parameter. Although, there are few methods available to determine the regularization parameter such as L-curve method they are sometimes not applicable for all cases. Moreover, regularization parameter is a scalar and it is fixed during iteration process. Therefore, in this paper, a novel method is used to determine the regularization parameter to improve reconstruction performance. Conductivity norm is calculated at each iteration step and it used to obtain the regularization parameter which is a diagonal matrix in this case. The proposed method is applied to human thorax imaging and the reconstruction performance is compared with traditional methods. From numerical results, improved performance of proposed method is seen as compared to conventional methods.

Time- and Frequency-Domain Block LMS Adaptive Digital Filters: Part Ⅱ - Performance Analysis (시간영역 및 주파수영역 블럭적응 여파기에 관한 연구 : 제 2 부- 성능분석)

  • Lee, Jae-Chon;Un, Chong-Kwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.7 no.4
    • /
    • pp.54-76
    • /
    • 1988
  • In Part Ⅰ of the paper, we have developed various block least mean-square (BLMS) adaptive digital filters (ADF's) based on a unified matrix treatment. In Part Ⅱ we analyze the convergence behaviors of the self-orthogonalizing frequency-domain BLMS (FBLMS) ADF and the unconstrained FBLMS (UFBLMS) ADF both for the overlap-save and overlap-add sectioning methods. We first show that, unlike the FBLMS ADF with a constant convergence factor, the convergence behavior of the self-orthogonalizing FBLMS ADF is governed by the same autocorrelation matrix as that of the UFBLMS ADF. We then show that the optimum solution of the UFBLMS ADF is the same as that of the constrained FBLMS ADF when the filter length is sufficiently long. The mean of the weight vector of the UFBLMS ADF is also shown to converge to the optimum Wiener weight vector under a proper condition. However, the steady-state mean-squared error(MSE) of the UFBLMS ADF turns out to be slightly worse than that of the constrained algorithm if the same convergence constant is used in both cases. On the other hand, when the filter length is not sufficiently long, while the constrained FBLMS ADF yields poor performance, the performance of the UFBLMS ADF can be improved to some extent by utilizing its extended filter-length capability. As for the self-orthogonalizing FBLMS ADF, we study how we can approximate the autocorrelation matrix by a diagonal matrix in the frequency domain. We also analyze the steady-state MSE's of the self-orthogonalizing FBLMS ADF's with and without the constant. Finally, we present various simulation results to verify our analytical results.

  • PDF

Morphological Interpretation of Modified Karhunen-Loeve Transformation and Its Applications to Color Image Processing (변형 Karhunen-Loeve 변환의 수리형태학적 의미와 칼라 영상처리에의 응용)

  • Eo, Jin-Woo
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.97-108
    • /
    • 1994
  • A modified Karhunen-Loeve transformation technique using normalization and simultaneous diagonalization of two sample covariance matrices is proposed to separate the object from the background. The transformation technique for the separation of local data structure through maximizing the ratio of sample variances between two classes was identified as a promising one for a preprocessing of multi-variate signal processing algorithms using neighborhood operators including morphological filtering. To relate the separation quality of the proposed technique to a morphological measure, average height was defined by using morphological pattern spectrum. A practical implementation of the transformation technique was tested experimentally and the theoretical results were confirmed.

  • PDF

A Study on the load Flow Calculation for preserving off Diagonal Element in Jacobian Matrix (Jacobian 행렬의 비 대각 요소를 보존시킬 수 있는 조류계산에 관한 연구)

  • 이종기;최병곤;박정도;류헌수;문영현
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.9
    • /
    • pp.1081-1087
    • /
    • 1999
  • Load Flow calulation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning. operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to slove load flow equation and to modify above defects. And it preserve P-Q bus part of Jacobian matrix to shorten computing time. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical results and the same numbers of iteration obtained by Newton-Raphson method. The effect of computing time reduction showed about 28% , 30% , at each case of 39 bus, 118 bus system.

  • PDF

MIMO Channel Diagonalization: Linear Detection ZF, MMSE (MIMO 채널 대각화: 선형 검출 ZF, MMSE)

  • Yang, Jae Seung;Shin, Tae Chol;Lee, Moon Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.15-20
    • /
    • 2016
  • Compared to the MIMO system using the spatial multiplexing methods and the MIMO system using the diversity scheme achieved a high rate, but the lower the diversity gain to improve the data transmission reliability should separate the spatial stream at the MIMO receiver. In this paper, we compared Channel capacity detection methods with the Lattice code, the 3-user interference channel and linear channel interference detection methods ZF (Zero Forcing) and MMSE (Minimum Mean Square Error) detection methods. The channel is a Diagonal channel. In other words, Diagonal channel is confirmed by the inverse matrix satisfies the properties of Jacket are element-wise inverse to $[H]_N[H]_N^{-1}=[I]_N$.

Analysis of Large-Scale Network using a new Network Tearing Method (새로운 분할법에 의한 회로망해석)

  • 김준현;송현선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.3
    • /
    • pp.267-275
    • /
    • 1987
  • This paper concerns a study on the theory of tearing which analyzes a large scale network by partitioning it into a number of small subnetworks by cutting through some of the existing nodes and branches in the network. By considering of the relationship its voltage and current of node cutting before and after, the consititutive equations of tearing method is equvalent to renumbering the nodes of untorn network equations. Therefore the analysis of network is conveniently applied as same algorithm that is used in untorn network. Also the proposed nodal admittnace matrix is put in block diagonal form, therefore this method permit parallel processing analysis of subnetworks. 30 nodes network was tested and the effectiveness of the proposed algorithm was proved.

  • PDF

Temperature Dependence of the Gain Spectrum of a Quantum Well Laser (양자우물 레이저의 이득 곡선의 온도 의존성)

  • 김동철;유건호;박종대;김태환
    • Korean Journal of Optics and Photonics
    • /
    • v.6 no.4
    • /
    • pp.302-309
    • /
    • 1995
  • We desinged a lattice-matched InGaAs/lnGaAsP quantum well laser that lases at $1.55{\mu}m$ at room temperature, and calculated the gain spectrum as a function of injected carrier density and temperature. For the calculation of band structures and momentum matrix elements, we used a transfer JIlatrix method based on a block-diagonalized 8x8 second-order Ii$.$ P Hamiltonian. This lattice-matched quantum well lases in transverse electric mode. As the temperature increases, the lasing wavelength gets longer, the transparency carrier density increases, and the differential gain is reduced. The temperature dependence of the gain spectrum comes from the temperature dependence of the band structure and that of the Fermi function, and the latter contributes dominantly.nantly.

  • PDF

A Four-Node Assumed Strain Plate Element for Explicit Dynamic Transient Analysis (명시적인 동적 시간이력해석을 한 사절점 가변형도 평판요소)

  • 이상진
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.3
    • /
    • pp.349-359
    • /
    • 2001
  • An enhanced four-node plate element, which has been developed for explicit dynamic analysis of plate, is described in this paper. Reissner-Mind1in(RM) assumptions are adopted to consider transverse shear deformation effects in the present plate element. RM plate element produces a shear locking phenomena in thin plate so that the substitute natural strains based on assumed strain method are explicitly derived. The present plate element is applied into the explicit transient algorithm and the mass matrix of plate is formulated by using special lumping method proposed by Hinton et al. The performance of the element is verified with numerical examples.

  • PDF

A Study on a Load Flow calculation for Preserved Jacobian Matrix's elements except diagonal terms (Jacobian 행렬의 비 대각 요소를 보존시킬 수 있는 조류계산에 관한 연구)

  • Moon, Yong-Hyun;Lee, Jong-Gi;Choi, Byoung-Kon;Park, Jeong-Do;Ryu, Hun-Su
    • Proceedings of the KIEE Conference
    • /
    • 1998.11a
    • /
    • pp.311-315
    • /
    • 1998
  • Load Flow calculation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning, operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to solve load flow equation and to modify above defects. And it preserve certain part of Jacobian matrix to shorten the time of calculation. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical result and the number of iteration got by Newton-Raphson method. The effect of time reduction showed about 28%, 30%, at each case of 39 bus, 118 bus system.

  • PDF