• 한국컴퓨터정보학회논문지
• /
• 제4권2호
• /
• pp.135-140
• /
• 1999

본 논문은 영상 부호화시에 걸리는 오랜 시간을 줄이기 위해 스케일링 방식과 탐색영역 제한방식을 이용한 어핀변환 부호화 방식을 제안한다. 제안한 방법의 성능을 평가하기 위해, 제안한 알고리즘과 전통적인 어핀변환 부호화 방식을 사용하는 Jacquin의 방법과 비교하였다. 시뮬레이션 결과, 제안한 알고리즘은 스케일링 방식과 탐색영역 제한 방식을 사용하므로써, 부호화 시간을 상당히 줄일 수 있었다. Jacquin의 방식과 비교해, 복원된 영상의 화질은 약간 저하되었지만 부호화 시간을 많이 단축하였다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1997년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.125-130
• /
• 1997

In this paper we present an algorithm to generate new views of a scene, starting with images from weakly calibrated cameras. Errors in 3D scene reconstruction usually gets reflected in the quality of the new scene generated, so we seek a direct method for reprojection. In this paper, we use the knowledge of dense point matches and their affine coordinate values to estimate the corresponding affine coordinate values in the new scene. We borrow ideas from the object recognition literature, and extend them significantly to solve the problem of reprojection. Unlike the epipolar line intersection algorithms for reprojection which requires at least eight matched points across three images, we need only five matched points. The theory of reprojection is used with hardware based rendering to achieve fast rendering. We demonstrate our results of novel view generation from stereopairs for arbitrary locations of the virtual camera.

• 전기학회논문지
• /
• 제59권2호
• /
• pp.476-483
• /
• 2010

If the data are pre-whitened, then gradient adaptive algorithms which are simpler than higher order statistics algorithms can be used in adaptive blind signal estimation. In this paper, we propose a blind subband affine projection algorithm for multiple-input multiple-output adaptive equalization in the blind environments. All of the adaptive filters in subband affine projection equalization are decomposed to polyphase components, and the coefficients of the decomposed adaptive sub-filters are updated by defining the multiple cost functions. An infinite impulse response filter bank is designed for the data pre-whitening. Pre-whitening procedure through subband filtering can speed up the convergence rate of the algorithm without additional computation. Simulation results are presented showing the proposed algorithm's convergence rate, blind equalization and blind signal separation performances.

• Journal of Power Electronics
• /
• 제11권3호
• /
• pp.327-334
• /
• 2011

Single-phase power factor correction (PFC) converter circuits are non-linear systems due to the contribution of their multiplier. This non-linearity causes difficulties in analysis and design. Models that reduce the system to a linear system involve considerable approximation, and produce results that are susceptible to instability problems. In this paper a piecewise affine (PWA) system is introduced for describing the nonlinear averaged model. Then robust output feedback controllers are established in terms of the linear matrix inequality (LMI). Simulation and experiments results show the effectiveness of the proposed control method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.169-172
• /
• 2001

In recent years, many studies regarding the modeling of fuzzy system have been conducted. In this paper, a new computational approach to modeling of linguistic fuzzy system is proposed The fuzzy system is modeled as a combination of affine systems, The proposed method can be used in a rigorous stability analysis of fuzzy system including the linguistic fuzzy controller.

• Journal of applied mathematics & informatics
• /
• 제33권1_2호
• /
• pp.127-143
• /
• 2015

In this paper, we consider a modified inexact Newton method for solving a nonlinear system F(x) = 0 where $F(x):R^n{\rightarrow}R^n$. The basic idea is to accelerate convergence. A semi-local convergence theorem for the modified inexact Newton method is established and an affine invariant version is also given. Moreover, we test three numerical examples which show that the modified inexact scheme is more efficient than the classical inexact Newton strategy.

• 호남수학학술지
• /
• 제33권3호
• /
• pp.381-391
• /
• 2011

One of the main interesting things of a matroid theory is the representability by a matroid from a matrix over some field F. The representability of uniform matroid $U_{m,n}$ over some field are studied by many authors. In this paper we construct a matrix representing $U_{3,6}$ over the field GF(4). Also we find out matrix of the affine matroid AG(2, 3) over the field GF(4).

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권1호
• /
• pp.65-73
• /
• 2005

Let g = g(A) = (equation omitted) + be a symmetrizable Kac-Moody Lie algebra of type D/sub l//sup (1) with W as its Weyl group. We construct a sequence of root spaces with certain conditions. We also find the number of terms of this sequence is less then or equal to the hight of θ, the highest root.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.59-65
• /
• 1992

A modified primal-dual affine scaling algorithm for linear programming is presented. This modified algorithm generates an elipsoid containing all optimal dual solutions at each iteration, then checks whether or not a dual hyperplane intersects this ellipsoid. If the dual hyperplane has no intersection with this ellipsoid, its corresponding column must be optimal nonbasic. By condensing these columns, the size of LP problem can be reduced.

• The Journal of the Acoustical Society of Korea
• /
• 제17권2E호
• /
• pp.3-9
• /
• 1998

Since the introduction of hands-free phone set and teleconferencing system, acoustic echo cancellation has been a challenge for engineers. Recently many researches have shown that the best solution for the acoustic echo compensation problem is represented by an adaptive filter which iteratively tries to identify the unknown impulse response of the system from loudspeaker to microphone. In this paper, we apply the delayless subband adaptive filters and fast affine projection algorithm for the identification of room impulse response. Simulation results show 3∼8 dB more enhanced performance than conventional fullband adaptive filters or subband adaptive filters. In addition, fast affine projection algorithm shows better convergence speed at the expense of the low computational complexity than conventional LMS algorithm.