• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.891-894
• /
• 2004

This paper proposes an improved image segmentation algorithm by the watershed algorithm based on the local adaptive threshold on local minima search and the fixing threshold on label allocation. The previous watershed algorithm generates the problem of over-segmentation. The over-segmentation makes the boundary in the inaccuracy region by occurring around the object. In order to solve those problems we quantize the input color image by the vector quantization, remove noise and find the gradient image. We sorted local minima applying the local adaptive threshold on local minima search of the input color image. The simulation results show that the proposed algorithm controls over-segmentation and makes the fine boundary around segmented region applying the fixing threshold based on sorted local minima on label allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1843-1859
• /
• 2013

The continuous increase of the spatial resolution of remote sensing images brings great challenge to image analysis and processing. Traditional prior knowledge-based region detection and target recognition algorithms for processing high resolution remote sensing images generally employ a global searching solution, which results in prohibitive computational complexity. In this paper, a more efficient region of interest (ROI) detection algorithm based on visual attention and threshold segmentation (VA-TS) is proposed, wherein a visual attention mechanism is used to eliminate image segmentation and feature detection to the entire image. The input image is subsampled to decrease the amount of data and the discrete moment transform (DMT) feature is extracted to provide a finer description of the edges. The feature maps are combined with weights according to the amount of the "strong points" and the "salient points". A threshold segmentation strategy is employed to obtain more accurate region of interest shape information with the very low computational complexity. Experimental statistics have shown that the proposed algorithm is computational efficient and provide more visually accurate detection results. The calculation time is only about 0.7% of the traditional Itti's model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.6
• /
• pp.587-595
• /
• 2011

In this paper, we focus on the issue of automatic selection for multi-level threshold, and we greatly improve the efficiency of Otsu's method for image segmentation based on genetic algorithm. We have investigated and evaluated the performance of the Otsu and Valley-emphasis threshold methods. Based on this observation we propose a method for automatic threshold method that segments an image into more than two regions with high performance and processing in real-time. Our paper introduced new peak detection, combines with evolution algorithm using MAGA (Modified Adaptive Genetic Algorithm) and HCA (Hill Climbing Algorithm), to find the best threshold automatically, accurately, and quickly. The experimental results show that the proposed evolutionary algorithm achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.3
• /
• pp.7-11
• /
• 2020

Enormous methods have been proposed for the detection and segmentation of blur and non-blur regions of the images. Due to the limited available information about the blur type, scenario and the level of blurriness, detection and segmentation is a challenging task. Hence, the performance of the blur measure operators is an essential factor and needs improvement to attain perfection. In this paper, we propose an effective blur measure based on the local binary pattern (LBP) with the adaptive threshold for blur detection. The sharpness metric developed based on LBP uses a fixed threshold irrespective of the blur type and level which may not be suitable for images with large variations in imaging conditions and blur type and level. Contradictory, the proposed measure uses an adaptive threshold for each image based on the image and the blur properties to generate an improved sharpness metric. The adaptive threshold is computed based on the model learned through the support vector machine (SVM). The performance of the proposed method is evaluated using a well-known dataset and compared with five state-of-the-art methods. The comparative analysis reveals that the proposed method performs significantly better qualitatively and quantitatively against all the methods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.1
• /
• pp.64-75
• /
• 2003

Medical image segmentation is the process by which an original image is partitioned into some homogeneous regions like bones, soft tissues, etc. This study demonstrates an automatic medical image segmentation technique based on independent component analysis. Independent component analysis is a generalization of principal component analysis which encodes the higher-order dependencies in the input in addition to the correlations. It extracts statistically independent components from input data. Use of automatic medical image segmentation technique using independent component analysis under the assumption that medical image consists of some statistically independent parts leads to a method that allows for more accurate segmentation of bones from CT data. The result of automatic segmentation using independent component analysis with square test data was evaluated using probability of error(PE) and ultimate measurement accuracy(UMA) value. It was also compared to a general segmentation method using threshold based on sensitivity(True Positive Rate), specificity(False Positive Rate) and mislabelling rate. The evaluation result was done statistical Paired-t test. Most of the results show that the automatic segmentation using independent component analysis has better result than general segmentation using threshold.

