• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.665-671
• /
• 2013

Even though a dual lens stereoscopic camera allows for convenient stereoscopic photography, the necessity for the research comes up, since the dual lens stereoscopic camera can cause visual discomfort during zoom-in due to the fixed convergence point. We propose a method based on which a convergence point can be adjusted to prevent visual discomfort during zoom-in for a dual lens stereoscopic camera. First, the relational model is classified into nine kinds and defined, depending on locations of focus, object, and convergence point. And then, the method to minimize visual discomfort is suggested by adjusting convergence point on the given model. We also implement the suggested methods with anaglyph computer graphic and demonstrate the superiority of them.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.12
• /
• pp.1-8
• /
• 1996

In this paper, we propose a hybrid blind equalizer with TEA and SG (stop & Go) algorithm with switching point a 0 dB of MSE value for improvement of convergence performance, where TEA is used initially to open the eye and then SG algorithm as rapid convergence is employed. The switching point is selected at the point of 0 dB MSE level because of settling the coefficients of blind equalier. As a result of computer simulatons for 8-PAM in the non-minimum phase channel, the proposed algorithm has better convergence speed as 3,500 ~ 4,500 iterations and has better MsE about 3 ~ 6 dB than those of original TEA. Also, computational cost of proposed algorithm is reduced as 5 ~ 16% than that of original TEA. and, the proposed algorithm has better convergence than SG algorithm as 8,500 ~ 17,500 iteratins but, the MSE is similar to original SG.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.973-976
• /
• 2011

This letter describes an efficient technique for maximum power point tracking (MPPT) of an energy harvesting device. It is based on controlling the device voltage at the point of maximum power. Using a microcontroller with a power saving technique, the MPPT algorithm maintains the maximum power with low power consumption. An experiment shows that the algorithm maximizes the energy transfer power using an energy management IC fabricated in a 0.18-${\mu}m$ process. Compared to direct energy transfer to a battery, the proposed technique is more efficient for low-energy harvesting under variable conditions.

• East Asian mathematical journal
• /
• v.27 no.5
• /
• pp.545-555
• /
• 2011

Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.375-388
• /
• 2013

In this paper, we introduce an iterative sequence for finding solution of a system of mixed equilibrium problems and the set of fixed points of a nonexpansive mapping in Hilbert spaces. Then, the weak and strong convergence theorems are proved under some parameters controlling conditions. Moreover, we apply our result to fixed point problems, system of equilibrium problems, general system of variational inequalities, mixed equilibrium problem, equilibrium problem and variational inequality.

• Journal of the Korean Statistical Society
• /
• v.35 no.1
• /
• pp.1-23
• /
• 2006

In this paper we consider an estimation of the discontinuous variance function in nonparametric heteroscedastic random design regression model. We first propose estimators of the change point in the variance function and then construct an estimator of the entire variance function. We examine the rates of convergence of these estimators and give results for their asymptotics. Numerical work reveals that using the proposed change point analysis in the variance function estimation is quite effective.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.246-251
• /
• 2014

The recent rise of the three-dimensional television (3DTV) industry has led to a wide exploitation of the dual-lens stereoscopic camera. However, when the zoom-in function is used, it is possible that a camera object is magnified only with a fixed convergence point, thereby leading to visual discomfort. In this paper, we propose several methods based on which a convergence point can be adjusted to prevent visual discomfort during zoom-in for a dual-lens stereoscopic camera. Further, we produce 3D contents by applying the proposed methods to certain cases and at certain distances and conduct a subjective evaluation. On the subjective evaluation, 48 subjects watch the 3D contents created by the proposed methods and score the stages of the visual comfort. The result of the subjective evaluation shows that some of the proposed methods are more efficient than the others. We hope that these proposed high-efficiency methods can be applied to produce a dual-lens stereoscopic camera that allows convenient stereoscopic photography.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.583-607
• /
• 2010

The purpose of this paper is to prove strong convergence theorems for common fixed points of two families of weak relatively nonexpansive mappings and a family of equilibrium problems by a new monotone hybrid method in Banach spaces. Because the hybrid method presented in this paper is monotone, so that the method of the proof is different from the original one. We shall give an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping in Banach space $l^2$. Our results improve and extend the corresponding results announced in [W. Takahashi and K. Zembayashi, Strong convergence theorem by a new hybrid method for equilibrium problems and relatively nonexpansive mappings, Fixed Point Theory Appl. (2008), Article ID 528476, 11 pages; doi:10.1155/2008/528476] and [Y. Su, Z. Wang, and H. Xu, Strong convergence theorems for a common fixed point of two hemi-relatively nonexpansive mappings, Nonlinear Anal. 71 (2009), no. 11, 5616?5628] and some other papers.

• Journal of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1529-1540
• /
• 2018

The matrix equation $X^p+A^*XA=Q$ has been studied to find the positive definite solution in several researches. In this paper, we consider fixed-point iteration and Newton's method for finding the matrix p-th root. From these two considerations, we will use the Newton-Schulz algorithm (N.S.A). We will show the residual relation and the local convergence of the fixed-point iteration. The local convergence guarantees the convergence of N.S.A. We also show numerical experiments and easily check that the N.S. algorithm reduce the CPU-time significantly.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1011-1014
• /
• 1999

In this paper, a new algorithm has been presented that helps to preserve diversity as well as to enhance the convergence speed of the evolutionary programming. This algorithm is based on the cell partitioning of search region for preserving the diversity. Until now, the greater part of researches is not concerned about preserving the diversity of individuals in a population but improving convergence speed. Although these evolutions are started from multi-point search at the early phase, but at the end those search points are swarming about a one-point, the strong candidate. These evolutions vary from the original idea in some points such as multi-point search. In most case we want to find the only one point of the best solution not several points in the vicinity of that. That is why the cell partitioning of search region has been used. By restricting the search area of each individual, the diversity of individual in solution space is preserved and the convergence speed is enhanced. The efficiency of the proposed algorithm has been verified through benchmark test functions.