• Title/Summary/Keyword: Image Segmentation

Search Result 2,124, Processing Time 0.031 seconds

Enhanced Graph-Based Method in Spectral Partitioning Segmentation using Homogenous Optimum Cut Algorithm with Boundary Segmentation

  • S. Syed Ibrahim;G. Ravi
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.61-70
    • /
    • 2023
  • Image segmentation is a very crucial step in effective digital image processing. In the past decade, several research contributions were given related to this field. However, a general segmentation algorithm suitable for various applications is still challenging. Among several image segmentation approaches, graph-based approach has gained popularity due to its basic ability which reflects global image properties. This paper proposes a methodology to partition the image with its pixel, region and texture along with its intensity. To make segmentation faster in large images, it is processed in parallel among several CPUs. A way to achieve this is to split images into tiles that are independently processed. However, regions overlapping the tile border are split or lost when the minimum size requirements of the segmentation algorithm are not met. Here the contributions are made to segment the image on the basis of its pixel using min-cut/max-flow algorithm along with edge-based segmentation of the image. To segment on the basis of the region using a homogenous optimum cut algorithm with boundary segmentation. On the basis of texture, the object type using spectral partitioning technique is identified which also minimizes the graph cut value.

A Method for Tree Image Segmentation Combined Adaptive Mean Shifting with Image Abstraction

  • Yang, Ting-ting;Zhou, Su-yin;Xu, Ai-jun;Yin, Jian-xin
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1424-1436
    • /
    • 2020
  • Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

Image Segmentation Using an Extended Fuzzy Clustering Algorithm (확장된 퍼지 클러스터링 알고리즘을 이용한 영상 분할)

  • 김수환;강경진;이태원
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.3
    • /
    • pp.35-46
    • /
    • 1992
  • Recently, the fuzzy theory has been adopted broadly to the applications of image processing. Especially the fuzzy clustering algorithm is adopted to image segmentation to reduce the ambiguity and the influence of noise in an image.But this needs lots of memory and execution time because of the great deal of image data. Therefore a new image segmentation algorithm is needed which reduces the memory and execution time, doesn't change the characteristices of the image, and simultaneously has the same result of image segmentation as the conventional fuzzy clustering algorithm. In this paper, for image segmentation, an extended fuzzy clustering algorithm is proposed which uses the occurence of data of the same characteristic value as the weight of the characteristic value instead of using the characteristic value directly in an image and it is proved the memory reduction and execution time reducted in comparision with the conventional fuzzy clustering algorithm in image segmentation.

  • PDF

A Study of Automatic Medical Image Segmentation using Independent Component Analysis (Independent Component Analysis를 이용한 의료영상의 자동 분할에 관한 연구)

  • Bae, Soo-Hyun;Yoo, Sun-Kook;Kim, Nam-Hyun
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.1
    • /
    • pp.64-75
    • /
    • 2003
  • Medical image segmentation is the process by which an original image is partitioned into some homogeneous regions like bones, soft tissues, etc. This study demonstrates an automatic medical image segmentation technique based on independent component analysis. Independent component analysis is a generalization of principal component analysis which encodes the higher-order dependencies in the input in addition to the correlations. It extracts statistically independent components from input data. Use of automatic medical image segmentation technique using independent component analysis under the assumption that medical image consists of some statistically independent parts leads to a method that allows for more accurate segmentation of bones from CT data. The result of automatic segmentation using independent component analysis with square test data was evaluated using probability of error(PE) and ultimate measurement accuracy(UMA) value. It was also compared to a general segmentation method using threshold based on sensitivity(True Positive Rate), specificity(False Positive Rate) and mislabelling rate. The evaluation result was done statistical Paired-t test. Most of the results show that the automatic segmentation using independent component analysis has better result than general segmentation using threshold.

Smart Phone Road Signs Recognition Model Using Image Segmentation Algorithm

  • Huang, Ying;Song, Jeong-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.887-890
    • /
    • 2012
  • Image recognition is one of the most important research directions of pattern recognition. Image based road automatic identification technology is widely used in current society, the intelligence has become the trend of the times. This paper studied the image segmentation algorithm theory and its application in road signs recognition system. With the help of image processing technique, respectively, on road signs automatic recognition algorithm of three main parts, namely, image segmentation, character segmentation, image and character recognition, made a systematic study and algorithm. The experimental results show that: the image segmentation algorithm to establish road signs recognition model, can make effective use of smart phone system and application.

  • PDF

