• 한국콘텐츠학회논문지
• /
• 제13권10호
• /
• pp.62-70
• /
• 2013

DIBR(Depth Image Based Rendering)은 참조 영상 및 그와 관련된 깊이지도로부터 자유 시점의 영상을 생성하는 영상 합성 알고리즘이다. DIBR을 통한 영상 합성의 주요 난제 중 하나는 참조영상에서 가려져 있던 영역이 합성 시점에서 드러나게 되어 발생하는 홀의 처리 문제이다. 이를 위해 깊이지도 또는 시차지도의 전처리를 통해 홀의 크기 자체를 줄이기 위한 방안 및 발생된 홀 영역을 주위 신호를 이용하여 채우는 홀 채우기 알고리즘에 대한 연구가 활발히 진행되어 왔다. 일반적으로 홀의 크기를 줄이기 위한 방안으로는 깊이지도에 평활화를 적용하는 전처리 방식들이 주를 이룬다. 깊이지도를 평활화하면 큰 홀의 발생을 막을 수 있다는 장점을 갖게 되지만, 깊이 정보의 손실과 기하학적 왜곡이 발생한다는 단점 또한 동시에 나타난다. 본 논문에서는 이러한 단점을 극복하여 장면 합성 과정에서 발생하는 홀 채우기의 성능을 효과적으로 개선할 수 있는 시차지도 기반의 전처리 알고리즘을 제안한다.

• 음성과학
• /
• 제10권4호
• /
• pp.125-136
• /
• 2003

Speech coding techniques have been studied to reduce the complexity and bit rate but also to improve the sound quality. CELP type vocoder, has used as a one of standard, supports the great sound quality even low bit rate. In this paper, the preprocessing of input speech to reduce the bit rate is the different with the conventional vocoder. The different kinds of parameter are used for the preprocessing so this paper is compared with theses parameters for finding the more appropriate parameter for the vocoder. The parameters are used to synthesize the speech not to encode or decode for coding technique so we proposed the simple algorithm not to have the influence on the processing time or the computation time. The parameters in used the preprocessing step are speaking rate, duration and PSOLA technique.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2017년도 춘계학술발표대회
• /
• pp.787-790
• /
• 2017

Data quality is the main issue in the classification problems; generally, the presence of noisy instances in the training dataset will not lead to robust classification performance. Such instances may cause the generated decision tree to suffer from over-fitting and its accuracy may decrease. Decision trees are useful, efficient, and commonly used for solving various real world classification problems in data mining. In this paper, we introduce a preprocessing technique to improve the classification accuracy rates of the C4.5 decision tree algorithm. In the proposed preprocessing method, we applied the naive Bayes classifier to remove the noisy instances from the training dataset. We applied our proposed method to a real e-commerce sales dataset to test the performance of the proposed algorithm against the existing C4.5 decision tree classifier. As the experimental results, the proposed method improved the classification accuracy by 8.5% and 14.32% using training dataset and 10-fold crossvalidation, respectively.

• 한국컴퓨터정보학회논문지
• /
• 제24권4호
• /
• pp.51-56
• /
• 2019

In this paper, we propose an algorithm that can quickly generate and synthesize city maps in racing games. Racing games are characterized by moving a wide map rather than a fixed map, but designing and developing a wide map requires a lot of production time. This problem can be mitigated by creating a large map in the preprocessing step, but a fixed map makes the game tedious. It is also inefficient to process all the various maps in the preprocessing step. In order to solve this problem, we propose a technique to create a terrain pattern in the preprocessing process, to generate a map in real time, and to synthesize various maps randomly. In addition, we reduced unnecessary rendering computations by integrating view-dependent techniques into the proposed framework. This study was developed in Unity3D and can be used for various contents as well as racing game.

• 대한임베디드공학회논문지
• /
• 제15권6호
• /
• pp.307-316
• /
• 2020

