• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.101-110
• /
• 1996

Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. the basic problem is how to display 224 colors with 256 or less colors, called color palette. In this paper, we propose an algorithm to design the 256 or less size color palette by using spatial maskin geffect of HVS and subjective distortion measure weighted by color palette by using spatial masking effect of HVS and subjective distortion measure weighted by color activity in 4*4 local region in any color image. The proposed algorithm consists of octal prequantization and subdivision quantization processing step using the distortion measure and modified Otsu's between class variance maximization method. The experimental results show that the proposed algorithm has higher visual quality and needs less consuming time than conventional algorithms.

• Journal of information and communication convergence engineering
• /
• 제9권1호
• /
• pp.55-58
• /
• 2011

In this paper we introduce an improved method to measure saliency values of pixels from an image. The proposed saliency measure is formulated using local features of color and a statistical framework. In the preprocessing step, rough salient pixels are determined as the local contrast of an image region with respect to its neighborhood at various scales. Then, the saliency value of each pixel is calculated by Bayes' rule using rough salient pixels. The experiments show that our approach outperforms the current Bayes' rule based method.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1992년도 추계학술대회 논문집
• /
• pp.298-301
• /
• 1992

A digital image processing approach has been adopted to measure the flank wear area, which is very difficult to measure using conventional techniques. Automatic thresholding of the gray-level values of an image is very useful in automated analysis of image. 1-D entropy thresholding technique is used for image processing and analysis of the flank wear area. This strategy provides more information about drill wear conditions and should therefore have a higher reliability than previous methods. This study calulated quantitatively the flank were area of drill by computer program.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 춘계학술대회 논문집
• /
• pp.195-200
• /
• 2008

The accuracy of classifying pixels in HIRIS images is usually degraded by noisy bands since noisy bands may deform the typical shape of spectral reflectance. Proposed in this paper is a statistical method for noisy band removal which mainly makes use of the correlation coefficients between bands. Considering each band as a random variable, the correlation coefficient measures the strength and direction of a linear relationship between two random variables. While the correlation between two signal bands is high, existence of a noisy band will produce a low correlation due to ill-correlativeness and undirectedness. The application of the correlation coefficient as a measure for detecting noisy bands is under a two-pass screening scheme. This method is independent of the prior knowledge of the sensor or the cause resulted in the noise. The classification in this experiment uses the unsupervised k-nearest neighbor algorithm in accordance with the well-accepted Euclidean distance measure and the spectral angle mapper measure. This paper also proposes a hierarchical combination of these measures for spectral matching. Finally, a separability assessment based on the between-class and within-class scatter matrices is followed to evaluate the performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.3121-3143
• /
• 2019

Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2008년도 정보통신설비 학술대회
• /
• pp.531-534
• /
• 2008

Image Hash specifies as a descriptor that can be used to measure similarity in images. Among all image Hash methods, histogram based image Hash has robustness to common noise-like operation and various geometric except histogram _equalization. In this_paper an improved histogram based Image Hash that is using "Imadjust" filter I together is proposed. This paper has achieved a satisfactory performance level on histogram equalization as well as geometric deformation.

• International Journal of Internet, Broadcasting and Communication
• /
• 제7권1호
• /
• pp.15-19
• /
• 2015

The depth information of an image is used in a variety of applications including 2D/3D conversion, multi-view extraction, modeling, depth keying, etc. There are various methods to acquire depth information, such as the method to use a stereo camera, the method to use the depth camera of flight time (TOF) method, the method to use 3D modeling software, the method to use 3D scanner and the method to use a structured light just like Microsoft's Kinect. In particular, the depth camera of TOF method measures the distance using infrared light, whereas TOF sensor depends on the sensitivity of optical light of an image sensor (CCD/CMOS). Thus, it is mandatory for the existing image sensors to get an infrared light image by bundling several pixels; these requirements generate a phenomenon to reduce the resolution of an image. This thesis proposed a measure to acquire a high-resolution image through gradual area movement while acquiring a low-resolution image through pixel bundling method. From this measure, one can obtain an effect of acquiring image information in which illumination intensity (lux) and resolution were improved without increasing the performance of an image sensor since the image resolution is not improved as resolving a low-illumination intensity (lux) in accordance with the gradual pixel bundling algorithm.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권8호
• /
• pp.837-841
• /
• 2010

본 논문에서는 MPEG-7 DCD를 이용하여 내용기반 이미지 검색을 할 때 적합한 유사도 측정 방법을 제안한다. 제안한 방법은 이미지에서 추출한 도미넌트 컬러의 비율에 따라 유사도를 측정할 수 있도록 하였다. 실험결과 제안한 방법은 MPEG-7 DCD의 QHDM[1]에 의한 검색결과보다 전역 DCD를 사용할 경우 ANMRR이 18.9%의 성능향상을 보였으며 블록별 DCD를 사용할 경우 47.2%라는 높은 성능향상을 보였다. 이는 제안한 방법이 DCD를 이용하여 내용기반 이미지 검색을 할 때 효과적인 유사도 측정 방법임을 보여준다. 특히, 영역 기반의 이미지 검색 방법에 유용하게 적용할 수 있을 것으로 보인다.

• 방송공학회논문지
• /
• 제16권3호
• /
• pp.552-560
• /
• 2011

본 논문에서는 영상의 선명도를 영상의 주파수 도메인 정보를 이용하여 측정하는 새로운 무기준법 화질 평가 방법을 제안한다. 기존에, 영상에 대한 선명도는 일반적으로 영상의 픽셀 값을 이용하여 측정되었다. 제안된 방법은 기존 방법과 달리 영상에 대한 선명도를 주파수 도메인 정보를 이용하여 측정하였다. 주파수 도메인에서 선명도를 평가하기 위하여 주어진 영상은 가우시안 저주파 필터를 사용하여 열화 되고, 열화 영상과 주어진 영상의 주파수 영역 계수를 사용하여 새로운 선명도 평가 함수를 정의하였다. 제안된 방법의 성능 검증은 TID2008 화질 평가 데이터베이스를 사용하여 이루어졌다. 기존 무기준법 영상 선명도 평가 방법과 비교하였을 때, 제안된 선명도 평가 방법은 주관적 화질 점수와 보다 높은 상관도를 보였다.

• Journal of applied mathematics & informatics
• /
• 제41권5호
• /
• pp.1115-1128
• /
• 2023

In this paper, a novel hybrid method for multi-focus image fusion is proposed. The method combines the advantages of wavelet transform-based methods and focus-measure-based methods to achieve an improved fusion result. The input images are first decomposed into different frequency sub-bands using the discrete wavelet transform (DWT). The focus measure of each sub-band is then calculated using the Laplacian of Gaussian (LoG) operator, and the sub-band with the highest focus measure is selected as the focused sub-band. The focused sub-band is sharpened using an unsharp masking filter to preserve the details in the focused part of the image.Finally, the sharpened focused sub-bands from all input images are fused using the maximum intensity fusion method to preserve the important information from all focus images. The proposed method has been evaluated using standard multi focus image fusion datasets and has shown promising results compared to existing methods.