• Title/Summary/Keyword: adaptive thresholding

Search Result 129, Processing Time 0.025 seconds

A Segmentation Method for Counting Microbial Cells in Microscopic Image

  • Kim, Hak-Kyeong;Lee, Sun-Hee;Lee, Myung-Suk;Kim, Sang-Bong
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.4 no.3
    • /
    • pp.224-230
    • /
    • 2002
  • In this paper, a counting algorithm hybridized with an adaptive automatic thresholding method based on Otsu's method and the algorithm that elongates markers obtained by the well-known watershed algorithm is proposed to enhance the exactness of the microcell counting in microscopic images. The proposed counting algorithm can be stated as follows. The transformed full image captured by CCD camera set up at microscope is divided into cropped images of m$\times$n blocks with an appropriate size. The thresholding value of the cropped image is obtained by Otsu's method and the image is transformed into binary image. The microbial cell images below prespecified pixels are regarded as noise and are removed in tile binary image. The smoothing procedure is done by the area opening and the morphological filter. Watershed algorithm and the elongating marker algorithm are applied. By repeating the above stated procedure for m$\times$n blocks, the m$\times$n segmented images are obtained. A superposed image with the size of 640$\times$480 pixels as same as original image is obtained from the m$\times$n segmented block images. By labeling the superposed image, the counting result on the image of microbial cells is achieved. To prove the effectiveness of the proposed mettled in counting the microbial cell on the image, we used Acinetobacter sp., a kind of ammonia-oxidizing bacteria, and compared the proposed method with the global Otsu's method the traditional watershed algorithm based on global thresholding value and human visual method. The result counted by the proposed method shows more approximated result to the human visual counting method than the result counted by any other method.

An Adaptive Thresholding of the Nonuniformly Contrasted Images by Using Local Contrast Enhancement and Bilinear Interpolation (국소 영역별 대비 개선과 쌍선형 보간에 의한 불균등 대비 영상의 효율적 적응 이진화)

  • Jeong, Dong-Hyun;Cho, Sang-Hyun;Choi, Heung-Moon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.51-57
    • /
    • 1999
  • In this paper, an adaptive thresholding of the nonuniformly contrasted images is proposed through using the contrast pre-enhancement of the local regions and the bilinear interpolation between the local threshold values. The nonuniformly contrasted image is decomposed into 9${\times}$9 sized local regions, and the contrast is enhanced by intensifying the gray level difference of each low contrasted or blurred region. Optimal threshold values are obtained by iterative method from the gray level distribution of each contrast-enhanced local region. Discontinuities are reduced at the region of interest or at the characters by using bilinear interpolation between the neighboring threshold surfaces. Character recognition experiments are conducted using backpropagation neural network on the characters extracted from the nonuniformly contrasted document, PCB, and wafer images binarized through using the proposed thresholding and the conventional thresholding methods, and the results prove the relative effectiveness of the proposed scheme.

  • PDF

Adaptive Optimal Thresholding for the Segmentation of Individual Tooth from CT Images (CT영상에서 개별 치아 분리를 위한 적응 최적 임계화 방안)

  • Heo, Hoon;Chae, Ok-Sam
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.3
    • /
    • pp.163-174
    • /
    • 2004
  • The 3D tooth model in which each tooth can be manipulated individualy is essential component for the orthodontic simulation and implant simulation in dental field. For the reconstruction of such a tooth model, we need an image segmentation algorithm capable of separating individual tooth from neighboring teeth and alveolar bone. In this paper we propose a CT image normalization method and adaptive optimal thresholding algorithm for the segmenation of tooth region in CT image slices. The proposed segmentation algorithm is based on the fact that the shape and intensity of tooth change gradually among CT image slices. It generates temporary boundary of a tooth by using the threshold value estimated in the previous imge slice, and compute histograms for the inner region and the outer region seperated by the temporary boundary. The optimal threshold value generating the finnal tooth region is computed based on these two histogram.

A Fast and Robust License Plate Detection Algorithm Based on Two-stage Cascade AdaBoost

  • Sarker, Md. Mostafa Kamal;Yoon, Sook;Park, Dong Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3490-3507
    • /
    • 2014
  • License plate detection (LPD) is one of the most important aspects of an automatic license plate recognition system. Although there have been some successful license plate recognition (LPR) methods in past decades, it is still a challenging problem because of the diversity of plate formats and outdoor illumination conditions in image acquisition. Because the accurate detection of license plates under different conditions directly affects overall recognition system accuracy, different methods have been developed for LPD systems. In this paper, we propose a license plate detection method that is rapid and robust against variation, especially variations in illumination conditions. Taking the aspects of accuracy and speed into consideration, the proposed system consists of two stages. For each stage, Haar-like features are used to compute and select features from license plate images and a cascade classifier based on the concatenation of classifiers where each classifier is trained by an AdaBoost algorithm is used to classify parts of an image within a search window as either license plate or non-license plate. And it is followed by connected component analysis (CCA) for eliminating false positives. The two stages use different image preprocessing blocks: image preprocessing without adaptive thresholding for the first stage and image preprocessing with adaptive thresholding for the second stage. The method is faster and more accurate than most existing methods used in LPD. Experimental results demonstrate that the LPD rate is 98.38% and the average computational time is 54.64 ms.