• 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.

• Korean Journal of Radiology
• /
• v.20 no.1
• /
• pp.102-113
• /
• 2019

Objective: To assess the accuracy and potential bias of computed tomography (CT) ventricular volumetry using semiautomatic three-dimensional (3D) threshold-based segmentation in repaired tetralogy of Fallot, and to compare them to those of two-dimensional (2D) magnetic resonance imaging (MRI). Materials and Methods: This retrospective study evaluated 32 patients with repaired tetralogy of Fallot who had undergone both cardiac CT and MRI within 3 years. For ventricular volumetry, semiautomatic 3D threshold-based segmentation was used in CT, while a manual simplified contouring 2D method was used in MRI. The indexed ventricular volumes were compared between CT and MRI. The indexed ventricular stroke volumes were compared with the indexed arterial stroke volumes measured using phase-contrast MRI. The mean differences and degrees of agreement in the indexed ventricular and stroke volumes were evaluated using Bland-Altman analysis. Results: The indexed end-systolic (ES) volumes showed no significant difference between CT and MRI (p > 0.05), while the indexed end-diastolic (ED) volumes were significantly larger on CT than on MRI (93.6 ± 17.5 mL/m² vs. 87.3 ± 15.5 mL/m² for the left ventricle [p < 0.001] and 177.2 ± 39.5 mL/m² vs. 161.7 ± 33.1 mL/m² for the right ventricle [p < 0.001], respectively). The mean differences between CT and MRI were smaller for the indexed ES volumes (2.0-2.5 mL/m²) than for the indexed ED volumes (6.3-15.5 mL/m²). CT overestimated the stroke volumes by 14-16%. With phase-contrast MRI as a reference, CT (7.2-14.3 mL/m²) showed greater mean differences in the indexed stroke volumes than did MRI (0.8-3.3 mL/m²; p < 0.005). Conclusion: Compared to 2D MRI, CT ventricular volumetry using semiautomatic 3D threshold-based segmentation provides comparable ES volumes, but overestimates the ED and stroke volumes in patients with repaired tetralogy of Fallot.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.39-46
• /
• 2019

This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.661-680
• /
• 2016

The vehicle license plate recognition (VLPR) system analyzes and monitors the speed of vehicles, theft of vehicles, the violation of traffic rules, illegal parking, etc., on the motorway. The VLPR consists of three major parts: license plate detection (LPD), license plate character segmentation (LPCS), and license plate character recognition (LPCR). This paper presents an efficient method for the LPCS and LPCR of Korean vehicle license plates (LPs). LP tilt adjustment is a very important process in LPCS. Radon transformation is used to correct the tilt adjustment of LP. The global threshold segmentation method is used for segmented LP characters from two different types of Korean LPs, which are a single row LP (SRLP) and double row LP (DRLP). The cross-correlation matching method is used for LPCR. Our experimental results show that the proposed methods for LPCS and LPCR can be easily implemented, and they achieved 99.35% and 99.85% segmentation and recognition accuracy rates, respectively for Korean LPs.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.607-613
• /
• 2011

In this paper, we propose a hand image segmentation method using the dynamic threshold values on input images with various lighting and background attributes. First, a moving hand silhouette is extracted using the camera input difference images, Next, based on the R,G,B histogram analysis of the extracted hand silhouette area, the threshold interval for each R, G, and B is calculated on run-time. Finally, the hand area is segmented using the thresholding and then a morphology operation, a connected component analysis and a flood-fill operation are performed for the noise removal. Experimental results on various input images showed that our hand segmentation method provides high level of accuracy and relatively fast stable results without the need of the fixed threshold values. Proposed methods can be used in the user interface of mixed reality applications.