• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.39-42
• /
• 1994

An automatic multi-threshold algorithm for segmentation of 2D ultrasound images based on average filtering and the characteristics of speckle noise in 2D ultrasound image is proposed. To do this, we investigate the histogram of difference between $7{\times}7$ averaging histogram and $3{\times}3$ averaging histogram. And, we find zero crossing points in the positive portion of the differenced histogram and select middle points of the zero crossing points. We assign these selected points to characteristic points. The thresholds are the center of two characteristic points. Then we segment 2D ultrasound image by using these thresholds and extract edges from applying edge operator to optimal segmented image. Experimental results show that the segmented regions are devided accurately around the homogeneous region.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.2
• /
• pp.257-266
• /
• 2007

In many multimedia applications, image compression is required to substantially reduce the amount of image data. This compression, however, sometimes brings artifacts. Typical artifacts are blocking artifacts and mosquito noise in DCT-coded images, and ringing artifacts around edges in wavelet-coded images. We propose a new directional postprocessing algorithm, which includes detection of the edge direction, interpolation scheme, and directional nonlinear filtering, to enhance the quality of decoded images. Simulation results show that the proposed algorithm is as effective as or more effective than other nonlinear filtering techniques.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.179-184
• /
• 2004

This paper presents an image segmentation algorithm to obtain the 3D body shape data that the grid pattern and the body contour lute in the background image are extracted using the new proposed hybrid method. The body contour line is extracted based on maximum biased anisotropic recognition(MaxBAR) algorithm which recognizes the most strong and robust edges in the image since the normal derivative at the edges is large, while the tangential derivatives can be small. The grid patterns within body contour lines are extracted by grid pattern detection (GPD). The body contour lilies and the grid patterns are combined. The consecutive run test based on heuristic method is used to link the disconnected line and reduce noise line. This proposed segmentation method is more effective than the conventional method which uses a gradient and a laplacian operator, verified with application two conventional method.

• Journal of the Korean Society of Combustion
• /
• v.20 no.1
• /
• pp.24-31
• /
• 2015

Flame structure, which contains a useful information for studying combustion instability of the flame, is often quantitatively visualized with PLIF (planar laser-induced fluorescence) and/or chemiluminescence images. The latter, a line-integral of a flame property, needs to be preprocessed before being inverted, mainly due to its inherent noise and the axisymmetry assumption of the inversion. A preprocessing scheme utilizing multi-division of ROI (region of interest) of the chemiluminescence image is proposed. Its feasibility has been tested with OH PLIF and $OH^*$ chemiluminescence images of SNG (synthetic natural gas) swirl-stabilized flames taken from a model gas turbine combustor. It turns out that the multi-division technique outperforms two conventional ones: those are, one without preprocessing and the other with uni-division preprocessing, reconstructing the SNG flame structure much better than its two counterparts, when compared with the corresponding OH PLIF images. It is also found that the Canny edge detection algorithm used for detecting edges in the multi-division method works better than the Sobel algorithm does.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.494-507
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in 8 ${\times}$ 8 MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi's scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In 4 ${\times}$ 4 MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.204-213
• /
• 2008

In this paper, we present the practical application of an Unscented Kalman Filter (UKF) for an Indoor Mobile Localization System using ultrasonic sensors. It is true that many kinds of localization techniques have been researched for several years in order to contribute to the realization of a ubiquitous system; particularly, such a ubiquitous system needs a high degree of accuracy to be practical and efficient. Unfortunately, a number of localization systems for indoor space do not have sufficient accuracy to establish any special task such as precise position control of a moving target even though they require comparatively high developmental cost. Therefore, we developed an Indoor Mobile Localization System having high localization performance; specifically, the Unscented Kalman Filter is applied for improving the localization accuracy. In addition, we also present the additive filter named 'Pre-filtering' to compensate the performance of the estimation algorithm. Pre-filtering has been developed to overcome negative effects from unexpected external noise so that localization through the Unscented Kalman Filter has come to be stable. Moreover, we tried to demonstrate the performance comparison of the Unscented Kalman Filter and another estimation algorithm, such as the Unscented Particle Filter (UPF), through simulation for our system.

• 전자공학회논문지 IE
• /
• v.48 no.2
• /
• pp.26-31
• /
• 2011

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. From some experiments results, the proposed algorithms show that defect detected and classified in the ratio of 92.3% and 94.5 respectively. Accordingly, in this paper, a possibility of practical implementation of the LCD defect inspection system is finally suggested.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.19-25
• /
• 2004

In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in terms of path metrics. Equivalently, multiple channel estimates are maintained and updated once a single symbol is received. Second, the best channel estimate from the above operation will be adopted to set up the whole trellis. The conventional adaptive Viterbi algorithm is then applied to detect the signal and further update the channel estimate alternately. A small delay is introduced for the symbol detection and the decision feedback to smooth the noise impact. An automatic switch between the above two operations is also proposed by exploiting the evolution of path metrics and the linear constraint inherent in the trellis mapping. Simulation has shown an overall excellent performance of the proposed scheme in terms of mean square error (MSE) for channel estimation, robustness to the initial channel guess, computational complexity, and channel equalization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.918-920
• /
• 2011

In this paper, a simple edge pattern classification method is proposed for detecting straight line segments in an image corrupted by impulse noise. Corrupted images have complicated edge patterns. To detect straight line from an complicated edge pattern, it is needed to simplify the entire edge. The proposed algorithm separates the entire edge into 4 directional partial edge patterns. Each line segment is separated from the partial edge image where several line segments are overlapped, and then the straight line is detected. The results of the experiments emphasize that the proposed algorithm is simple but accurate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.330-343
• /
• 2011

In this paper, we propose two schemes to reduce the complexity of fixed-complexity sphere decoder (FSD) algorithm in the ordering and tree-search stages, respectively, while achieving quasi-ML performance. In the ordering stage, we propose a QR-decomposition-based FSD signal ordering based on the zero-forcing criterion (FSD-ZF-SQRD) that requires only a few number of additional complex flops compared to the unsorted QRD. Also, the proposed ordering algorithm is extended using the minimum mean square error (MMSE) criterion to achieve better performance. In the tree-search stage, we introduce a threshold-based complexity reduction approach for the FSD depending on the reliability of the signal with the largest noise amplification. Numerical results show that in $8{\times}8$ MIMO system, the proposed FSD-ZF-SQRD and FSD-MMSE-SQRD only require 19.5% and 26.3% of the computational efforts required by Hassibi’s scheme, respectively. Moreover, a third threshold vector is outlined which can be used for high order modulation schemes. In $4{\times}4$ MIMO system using 16-QAM and 64-QAM, simulation results show that when the proposed threshold-based approach is employed, FSD requires only 62.86% and 53.67% of its full complexity, respectively.