Machine learning model data is highly affected by performance. preprocessing is needed to enable analysis of various types of data, such as letters, numbers, and special characters. This paper proposes a development environment that aims to process categorical and continuous data according to the type of missing values in stage 1, implementing the function of selecting the best performing algorithm in stage 2 and automating the process of checking model performance in stage 3. Using this model, machine learning models can be created without prior knowledge of data preprocessing.

• 융합신호처리학회논문지
• /
• 제14권2호
• /
• pp.90-94
• /
• 2013

만주문자로 기록된 문헌의 디지털화에 대한 연구는 아직 초기 단계이다. 본 논문은 만주문자의 인식을 위한 전처리 방법을 제안한다. 만주문자의 전처리 단계는 세선화와 문자단위 분리가 중요하다. 본 논문에서는 기존 세선화 방법인 Hilditch 세선화 알고리듬을 개선하여 만주문자의 세선화 오류를 보완하고 각 문자단위를 좌우측으로 분류하지 않고 문자의 삐침이 존재하는 위치점 사이의 중심점을 이용하여 분리하여 내는 실제적인 방법을 제안하고 있다. 실험을 통하여 만주문자로 이루어진 단어의 세선화와 문자단위 분류에 적용하여 그 유효성을 보여주고 있다.

• 대한원격탐사학회지
• /
• 제3권1호
• /
• pp.25-39
• /
• 1987

The purpose of this research is to develop the Automatic Fingerprint Verfication System by digital computer based on specially in PC level. Fingerprint is used as means of personal identity verification in view of that it has the high reliability and safety. Fingerprint pattern recognition algorithm is constitute of 3 stages, namely of the preprocessing, the feature extraction and the recognition. The preprocessing stage includes smoothing, binarization, thinning and restoration. The feature extraction stage includes the extraction of minutiae and its features. The recognition stage includes the registration and the matching score calculation which measures the similarity between two images. Tests for this study with 325 pairs of fingerprint resulted in 100% of separation which which in turn is turned out to be the reliability of this algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3433-3446
• /
• 2019

Aiming at the high complexity of traditional single-channel demodulation algorithm for PCMA signals, a new demodulation algorithm based on neural network is proposed to reduce the complexity of demodulation in the system of non-cooperative PCMA communication. The demodulation network is trained in this paper, which combines the preprocessing module and decision module. Firstly, the preprocessing module is used to estimate the initial parameters, and the auxiliary signals are obtained by using the information of frequency offset estimation. Then, the time-frequency characteristic data of auxiliary signals are obtained, which is taken as the input data of the neural network to be trained. Finally, the decision module is used to output the demodulated bit sequence. Compared with traditional single-channel demodulation algorithms, the proposed algorithm does not need to go through all the possible values of transmit symbol pairs, which greatly reduces the complexity of demodulation. The simulation results show that the trained neural network can greatly extract the time-frequency characteristics of PCMA signals. The performance of the proposed algorithm is similar to that of PSP algorithm, but the complexity of demodulation can be greatly reduced through the proposed algorithm.

• International Journal of CAD/CAM
• /
• 제9권1호
• /
• pp.31-36
• /
• 2010

3D point data acquired from laser scan or stereo vision can be quite noisy. A preprocessing step is often needed before a surface reconstruction algorithm can be applied. In this paper, we propose a nonparametric approach for noisy point data preprocessing. In particular, we proposed an anisotropic kernel based nonparametric density estimation method for outlier removal, and a hill-climbing line search approach for projecting data points onto the real surface boundary. Our approach is simple, robust and efficient. We demonstrate our method on both real and synthetic point datasets.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.275-276
• /
• 2007

In this paper, we propose an efficient illumination preprocessing algorithm for face recognition. One of the best known illumination preprocessing method, based on anisotropic smoothing, enhances the edge information, but instead deteriorates the contrast of the original image. Our proposed method reduces the deterioration of the contrast while enhancing the edge information, and thus the preprocessed image does not lose features like Gabor features of the original images much.. The effectiveness of the proposed illumination preprocessing method is verified through experiments of face recognition.