• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.2931-2946
• /
• 1997

In multimedia information retrieval applications, content-based image retrieval is essential for retrieving relevant multimedia documents. The purpose of our paper is to provide effective representation and efficient retrieval of images when a pixel-level original image is automatically or manually transformaed into its iconic image containing meaningful graphic descriptions, called icon objects. For this, we first propose new spatial match representationschemes to describe spatial relationships between icon objects accurately by expressing them as rectangles, rather than as points. In order to accelerate image searching, we also design an efficient retrieval method using a two-dimensional signature file organization. Finally, we show from our experiment that the proposed representation schemes achieve better retrieval effectiveness than the 9-DLT (Direction Lower Triangular) scheme.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.155-160
• /
• 2004

In this paper, we describe the results of a study on the edge enhancement of X-ray images by using their fuzzy system representation. A set of gray scale X-ray images was generated using the EGS4 computer code. An aluminum plate or a lead plate with three parallel strips taken out has been used as the object with the thickness and the width of the plate, and the gap between the two strips varied. We started with a comparative study on a set of the fuzzy sets for their applicability as the input fuzzy sets for the fuzzy system representation of the gray scale images. Then we describe how the fuzzy system is used to sharpen the edges. Our algorithm is based on adding the magnitude of the gradient not to the pixel value of concern but rather to the nearest neighboring pixel in the direction of the gradient. We show that this algorithm is better in maintaining the spatial resolution of the original image after the edge enhancement.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.322-326
• /
• 2004

This paper describes a new iris recognition method based on a shift-invariant wavelet sub-images. For the feature representation, we first preprocess an iris image for the compensation of the variation of the iris and for the easy implementation of the wavelet transform. Then, we decompose the preprocessed iris image into multiple subband images using a shift-invariant wavelet transform. For feature representation, we select a set of subband images, which have rich information for the classification of various iris patterns and robust to noises. In order to reduce the size of the feature vector, we quantize. each pixel of subband images using the Lloyd-Max quantization method Each feature element is represented by one of quantization levels, and a set of these feature element is the feature vector. When the quantization is very coarse, the quantized level does not have much information about the image pixel value. Therefore, we define a new similarity measure based on mutual information between two features. With this similarity measure, the size of the feature vector can be reduced without much degradation of performance. Experimentally, we show that the proposed method produced superb performance in iris recognition.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.576-586
• /
• 2005

This paper presents a new estimation and representation of a disparity map for stereo-based video communication systems. Several pixel-based and block-based algorithms have been proposed to estimate the disparity map. While the pixel-based algorithms can achieve high accuracy in computing the disparity map, they require a lost of bits to represent the disparity information. The bit rate can be reduced by the block-based algorithm, sacrificing the representation accuracy. In this paper, the block enclosing a distinct edge is divided into two regions and the disparity of each region is set to that of a neighboring block. The proposed algorithm employs accumulated histograms and a neural network to classify a type of a block. In this paper, we proved that the proposed algorithm is more effective than the conventional algorithms in estimating and representing disparity maps through several experiments.

• Journal of Korea Multimedia Society
• /
• v.15 no.10
• /
• pp.1205-1211
• /
• 2012

Recently, the evaluating method of the bone mineral density (BMD) in X-ray absorptiometry image has been studied for the early diagnosis of osteoporosis which is known as a metabolic disease. The BMD, in general, is evaluated by calculating pixel intensity in the bone segmented regions. Accurate bone region extraction is extremely crucial for the BMD evaluation. So, a X-Ray image enhancement is needed to get precise bone segmentation. In this paper, we propose an image enhancement method of X-ray image having multiple noise based sparse representation. To evaluate the performance of proposed method, we employ the contrast to noise ratio (CNR) metric and cut-view graphs visualizing image enhancement performance. Experimental results show that the proposed method outperforms the BayesShrink noise reduction methods and the previous noise reduction method in sparse representation with general noise model.

• International Journal of Contents
• /
• v.11 no.3
• /
• pp.47-53
• /
• 2015

Visual object tracking is a fundamental problem in the field of computer vision, as it needs a proper model to account for drastic appearance changes that are caused by shape, textural, and illumination variations. In this paper, we propose a feature-based visual-object-tracking method with a sparse representation. Generally, most appearance-based models use the gray-scale pixel values of the input image, but this might be insufficient for a description of the target object under a variety of conditions. To obtain the proper information regarding the target object, the following combination of features has been exploited as a corresponding representation: First, the features of the target templates are extracted by using the HOG (histogram of gradient) and LBPs (local binary patterns); secondly, a feature-based sparsity is attained by solving the minimization problems, whereby the target object is represented by the selection of the minimum reconstruction error. The strengths of both features are exploited to enhance the overall performance of the tracker; furthermore, the proposed method is integrated with the particle-filter framework and achieves a promising result in terms of challenging tracking videos.

• Korean Journal of Digital Imaging in Medicine
• /
• v.13 no.1
• /
• pp.49-53
• /
• 2011

Dynamic range on the digital detector can be a representation to the ratio of maximum and minimum of pixel value. Wide dynamic range and post processing ability of the digital detector made difficult to recognize visually to high or low dose images. We were evaluated a change of mean pixel value on the original and processed image, when we controlled the kVp, mA, exposure time on the digital detector. On the kVp of a constant condition, we were acquired an original and processed image by changes of mA, exposure time. According to the thickness of the subject under the same conditions, to determine a relation of pixel value and X-ray intensity, we used an aluminum step wedge. When mA and exposure times were changed under the kVp of a constant condition, the X-ray intensity was decreased by the reduction of the mean pixel value. In addition when kVp was increased in a constant condition of mAs, the mean pixel value was increased according to the increment of the X-ray intensity. Therefore, low kVp, high mA and short exposure time were a way to reduce a patient dose.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.80-85
• /
• 2011

In this paper, I propose flexible base point used for a BTC(Block Truncation Coding). Halftoning images are used for printer by reducing the number of pixel depth. During over 20 years, many researches have been studied to apply this techniques to image compression. BTC algorithms are the compression methods using digital halftoning technique about images. In the BTC algorithm, an image block is divided into higher and lower domain compared with the mean of block. then the MAX and MIN representative values are evaluated by calculating the mean of higher and lower domain respectively. At a result, an image block(for example 88 size) is compressed into 64bits pixel representation and 16 bits of the MAX and MIN. And they also have been tried to sustain the image quality high after compression. In this paper, I found that there is some marginal possibility to enhance the image quality by adjusting the base point(generally mean of block) of existing algorithms.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.533-536
• /
• 1997

In this paper, we visualized 3-dimensional volume of heart using volume method by thresholding in EBT slices data. Volume rendering is the method that acquire the color by casting a pixel ray to volume data. The gray level of heart region is so high that we decide heart region by thresholding method. When a pixel ray is cast to volume data, the region that is higher than threshold value becomes heart region. We effectively rendered the heart volume and showed the 3-dimensional heart volume.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.317-322
• /
• 2018

We use edge detection technique for the input image to extract the entire edges of the object in the image and then select only the edges that construct the outline of the object. By examining the positional relation between these pixels composing the outline, a simplified version of the outline of the object in the input image is generated by removing unnecessary pixels while maintaining the condition of connection of the outline. For each pixel constituting the outline, its direction is calculated by examining the positional relation with the next pixel. Then, we group the consecutive pixels with same direction into one and then change them to a line segment instead of a point. Among those line segments composing the outline of the object, a line segment whose length is smaller than a predefined minimum length of acceptable line segment is removed by merging it into one of the adjacent line segments. As a result, an outline composed of line segments of over a certain length is obtained through this process.