• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.434-436
• /
• 2022

For 4th industrial revolution and the development of various communication media, unmanned and automation are rapidly progressing in various fields. In particular, high-level image processing technology is required in fields such as smart factories, autonomous driving technology, and intelligent CCTV. Accordingly, the importance of preprocessing in a system operating based on an image is increasing, and an algorithm for effectively removing noise from an image is attracting attention. In this paper, we propose a filtering algorithm using noise judgment and a segmentation mask in a complex noise environment. The proposed algorithm calculates the final output by switching the segmentation mask suitable for filtering by performing noise judgment on the pixel values of the input image. Simulation was conducted to verify the performance of the proposed algorithm, and the result image was compared and evaluated with the existing filter algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4624-4644
• /
• 2019

With the development of films, games and animation industry, analysis and reuse of human motion capture data become more and more important. Human motion segmentation, which divides a long motion sequence into different types of fragments, is a key part of mocap-based techniques. However, most of the segmentation methods only take into account low-level physical information (motion characteristics) or high-level data information (statistical characteristics) of motion data. They cannot use the data information fully. In this paper, we propose an unsupervised framework using both low-level physical information and high-level data information of human motion data to solve the human segmentation problem. First, we introduce the algorithm of CFSFDP and optimize it to carry out initial segmentation and obtain a good result quickly. Second, we use the ACA method to perform optimized segmentation for improving the result of segmentation. The experiments demonstrate that our framework has an excellent performance.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.255-274
• /
• 2006

Moving object boundary is very important for the accurate segmentation of moving object. We extract the moving object boundary from the moving object edge. But the object boundary shows broken boundaries so we develop a novel boundary linking algorithm to link the broken boundaries. The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundaries and searches for other terminating pixels to link in concentric circles clockwise within a search radius in the forward direction. The boundary linking algorithm guarantees the shortest distance linking. We register the background from the image sequence using the stationary background filtering. We construct two object masks, one object mask from the boundary linking and the other object mask from the initial moving object, and use these two complementary object masks to segment the moving objects. The main contribution of the proposed algorithms is the development of the novel object boundary linking algorithm for the accurate segmentation. We achieve the accurate segmentation of moving object, the segmentation of multiple moving objects, the segmentation of the object which has a hole within the object, the segmentation of thin objects, and the segmentation of moving objects in the complex background using the novel object boundary linking and the background automatically. We experiment the algorithms using standard MPEG-4 test video sequences and real video sequences of indoor and outdoor environments. The proposed algorithms are efficient and can process 70.20 QCIF frames per second and 19.7 CIF frames per second on the average on a Pentium-IV 3.4GHz personal computer for real-time object-based processing.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.7
• /
• pp.78-88
• /
• 1997

A three dimensional-two spatical dimensions plus time-image segmentation is widely used in a very low bit rate image sequence coding because it can solve the region correspondence problem. Mathematical morphology is a very efficient tool for the segmentation because it deals well with geometric features such as size, shape, contrast and connectivity. But if the motion in the image sequence is large in time axis, the conventional 3D morphological segmentation algorithm have difficulty in solving region correspondence problem. To alleviate this problem, we propose the hierarchical image sequence segmentation algorithm that uses the region motion information. Since the motion of a region in previous level affects that in current level uses the previous motion information to increase region correspondence. Simulation result shows improved performance for sequence frames with large motion.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.4
• /
• pp.201-210
• /
• 2010

We propose a new robust and accurate method for the numerical solution of medical image segmentation. The modified Allen-Cahn equation is used to model the boundaries of the image regions. Its numerical algorithm is based on operator splitting techniques. In the first step of the splitting scheme, we implicitly solve the heat equation with the variable diffusive coefficient and a source term. Then, in the second step, using a closed-form solution for the nonlinear equation, we get an analytic solution. We overcome the time step constraint associated with most numerical implementations of geometric active contours. We demonstrate performance of the proposed image segmentation algorithm on several artificial as well as real image examples.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.6
• /
• pp.1136-1142
• /
• 2010

In this study, an efficient removal algorithm for specular reflections in a tooth color image is proposed to minimize the artefact interrupting color image segmentation. The pixel values of RGB color channels are initially reversed to emphasize the features in reflective regions, and then those regions are automatically detected by utilizing perceptron artificial neural network model and those prominent intensities are corrected by applying a smoothing spatial filter. After correcting specular reflection regions, multiple seeds in the tooth candidates are selected to find the regional minima and MCWA(Marker-Controlled Watershed Algorithm) is applied to delineate the individual tooth region in a CCD tooth color image. Therefore, the accuracy in segmentation for separating tooth regions can be drastically improved with removing specular reflections due to the illumination effect.

• MALSORI
• /
• no.47
• /
• pp.131-140
• /
• 2003

We propose a new method of generating client models for HMM based text-dependent speaker verification system with only a small amount of training data. To make a client model, statistical methods such as segmental K-means algorithm are widely used, but they do not guarantee the quality or reliability of a model when only limited data are avaliable. In this paper, we propose a blind speech segmentation based on level building DTW algorithm as an alternative method to make a client model with limited data. In addition, considering the fact that voiced sounds have much more speaker-specific information than unvoiced sounds and energy of the former is higher than that of the latter, we also propose a new score evaluation method using the observation probability raised to the power of weighting factor estimated from the normalized log energy. Our experiment shows that the proposed methods are superior to conventional HMM based speaker verification system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.16.2-21
• /
• 1998

Old movies are often corrupted by randomly located blotches and scratches. In this paper were present an efficient method for detection and removal of these distortions. The presented method is composed of two separate steps: the detection process and the restoration process. In the detection process, blotch locations are detected through global motion segmentation, the sequential approach to motion segmentation, a robust model-fit criterion and so on, we form the algorithm for the algorithm for the global motion segmentation tuned to the blotch detection problem. In the restoration process, the missing data of the detected blotch areas are temporally extrapolated from the corresponding image areas at the preceding or the succeeding image frame with considering the global motion segmentation results. We apply the presented method to moving image sequences distorted by artificial blotches. The method works very well and provides a subjective improvement of picture quality.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.38-49
• /
• 1996

In this paper, we propose a fast hierarchical image segmentation using mathematical morphology. The proposed segmentation method is composed of five basic steps; multi-thresholding, open-close by reconstructing, mode operation, marker extraction, and region decision. In the multi-thresholding, an input image is simplified by Lloyd clustering algorithm. The multi-thresholded image then is more simplified by open-close by reconstruction and mode operating. In the region decision, to which region each uncertainty pixel belongs finally is decided by a watershed algorithm. Experimental results show that the quality of the segmentation results by the proposed method is not inferior to that by the conventional method and the average times elapsed by the proposed method can be reduced by one tghird of those elapsed by the conventional method.