• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.227-245
• /
• 2011

In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

• Journal of Astronomy and Space Sciences
• /
• 제13권2호
• /
• pp.198-209
• /
• 1996

본 논문에서는 인공위성을 통하여 수신되는 다중대역 영상을 압축하기 위한 방법을 제시한다. 본 논문에서 제안하는 방법은 다대역 영상에서 보이는 대역간 상관성 및 대역내에서 각 화소간의 상관성을 줄이는 목표를 가지고, 화소간 상관성을 줄이기 위해서는 wavelet 변환을 사용하고, 대역간 상관성을 줄이기 위해서는 대역간 데이타블럭의 화소값간의 상관관계를 1차식으로 모델링하고 회귀(regression) 방법을 이용하여 대역간 화소 차이을 가깝게 하여 데이타 압축율을 향상시킨다. 변환계수는 데이타 압축율을 높이기 위해 변형된 힐버트 커브와 RLE 그리고 허프만 코딩을 이용하였다. 제안된 알고리듬은 우리별 1호 영상과 LANDSAT MSS 영상을 이용하여 실험하였으며, 성능평가 척도로는 원영상과 복원된 영상의 PSNR과 ISODATA를 이용할 때의 분류 능력을 비교하였다.

• Nonlinear Functional Analysis and Applications
• /
• 제29권1호
• /
• pp.131-164
• /
• 2024

In this research, we study a modified relaxed Tseng method with a single projection approach for solving common solution to a fixed point problem involving finite family of τ-demimetric operators and a quasi-monotone variational inequalities in real Hilbert spaces with alternating inertial extrapolation steps and adaptive non-monotonic step sizes. Under some appropriate conditions that are imposed on the parameters, the weak and linear convergence results of the proposed iterative scheme are established. Furthermore, we present some numerical examples and application of our proposed methods in comparison with other existing iterative methods. In order to show the practical applicability of our method to real word problems, we show that our algorithm has better restoration efficiency than many well known methods in image restoration problem. Our proposed iterative method generalizes and extends many existing methods in the literature.

• 한국통신학회논문지
• /
• 제30권9C호
• /
• pp.913-921
• /
• 2005

일반적인 bandpass sampling 방법인 real bandpass sampling 기법은 하향변환(downconversion)을 시행할 때 음의 주파수 대역의 RF 신호와의 에일리어싱(aliasing) 현상을 피해야 하므로 신중한 sampling 주파수 선택이 요구된다. 더욱이 다중신호(multiple signals)가 하향변환 될 경우에 이 sampling 방법은 더욱 많은 제약이 따르게 된다. 그러나 Hilbert 변환을 사용하는 complex bandpass sampling 방법은 음의 주파수 영역의 신호를 제거함으로써, real bandpass sampling 기법보다 유연하고 넓은 sampling 주파수 범위를 제공하며, 또한 더욱 낮은 sampling 주파수를 얻을 수 있는 장점이 있다. 본 논문에서는 이러한 complex bandpass sampling의 특징을 사용하여, 다중 신호를 하나의 통신 기기에서 동시에 하향 변환하는 수신기의 구조를 제시한다. 그리고 하나 또는 2개 신호의 하향변환에 관한 내용으로 제한하지 않고 N개의 신호로 확장하여 유효 sampling 주파수 영역 및 보호대역(guard-band)이 고려된 sampling 가능 최소 주파수에 관한 수식들을 일반화한다. 또한 모의실험을 통해 유도된 수식들을 증명한다.

• 전자공학회논문지A
• /
• 제30A권3호
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.