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

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.640-644
• /
• 2004

Since the existing quadtree image segmentation methods decide the presence of image information using the maximum and minimum pixel value within an image block, they are very sensitive to noise. Although many image segmentation methods have been researched up to date, they can not execute the optimum image segmentation if noise is included in an image because there is no accurate parameters which can distinguish noise. For that reason, all application using the existing quadtree segmentation has potential of decreasing in performance due to noise. This paper proposed a quadtree image segmentation based on SDT (Standard Deviation Threshold) that can effectively extract image information parameters from a noise image. This method has the advantage of distinguishing the presence of image information even if the image has noises caused by communication. Furthermore, this paper verified through test comparison that the proposed quadtree segmentation could estimate more accurate image information parameters than the existing ones even in noise-added environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.1-8
• /
• 2005

There are many image segmentation methods having bon published as the results of research so far, however these are for the noise images which can process an image under the general white noise environments. Therefore, these methods has the disadvantages because it is difficult to extract only the accurate parameters, which can distinguish between image and impulsive noise, from image with impulsive noises. So it has a problem about the potential decreasing of the performance according to the impulsive noise for all applications using the present quadtree segmentation. In this paper, we propose new quadtree segmentation using quartile deviation which can extract effectively the image information parameters from a noise image. Therefore our method can apply for various image processing fields because it has a advantage to distinguish an image information from noise image. As the result of simulation, we confirm that the proposed quadtree segmentation is more efficient than the present method when tested on impulsive noise image.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.692-704
• /
• 2002

In this paper, we present am image retrieval method based on color-spatial features using quadtree and texture information extracted from object MBRs in an image. Tile proposed method consists of creating a DC image from an original image, changing a color coordinate system, and decomposing regions using quadtree. As such, conditions are present to decompose the DC image, then the system extracts representative colors from each region. And, image segmentation is used to search for object MBRs, including object themselves, object included in the background, or certain background region, then the wavelet coefficients are calculated to provide texture information. Experiments were conducted using the proposed similarity method based on color-spatial and texture features. Our method was able to refute the amount of feature vector storage by about 53%, but was similar to the original image as regards precision and recall. Furthermore, to make up for the deficiency in using only color-spatial features, texture information was added and the results showed images that included objects from the query images.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.201-204
• /
• 1991

In this paper the method of representing the document image by the quadtree data structure, and extracting each character seperately from the constructed quadtree are described. The document image is represented by a binary encoded quadtree and the segmentation is performed according to the information of each leaf node of the quadtree. Then, each character is extracted by the relation of positions of segments. This method enables to extract characters without examining every pixel in the image and the required storage of document image is decreased.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.9
• /
• pp.1176-1182
• /
• 2021

Recently, with the development of artificial intelligence and IoT technology, automation, and unmanned work are progressing in various fields, and the importance of image processing, which is the basis of AI object recognition, is increasing. In particular, in systems that require detailed data processing, noise removal is used as a preprocessing step, but the existing algorithm does not consider the noise level of the image, so it has the disadvantage of blurring in the filtering process. Therefore, in this paper, we propose a modified Gaussian filter that determines the weight by determining the noise level of the image. The proposed algorithm obtains the noise estimate for the AWGN of the image using quadtree segmentation, determines the Gaussian weight and the pixel weight, and obtains the final output by convolution with the local mask. To evaluate the proposed algorithm, it was simulated compared to the existing method, and superior performance was confirmed compared to the existing method.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.83-88
• /
• 2011

Abstract. Image segmentation is always a challenging task in computer vision as well as in pattern recognition. Nowadays, this method has great importance in the field of stereo vision. The disparity information extracting from the binocular image pairs has essential relevance in the fields like Stereoscopic (3D) Imaging Systems, Virtual Reality and 3D Graphics. The term 'disparity' represents the horizontal shift between left camera image and right camera image. Till now, many methods are proposed to visualize or estimate the disparity. In this paper, we present a new technique to visualize the horizontal disparity between two stereo images based on image segmentation method. The process of comparing left camera image with right camera image is popularly known as 'Stereo-Matching'. This method is used in the field of stereo vision for many years and it has large contribution in generating depth and disparity maps. Correlation based stereo-matching are used most of the times to visualize the disparity. Although, for few stereo image pairs it is easy to estimate the horizontal disparity but in case of some other stereo images it becomes quite difficult to distinguish the disparity. Therefore, in order to visualize the horizontal disparity between any stereo image pairs in more robust way, a novel stereo-matching algorithm is proposed which is named as "Quadtree Segmentation of Pixels Disparity Estimation (QSPDE)".

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.834-847
• /
• 1996

A selective coding scheme is proposed that describes a method for coding image sequences distinguishing bits between background and target region. The suggested method initially estimates global motion parameters and local motion vectors. Then segmentation is performed with a hierarchical clustering scheme and a quadtree algorithm in order to divide the processing image into the backgraound and target region. Finally image coding is done by assigning more bits to the target region and less bits to background so that the target region may be reconstructed with high quality. Simulations show that the suggested algorithm performs well especially in the circumstances where background changes and target regionis small enough compared with that of background.