• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.703-711
• /
• 2005

This paper proposes the improved orthogonal projection method as a new technique advancing the performance of the echo cancellation for speeches in the acoustic echo canceller. Comparing with the used NLMS adaptive algorithm, it shows that this method improves the performance of the echo cancellation for signals with the large auto-correlation. In order to testify performances of the orthogonal projection method whom this paper proposes, we have coded a simulation program and executed computer simulations. We observed convergence curves by using two adaptive algorithm for noises and speeches. From simulation results for two input signals, the proposed method shows the high ERLE and the fast convergence and the stable operation in case of using speeches as well as noises.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.73-81
• /
• 2006

This paper proposes the improved orthogonal projection method as a new technique advancing the performance of the acoustic echo canceller. Comparing with the widely used NLMS adaptive algorithm which is simple and stable, it shows that this method has the improvement of the convergence speed for signals with the large auto-correlation, and has small computational quantities. In order to testify performances of the orthogonal projection method whom this paper proposes, we have coded a simulation program md executed computer simulations. We observed convergence curves by using two adaptive algorithm for noises and speeches. From simulation results for two input signals, the proposed method shows the high ERLE and the fast convergence and the stable operation in case of using speeches as well as noises.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2388-2396
• /
• 2012

This paper is on an simplified orthogonal projection method which cancel the acoustic echo signals in the stereo acoustic echo canceller. Comparing with the NLMS algorithm which is widely used for simplicity and stability, it shows that this method has the improvement of the convergence performances for signals with the high auto-correlation, and has small computational quantities. To verify the convergence characteristics of the proposed algorithm, we simulated about various input signals. And we compared the results of simulation for this algorithm with the ones for the NLMS algorithm. By these works, it was proved that the stereo acoustic echo canceller adopting the proposed algorithm shows about 3dB more high ERLE than the NLMS algorithm for the white noise signals, and 5dB for the colored voice signals.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.739-742
• /
• 2001

동영상은 각 프레임 사이에 시간적으로나 공간적으로 많은 양의 정보가 중복되어 있다. 이러한 중복 정보를 줄이는 표현 방법들 중에 하나로, 동영상을 커다란 하나의 영상으로 정합하여 중복 정보를 줄이는 모자이크 기법이 있다. 두 개 이상의 영상을 정합하기 위해서는 영상간의 카메라 파라미터가 필요한데, 본 논문에서는 Mellin 변환을 사용하여 카메라 파라미터를 구하였다. 이때 3차원 공간모델은 직교 투사법을 사용하였으며, 영상의 움직임 모델로는 4개의 파라미터(평행이동, 확대/축소, 회전)를 사용한 어파인 움직임 모델을 사용하였다. 이렇게 구현된 파노라마 영상은 동영상에서 움직이는 물체를 검출하거나 추적하고, 동영상을 편집하는데 응용될 수 있다. 또한 본 연구의 최종 목적인 3D 영상의 배경을 구현하는 데 좀 더 사실적인 영상을 제공할 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.117-126
• /
• 2008

Recent advances in medical imaging technologies have enabled the high-resolution data acquisition. Therefore visualization of such large data set on standard graphics hardware became a popular research theme. Among many visualization techniques, we focused on bricking method which divided the entire volume into smaller bricks and rendered them in order. Since it switches bet\W8n bricks on main memory and bricks on GPU memory on the fly, to achieve better performance, the number of these memory swapping conditions has to be minimized. And, because the original bricking algorithm was designed for regular volume data such as CT and MR, when applying the algorithm to ultrasound volume data which is based on the toroidal coordinate space, it revealed some performance degradation. In some areas near bricks' boundaries, an orthogonal viewing ray intersects the single brick twice, and it consequently makes a single brick memory to be uploaded onto GPU twice in a single frame. To avoid this redundancy, we divided the volume into bricks allowing overlapping between the bricks. In this paper, we suggest the formula to determine an appropriate size of these shared area between the bricks. Using our formula, we could minimize the memory bandwidth. and, at the same time, we could achieve better rendering performance.