• 한국지능시스템학회논문지
• /
• 제20권3호
• /
• pp.368-374
• /
• 2010

영상 분할 (Image Segmentation)은 패턴 인식, 환경 인식, 문서 분석을 위한 영상 처리 과정에서 가장 기본적인 단계이다. 영상 분할 방법들 중 Otsu의 영상의 정규화된 히스토그램의 분포 정보를 이용하여 클래스 간의 분산을 최대화 시키는 임계치값을 결정하는 자동 임계치값 선정방법이 가장 잘 알려진 방법이다. Otsu의 방법은 영상의 전 영역에 대한 히스토그램을 분석함으로써 영상의 부분적인 특성을 반영하여 임계치값을 결정하기는 어렵다. 본 논문에서는 이 어려움 해소하기 위하여 Context Fuzzy c-Means 알고리즘을 이용하여 영상을 여러 개의 부분 영역으로 나누고, 정의된 부 영역에 영상 분할 기법을 적용함으로써 부 영역들에 적합한 여러 개의 임계치값을 계산함으로써 영상 분할 성능을 개선하고자 하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 추계학술발표논문집(상)
• /
• 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.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.491-499
• /
• 2017

In this study, we proposed a new approach to segment ground and nonground points gained from a 3D laser range sensor. The primary aim of this research was to provide a fast and effective method for ground segmentation. In each frame, we divide the point cloud into small groups. All threshold points and start-ground points in each group are then analyzed. To determine threshold points we depend on three features: gradient, lost threshold points, and abnormalities in the distance between the sensor and a particular threshold point. After a threshold point is determined, a start-ground point is then identified by considering the height difference between two consecutive points. All points from a start-ground point to the next threshold point are ground points. Other points are nonground. This process is then repeated until all points are labelled.

• 한국멀티미디어학회논문지
• /
• 제17권5호
• /
• pp.547-555
• /
• 2014

This paper presents a method for hand segmentation using depth information, and adaptive threshold by means of histogram analysis and color clustering in HSV color model. We consider hand area as a nearer object to the camera than background on depth information. And the threshold of hand color is adaptively determined by clustering using the matching of color values on the input image with one of the regions of hue histogram. Experimental results demonstrate 95% accuracy rate. Thus, we confirmed that the proposed method is effective for hand segmentation in variations of hand color, scale, rotation, pose, different lightning conditions and any colored background.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권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.

• 제어로봇시스템학회논문지
• /
• 제17권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.

• International Journal of Internet, Broadcasting and Communication
• /
• 제11권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
• /
• 제12권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.

• International Journal of Computer Science & Network Security
• /
• 제24권9호
• /
• pp.93-96
• /
• 2024

The segmentation, detection, and extraction of infected tumour area from magnetic resonance (MR) images are a primary concern but a tedious and time taking task performed by radiologists or clinical experts, and their accuracy depends on their experience only. So, the use of computer aided technology becomes very necessary to overcome these limitations. In this study, to improve the performance and reduce the complexity involves in the medical image segmentation process, we have investigated many algorithm methods are available in medical imaging amongst them the Threshold technique brain tumour segmentation process gives an accurate result than other methods for MR images. The proposed method compare with the K-means clustering methods, it gives a cluster of images. The experimental results of proposed technique have been evaluated and validated for performance and quality analysis on magnetic resonance brain images, based on accuracy, process time and similarity of the segmented part. The experimental results achieved more accuracy, less running time and high resolution.

• 대한의용생체공학회:의공학회지
• /
• 제26권3호
• /
• pp.171-176
• /
• 2005

This paper proposes an automatic liver segmentation method using improved partial histogram threshold (PHT) algorithms. This method removes neighboring abdominal organs regardless of random pixel variation of contrast enhanced CT images. Adaptive multi-modal threshold is first performed to extract a region of interest (ROI). A left PHT (LPHT) algorithm is processed to remove the pancreas, spleen, and left kidney. Then a right PHT (RPHT) algorithm is performed for eliminating the right kidney from the ROI. Finally, binary morphological filtering is processed for removing of unnecessary objects and smoothing of the ROI boundary. Ten CT slices of six patients (60 slices) were selected to evaluate the proposed method. As evaluation measures, an average normalized area and area error rate were used. From the experimental results, the proposed automatic liver segmentation method has strong similarity performance as the MSM by medical Doctor.