• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.441-464
• /
• 2010

In this paper, we introduce an iterative method for finding common elements of the set of solutions to a general system of variational inequalities for inverse-strongly accretive mappings and of the set of fixed points of strict pseudo-contractions in a real Banach space. The results presented in this paper mainly improve and extend the corresponding results announced by many others.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.455-469
• /
• 2002

The Purpose Of this Paper is to introduce the concept of a class of strictly successively hemicontractive mappings and construct certain stable and almost stable iteration procedures for the iterative approximation of fixed points for asymptotically nonexpansive and strictly successively hemicontractive mappings in Banach spaces.

• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.83-95
• /
• 2014

In a uniformly convex Banach space, we introduce a iterative scheme for a finite family of asymptotically quasi-nonexpansive mappings and utilize a new inequality to prove several convergence results for the iterative sequence. The results generalize and unify many important known results of relevant scholars.

• Korean Journal of Mathematics
• /
• v.20 no.3
• /
• pp.353-360
• /
• 2012

In this paper we introduce the property (C), which is a cone metric extension of the usual metric property (E,A) and consider fixed point theorems for generalized contractive mappings under suitable conditions in cone metric spaces without normal cones.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.801-812
• /
• 2010

In this paper, we consider the convergence of the shrinking projection method for quasi-$\phi$-nonexpansive mappings. Strong convergence theorems are established in a uniformly smooth and strictly convex Banach space which enjoys the Kadec-Klee property.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.195-198
• /
• 2000

Fractal image compression can reduce the size of image data by contractive mapping of original image. The mapping is affine transformation to find the block(called range block) which is the most similar to the original image. Fractal is very efficient way to reduce the data size. However, it has high distortion rate and requires long encoding time. In this paper, we present the simulation result of fractal and VQ hybrid systems which use different clustering algorithms, normal and improved competitive learning SOFM. The simulation results showed that the VQ hybrid fractal using improved competitive learning SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.4
• /
• pp.181-187
• /
• 2001

본 논문에서는 3D 텍스쳐 매핑 하드웨어(texture mapping hardware)하에서 OpenGL를 이용하여 빠른 추출(classification) 및 음영처리(shading)를 가능하게 하는 직접 볼륨 렌더링(direct volume rendering) 방법을 제안한다. 추출과정을 위해 lookup table을 통해서 볼륨 데이터의 밀도값(density)으로부터 불투명도(opacity)값을 얻어내고, 법선 벡터 블렌딩(normal blending)방법을 제안하여 볼륨 크기에 상관없이 최종 이미지에서만 음영 처리 연산을 수행한다. 본 논문에서 제시된 볼륨 렌더링의 전과정이 그래픽스 하드웨어(graphics hardware)에서 이뤄지면, 음영처리 연산의 복잡도 감소로 인하여 상호 대화적인 볼륨 렌더링이 가능하다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.81-84
• /
• 2000

Fractal image compression can reduce the size of image data by contractive mapping of original image. The mapping is affine transformation to find the block(called range block) which is the most similar to the original image. Fractal is very efficient way to reduce the data size. However, it has high distortion rate and requires long encoding time. In this paper, we present the simulation result of fractal and VQ hybrid systems which use different clustering algorithms, normal and improved competitive learning SOFM. The simulation results showed that the VQ hybrid fractal using improved competitive learning SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.129-137
• /
• 2010

In this paper, we introduce and study a system of nonlinear set-valued implicit variational inclusions (SNSIVI) with relaxed cocoercive mappings in real Banach spaces. By using resolvent operator technique for M-accretive mapping, we construct a new class of iterative algorithms for solving this class of system of set-valued implicit variational inclusions. The convergence of iterative algorithms is proved in q-uniformly smooth Banach spaces. Our results generalize and improve the corresponding results of recent works.

• Investigative Magnetic Resonance Imaging
• /
• v.24 no.3
• /
• pp.141-153
• /
• 2020

Purpose: Myocardial T1 and T2 relaxation times are affected by technical factors such as cardiovascular magnetic resonance platform/vendor. We aimed to validate T1 and T2 mapping sequences using a phantom; establish reference T1, T2, and extracellular volume (ECV) measurements using two sequences at 3T in normal Koreans; and compare the protocols and evaluate the differences from previously reported measurements. Materials and Methods: Eleven healthy subjects underwent cardiac magnetic resonance imaging (MRI) using 3T MRI equipment (Verio, Siemens, Erlangen, Germany). We did phantom validation before volunteer scanning: T1 mapping with modified look locker inversion recovery (MOLLI) with 5(3)3 and 4(1)3(1)2 sequences, and T2 mapping with gradient echo (GRE) and TrueFISP sequences. We did T1 and T2 mappings on the volunteers with the same sequences. ECV was also calculated with both sequences after gadolinium enhancement. Results: The phantom study showed no significant differences from the gold standard T1 and T2 values in either sequence. Pre-contrast T1 relaxation times of the 4(1)3(1)2 protocol was 1142.27 ± 36.64 ms and of the 5(3)3 was 1266.03 ± 32.86 ms on the volunteer study. T2 relaxation times of GRE were 40.09 ± 2.45 ms and T2 relaxation times of TrueFISP were 38.20 ± 1.64 ms in each. ECV calculation was 24.42% ± 2.41% and 26.11% ± 2.39% in the 4(1)3(1)2 and 5(3)3 protocols, respectively, and showed no differences at any segment or slice between the sequences. We also calculated ECV from the pre-enhancement T1 relaxation time of MOLLI 5(3)3 and the post-enhancement T1 relaxation time of MOLLI 4(1)3(1)2, with no significant differences between the combinations. Conclusion: Using phantom-validated sequences, we reported the normal myocardial T1, T2, and ECV reference values of healthy Koreans at 3T. There were no statistically significant differences between the sequences, although it has limited statistical value due to the small number of subjects studied. ECV showed no significant differences between calculations based on various pre- and post-mapping combinations.