• 제목/요약/키워드: conjugate gradient

Search Result 252, Processing Time 0.029 seconds

A Geological Study on the Seoul-Dongducheun Lineament Using Digital Image Processing Teachniques of Landsat Data (LANDSAT DATA의 映像處理手法에 의한 서울-東豆川 간의 LINEAMENT 硏究)

  • 姜必鍾;智光薰;曺民肇;崔映燮
    • Korean Journal of Remote Sensing
    • /
    • v.1 no.1
    • /
    • pp.39-51
    • /
    • 1985
  • The study was emphasized on application of the digital image processing techniques for lineament analysis. The major lineament of the study area belongs to Choogaryong faults which many geologists have studied since 1903. Also the lineament is so significant in geological views, because the lineament runs through Seoul area. The several image processing methods such as gradient, Laplacian and spatial filter have been applied, and the spatial filtering is most suitable method for lineament analysis among them. The lineaments distribute predominently in the N20.deg.-30.deg.E trend and N80.deg.-90.deg.W trend which have the conjugated relationship each other, and it coincides with the Gyeongsang conjugate system. The circular structure of study area was developed by cooling circular joint.

A Spectral-Galerkin Nodal Method for Salving the Two-Dimensional Multigroup Diffusion Equations

  • Hongwu Cheng;Cho, Nam-Zin
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1996.05a
    • /
    • pp.157-162
    • /
    • 1996
  • A novel nodal method is developed for the two-dimensional multi-group diffusion equations based on the Spectral-Galerkin approach. In this study, the nodal diffusion equations with Robin boundary condition are reformulated in a weak (variational) form, which is then approximated spatially by choosing appropriate basis functions. For the nodal coupling relations between the neighbouring nodes, the continuity conditions of partial currents are utilized. The resulting discrete systems with sparse structured matrices are solved by the Preconditioned Conjugate Gradient Method (PCG) and sweeping technique. The method is validated on two test problems.

  • PDF

Numerical simulation of non-isothermal flow in oil reservoirs using a two-equation model

  • dos Santos Heringer, Juan Diego;de Souza Debossam, Joao Gabriel;de Souza, Grazione;Souto, Helio Pedro Amaral
    • Coupled systems mechanics
    • /
    • v.8 no.2
    • /
    • pp.147-168
    • /
    • 2019
  • This work aims to simulate three-dimensional heavy oil flow in a reservoir with heater-wells. Mass, momentum and energy balances, as well as correlations for rock and fluid properties, are used to obtain non-linear partial differential equations for the fluid pressure and temperature, and for the rock temperature. Heat transfer is simulated using a two-equation model that is more appropriate when fluid and rock have very different thermal properties, and we also perform comparisons between one- and two-equation models. The governing equations are discretized using the Finite Volume Method. For the numerical solution, we apply a linearization and an operator splitting. As a consequence, three algebraic subsystems of linearized equations are solved using the Conjugate Gradient Method. The results obtained show the suitability of the numerical method and the technical feasibility of heating the reservoir with static equipment.

Reduction of magnetic anomaly observations from helicopter surveys at varying elevations (고도가 변화하는 헬리콥터 탐사에서 얻어지는 자력이상의 변환)

  • Nakatsuka, Tadashi;Okuma, Shigeo
    • Geophysics and Geophysical Exploration
    • /
    • v.9 no.1
    • /
    • pp.121-128
    • /
    • 2006
  • Magnetic survey flights by helicopters are usually parallel to the topographic surface, with a nominal clearance, but especially in high-resolution surveys the altitudes at which observations are made may be too variable to be regarded as a smooth surface. We have developed a reduction procedure for such data using the method of equivalent sources, where surrounding sources are included to control edge effects, and data from points distributed randomly in three dimensions are directly modelled. Although the problem is generally underdetermined, the method of conjugate gradients can be used to find a minimum-norm solution. There is freedom to select the harmonic function that relates the magnetic anomaly with the source. When the upward continuation function operator is selected, the equivalent source is the magnetic anomaly itself. If we select as source a distribution of magnetic dipoles in the direction of the ambient magnetic field, we can easily derive reduction-to-pole anomalies by rotating the direction of the magnetic dipoles to vertical.