Expert system for segmentation of 2.5-D image

  • Ahn, Hongyoung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.376-381
    • /
    • 1992
  • This paper presents an expert system for the segmentation of a 2.5-D image. The results of two segmentation approaches, edge-based and region-based, are combined to produce a consistent and reliable segmentation. Rich information embedded in the 2.5-D image is utilized to obtain a view independent surface patch description of the image, which can facilitate object recognition considerably.

  • PDF

Accurate Segmentation Algorithm of Video Dynamic Background Image Based on Improved Wavelet Transform

  • Ming, Ming
    • Journal of Information Processing Systems
    • /
    • v.18 no.5
    • /
    • pp.711-718
    • /
    • 2022
  • In this paper, an accurate segmentation algorithm of video dynamic background image (VDBI) based on improved wavelet transform is proposed. Based on the smooth processing of VDBI, the traditional wavelet transform process is improved, and the two-layer decomposition of dynamic image is realized by using two-dimensional wavelet transform. On the basis of decomposition results and information enhancement processing, image features are detected, feature points are extracted, and quantum ant colony algorithm is adopted to complete accurate segmentation of the image. The maximum SNR of the output results of the proposed algorithm can reach 73.67 dB, the maximum time of the segmentation process is only 7 seconds, the segmentation accuracy shows a trend of decreasing first and then increasing, and the global maximum value can reach 97%, indicating that the proposed algorithm effectively achieves the design expectation.

A Level Set Method to Image Segmentation Based on Local Direction Gradient

  • Peng, Yanjun;Ma, Yingran
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1760-1778
    • /
    • 2018
  • For image segmentation with intensity inhomogeneity, many region-based level set methods have been proposed. Some of them however can't get the relatively ideal segmentation results under the severe intensity inhomogeneity and weak edges, and without use of the image gradient information. To improve that, we propose a new level set method combined with local direction gradient in this paper. Firstly, based on two assumptions on intensity inhomogeneity to images, the relationships between segmentation objects and image gradients to local minimum and maximum around a pixel are presented, from which a new pixel classification method based on weight of Euclidian distance is introduced. Secondly, to implement the model, variational level set method combined with image spatial neighborhood information is used, which enhances the anti-noise capacity of the proposed gradient information based model. Thirdly, a new diffusion process with an edge indicator function is incorporated into the level set function to classify the pixels in homogeneous regions of the same segmentation object, and also to make the proposed method more insensitive to initial contours and stable numerical implementation. To verify our proposed method, different testing images including synthetic images, magnetic resonance imaging (MRI) and real-world images are introduced. The image segmentation results demonstrate that our method can deal with the relatively severe intensity inhomogeneity and obtain the comparatively ideal segmentation results efficiently.

A High Image Compression for Computer Storage and Communication

  • Jang, Jong-Whan
    • The Journal of Natural Sciences
    • /
    • v.4
    • /
    • pp.191-220
    • /
    • 1991
  • A new texture segmentation-based image coding technique which performs segmentation based on roughness of textural regions and properties of the human visual system (HVS) is presented. This method solves the problems of a segmentation-based image coding technique with constant segments by proposing a methodology for segmenting an image texturally homogeneous regions with respect to the degree of roughness as perceived by the HVS. The fractal dimension is used to measure the roughness of the textural regions. The segmentation is accomplished by thresholding the fractal dimension so that textural regions are classified into three texture classes; perceived constant intensity, smooth texture, and rough texture. An image coding system with high compression and good image quality is achieved by developing an efficient coding technique for each segment boundary and each texture class. For the boundaries, a binary image representing all the boundaries is created. For regions belonging to perceived constant intensity, only the mean intensity values need to be transmitted. The smooth and rough texture regions are modeled first using polynomial functions, so only the coefficients characterizing the polynomial functions need to be transmitted. The bounda-ries, the means and the polynomial functions are then each encoded using an errorless coding scheme. Good quality reconstructed images are obtained with about 0.08 to 0.3 bit per pixel for three different types of imagery ; a head and shoulder image with little texture variation, a complex image with many edges, and a natural outdoor image with highly textured areas.

  • PDF