• Progress in Medical Physics
• /
• v.15 no.2
• /
• pp.70-76
• /
• 2004

The most important work for early detection of liver cancer and decision of its characteristic and location is good segmentation of a liver region from other abdominal organs. This paper proposes a fully automatic liver segmentation algorithm based on the abdominal morphology characteristic as an easy and efficient method. Multi-modal threshold as pre-processing is peformed and a spine is segmented for finding morphological coordinates of an abdomen. Then the liver region is extracted using C-class maximum a posteriori (MAP) decision and morphological filtering. In order to estimate results of the automatic segmented liver region, area error rate (AER) and correlation coefficients of rotational binary region projection matching (RBRPM) are utilized. Experimental results showed automatic liver segmentation obtained by the proposed algorithm provided strong similarity to manual liver segmentation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.221-230
• /
• 2002

This paper presents a new moving object segmentation algorithm using markov random field. The algorithm is based on signal detection theory. That is to say, motion of moving object is decided by binary decision rule, and false decision is corrected by markov random field model. The procedure toward complete segmentation consists of two steps: motion detection and object segmentation. First, motion detection decides the presence of motion on velocity vector by binary decision rule. And velocity vector is generated by optical flow. Second, object segmentation cancels noise by Bayes rule. Experimental results demonstrate the efficiency of the presented method.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.491-500
• /
• 2013

A connected component analysis from a binary image is a popular character segmentation method but occasionally fails to segment the characters owing to image noise and uneven illumination. A multimethod binarization scheme that incorporates two or more binary images is a novel solution, but selection of binarization methods has never been analyzed before. This paper reveals the best combination of binarization methods and parameters and presents an in-depth analysis of the multimethod binarization scheme for better character segmentation. We carry out an extensive quantitative evaluation, which shows a significant improvement over conventional single-method binarization methods. Experiment results of six binarization methods and their combinations with different test images are presented.

• Communications for Statistical Applications and Methods
• /
• v.12 no.1
• /
• pp.139-147
• /
• 2005

It is interesting to locate homogeneous segments within a DNA sequence. Suppose that the DNA sequence has segments within which the observations follow the same residue frequency distribution, and between which observations have different distributions. In this setting, change points correspond to the end points of these segments. This article explores the use of a binary segmentation procedure in detecting the change points in the DNA sequence. The change points are determined using a sequence of nested hypothesis tests of whether a change point exists. At each test, we compare no change-point model with a single change-point model by using the Bayesian information criterion. Thus, the method circumvents the computational complexity one would normally face in problems with an unknown number of change points. We illustrate the procedure by analyzing the genome of the bacteriophage lambda.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.483-496
• /
• 2005

We consider the power law process which is assumed to have multiple changepoints. We propose a binary segmentation procedure for locating all existing changepoints. We select one model between the no-changepoints model and the single changepoint model by the Bayes factor. We repeat this procedure until no more changepoints are found. Then we carry out a multiple test based on the Bayes factor through the intrinsic priors of Berger and Pericchi (1996) to investigate the system behaviour of failure times. We demonstrate our procedure with a real dataset and some simulated datasets.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.345-346
• /
• 2009

The segmentation of vessel including portal vein, hepatic vein and artery, from Computed Tomography (CT) images plays an important role in the therapeutic strategies for hepatic diseases. Representing segmented vessels in three dimensional spaces is extremely useful for doctors to plan liver surgery. In this paper, proposed method is focused on smoothing technique of segmented 3D liver vessels, which derived from 3D region growing approach. A pixel expand algorithm has been developed first to avoid vessel lose and disconnection cased by the next smoothing technique. And then a binary volume filtering technique has been implemented and applied to make the segmented binary vessel volume qualitatively smoother. This strategy uses an iterative relaxation process to extract isosurfaces from binary volumes while retaining anatomical structure and important features in the volume. Hard and irregular place in volume image has been eliminated as shown in the result part, which also demonstrated that proposed method is a suitable smoothing solution for post processing of fine vessel segmentation.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.48-56
• /
• 2006

This paper proposes an efficient preprocessing technique for a binary centroid tracker in correlated image sequences. It is known that the following factors determine the performance of the binary centroid target tracker: (1) an efficient real-time preprocessing technique, (2) an exact target segmentation from cluttered background images and (3) an intelligent tracking window sizing, and etc. The proposed centroid tracker consists of an adaptive segmentation method based on novel distance features and an efficient real-time preprocessing technique in order to enhance the distinction between the objects of interest and their local background. Various tracking experiments using synthetic images as well as real Forward-Looking InfraRed (FLIR) images are performed to show the usefulness of the proposed methods.

• Journal of the Semiconductor & Display Technology
• /
• v.18 no.4
• /
• pp.110-115
• /
• 2019

Blur detection and segmentation play vital role in many computer vision applications. Among various methods, local binary pattern based methods provide reasonable blur detection results. However, in conventional local binary pattern based methods, the blur map is computed by using a fixed threshold irrespective of the type and level of blur. It may not be suitable for images with variations in imaging conditions and blur. In this paper we propose an effective method based on local binary pattern with adaptive threshold for blur detection. The adaptive threshold is computed based on the model learned through the multinomial logistic regression. The performance of the proposed method is evaluated using different datasets. The comparative analysis not only demonstrates the effectiveness of the proposed method but also exhibits it superiority over the existing methods.

• Journal of the Optical Society of Korea
• /
• v.19 no.2
• /
• pp.149-153
• /
• 2015

A digital micro-mirror device (DMD) has the potential to modulate an incident wave with high speed, and the application for holographic display has been studied by many researchers. However, the quality of reconstructed image isn't good in comparison with that from a gray-scale amplitude-only hologram since it is a binary amplitude-only spatial light modulator (SLM). In this paper, we suggest a method generating a set of binary holograms to improve the quality of the reconstructed image. Here, we are concerned with the case for which the object plane is positioned at the Fourier domain of the plane of the SLM. In this case, any point in the Fourier plane is related to all points in the hologram. So there is a chance to generate a set of binary holograms illuminated by incident wave with constant optical power. Moreover, we find an interesting fact that the quality of reconstructed image is improved when the spatial frequency bandwidth of the binary hologram is limited. Therefore, we propose an iterative segmentation algorithm generating a set of binary holograms that are designed to be illuminated by the wave with constant optical power. The feasibility of our method is experimentally confirmed with a DMD.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.806-816
• /
• 2009

Character recognition system consists of four step; text localization, text segmentation, character segmentation, and recognition. The character segmentation is very important and difficult because of noise, illumination, and so on. For high recognition rates of the system, it is necessary to take good performance of character segmentation algorithm. Many algorithms for character segmentation have been developed up to now, and many people have been recently making researches in segmentation of touching or overlapping character. Most of algorithms cannot apply to the text regions of management number marked on the slab in steel image, because the text regions are irregular such as touching character by strong illumination and by trouble of nozzle in marking machine, and loss of character. It is difficult to gain high success rate in various cases. This paper describes a new algorithm of character segmentation to recognize slab management number marked on the slab in the steel image. It is very important that pre-processing step is to convert gray image to binary image without loss of character and touching character. In this binary image, non-touching characters are simply separated by using vertical projection profile. For separating touching characters, after we use combined profile to find candidate points of boundary, decide real character boundary by using method based on recognition. In recognition step, we remove noise of character images, then recognize respective character images. In this paper, the proposed algorithm is effective for character segmentation and recognition of various text regions on the slab in steel image.