Estimation of bubble size distribution using deep ensemble physics-informed neural network (딥앙상블 물리 정보 신경망을 이용한 기포 크기 분포 추정)

  • Sunyoung Ko;Geunhwan Kim;Jaehyuk Lee;Hongju Gu;Kwangho Moon;Youngmin Choo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.4
    • /
    • pp.305-312
    • /
    • 2023
  • Physics-Informed Neural Network (PINN) is used to invert bubble size distributions from attenuation losses. By considering a linear system for the bubble population inversion, Adaptive Learned Iterative Shrinkage Thresholding Algorithm (Ada-LISTA), which has been solved linear systems in image processing, is used as a neural network architecture in PINN. Furthermore, a regularization based on the linear system is added to a loss function of PINN and it makes a PINN have better generalization by a solution satisfying the bubble physics. To evaluate an uncertainty of bubble estimation, deep ensemble is adopted. 20 Ada-LISTAs with different initial values are trained using the same training dataset. During test with attenuation losses different from those in the training dataset, the bubble size distribution and corresponding uncertainty are indicated by average and variance of 20 estimations, respectively. Deep ensemble Ada-LISTA demonstrate superior performance in inverting bubble size distributions than the conventional convex optimization solver of CVX.

Splitting and Merging Algorithm Based on Local Statistics of Sub-Regions in Document Image

  • Thapaliya, Kiran;Park, Il-Cheol;Kwon, Goo-Rak
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.487-490
    • /
    • 2011
  • This paper presents splitting and merging algorithm based on adaptive thresholding. The algorithm first divides the image into blocks, and then compares each block using the calculated thresholding value. The blocks which are same are merged using the certain threshold value and different blocks are split unless it satisfies the threshold value. When the block has been merged, maximum and minimum block sizes are determined then the average block size is determined. After the average block size is determined the average intensity and standard deviation of average block is calculated. The process of thresholding is applied to binarize the image. Finally, the experimental results show that the proposed method distinguishes clearly the background with text in the document image.

Robust Visual Odometry System for Illumination Variations Using Adaptive Thresholding (적응적 이진화를 이용하여 빛의 변화에 강인한 영상거리계를 통한 위치 추정)

  • Hwang, Yo-Seop;Yu, Ho-Yun;Lee, Jangmyung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.9
    • /
    • pp.738-744
    • /
    • 2016
  • In this paper, a robust visual odometry system has been proposed and implemented in an environment with dynamic illumination. Visual odometry is based on stereo images to estimate the distance to an object. It is very difficult to realize a highly accurate and stable estimation because image quality is highly dependent on the illumination, which is a major disadvantage of visual odometry. Therefore, in order to solve the problem of low performance during the feature detection phase that is caused by illumination variations, it is suggested to determine an optimal threshold value in the image binarization and to use an adaptive threshold value for feature detection. A feature point direction and a magnitude of the motion vector that is not uniform are utilized as the features. The performance of feature detection has been improved by the RANSAC algorithm. As a result, the position of a mobile robot has been estimated using the feature points. The experimental results demonstrated that the proposed approach has superior performance against illumination variations.

Robust 3D Object Detection through Distance based Adaptive Thresholding (거리 기반 적응형 임계값을 활용한 강건한 3차원 물체 탐지)

  • Eunho Lee;Minwoo Jung;Jongho Kim;Kyongsu Yi;Ayoung Kim
    • The Journal of Korea Robotics Society
    • /
    • v.19 no.1
    • /
    • pp.106-116
    • /
    • 2024
  • Ensuring robust 3D object detection is a core challenge for autonomous driving systems operating in urban environments. To tackle this issue, various 3D representation, including point cloud, voxels, and pillars, have been widely adopted, making use of LiDAR, Camera, and Radar sensors. These representations improved 3D object detection performance, but real-world urban scenarios with unexpected situations can still lead to numerous false positives, posing a challenge for robust 3D models. This paper presents a post-processing algorithm that dynamically adjusts object detection thresholds based on the distance from the ego-vehicle. While conventional perception algorithms typically employ a single threshold in post-processing, 3D models perform well in detecting nearby objects but may exhibit suboptimal performance for distant ones. The proposed algorithm tackles this issue by employing adaptive thresholds based on the distance from the ego-vehicle, minimizing false negatives and reducing false positives in the 3D model. The results show performance enhancements in the 3D model across a range of scenarios, encompassing not only typical urban road conditions but also scenarios involving adverse weather conditions.

Adaptive Thresholding Method Using Zone Searching Based on Representative Points for Improving the Performance of LCD Defect Detection (LCD 결함 검출 성능 개선을 위한 대표점 기반의 영역 탐색을 이용한 적응적 이진화 기법)

  • Kim, Jin-Uk;Ko, Yun-Ho;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.7
    • /
    • pp.689-699
    • /
    • 2016
  • As the demand for LCD increases, the importance of inspection equipment for improving the efficiency of LCD production is continuously emphasized. The pattern inspection apparatus is one that detects minute defects of pattern quickly using optical equipment such as line scan camera. This pattern inspection apparatus makes a decision on whether a pixel is a defect or not using a single threshold value in order to meet constraint of real time inspection. However, a method that uses an adaptive thresholding scheme with different threshold values according to characteristics of each region in a pattern can greatly improve the performance of defect detection. To apply this adaptive thresholding scheme it has to be known that a certain pixel to be inspected belongs to which region. Therefore, this paper proposes a region matching algorithm that recognizes the region of each pixel to be inspected. The proposed algorithm is based on the pattern matching scheme with the consideration of real time constraint of machine vision and implemented through GPGPU in order to be applied to a practical system. Simulation results show that the proposed method not only satisfies the requirement for processing time of practical system but also improves the performance of defect detection.

Locally Adaptive Bi-level Image Segmentation Technique (국부 적응 2 진 화상 영역화 기법)

  • Jung, Gyoo-Sung;Park, Rae-Hong
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1367-1370
    • /
    • 1987
  • This paper describes a new automatic bi-level image segmentation algorithm which determines local thresholds by applying a locally adaptive edge detection technique to a variable threshold selection method. Computer simulations show that the performance of the proposed algorithm is more robust than those of automatic global thresholding methods.

  • PDF