• Title/Summary/Keyword: optimal thresholding

Search Result 54, Processing Time 0.026 seconds

An Optimal Thresholding Method for the Voxel Coloring in the 3D Shape Reconstruction

  • Ye, Soo-Young;Kim, Hyo-Sung;Yi, Young-Youl;Nam, Ki-Gon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1695-1700
    • /
    • 2005
  • In this paper, we propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the surface voxel of photo-consistency with inside voxel on the optic ray of the center camera. As iterating the process of the voxels, the threshold value is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph cut as compare with conventional algorithms.

  • PDF

Multi-level thresholding using Entropy-based Weighted FCM Algorithm in Color Image (Entropy 기반의 Weighted FCM 알고리즘을 이용한 컬러 영상 Multi-level thresholding)

  • Oh, Jun-Taek;Kwak, Hyun-Wook;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.73-82
    • /
    • 2005
  • This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

The Optimal Thresholding Technique for an Efficient Quadtree Segmentation (효율적인 Quadtree 분할을 위한 최적의 임계값 설정 기술)

  • Lee, Hang-Chan
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.8
    • /
    • pp.1031-1036
    • /
    • 1999
  • A Hierarchical vector Quantization scheme is implemented and an optimal thresholding technique of quadtree segmentation for performing high quality low bit rate image compression is proposes. A mathematical model is constructed under the assumption that the standard deviations of sub-blocks are larger than or equal to the standard deviation of the upper level block which is generated by merging of sub-blocks. This thresholding technique based on the mathematical modeling allows producing about 1 dB improved performance in terms of PSNR at most ranges of bit rates over the quadtree coder, which is based on MSE for quadtree segmentation.

  • PDF

Obtaining Object by Using Optimal Threshold for Saliency Map Thresholding (Saliency Map을 이용한 최적 임계값 기반의 객체 추출)

  • Hai, Nguyen Cao Truong;Kim, Do-Yeon;Park, Hyuk-Ro
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.6
    • /
    • pp.18-25
    • /
    • 2011
  • Salient object attracts more and more attention from researchers due to its important role in many fields of multimedia processing like tracking, segmentation, adaptive compression, and content-base image retrieval. Usually, a saliency map is binarized into black and white map, which is considered as the binary mask of the salient object in the image. Still, the threshold is heuristically chosen or parametrically controlled. This paper suggests using the global optimal threshold to perform saliency map thresholding. This work also considers the usage of multi-level optimal thresholds and the local adaptive thresholds in the experiments. These experimental results show that using global optimal threshold method is better than parametric controlled or local adaptive threshold method.

A Fast Thresholding Method For Pattern Matching (패턴매칭을 위한 고속 스레쉬홀딩법)

  • Li, Zhe-Xue;Kim, Sang-Woon
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.126-128
    • /
    • 2006
  • For pattern matching, an object image should be segmented and analyzed for the first time. Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding is one of the most veil-known methods proposed in the literature. However, the method has a disadvantage of repeatedly searching the optimal thresholds for the entire region. To overcome this problem, a number of methods have been proposed. In this paper, we propose a simple and fast thresholding method of finding multi-level threshold values by extending the Otsu's method. Our experimental results for the benchmak images show a possibility that the proposed method could be used efficiently for pattern matching.

  • PDF

Entropic Image Thresholding Segmentation Based on Gabor Histogram

  • Yi, Sanli;Zhang, Guifang;He, Jianfeng;Tong, Lirong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.2113-2128
    • /
    • 2019
  • Image thresholding techniques introducing spatial information are widely used image segmentation. Some methods are used to calculate the optimal threshold by building a specific histogram with different parameters, such as gray value of pixel, average gray value and gradient-magnitude, etc. However, these methods still have some limitations. In this paper, an entropic thresholding method based on Gabor histogram (a new 2D histogram constructed by using Gabor filter) is applied to image segmentation, which can distinguish foreground/background, edge and noise of image effectively. Comparing with some methods, including 2D-KSW, GLSC-KSW, 2D-D-KSW and GLGM-KSW, the proposed method, tested on 10 realistic images for segmentation, presents a higher effectiveness and robustness.

A New Voxel Coloring Method for 3D Shape Reconstruction (3차원 형상 재구성을 위한 새로운 복셀 칼라링 기법)

  • Ye Sooyoung;Kim Hyosung;Joo Jaeheum;Nam Kigon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.6
    • /
    • pp.93-100
    • /
    • 2005
  • We propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the photo-consistency of a surface with inside voxel on the optic ray of the center camera. As iterating the process of the vokels, the threshold is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph as compare with conventional algorithms.

Multi-level Thresholding using Fuzzy Clustering Algorithm in Local Entropy-based Transition Region (지역적 엔트로피 기반 전이 영역에서 퍼지 클러스터링 알고리즘을 이용한 Multi-Level Thresholding)

  • Oh, Jun-Taek;Kim, Bo-Ram;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.12B no.5 s.101
    • /
    • pp.587-594
    • /
    • 2005
  • This paper proposes a multi-level thresholding method for image segmentation using fuzzy clustering algorithm in transition region. Most of threshold-based image segmentation methods determine thresholds based on the histogram distribution of a given image. Therefore, the methods have difficulty in determining thresholds for real-image, which has a complex and undistinguished distribution, and demand much computational time and memory size. To solve these problems, we determine thresholds for real-image using fuzzy clustering algorithm after extracting transition region consisting of essential and important components in image. Transition region is extracted based on Inか entropy, which is robust to noise and is well-known as a tool that describes image information. And fuzzy clustering algorithm can determine optimal thresholds for real-image and be easily extended to multi-level thresholding. The experimental results demonstrate the effectiveness of the proposed method for performance.

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.

Determination of Noise Threshold from Signal Histogram in the Wavelet Domain

  • Kim, Eunseo;Lee, Kamin;Yang, Sejung;Lee, Byung-Uk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.156-160
    • /
    • 2014
  • Thresholding in frequency domain is a simple and effective noise reduction technique. Determination of the threshold is critical to the image quality. The optimal threshold minimizing the Mean Square Error (MSE) is chosen adaptively in the wavelet domain; we utilize an equation of the MSE for the soft-thresholded signal and the histogram of wavelet coefficients of the original image and noisy image. The histogram of the original signal is estimated through the deconvolution assuming that the probability density functions (pdfs) of the original signal and the noise are statistically independent. The proposed method is quite general in that it does not assume any prior for the source pdf.