• Title/Summary/Keyword: Bayesian approach to image segmentation

Search Result 5, Processing Time 0.023 seconds

Boundary Detection using Adaptive Bayesian Approach to Image Segmentation (적응적 베이즈 영상분할을 이용한 경계추출)

  • Kim Kee Tae;Choi Yoon Su;Kim Gi Hong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.22 no.3
    • /
    • pp.303-309
    • /
    • 2004
  • In this paper, an adaptive Bayesian approach to image segmentation was developed for boundary detection. Both image intensities and texture information were used for obtaining better quality of the image segmentation by using the C programming language. Fuzzy c-mean clustering was applied fer the conditional probability density function, and Gibbs random field model was used for the prior probability density function. To simply test the algorithm, a synthetic image (256$\times$256) with a set of low gray values (50, 100, 150 and 200) was created and normalized between 0 and 1 n double precision. Results have been presented that demonstrate the effectiveness of the algorithm in segmenting the synthetic image, resulting in more than 99% accuracy when noise characteristics are correctly modeled. The algorithm was applied to the Antarctic mosaic that was generated using 1963 Declassified Intelligence Satellite Photographs. The accuracy of the resulting vector map was estimated about 300-m.

Crack segmentation in high-resolution images using cascaded deep convolutional neural networks and Bayesian data fusion

  • Tang, Wen;Wu, Rih-Teng;Jahanshahi, Mohammad R.
    • Smart Structures and Systems
    • /
    • v.29 no.1
    • /
    • pp.221-235
    • /
    • 2022
  • Manual inspection of steel box girders on long span bridges is time-consuming and labor-intensive. The quality of inspection relies on the subjective judgements of the inspectors. This study proposes an automated approach to detect and segment cracks in high-resolution images. An end-to-end cascaded framework is proposed to first detect the existence of cracks using a deep convolutional neural network (CNN) and then segment the crack using a modified U-Net encoder-decoder architecture. A Naïve Bayes data fusion scheme is proposed to reduce the false positives and false negatives effectively. To generate the binary crack mask, first, the original images are divided into 448 × 448 overlapping image patches where these image patches are classified as cracks versus non-cracks using a deep CNN. Next, a modified U-Net is trained from scratch using only the crack patches for segmentation. A customized loss function that consists of binary cross entropy loss and the Dice loss is introduced to enhance the segmentation performance. Additionally, a Naïve Bayes fusion strategy is employed to integrate the crack score maps from different overlapping crack patches and to decide whether a pixel is crack or not. Comprehensive experiments have demonstrated that the proposed approach achieves an 81.71% mean intersection over union (mIoU) score across 5 different training/test splits, which is 7.29% higher than the baseline reference implemented with the original U-Net.

EM Algorithm-based Segmentation of Magnetic Resonance Image Corrupted by Bias Field (바이어스필드에 의해 왜곡된 MRI 영상자료분할을 위한 EM 알고리즘 기반 접근법)

  • 김승구
    • The Korean Journal of Applied Statistics
    • /
    • v.16 no.2
    • /
    • pp.305-319
    • /
    • 2003
  • This paper provides a non-Bayesian method based on the expanded EM algorithm for segmenting the magnetic resonance images degraded by bias field. For the images with the intensity as a pixel value, many segmentation methods often fail to segment it because of the bias field(with low frequency) as well as noise(with high frequency). Our contextual approach is appropriately designed by using normal mixture model incorporated with Markov random field for noise-corrective segmentation and by using the penalized likelihood to estimate bias field for efficient bias filed-correction.

An Assessment of Urbanization Using Historic Satellite Photography: Columbus Metropolitan Area, Ohio, 1965

  • Kim, Kee-Tae;Kim, Jung-Hwan;Jayakumar, S.;Sohn, Hong-Gyoo
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.3
    • /
    • pp.221-227
    • /
    • 2007
  • We present an analysis of urban development and growth with reconnaissance satellite photographs of Columbus metropolitan area acquired by the Corona program in 1965. A two-dimensional polynomial linear transformation was used to rectify the photos against United State Geological Survey (USGS) Large-scale Digital Line Graph (DLG) data georeferenced to Universal Transverse Mercator (UTM) coordinates. The boundaries of the Columbus metropolitan area were extracted from the rectified Corona image mosaic using a Bayesian approach to image segmentation. The inferred 1965 urban boundaries were compared with 1976 USGS Land Use and Land Cover (LULC) data and boundaries derived from 1988 and 1994 Landsat TM images. The urban area in and around Columbus approximately doubled from 1965 to 1994 (${\sim}110%$) along with population growth from 1960 to 1998 (${\sim}50%$). Most of the urban expansion results from development of residential units.

Guitar Tab Digit Recognition and Play using Prototype based Classification

  • Baek, Byung-Hyun;Lee, Hyun-Jong;Hwang, Doosung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.9
    • /
    • pp.19-25
    • /
    • 2016
  • This paper is to recognize and play tab chords from guitar musical sheets. The musical chord area of an input image is segmented by changing the image in saturation and applying the Grabcut algorithm. Based on a template matching, our approach detects tab starting sections on a segmented musical area. The virtual block method is introduced to search blanks over chord lines and extract tab fret segments, which doesn't cause the computation loss to remove tab lines. In the experimental tests, the prototype based classification outperforms Bayesian method and the nearest neighbor rule with the whole set of training data and its performance is similar to that of the support vector machine. The experimental result shows that the prediction rate is about 99.0% and the number of selected prototypes is below 3.0%.