A Fast Digital Elevation Model Extraction Algorithm Using Gradient Correlation (Gradient Correlation을 이용한 고속 수치지형표고 모델 추출 방법)

  • Chul Soo Ye;Byung Min Jeon;Kwae Hi Lee
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.3
    • /
    • pp.250-261
    • /
    • 1998
  • The purpose of this paper is to extract fast DEM (Digital Elevation Model) using satellite images. DEM extraction consists of three parts. First part is the modeling of satellite position and attitude, second part is the matching of two images to find corresponding points of them and third part is to calculate the elevation of each point by using the results of the first and second part. The position and attitude modeling of satellite is processed by using GCPs. A area based matching method is used to find corresponding points between the stereo satellite images. The elevation of each point is calculated using the exterior orientation parameters obtained from modeling and conjugate points from matching. In the DEM generation system, matching procedure holds most of a processing time, therefore to reduce the time for matching, a new fast matching algorithm using gradient correlation and fast similarity measure calculation method is proposed. In this paper, the SPOT satellite images, level 1A 6000$\times$6000 panchromatic images are used to extract DEM. The experiment result shows the possibility of fast DEM extraction with the satellite images.

Study on CGM-LMS Hybrid Based Adaptive Beam Forming Algorithm for CDMA Uplink Channel (CDMA 상향채널용 CGM-LMS 접목 적응빔형성 알고리듬에 관한 연구)

  • Hong, Young-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.895-904
    • /
    • 2007
  • This paper proposes a robust sub-optimal smart antenna in Code Division Multiple Access (CDMA) basestation. It makes use of the property of the Least Mean Square (LMS) algorithm and the Conjugate Gradient Method (CGM) algorithm for beamforming processes. The weight update takes place at symbol level which follows the PN correlators of receiver module under the assumption that the post correlation desired signal power is far larger than the power of each of the interfering signals. The proposed algorithm is simple and has as low computational load as five times of the number of antenna elements(O(5N)) as a whole per each snapshot. The output Signal to Interference plus Noise Ratio (SINR) of the proposed smart antenna system when the weight vector reaches the steady state has been examined. It has been observed in computer simulations that proposed beamforming algorithm improves the SINR significantly compared to the single antenna case. The convergence property of the weight vector has also been investigated to show that the proposed hybrid algorithm performs better than CGM and LMS during the initial stage of the weight update iteration. The Bit Error Rate (BER) characteristics of the proposed array has also been shown as the processor input Signal to Noise Ratio (SNR) varies.

A Study on the Forecasting of Daily Streamflow using the Multilayer Neural Networks Model (다층신경망모형에 의한 일 유출량의 예측에 관한 연구)

  • Kim, Seong-Won
    • Journal of Korea Water Resources Association
    • /
    • v.33 no.5
    • /
    • pp.537-550
    • /
    • 2000
  • In this study, Neural Networks models were used to forecast daily streamflow at Jindong station of the Nakdong River basin. Neural Networks models consist of CASE 1(5-5-1) and CASE 2(5-5-5-1). The criteria which separates two models is the number of hidden layers. Each model has Fletcher-Reeves Conjugate Gradient BackPropagation(FR-CGBP) and Scaled Conjugate Gradient BackPropagation(SCGBP) algorithms, which are better than original BackPropagation(BP) in convergence of global error and training tolerance. The data which are available for model training and validation were composed of wet, average, dry, wet+average, wet+dry, average+dry and wet+average+dry year respectively. During model training, the optimal connection weights and biases were determined using each data set and the daily streamflow was calculated at the same time. Except for wet+dry year, the results of training were good conditions by statistical analysis of forecast errors. And, model validation was carried out using the connection weights and biases which were calculated from model training. The results of validation were satisfactory like those of training. Daily streamflow forecasting using Neural Networks models were compared with those forecasted by Multiple Regression Analysis Mode(MRAM). Neural Networks models were displayed slightly better results than MRAM in this study. Thus, Neural Networks models have much advantage to provide a more sysmatic approach, reduce model parameters, and shorten the time spent in the model development.

  • PDF

