• 충청수학회지
• /
• 제26권3호
• /
• pp.641-645
• /
• 2013

In this article, we show that the modular equation ${\Phi}_p^{T_q}(X,Y)$ of Thompson series $T_q$ corresponding to ${\Gamma}_0(q)+q$ gives an affine model of a modular curve $X_0(pq)+q$.

• Kyungpook Mathematical Journal
• /
• 제50권2호
• /
• pp.337-343
• /
• 2010

We study affine translation surfaces in $\mathbb{R}^3$ and get a complete classification of such surfaces with constant Gauss-Kronecker curvature.

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

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.877-880
• /
• 2000

In this paper, we develop an algorithm of soccer image sequences mosaicing using reverse affine transform. The continuous mosaic images of soccer ground field allows the user/viewer to view a “wide picture” of the player’s actions The first step of our algorithm is to automatic detection and tracking player, ball and some lines such as center circle, sideline, penalty line and so on. For this purpose, we use the ground field extraction algorithm using color information and player and line detection algorithm using four P-rules and two L-rules. The second step is Affine transform to map the points from image to model coordinate using predefined and pre-detected four points. General Affine transformation has many holes in target image. In order to delete these holes, we use reverse Affine transform. We tested our method in real image sequence and the experimental results are given.

• 대한수학회지
• /
• 제43권6호
• /
• pp.1301-1324
• /
• 2006

The affine homogeneous hypersurface in ${\mathbb{R}}^{n+1}$, which is a graph of a function $F:{\mathbb{R}}^n{\rightarrow}{\mathbb{R}}$ with |det DdF|=1, corresponds to a complete unimodular left symmetric algebra with a nondegenerate Hessian type inner product. We will investigate the condition for the domain over the homogeneous hypersurface to be homogeneous through an extension of the complete unimodular left symmetric algebra, which is called the graph extension.

• 한국음향학회지
• /
• 제33권6호
• /
• pp.420-426
• /
• 2014

본 논문에서는 충격성 잡음 환경 하에서 인접 투사 알고리즘(Affine Projection Algorithm, APA)의 안정성을 높이기 위해 제안된 인접 투사 부호 알고리즘(Affine Projection Sign Algorithm, APSA)의 수렴 속도를 향상시키기 위한 새로운 APSA을 제안하였다. APSA은 충격성 잡음에 안정적으로 동작하고 역행렬 연산을 요구하지 않는다는 장점을 가지고 있다. 제안된 알고리즘은 기존 알고리즘의 장점을 가지면서도 기존의 알고리즘보다 더 빠른 수렴속도를 갖는다. 기존의 알고리즘은 i번째 과거 입력 신호를 필터 갱신을 위해 사용되는 모든 입력 신호의 $l_2$-norm으로 정규화 하지만 제안된 알고리즘은 i번째 과거 입력 신호를 i번째 과거 입력 신호의 $l_2$-norm 만으로 정규화한다. 시스템 식별 환경에서 두 알고리즘의 성능을 비교하는 컴퓨터 모의 실험을 수행하여 제안된 알고리즘의 수렴속도가 기존의 알고리즘보다 개선되었음을 보였다.

• 한국음향학회지
• /
• 제34권2호
• /
• pp.130-137
• /
• 2015

본 논문에서는 충격성 소음의 능동 제어를 위해 제안된 Modified Filtered-x Affine Projection Sign Algorithm(MFxAPSA)의 수렴 속도를 향상시키기 위한 새로운 MFxAPSA를 제안하였다. 능동 소음 제어에서 소음원이 충격성 잡음을 포함하는 경우, 무한한 크기의 분산을 갖으려는 성질 때문에 Filtered-x affine Projection Sign Algorithm(FxLMS)와 같이 2차 모멘트를 기반으로 유도된 적응 알고리즘들은 수렴 속도가 매우 느리거나 발산하는 경향이 있다. MFxAPSA는 기존에 제안된 Affine Projection Sign Algorithm(APSA)을 능동 충격성 소음 제어에 적용한 알고리즘이다. APSA은 역행렬 연산을 요구하지 않는다는 장점으로 인해 낮은 연산량을 요구하는 능동 소음 제어에 적합하다. 본 논문에서는 기존의 MFxAPSA와 같이 역행렬 연산을 요구하지 않으면서 더 좋은 수렴 특성을 가지는 새로운 MFxAPSA를 제안하였다. 두 알고리즘의 성능을 비교하는 컴퓨터 모의 실험을 수행하여 제안된 알고리즘의 수렴 특성이 더 좋음을 보였다.

• 전자공학회논문지B
• /
• 제31B권2호
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• 대한수학회논문집
• /
• 제16권1호
• /
• pp.85-94
• /
• 2001

Let g=g(A) be an affine Lie algebra of type A(sub)2ι(sup)(2)(ι>1) and W be its Weyl group. In this paper, we find $\omega$$\in$W such that $\Delta$+U{1/2($\alpha$ι+$\delta$), 1/2($\alpha$ι+3$\delta$)}⊂$\Delta$+($\omega$).

• 대한수학회지
• /
• 제42권3호
• /
• pp.485-498
• /
• 2005

In this article we show that every quasi-homogeneous convex affine domain whose boundary is everywhere differentiable except possibly at a finite number of points is either homogeneous or covers a compact affine manifold. Actually we show that such a domain must be a non-elliptic strictly convex cone if it is not homogeneous.