• ETRI Journal
• /
• 제41권2호
• /
• pp.235-241
• /
• 2019

In this paper, we propose a rank-weighted reconstruction feature to improve the robustness of a feed-forward deep neural network (FFDNN)-based acoustic model. In the FFDNN-based acoustic model, an input feature is constructed by vectorizing a submatrix that is created by slicing the feature vectors of frames within a context window. In this type of feature construction, the appropriate context window size is important because it determines the amount of trivial or discriminative information, such as redundancy, or temporal context of the input features. However, we ascertained whether a single parameter is sufficiently able to control the quantity of information. Therefore, we investigated the input feature construction from the perspectives of rank and nullity, and proposed a rank-weighted reconstruction feature herein, that allows for the retention of speech information components and the reduction in trivial components. The proposed method was evaluated in the TIMIT phone recognition and Wall Street Journal (WSJ) domains. The proposed method reduced the phone error rate of the TIMIT domain from 18.4% to 18.0%, and the word error rate of the WSJ domain from 4.70% to 4.43%.

• 한국전자통신학회논문지
• /
• 제17권2호
• /
• pp.367-374
• /
• 2022

그래프 노드상에서 발생하는 그래프 신호의 일부를 선택해서 만든 샘플링 신호로부터 원신호를 복원하기 위해, 복원오차를 최소화하기 위한 최적의 샘플링 집합을 선택하는 알고리즘에 관해 연구한다. 복잡도 개선을 위해 복원오차를 직접적으로 최소화하는 대신에, 복원오차의 상한값을 비용함수로 사용하고, QR분해 적용을 통해 발생하는 상삼각행렬의 대각선상에 위치하는 값으로 샘플링을 결정할 수 있게 하는, 저 복잡도를 갖는 반복적 탐욕알고리즘을 제안한다. 기존의 샘플링 선택 방법과 비교하여, 제안 알고리즘이 복원 성능 저하를 평균 5%미만으로 유지하면서, 약 3.5배 빠른 실행시간을 보임을 다양한 그래프 상황에서 실험을 통해 확인한다.

• 대한전자공학회논문지
• /
• 제25권4호
• /
• pp.453-459
• /
• 1988

A new interpolation function, named modified raised-cosine interpolation, is proposed. This function is derived from the linear combination of weighted triangular and raised-cosine functions to reduce the effect of side lobes which incur the interpolation error. Interpolation error reduces significantly for higher-order convolutional interpolation functions of linear operators, but at the expense of resolution error due to the attenuation of main lobe. However, the proposed interpolation function enables us to reduce the side lobes as well as to preserve the main lobe. To prove practicality, this function is applied in image reconstruction and enlargement.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1994년도 추계학술대회
• /
• pp.134-137
• /
• 1994

In this paper, we describe an approach to ECG data coding based on a fractal theory of iterated contractive transformations defined piecewise. The main characteristic of this approach is that it relies on the assumption that signal redundancy can be efficiently captured and exploited through piecewise self-transformability on a block-wise basis. The variable range size technique is employed to reduce the reconstruction error. Large ranges are used for encoding the smooth waveform to yield high compression efficiency, and the smaller ranges are used for encoding rapidly varying parts of the signal to preserve the signal quality. The suggested algorithm was evaluated using MIT/BIH arrhythmia database. A high compression ratio is achieved with a relatively low reconstruction error.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권3호
• /
• pp.163-172
• /
• 2003

A stereo matching has been an important tool for the reconstruction of 3D terrain. The current state of stereo matching technology has reached the level where a very elaborate DEM(Digital Elevation Map) can be obtained. However, there still exist many factors causing DEM error in stereo matching. This paper propose a new method to reduce the error caused by the lack of significant features in the correlation window The proposed algorithm keeps the correlation window as small as possible, as long as there is a significant feature in the window. Experimental results indicate that the proposed method increases the DEM accuracy by $72.65\%$ in the plain area and $41.96\%$ in the mountain area over the conventional scheme. Comparisons with Kanade's result show that the proposed method eliminates spike type of errors more efficiently than Kanade's adaptive window technique and produces reliable DEM.

• 디지털콘텐츠학회 논문지
• /
• 제6권2호
• /
• pp.113-118
• /
• 2005

본 논문에서는 블록 코딩된 영상을 전송할 때 손실 블록을 재구성하는 기법을 제안한다. JPEG 영상이 무선 통신 상에서 전송될 때, 오류는 영상 전체 블록에 영향을 미칠 수 있다. 이는 JPEG 영상에서 dc 계수를 차분 코딩하기 때문이다. 이에 본 논문은 손실 블록과 인근 블록들 사이의 상관성을 이용하여 손실 정보를 재구성한다. 제안된 기법의 성능 평가를 위해 의도적인 블록 오류를 추가하여 실험한 결과, 객관적으로나 주관적으로 모두 좋은 결과를 얻었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.35-38
• /
• 2000

The method of Content-based Triangular Mesh Image representation in moving pictures makes better performance in prediction error ratio and visual efficiency than that of classical block matching. Specially if background and objects can be separated from image, the objects are designed by Irregular mesh. In this case this irregular mesh design has an advantage of increasing video coding efficiency. This paper presents the techniques of mesh generation, motion estimation using these mesh, uses image warping transform such as Affine transform for image reconstruction, and evaluates the content based mesh design through computer simulation.

• 한국멀티미디어학회논문지
• /
• 제8권12호
• /
• pp.1565-1571
• /
• 2005

Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).

• 한국정보과학회논문지:시스템및이론
• /
• 제32권4호
• /
• pp.168-176
• /
• 2005

본 논문에서는 모델 기반으로 한 장의 사진으로부터 중점 정보를 포함한 선분을 이용하여 물체를 3차원 재구성하는 방법을 제안한다. 미리 정의된 다면체를 원시기하모델로 사용하며 한 장의 영상으로부터 복원을 시도하였다. 미리 정의된 다면체 모델을 원시기하모델로 사용하며 사용자가 원시기하모델(primitive)의 각 대응점(correspondence point)을 사진에 매핑 시키는 것으로서 3차원 재구성이 수행된다. 기존의 모델기반 3차원 재구성은 카메라 파라미터들을 복원하거나 반복(iteration)을 통한 오차최소화 기법을 사용하였다. 하지만 본 논문은 원시기하모델에 포함되어 있는 선분들과 그 선분들의 중점 정보로부터 선분을 3차원 복원하며 복원된 선분들로부터 원시기하모델을 재구성하는 방법을 제안한다. 이러한 방법은 선분을 복원하는 단계에서 요구되는 최소한의 카메라 파라미터(focal length) 만으로 원시기하모델을 재구성 할 수 있다.

• 전자공학회논문지B
• /
• 제32B권9호
• /
• pp.1207-1214
• /
• 1995

We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.