• 전자공학회논문지B
• /
• 제32B권1호
• /
• pp.103-109
• /
• 1995

In this paper, we propose a postprocessing method that neatly removes blocking effect but retains visually important image details and edges. The iterative thresholded lowpass filter is basically a low pass filter whose ouput depends on three variable elements. I.e. iteration number, threshold value and passband width. The threshold value restricts the difference between the output of the proposed filter and the original input independent of the iteration number. With this property, the iterative thresholded lowpass filter can retain most of the image details while smoothing the block boundaries. The other two variable elements, i.e. iteration number and passband width, can determine the convergence speed of the proposed filter. In this paper, we also propose several adaptive filtering techniques based on the iterative thresholded lowpass filter with their simulation results.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.9-12
• /
• 2003

This paper describes a step-by-step method to minimize design iterations in a process of product design change. In the design process, two components are coupled if a change of a component can require the other components change, and design iterations are generated by the coupling. The design iteration is one of main factors that increase design effort. In this study, three matrices are used to solve the design iteration of automatic transmission lever, Requirement-Engineering matrix, Engineering-Components matrix, and DSM(Design Structure Matrix). Firstly, with the DSM, the product architecture and conceptual design process are proposed from product function analysis. Secondly, with the QFD, the Requirement-Engineering matrix and Engineering-Components matrix present the relationship among customer requirements, engineering issues, and product components. Lastly, the results of the QFD analysis are used in the DSM to solve the component interactions and to provide design

• 한국통신학회논문지
• /
• 제13권5호
• /
• pp.437-443
• /
• 1988

무한히 긴 도체 스트립 위에 TM파가 입사될 때, 스트립의 전류 분포를 계산한다. 스트립의 경계조건식을 공간영역의 함수로 표시하면 convolution 적분을 포함하는 복잡한 식으로 나타난다. 그러나 그들을 주파수 영역으로 변환하면 전류 및도 함수와 Green함수의 곱으로 간단히 표시된다. 반복 계산 결과는 본 연구에서 제시한 반복 끝내기 조건을 만족할 때에 가장 좋은 결과를 보이고 있다. 반복과정의 수렴 속도를 Kastner의 방법을 이용하여 증가시켰다. 스트립에 유도되는 전류 분포는 스트립 폭에 따라 크게 변화하고 있음을 확인하였다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1999년도 추계학술대회 논문집
• /
• pp.254-262
• /
• 1999

실시간 시뮬레이션에서 주어지는 다양한 종류의 불연속적인 파라미터 값을 가지는 데이터 테이블에서 실시간의 제약 하에서의 검색을 수행하기 위해서는 최적의 기법이 요구된다. 실시간의 제약 하에서 최적 기법의 기준이 되는 것은 보통의 알고리즘들과는 달리 평균 속도가 아니라 worst case에서의 속도가 된다. 검색 알고리즘 들은 iteration을 거치게 되므로 총 탐색에 걸리는 시간은 iteration의 수(logical speed)와 1 probe를 수행하는 데 걸리는 시간(실제 수행속도)의 곱으로 정의된다. 본 연구에서 총 탐색에 걸리는 시간을 이론적으로 계산한 검색 속도 기존의 수행한 수치비교시험의 결과와 대체로 일치하였고, 이분 검색법이 iteration의 수와 실제 수행시간 모두에 있어서 가장 우수하다. 한편, 검색하고자 하는 파라미터 값의 dynamics를 이용하여 주어진 데이터 테이블 내의 검색 영역을 축소시키는 dynamic-window 개념을 도입하여 검색 알고리즘의 속도를 향상시킬 수 있었다. 이 개념의 도입은 데이터 테이블의 형태에 민감한 보간 검색법(interpolation method)과 그 응용 기법들에 대해 탁월한 효과를 나타내었다. 결론적으로 일반적 데이터 테이블에 있어서는 이분 검색법이 logical speed와 실제 수행속도가 우수하고, dynamic-window 개념을 도입한 보간 검색법과 그 변형들은 logical speed가 탁월하게 향상된다.