Integration of Motion Compensation Algorithm for Predictive Video Coding (예측 비디오 코딩을 위한 통합 움직임 보상 알고리즘)

  • Eum, Ho-Min;Park, Geun-Soo;Song, Moon-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.85-96
    • /
    • 1999
  • In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.

  • PDF

${T_2}weighted$- Half courier Echo Planar Imaging

  • 김치영;김휴정;안창범
    • Investigative Magnetic Resonance Imaging
    • /
    • v.5 no.1
    • /
    • pp.57-65
    • /
    • 2001
  • Purpose : $T_2$-weighted half courier Echo Planar Imaging (T2HEPI) method is proposed to reduce measurement time of existing EPI by a factor of 2. In addition, high $T_2$ contrast is obtained for clinical applications. High resolution single-shot EPI images with $T_2$ contrast are obtained with $128{\times}128$ matrix size by the proposed method. Materials and methods : In order to reduce measurement time in EPI, half courier space is measured, and rest of half courier data is obtained by conjugate symmetric filling. Thus high resolution single shot EPI image with $128{\times}128$ matrix size is obtained with 64 echoes. By the arrangement of phase encoding gradients, high $T_2$ weighted images are obtained. The acquired data in k-space are shifted if there exists residual gradient field due to eddy current along phase encoding gradient, which results in a serious problem in the reconstructed image. The residual field is estimated by the correlation coefficient between the echo signal for dc and the corresponding reference data acquired during the pre-scan. Once the residual gradient field is properly estimated, it can be removed by the adjustment of initial phase encoding gradient field between $70^{\circ}$ and $180^{\circ}$ rf pulses. Results : The suggested T2EPl is implemented in a 1.0 Tela whole body MRI system. Experiments are done with the effective echo times of 72ms and 96ms with single shot acquisitions. High resolution($128{\times}128$) volunteer head images with high $T_2$ contrast are obtained in a single scan by the proposed method. Conclusion : Using the half courier technique, higher resolution EPI images are obtained with matrix size of $128{\times}128$ in a single scan. Furthermore $T_2$ contrast is controlled by the effective echo time. Since the suggested method can be implemented by software alone (pulse sequence and corresponding tuning and reconstruction algorithms) without addition of special hardware, it can be widely used in existing MRI systems.

  • PDF

A STUDY ON A MULTI-LEVEL SUBSTRUCTURING METHOD FOR COMPUTATIONS OF FLUID FLOW (유동계산을 위한 다단계 부분 구조법에 대한 연구)

  • Kim J.W.
    • Journal of computational fluids engineering
    • /
    • v.10 no.2
    • /
    • pp.38-47
    • /
    • 2005
  • Substructuring methods are often used in finite element structural analyses. In this study a multi-level substructuring(MLSS) algorithm is developed and proposed as a possible candidate for finite element fluid solvers. The present algorithm consists of four stages such as a gathering, a condensing, a solving and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At the highest level, each sub-domain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each sub-domain has been replaced by a sequential static condensation of gathered element matrices. The global algebraic system arising from the assembly of each sub-domain matrices is solved using a well-known iterative solver such as the conjugare gradient(CG) or the conjugate gradient squared(CGS) method. A time comparison with CG has been performed on a 2-D Poisson problem. With one domain the computing time by MLSS is comparable with that by CG up to about 260,000 d.o.f. For 263,169 d.o.f using 8 x 8 sub-domains, the time by MLSS is reduced to a value less than $30\%$ of that by CG. The lid-driven cavity problem has been solved for Re = 3200 using the element interpolation degree(Deg.) up to cubic. in this case, preconditioning techniques usually accompanied by iterative solvers are not needed. Finite element formulation for the incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et al.[9].