• The Journal of the Korea Contents Association
• /
• v.14 no.12
• /
• pp.555-564
• /
• 2014

The boundary noise in image syntheses using DIBR consists of noisy pixels that are separated from foreground objects into background region. It is generated mainly by edge misalignment between the reference image and depth map or blurred edge in the reference image. Since hole areas are generally filled with neighboring pixels, boundary noise adjacent to the hole is the main cause of quality degradation in synthesized images. To solve this problem, a new boundary noise removal algorithm using a preprocessing of the depth map is proposed in this paper. The most common way to eliminate boundary noise caused by boundary misalignment is to modify depth map so that the boundary of the depth map can be matched to that of the reference image. Most conventional methods, however, show poor performances of boundary detection especially in blurred edge, because they are based on a simple boundary search algorithm which exploits signal gradient. In the proposed method, a two-step hierarchical approach for boundary detection is adopted which enables effective boundary detection between the transition and background regions. Experimental results show that the proposed method outperforms conventional ones subjectively and objectively.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.818-825
• /
• 2016

The existing R-peak detection research suggests improving the distortion of the signal such as baseline variations in ECG signals by using preprocessing techniques such as a bandpass filtering. However, preprocessing can introduce another distortion, as it can generate a false detection in the R-wave detection. In this paper, we propose an R-peak detection algorithm in ECG signal, based on primitive signal in order to detect reliably an R-peak in baseline variation. First, the proposed algorithm decides the primitive signal to represent the QRS complex in ECG signal, and by scaling the time axis and voltage axis, extracts multiple primitive signals. Second, the algorithm detects the candidates of the R-peak using the value of the voltage. Third, the algorithm measures the similarity between multiple primitive signals and the R-peak candidates. Finally, the algorithm detects the R-peak using the mean and the standard deviation of similarity. Throughout the experiment, we confirmed that the algorithm detected reliably a QRS group similar to multiple primitive signals. Specifically, the algorithm can achieve an R-peak detection rate greater than an average rate of 99.9%, based on eight records of MIT-BIH ADB used in this experiment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.52-55
• /
• 1997

This paper discusses an automatic visual-servoing system, in which a laser and a CCD camera are used for imaging the pattern of joint groove. The algorithm used here is simple and robust to find out the gap width and gap center. As a consequence, the speed of algorithm is very fast and optimized. A feature of this system is that it processes only by summing the vertical line and horizontal line of screen without any image preprocessing in order to get the energy information of lines alternatively. It is practical and useful for the system requiring a fast process time of vision.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2959-2961
• /
• 2005

This study presents a human sensibility evaluation algorithm based on the personality-group templates of EEGs. For this objective, 16-channel EEG signals of 10 adults are collected. After Preprocessing of EEG, various EEG Parameters are estimated and compared. The proposed algorithm uses LP coefficients, neural network and pre-/post-processing techniques. The results showed good performance in human sensibility evaluation.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.79-92
• /
• 1995

In this paper we present an efficient parallel simulation algorithm in recursive feedforward network(RFN) which can reduce the simulation delay while decreasing the number of null messages compared to the previous result. As a preprocessing step, we first determine the group and type of each oupput channel for the nodes using DFS(Depth First Search) algorithm, and show that the number of null messages as well as the simulation scheme. By the new scheme we decide if null messages are sent to the output channels or not according to the group to which it belongs.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.637-640
• /
• 1999

In this Paper we show the LCD simulator for defect inspection using image processing algorithm and neural network. The defect inspection algorithm of the LCD consists of preprocessing, feature extraction and defect classification. Preprocess removes noise from LCD image, using morphology operator and neural network is used for the defect classification. Sample images with scratch, pinhole, and spot from real LCD color filter image are used. The proposed algorithms show that defect detected and classified in the ratio of 92.3% and 94.6 respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.560-562
• /
• 2000

본 논문에서는 정보블록알고리즘(IBPA;Information Block Preprocessing Algorithm)을 이용한 정보블록 정렬알고리즘 (IBSA; Information Block Sort Algotithm)을 제안하고 그 성능을 평가하였다. IBSA의 시간복잡도는 O(N)이며, 데이터의 분포상태에 영향을 받지 않는다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, 중복값 허용의 경우 (a)는 퀵 정렬의 32.42%, 기수정렬의 9%정도의 비교회수만으로도 정렬할 수 있음을 보여주었으며, 중복값이 없는 경우 (b)는 퀵 정렬의 53.12%, 기수정렬의 12.79%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.835-836
• /
• 2006

For non-contact structure vibration displacement measurement system, an algorithm for image processing using high speed CCD camera is introduced. The system sets the target to the structure, take picture using camera and image processing is performed to display the vibration data. The algorithm flow is basic preprocessing, projection data generation and curve fitting to find three crossing points for calibration or one center point in limited area.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.207-213
• /
• 2004

The layered depth image (LDI) is an efficient approach to represent three-dimensional objects with complex geometry for image-based rendering (IBR). LDI contains several attribute values together with multiple layers at each pixel location. In this paper, we propose an efficient preprocessing algorithm to compress depth information of LDI. Considering each depth value as a point in the two-dimensional space, we compute the minimum distance between a straight line passing through the previous two values and the current depth value. Finally, the minimum distance replaces the current attribute value. The proposed algorithm reduces the variance of the depth information , therefore, It Improves the transform and coding efficiency.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.12
• /
• pp.38-44
• /
• 2019

Various automation studies have been conducted to detect defective products based on product images. In the case of machine vision-based studies, size and color error are detected through a preprocessing process. A situation may arise in which the main features are removed during the preprocessing process, thereby decreasing the accuracy. In addition, complex systems are required to detect various kinds of defects. In this study, we designed and developed a system to detect errors by analyzing various conditions of defective products. We designed the deep learning algorithm to detect the defective features from the product images during the automation process using a convolution neural network (CNN) and verified the performance by applying the algorithm to the checker-switch failure detection system. It was confirmed that all seven error characteristics were detected accurately, and it is expected that it will show excellent performance when applied to automation systems for error detection.