• 대한전기학회논문지
• /
• 제40권4호
• /
• pp.427-438
• /
• 1991

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic system is preented. In the learning control structure, the control input converges globally and asymtotically to the desired input as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of the time-duration of trajectories, it may be achieved with system trajectories with small duration. In addition, the proposd learning control schemes are applicable to time-varying parametric systems as well as time-invariant systems, because the parameter estimation is performed at each fixed time along the iteration. In the parameter estimator, the acceleration information as well as the inversion of estimated inertia matrix are not used at all, which makes the proposed learning control schemes more feasible.

• Kyungpook Mathematical Journal
• /
• 제56권1호
• /
• pp.221-233
• /
• 2016

The present paper proposes a new monotone iteration method for existence as well as approximation of the coupled solutions for a coupled periodic boundary value problem of first order ordinary nonlinear differential equations. A new hybrid coupled fixed point theorem involving the Dhage iteration principle is proved in a partially ordered normed linear space and applied to the coupled periodic boundary value problems for proving the main existence and approximation results of this paper. An algorithm for the coupled solutions is developed and it is shown that the sequences of successive approximations defined in a certain way converge monotonically to the coupled solutions of the related differential equations under some suitable mixed hybrid conditions. A numerical example is also indicated to illustrate the abstract theory developed in the paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4355-4371
• /
• 2020

Phase retrieval, recovering a signal from phaseless measurements, is generally considered to be an NP-hard problem. This paper adopts an amplitude-based nonconvex optimization cost function to develop a new stochastic gradient algorithm, named stochastic reweighted phase retrieval (SRPR). SRPR is a stochastic gradient iteration algorithm, which runs in two stages: First, we use a truncated sample stochastic variance reduction algorithm to initialize the objective function. The second stage is the gradient refinement stage, which uses continuous updating of the amplitude-based stochastic weighted gradient algorithm to improve the initial estimate. Because of the stochastic method, each iteration of the two stages of SRPR involves only one equation. Therefore, SRPR is simple, scalable, and fast. Compared with the state-of-the-art phase retrieval algorithm, simulation results show that SRPR has a faster convergence speed and fewer magnitude-only measurements required to reconstruct the signal, under the real- or complex- cases.

• Korean Journal of Mathematics
• /
• 제30권4호
• /
• pp.665-678
• /
• 2022

The aim of this paper is to introduce a new iterative process and show that our iteration scheme is faster than other existing iteration schemes with the help of numerical examples. Next, we have established convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some convergence results for the approximation of the fixed points of a nonexpansive mapping.

• 한국해양공학회지
• /
• 제25권4호
• /
• pp.18-22
• /
• 2011

The Ranking source panel method was used to predict the flow phenomenon of a ship with a goose-neck type bulbous bow penetrating the free surface. The non-linearity of the free surface boundary condition was fully satisfied using an iterative calculation method, and the raised panel method was adopted to obtain a more stable solution at each iteration step. The panel cutting method was applied to generate a hull calculation grid at each iteration step, including the first step. At that time, the nose of the goose-neck type bulbous bow was divided by the free surface and the free surface panel was modified at each iteration step using the variable free surface panel method. Numerical calculations were performed to investigate the validity and efficiency of the applied numerical algorithm using the 3600 TEU container carrier. The computed wave resistance coefficients were compared with the experimentally achieved residual resistance coefficients.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.52-55
• /
• 1997

In this paper, both the generalization of one artificial variable technique to the general bound problem and the efficient implementation of the technique are suggested. When the steepest-edge method is used as a pricing rule in the simplex method, it is easy to update the reduced cost and the simplex multiplier every iteration. Therefore, one artificial variable technique is more efficient than Wolfe's method in which the reduced cost and simplex multiplier must be recalculated in every iteration. When implementing the one artificial variable technique on the LP problems with the general bound restraints on the variables, an arbitrary basic solution which satisfies the bound restraints is sought first, and the artificial column which adjusts the infeasibility is introduced. The phase one of the simplex method minimizes the one artificial variable. The efficient implementation technique includes the splitting, scaling, storage of the artificial column, and the cure of infeasibility problem.