• 제어로봇시스템학회논문지
• /
• 제8권11호
• /
• pp.984-990
• /
• 2002

We propose a new type of nonlinear fixed interval smoother to which an existing nonlinear smoother is modified. The nonlinear smoother is derived from two-filter formulas. For the backward filter. the propagation and the update equation of error states are derived. In particular, the modified update equation of the backward filter uses the estimated error terms from the forward filter. Data fusion algorithm, which combines the forward filter result and the backward filter result, is altered into the compatible form with the new type of the backward filter. The proposed algorithm is more efficient than the existing one because propagation in backward filter is very simple from the implementation point of view. We apply the proposed nonlinear smoothing algorithm to off-line navigation system and show the proposed algorithm estimates position, and altitude fairly well through the computer simulation.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.75-86
• /
• 2010

An iterative algorithm was been studied which can be viewed as an extension of the previously known algorithms for asymptotically nonexpansive mappings. Subsequently, we study the convergence problem of the proposed iterative algorithm for asymptotically nonexpansive mappings under some mild conditions in Banach spaces.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1499-1506
• /
• 2010

IIn this paper, we suggest and analyze a modified Mann's algorithm based on the CQ method for pseudo-contractive mappings in Hilbert spaces. Further, we prove a strong convergence theorem according to the proposed algorithm for pseudo-contractive mappings.

• Nonlinear Functional Analysis and Applications
• /
• 제27권1호
• /
• pp.203-221
• /
• 2022

In this paper, we introduce new hybrid inertial contraction projection algorithms for solving variational inequality problems over the intersection of the fixed point sets of demicontractive mappings in a real Hilbert space. The proposed algorithms are based on the hybrid steepest-descent method for variational inequality problems and the inertial techniques for finding fixed points of nonexpansive mappings. Strong convergence of the iterative algorithms is proved. Several fundamental experiments are provided to illustrate computational efficiency of the given algorithm and comparison with other known algorithms

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.13-30
• /
• 2010

Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

• 한국안전학회지
• /
• 제30권4호
• /
• pp.99-105
• /
• 2015

In this study, displacement estimation algorithm, which is not requiring an absolute reference point unlike the conventional displacement measurement method, is developed using the geophone. To estimate displacement of the bridge, measured velocity time signal is integrated in the frequency domain. And, the estimated displacement is compared with the measured result using a conventional method. Based on the dynamic field test results, it was found that the estimated displacement by the present algorithm is similar to that of a conventional method. The displacement estimation algorithm proposed in this paper can be effectively applied to measure the displacement of a structure, which is difficult to install a displacement transducer at the fixed point.

• East Asian mathematical journal
• /
• 제27권1호
• /
• pp.35-49
• /
• 2011

In this paper, we study multi-step iterative algorithm with errors and give the necessary and sufficient condition to converge to com mon fixed points for a finite family of asymptotically quasi-nonexpansive type mappings in Banach spaces. Also we have proved a strong convergence theorem to converge to common fixed points for a finite family said mappings on a nonempty compact convex subset of a uniformly convex Banach spaces. Our results extend and improve the corresponding results of [2, 4, 7, 8, 9, 10, 12, 15, 20].

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권4호
• /
• pp.293-299
• /
• 2004

This paper is about the extraction of basis function for ECG signal processing. In the first step, it is assumed that ECG signal consists of linearly mixed independent source signals. 12 channel ECG signals, which were sampled at 600sps, were used and the basis function, which can separate and detect source signals - QRS complex, P and T waves, - was found by applying the fast fixed point algorithm, which is one of learning algorithms in independent component analysis(ICA). The possibilities of significant point detection and classification of normal and abnormal ECG, using the basis function, were suggested. Finally, the proposed method showed that it could overcome the difficulty in separating specific frequency in ECG signal processing by wavelet transform. And, it was found that independent component analysis(ICA) could be applied to ECG signal processing for detection of significant points and classification of abnormal beats.

• 정보처리학회논문지B
• /
• 제10B권4호
• /
• pp.397-402
• /
• 2003

본 연구에서는 뉴우턴법의 고정점 알고리즘에 적응 조정이 가능한 학습 파라미터를 이용한 효율적인 신경망 기반 독립성분분석기법을 제안하였다. 이는 엔트로피 최적화 함수의 1차 미분을 이용하는 뉴우턴법의 고정점 알고리즘에서 학습율과 모멘트를 역혼합행렬의 경신 상태에 따나 적응조정되도록 함으로써 분리속도와 분리성능을 개선시키기 위함이다 제안된 기법을 256$\times$256 픽셀의 8개 지문과 512$\times$512 픽셀의 10개 영상으로부터 임의의 혼합행렬에 따라 발생되는 지문과 영상의 분리에 적용한 결과, 기존의 고정점 알고리즘에 의한 결과보다 우수한 분리성능과 빠른 분리속도가 있음을 확인하였다. 특히 제안된 알고리즘은 문제의 규모가 클수록 분리성능과 분리속도의 개선 정도가 큼을 확인하였다.

• 정보처리학회논문지B
• /
• 제9B권5호
• /
• pp.643-652
• /
• 2002

본 연구에서는 신경망 기반 독립성분분석의 분리성능을 개선하기 위해 할선법과 모멘트의 조합형 고정점 알고리즘을 제안하였다. 할선법은 독립성분 상호간의 정보를 최소화하는 목적함수의 근을 근사적으로 구함으로써 계산과정을 단순화하여 좀 더 개선된 분리성능을 얻기 위함이고, 모멘트는 계산과정에서 발생하는 발진을 억제하여 보다 빠른 분리속도를 얻기 위함이다. 이렇게 하면 할선법이 가지는 근사성에 따른 우수성과 과거의 속성을 반영하여 발진을 억제하는 모멘트의 우수성을 동시에 살릴 수 있다. 제안된 알고리즘을 $256\times{256}$ 픽셀의 8개 지문과 $512\times{512}$ 픽셀의 10개 영상으로부터 임의의 혼합행렬에 따라 생성된 복합지문과 복합영상을 각각 대상으로 시뮬레이션 한 결과, 뉴우턴법에 기초한 기존의 알고리즘과 할선법만에 기초한 알고리즘보다 각각 우수한 분리률과 빠른 분리속도가 있음을 확인하였다. 또한 할선법의 이용은 뉴우턴법을 이용한 고정점 알고리즘보다 초기값에도 덜 의존하며, 문제의 규모가 커짐에 따른 비현실적인 분리시간도 해결할 수 있음을 확인하였다.