• Title/Summary/Keyword: Boundary value methods

Search Result 169, Processing Time 0.031 seconds

CALCULATION METHODS OF SOLAR ATMOSPHERIC MODEL (태양대기모델 계산법)

  • KIM KAP-SUNG
    • Publications of The Korean Astronomical Society
    • /
    • v.15 no.spc2
    • /
    • pp.65-71
    • /
    • 2000
  • We have investigated the numerical methods to calculate model atmosphere for the analysis of spectral lines emitted from the sun and stars. Basic equations used in our calculations are radiative transfer, statistical equilibrium and charge-particle conservations. Transfer equation has been solved to get emitting spectral line profile as an initial value problem using Adams-Bashforth-Moulton method with accuracy as high as 12th order. And we have calculated above non linear differential equations simultaneously as a boundary value problem by finite difference method of 3 points approximation through Feautrier elimination scheme. It is found that all computing programs coded by above numerical methods work successfully for our model atmosphere.

  • PDF

Shot boundary Frame Detection and Key Frame Detection for Multimedia Retrieval (멀티미디어 검색을 위한 shot 경계 및 대표 프레임 추출)

  • 강대성;김영호
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.1
    • /
    • pp.38-43
    • /
    • 2001
  • This Paper suggests a new feature for shot detection, using the proposed robust feature from the DC image constructed by DCT DC coefficients in the MPEG video stream, and proposes the characterizing value that reflects the characteristic of kind of video (movie, drama, news, music video etc.). The key frames are pulled out from many frames by using the local minima and maxima of differential of the value. After original frame(not do image) are reconstructed for key frame, indexing process is performed through computing parameters. Key frames that are similar to user's query image are retrieved through computing parameters. It is proved that the proposed methods are better than conventional method from experiments. The retrieval accuracy rate is so high in experiments.

  • PDF

An Improved Joint Bayesian Method using Mirror Image's Features (미러영상 특징을 이용한 Joint Bayesian 개선 방법론)

  • Han, Sunghyu;Ahn, Jung-Ho
    • Journal of Digital Contents Society
    • /
    • v.16 no.5
    • /
    • pp.671-680
    • /
    • 2015
  • The Joint Bayesian[1] method was published in 2012. Since then, it has been used for binary classification in almost all state-of-the-art face recognition methods. However, no improved methods have been published so far except 2D-JB[2]. In this paper we propose an improved version of the JB method that considers the features of both the given face image and its mirror image. In pattern classification, it is very likely to make a mistake when the value of the decision function is close to the decision boundary or the threshold. By making the value of the decision function far from the decision boundary, the proposed method reduces the errors. The experimental results show that the proposed method outperforms the JB and 2D-JB methods by more than 1% in the challenging LFW DB. Many state-of-the-art methods required tons of training data to improve 1% in the LFW DB, but the proposed method can make it in an easy way.

2-D Stress Analysis by a Dislocation Model (전위모델 을 이용한 2차원 응력해석)

  • 구인회
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.9 no.1
    • /
    • pp.10-17
    • /
    • 1985
  • A new method is suggested for the solution of plane elasticity problems. With use of the dislocation model in the crack problems, the basic scheme of this method is to find equilibrium Burgers vectors of dislocations which are distributed along the boundary of the first fundamental boundary value problems. The stress distribution in the region can be found by superposition of the contributions of each dislocation. The method is applied to three cases with known analytical solutions, and to a V-notched specimen under uniaxial tension. The numerical results are compared with other available solutions. This method is effective and simple in its use, compared with other numerical methods. The method also provides very accurate solutions in the region except near the boundary where the discretization error is significant. The extrapolation method is suggested for the stresses in the boundary region. Extensive application are also suggested for a general estimate of the computational efficiency of the method.

MESHLESS AND HOMOTOPY PERTURBATION METHODS FOR ONE DIMENSIONAL INVERSE HEAT CONDUCTION PROBLEM WITH NEUMANN AND ROBIN BOUNDARY CONDITIONS

  • GEDEFAW, HUSSEN;GIDAF, FASIL;SIRAW, HABTAMU;MERGIAW, TADESSE;TSEGAW, GETACHEW;WOLDESELASSIE, ASHENAFI;ABERA, MELAKU;KASSIM, MAHMUD;LISANU, WONDOSEN;MEBRATE, BENYAM
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.675-694
    • /
    • 2022
  • In this article, we investigate the solution of the inverse problem for one dimensional heat equation with Neumann and Robin boundary conditions, that is, we determine the temperature and source term with given initial and boundary conditions. Three radial basis functions(RBFs) have been used for numerical solution, and Homotopy perturbation method for analytic solution. Numerical solutions which are obtained by considering each of the three RBFs are compared to the exact solution. For appropriate value of shape parameter c, numerical solutions best approximates exact solutions. Furthermore, we have shown the impact of noisy data on the numerical solution of u and f.

