• 한국정보처리학회논문지
• /
• 제4권12호
• /
• pp.2931-2946
• /
• 1997

멀티미디어정보검색 응용분야에서 내용－본위 이미지 검색은 유사성이 높은 멀티미디어 문서를 검색하는데 있어서 필수적이다. 따라서, 본 논문은 픽셀 (Pixel) 단위의 본래 이미지가 자동적 혹은 수동적으로 아이콘(icon) 객체로 구성된 아이콘 이미지로 변환될 때, 아이콘 이미지의 효율적인 표현과 검색을 제공하기 위함이다. 이를 위해 먼저 아이콘 객체를 점 대신에 사각형으로 표현함으로써 아이콘들간의 공간관계를 정확하게 표현할 수 있는 새로운 공간 매치 표현 기법을 제안한다. 또한, 이미지의 검색을 가속화시키기 위해, 2차원 시그니쳐 화일 구성을 사용한 효율적인 검색기법을 설계한다. 마지막으로, 성능 실험을 통하여 제안한 공간 매치 표현 기법이 기존의 9-DLT 표현 기법보다 더 나은 검색 효율을 나타냄을 보인다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권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
• /
• 제4권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.

• 방송공학회논문지
• /
• 제10권4호통권29호
• /
• pp.576-586
• /
• 2005

본 논문에서는 스테레오 기반 비디오 압축 전송 시스템을 위하여 시차영상을 추정하고 표현하는 방법에 대하여 연구를 수행하였다. 기존에는 스테레오 영상 전송을 위하여 시차영상을 화소 단위나 블록단위로 구하는 방법이 사용되었다. 화소 단위 시차추정은 정확도는 높으나 전송시 많은 비트를 발생시키는 반면, 블록단위 시차 추정은 정보량을 줄일 수 있으나 정확도가 떨어지는 단점을 가지고 있다. 본 논문에서는 영상의 경계부분을 두 개의 영역으로 나누고 시차정보를 주변 것으로 대치함으로써 블록단위의 방법과 거의 같은 정보량을 갖으면서 경계부분에서 보다 정확한 시차정보를 표현하는 방법을 제안하였다. 본 방법은 블록의 형태를 분류하기 위하여 누적 히스토그램을 특징으로 하는 신경망을 사용하였다. 본 논문에서는 제안한 알고리즘이 경계블록을 다수 포함한 영상에서는 블록단위의 시차표현 방법보다 효과적임을 실제 영상 분석을 통하여 증명하였다.

• 한국멀티미디어학회논문지
• /
• 제15권10호
• /
• pp.1205-1211
• /
• 2012

대사성 골 질환인 골다공증(Osteoporosis)의 조기 진단을 위해 X 선 영상에서 골 밀도를 측정하는 방법이 최근 연구되고 있다. 골 밀도는 X 선 영상에서 뼈가 분리되고, 분리된 영역에서의 픽셀에 의해 BMD가 측정되는데, 개선된 영상에서의 정밀한 뼈 추출이 주요한 요소이므로 X 선 영상의 개선은 골다공증의 조기 진단을 위해 필수적이다. 본 논문에서는 sparse 표현을 도입하여 다중(multiple) 잡음을 갖는 X 선 영상을 개선시키는 방법을 제안한다. 실험을 통해 제안한 방법의 결과가 기존의 방법인 웨이블릿 BayesShrink 잡음 제거 방법 및 일반적 sparse 표현 모델의 잡음 제거 방법의 결과에 비해 개선됨을 CNR(Contrast to Noise Ratio) 및 cut-view를 통해 확인하였다.

• International Journal of Contents
• /
• 제11권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.

• 대한디지털의료영상학회논문지
• /
• 제13권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.

• 정보통신설비학회논문지
• /
• 제10권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.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1997년도 추계학술대회
• /
• 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
• /
• 제6권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.