• Title/Summary/Keyword: Segmentation algorithm

Search Result 1,335, Processing Time 0.028 seconds

Color Image Coding Based on Shape-Adaptive All Phase Biorthogonal Transform

  • Wang, Xiaoyan;Wang, Chengyou;Zhou, Xiao;Yang, Zhiqiang
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.114-127
    • /
    • 2017
  • This paper proposes a color image coding algorithm based on shape-adaptive all phase biorthogonal transform (SA-APBT). This algorithm is implemented through four procedures: color space conversion, image segmentation, shape coding, and texture coding. Region-of-interest (ROI) and background area are obtained by image segmentation. Shape coding uses chain code. The texture coding of the ROI is prior to the background area. SA-APBT and uniform quantization are adopted in texture coding. Compared with the color image coding algorithm based on shape-adaptive discrete cosine transform (SA-DCT) at the same bit rates, experimental results on test color images reveal that the objective quality and subjective effects of the reconstructed images using the proposed algorithm are better, especially at low bit rates. Moreover, the complexity of the proposed algorithm is reduced because of uniform quantization.

Region-based Multi-level Thresholding for Color Image Segmentation (영역 기반의 Multi-level Thresholding에 의한 컬러 영상 분할)

  • Oh, Jun-Taek;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.6 s.312
    • /
    • pp.20-27
    • /
    • 2006
  • Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.

A Study on the Preprocessing Method Using Construction of Watershed for Character Image segmentation

  • Nam Sang Yep;Choi Young Kyoo;Kwon Yun Jung;Lee Sung Chang
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.814-818
    • /
    • 2004
  • Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

  • PDF

Slant Correction and Character String Segmentation using Vertical Transition (수직 천이점 검출을 통한 인쇄체 우편 영상에서의 회전각 보정 및 문자열 추출)

  • 이재용;오현화;장승익;진성일
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.469-472
    • /
    • 2003
  • Skew is inevitably occurred in a scanned document image Thus, character recognition systems are generally very sensitive to a skew angle. In this paper, we propose a robust slant correction algorithm based on dithering and estimating vortical transition. Character strings are segmented by projecting the vertical transition point and the slant corrected image. The segmentation method using the vertical transition point can effectively split the character strings touching vertically each other. Experimental results show that the proposed method has achieved robust slant correction and good performance of character string segmentation.

  • PDF

Image Segmentation Using Bi-directional Distribution Functions of Histogram (히스토그램의 양방향 분포함수를 이용한 영상분할)

  • 남윤석;하영호;김수중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.6
    • /
    • pp.1020-1024
    • /
    • 1987
  • Image segmentation based on the curvature of bi-directiona distribution functions of histogram with no mode informations is proposed. The curvature is an oscillating function and can be approximated to a polynomial form with a least square method using the Chebyshev basis. Nonhomogeneous linea equations are solved by Gauss-elimination method. In the proposed algorithm, critical points of the curvature are obtained on each direction to compensate the segmentation parameters, which can be ignored in only one-directional histogram.

  • PDF

Active Contours Level Set Based Still Human Body Segmentation from Depth Images For Video-based Activity Recognition

  • Siddiqi, Muhammad Hameed;Khan, Adil Mehmood;Lee, Seok-Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2839-2852
    • /
    • 2013
  • Context-awareness is an essential part of ubiquitous computing, and over the past decade video based activity recognition (VAR) has emerged as an important component to identify user's context for automatic service delivery in context-aware applications. The accuracy of VAR significantly depends on the performance of the employed human body segmentation algorithm. Previous human body segmentation algorithms often engage modeling of the human body that normally requires bulky amount of training data and cannot competently handle changes over time. Recently, active contours have emerged as a successful segmentation technique in still images. In this paper, an active contour model with the integration of Chan Vese (CV) energy and Bhattacharya distance functions are adapted for automatic human body segmentation using depth cameras for VAR. The proposed technique not only outperforms existing segmentation methods in normal scenarios but it is also more robust to noise. Moreover, it is unsupervised, i.e., no prior human body model is needed. The performance of the proposed segmentation technique is compared against conventional CV Active Contour (AC) model using a depth-camera and obtained much better performance over it.

A Gaussian Mixture Model for Binarization of Natural Scene Text

  • Tran, Anh Khoa;Lee, Gueesang
    • Smart Media Journal
    • /
    • v.2 no.2
    • /
    • pp.14-19
    • /
    • 2013
  • Recently, due to the increase of the use of scanned images, the text segmentation techniques, which play critical role to optimize the quality of the scanned images, are required to be updated and advanced. In this study, an algorithm has been developed based on the modification of Gaussian mixture model (GMM) by integrating the calculation of Gaussian detection gradient and the estimation of the number clusters. The experimental results show an efficient method for text segmentation in natural scenes such as storefronts, street signs, scanned journals and newspapers at different size, shape or color of texts in condition of lighting changes and complex background. These indicate that our model algorithm and research approach can address various issues, which are still limitations of other senior algorithms and methods.

  • PDF

Morphological Operations to Segment a Tumor from a Magnetic Resonance Image

  • Thapaliya, Kiran;Kwon, Goo-Rak
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.1
    • /
    • pp.60-65
    • /
    • 2014
  • This paper describes an efficient framework for the extraction of a brain tumor from magnetic resonance (MR) images. Before the segmentation process, a median filter is used to filter the image. Then, the morphological gradient is computed and added to the filtered image for intensity enhancement. After the enhancement process, the thresholding value is calculated using the mean and the standard deviation of the image. This thresholding value is used to binarize the image followed by the morphological operations. Moreover, the combination of these morphological operations allows to compute the local thresholding image supported by a flood-fill algorithm and a pixel replacement process to extract the tumor from the brain. Thus, this framework provides a new source of evidence in the field of segmentation that the specialist can aggregate with the segmentation results in order to soften his/her own decision.

Automatic segmentation of magnetic resonance images using error back-propagation algorithm (오류 역전파 알고리즘을 이용한 자기 공명 영상 자동 세그멘테이션)

  • 최재호;조범준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2425-2431
    • /
    • 1997
  • The increased usage of Magnetic Resonance Image (MRI) required the method for automatic segmentation of medical image that is more useful so as to diagnose the dissecitive information of a atient quickly and effectively through MR scans.The use of neural networks may give much hep to solving the complex problems concerned the matter. This paper proposes the new method for automatic segmentation of magnetic resonance (MR) images of the brain by using neural networks brained by back-propagation algorithm. The trained neural networks by the segmenting MR images of a patient produce an output that networks can segment MR images of the other patients automatically, too and show a clear image of the brain.

  • PDF

A New Face Detection Method by Hierarchical Color Histogram Analysis

  • Kwon, Ji-Woong;Park, Myoung-Soo;Kim, Mun-Hyuk;Park, Jin-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.138.3-138
    • /
    • 2001
  • Because face has non-rigid structure and is influenced by illumination, we need robust face detection algorithm with the variations of external environments (orientation of lighting and face, complex background, etc.). In this paper we develop a new face detection algorithm to achieve robustness. First we transform RGB color into other color space, in which we can reduce lighting effect much. Second, hierarchical image segmentation technique is used for dividing a image into homogeneous regions. This process uses not only color information, but also spatial information. One of them is used in segmentation by histogram analysis, the other is used in segmentation by grouping. And we can select face region among the homogeneous regions by using facial features.

  • PDF