Edge Detection using Genetic Algorithm (유전자 알고리즘을 이용한 윤곽선 추출)

  • 박찬란;이웅기
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.2
    • /
    • pp.85-97
    • /
    • 1998
  • The existing edge detection methods can not represent the real edge of object at fitting point or detect the edge which has unsufficient connecting trait. Especially, the two-fold thick edge detected by these methods cannot coincide real boundary of subject and it's location. To overcome these problems, we introduce the Genetic Algorithm(GA) in edge detection. The energy function is the value of fixel's satisfaction degree to edge condition. And it consists of the fitness value to image formation type, fitness value to connecting trait to it's neighboring edge and evalulation function which can represents the edge at fitting point as one fixel. This method is superior to remove the noise in edge detection than the existing methods. And it also detects the clear and exact edge because it can find the one fixel which is located at fitting point and has strong connecting trait.

  • PDF

Numerical Analysis of Tapered Circular Arch with Fixed Ends (양단고정 변단면 도호아-치의 수치해석에 관한 연구)

  • 박문호;이병구
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.19 no.3
    • /
    • pp.4462-4471
    • /
    • 1977
  • The governing differential equations for the tapered circular arch with fixed ends have been derived, and a numerical procedure for the solution of these equations have been developed. The governing differential equations were solved numerically by an initial value integration procedure and Shooting Methods for boundary value problems. The Rungekutta fourth order integration technique was used. The methods was programmed for a Cyber 73-18 computer System, and all esults were obtained on this computer. A detailed study has been made for a fixed arch with an angle of opening equal to 0.7 radian, and the results are presented in detail in tables and curves. It is hoped that the results presented herein is applied to the deformations of gives point from the tri-axial direction of tapered circular arch with fixed ends, bending moment, and torsional moment, and that at the same time results to be used for archwise structures in steel structure.

  • PDF

Image Steganographic Method using Variable Length for Data Embedding (가변 길이 자료 은닉이 가능한 이미지 스테가노그래픽 방법 연구)

  • Jung, Ki-Hyun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.3
    • /
    • pp.115-122
    • /
    • 2008
  • Wu and Tsai's pixel-value differencing method and Chang and Tseng's side-match method are based on the theory that the number of bits which can be embedded is determined by the degree of the pixel's smoothness, or its proximity to the edge of the image. If pixels are located in the edge area, they may tolerate larger changes than those in smooth areas. However, both methods are subject to the fall off the boundary problem(FOBP). This study proposes a new scheme that can solve the FOBP. The experimental results demonstrate that the proposed method resolves the problem, and achieves a higher image quality index value than other methods.

Robust multiple imputation method for missings with boundary and outliers (한계와 이상치가 있는 결측치의 로버스트 다중대체 방법)

  • Park, Yousung;Oh, Do Young;Kwon, Tae Yeon
    • The Korean Journal of Applied Statistics
    • /
    • v.32 no.6
    • /
    • pp.889-898
    • /
    • 2019
  • The problem of missing value imputation for variables in surveys that include item missing becomes complicated if outliers and logical boundary conditions between other survey items cannot be ignored. If there are outliers and boundaries in a variable including missing values, imputed values based on previous regression-based imputation methods are likely to be biased and not meet boundary conditions. In this paper, we approach these difficulties in imputation by combining various robust regression models and multiple imputation methods. Through a simulation study on various scenarios of outliers and boundaries, we find and discuss the optimal combination of robust regression and multiple imputation method.

A MESH INDEPENDENCE PRINCIPLE FOR PERTURBED NEWTON-LIKE METHODS AND THEIR DISCRETIZATIONS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.1
    • /
    • pp.139-159
    • /
    • 2000
  • In this manuscript we study perturbed Newton-like methods for the solution of nonlinear operator equations in a Banach space and their discretized versions in connection with the mesh independence principle. This principle asserts that the behavior of the discretized process is asymptotically the same as that for the original iteration and consequently, the number of steps required by the two processes to converge to within a given tolerance is essentially the same. So far this result has been proved by others using Newton's method for certain classes of boundary value problems and even more generally by considering a Lipschitz uniform discretization. In some of our earlierpapers we extend these results to include Newton-like methods under more general conditions. However, all previous results assume that the iterates can be computed exactly. This is mot true in general. That in why we use perturbed Newton-like methods and even more general conditions. Our results, on the one hand, extend, and on the other hand, make more practical and applicable all previous results.