• 한국CDE학회논문집
• /
• 제3권3호
• /
• pp.183-191
• /
• 1998

There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.648-661
• /
• 1997

This paper presents a new method for post-processing of coded images based upon the low-pass filtering followed by the projection onto the NQCS (narrow quantization constraint set). We also investigate how the proposed method works on JPEG-coded real images. The starting point of the QCS-based post-processing techniques is the centroid of the QCS, where the original image belongs. The low-pass filtering followed by the projection onto the QCS makes the images lie on the boundary of the QCS. It is likely that, however, the original image is inside the QCS. Hence projection onto the NQCS gives a lower MSE (mean square error) than does the projection onto the QCS. Simulation results show that setting the narrowing coefficients of the NQCS to be 0.2 yields the best performance in most cases. Even though the JPEG-coded image is low-pass filtered and projected onto the NQCS repeatedly, there is no guarantee that the resultant image has a lower MSE and goes closer to the original image. Thus only one iteration is sufficient for the post-processing of the coded images. This is interesting because the main drawback of the iterative post-processing techniques is the heavy computational burden. The single iteration method reduces the computational burden and gives us an easy way to implement the real time VLSI post-processor.

• 대한원격탐사학회지
• /
• 제23권1호
• /
• pp.33-42
• /
• 2007

In this paper, an iterative MAP approach using a Bayesian model based on the lognormal distribution for image intensity and a GRF for image texture is proposed for despeckling the SAR images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. MRFs have been used to model spatially correlated and signal-dependent phenomena for SAR speckled images. The MRF is incorporated into digital image analysis by viewing pixel types as slates of molecules in a lattice-like physical system defined on a GRF Because of the MRF-SRF equivalence, the assignment of an energy function to the physical system determines its Gibbs measure, which is used to model molecular interactions. The proposed Point-Jacobian Iterative MAP estimation method was first evaluated using simulation data generated by the Monte Carlo method. The methodology was then applied to data acquired by the ESA's ERS satellite on Nonsan area of Korean Peninsula. In the extensive experiments of this study, The proposed method demonstrated the capability to relax speckle noise and estimate noise-free intensity.

• 한국통신학회논문지
• /
• 제25권5B호
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• 한국통신학회논문지
• /
• 제41권8호
• /
• pp.868-876
• /
• 2016

MUSIC(multiple signal classification) 알고리즘은 고유값(eigenvalue)과 고유벡터(eigenvector)를 이용하여 표적의 도래각을 추정하는 대표적인 알고리즘이다. 일반적으로 고유값과 고유벡터는 고유치 해석(eigen-analysis)을 이용하여 구할 수 있으나, 계산 복잡도가 높고 수렴 시간의 긴 문제점이 있다. 그러므로 저가형 실시간 시스템 구현에 한계가 있다. 이런 문제를 개선한 고유치 해석 방법으로 QR 반복법이 제안되었으나, 기존의 QR 반복법 수렴 판단 방법으로는 MUSIC 알고리즘 적용에 부적합하다는 한계가 있다. 본 논문에서는 QR 반복법의 고유치 기반의 기존 수렴 판단 방법의 문제점을 분석하고, 고유벡터를 활용한 개선된 수렴 판단 방법을 제안한다.

• 한국전자파학회논문지
• /
• 제16권10호
• /
• pp.965-972
• /
• 2005

본 연구에서는 DTV, HDTV 서비스를 동시에 제공하는 차세대 위성 방송시스템의 표준안인 DVB-S2에서 채널 부호화 알고리즘으로 채택한 LDPC 부호의 복호 알고리즘에 대해 연구를 하였다. 샤논의 한계에 근접하기 위해서는 큰 블록 사이즈의 LDPC 부호어 길이와 많은 반복 횟수를 요구한다. 이는 많은 계산량을 요구하며, 그리고 이에 따른 전력 소비량(power consumption)을 야기시키므로 본 논문에서는 세 가지 형태의 low complexity LDPC 복호 알고리즘을 제시한다. 첫째로 큰 블록 사이즈와 많은 반복 회수는 많은 계산량과 power 소모량을 요구하므로 성능 손실 없이 반복 횟수를 줄일 수 있는 SUBSET 방법을 이용한 복호 알고리즘, 둘째로 early stop 알고리즘에 대해 연구하였고, 셋째로 비트 노드 계산과 체크 노드 계산시 일정한 신뢰도 값보다 크면 다음 반복시 계산을 하지 않는 early detection 알고리즘에 대해 연구하였다.

• Structural Engineering and Mechanics
• /
• 제34권6호
• /
• pp.719-738
• /
• 2010

The aim of this paper concerns with the nonlinear analysis of cable-stayed bridges including the vibration effect of cable stays. Two models for the cable stay system are built up in the study. One is the OECS (one element cable system) model in which one single element per cable stay is used and the other is MECS (multi-elements cable system) model, where multi-elements per cable stay are used. A finite element computation procedure has been set up for the nonlinear analysis of such kind of structures. For shape finding of the cable-stayed bridge with MECS model, an efficient computation procedure is presented by using the two-loop iteration method (equilibrium iteration and shape iteration) with help of the catenary function method to discretize each single cable stay. After the convergent initial shape of the bridge is found, further analysis can then be performed. The structural behaviors of cable-stayed bridges influenced by the cable lateral motion will be examined here detailedly, such as the static deflection, the natural frequencies and modes, and the dynamic responses induced by seismic loading. The results show that the MECS model offers the real shape of cable stays in the initial shape, and all the natural frequencies and modes of the bridge including global modes and local modes. The global mode of the bridge consists of coupled girder, tower and cable stays motion and is a coupled mode, while the local mode exhibits only the motion of cable stays and is uncoupled with girder and tower. The OECS model can only offers global mode of tower and girder without any motion of cable stays, because each cable stay is represented by a single straight cable (or truss) element. In the nonlinear seismic analysis, only the MECS model can offer the lateral displacement response of cable stays and the axial force variation in cable stays. The responses of towers and girders of the bridge determined by both OECS- and MECS-models have no great difference.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권1호
• /
• pp.47-55
• /
• 2008

Local convergence results for three Newton-like methods in Banach space are provided. A comparison is given between the three convergence radii. Then we show that using the largest convergence radius we can pick an initial guess from with we start the corresponding iteration. It turns out that after a finite number of steps we can always use the iterate found as the starting guess for a faster method, since this iterate will be inside the convergence domain of the new method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제15권1호
• /
• pp.19-30
• /
• 2011

In [21], we compared the Newton-Krylov method and some high-order methods to solve nonlinear systems. In this paper, we propose high-order Newton-Krylov methods combining the Newton-Krylov method with some high-order iterative methods to solve systems of nonlinear equations. We provide some numerical experiments including comparisons of CPU time and iteration numbers of the proposed high-order Newton-Krylov methods for several nonlinear systems.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.981-992
• /
• 2012

Integro-differential equations arise in modeling various physical and engineering problems. Several numerical and analytical methods have been developed to solving such equations. We introduce the NHPM for solving nonlinear integro-differential equations. Several examples for solving integro-differential equations are presented to illustrate the efficiency of the proposed NHPM.