• 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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.914-922
• /
• 1987

An image coding technique based on a segmentation, which utilizes a simplified description of regions composing an image, is investigated in this paper. The proposed coding technique consists of 3 stages: segmentation, contour coding. In this paper, emphasis was given to texture coding in order to improve a quality of an image. Split-and-merge method was employed for a segmentation. In the texture coding, a linear predictive coding(LPC), along with approximation technique based on a two-dimensional polynomial function was used to encode texture components. Depending on a size of region and a mean square error between an original and a reconstructed image, appropriate texture coding techniques were determined. A computer simulation on natural images indicates that an acceptable image quality at a compression ratio as high as 15-25 could be obtained. In comparison with a discrete cosine transform coding technique, which is the most typical coding technique in the first-generation coding, the proposed scheme leads to a better quality at compression ratio higher than 15-20.

• 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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1581-1590
• /
• 1995

Recently, advanced video coding techniques using segmentation technique have been actively researched as candidates for video coding of MPEG-4 standard. The conventional segmentation techniques are unsuitable for real-time process because they have sequential structure. In this paper, we propose a new image segmentation technique using competitive learning neural network for vector quantization. The proposed segmentation procedure consist of prefiltering, primary and secondary segmentation, and a small region ellimination process. Primary segmentation segments input image in detail. Secondary segmentation merges similar region using a repetitive FSCL(Frequency sensitive competive learning) neural network. In this process, it is possible to segment an image from high resolution to low resolution by adjusting the number of repetition. Finally, small regions are merged into adjacent regions. Experimental results show that the procedure described yields reconstructed images of reasonably acceptable quality at bit rates of 0. 25 - 0.3 bit/pel.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.19-24
• /
• 1997

This paper describes an image segmentation technique for the object-oriented coding at very low bit rates. By noting that, in the object-oriented coding technique, each objects are represented by 3 parameters, namely, shape, motion, and color informations, we propose a segmentation technique, in which the 3 parameters are fully exploited. To achieve this goal, starting with the color space conversion and the noise reduction, the input image is divided into many small regions by the K-menas algorithm on the O-K-S color space. Then, each regions are merged, according to the shape and motion information. In simultations, it is shown that the proposed technique segments the input image into relevant objects, according to the shape and motion as well as the colors. In addition, in order to evaluate the performance of the proposed technique, we introduce the notion of the interesting regions, and provide the results of encoding the image with emphasizing the interesting regions.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.43-54
• /
• 2005

This paper proposes a novel texture segmentation method using Bayesian image segmentation method and SOM(Self Organization feature Map). Multi-scale wavelet coefficients are used as the input of SOM, and likelihood and a posterior probability for observations are obtained from trained SOMs. Texture segmentation is performed by a posterior probability from trained SOMs and MAP(Maximum A Posterior) classification. And the result of texture segmentation is improved by context information. This proposed segmentation method shows better performance than segmentation method by HMT(Hidden Markov Tree) model. The texture segmentation results by SOM and multi-sclae Bayesian image segmentation technique called HMTseg also show better performance than by HMT and HMTseg.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.223-229
• /
• 2018

This paper proposes a robust technique of image segmentation, which can be obtained if the topological persistence of each connected component is used as the feature vector for the graph-based image segmentation. The topological persistence of the components, which are obtained from the super-level set of the image, is computed from the morse function which is associated with the gray-level or color value of each pixel of the image. The procedure for the components to be born and be merged with the other components is presented in terms of zero-dimensional homology group. Extensive experiments are conducted with a variety of images to show the more correct image segmentation can be obtained by merging the components of small persistence into the adjacent components of large persistence.

• The Journal of Natural Sciences
• /
• v.5 no.2
• /
• pp.33-38
• /
• 1992

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 for multime-dia teleconference. 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. We compare the coding efficiency of this technique with that of a well established technique (discrete cosine transform (DCT) image coding).

• 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.

• 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.