• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.426-429
• /
• 2004

To reconstruct the 3-D information of a irregular object, this paper proposes a new method applying the composition focus measure to time-series image. A focus measure function is carefully selected because a focus measure is apt to be affected by the working environment and the characteristics of an object. The proposed focus measure function combines the variance measure which is robust to noise and the Laplacian measure which, regardless of an object shape, has a good performance in calculating the focus measure. And the time-series image, which considers the object shape, is proposed in order to efficiently applying the interesting window. This method, first, divides the image frame by the window. Second, the composition focus measure function be applied to the windows, and the time-series image is constructed. Finally, the 3-D information of an object is reconstructed from the time-series images considering the object shape. The experimental results have shown that the proposed method is suitable algorithm to 3-D reconstruction of an irregular object.

• 지능정보연구
• /
• 제13권4호
• /
• pp.79-90
• /
• 2007

영상의 품질을 측정하는 것은 영상처리에서 매우 중요한 문제이다. 지금까지 영상 품질을 측정하기 위한 다양한 방법들이 제시되었고, 이들은 수학적인 관점에서 영상의 품질을 적절히 표현해주고 있다. 그러나, 수학적인 측정과 인간의 시각에 의해서 측정되는 품질은 서로 다를 수 있고 영상이 전달되는 최종 대상체는 인간의 시각이기 때문에 이를 고려한 영상품질 측정 방법이 필요하다. 본 논문에서는 사람의 시각적 특성을 고려하여 영상 품질을 측정할 수 있는 통계적 방법을 제시하였다. 사람의 시각은 영상의 전체적인 품질을 판단하면서도 국부적인 위치에서의 품질을 판단하며, 전체적인 영상의 품질보다는 국부적인 위치에서의 품질이 시각적인 영상품질 판단에 미치는 영향이 크다. 본 논문에서는 영상을 세그먼트화하고 각 세그먼트화된 영상에서 얻어진 영상 품질 값에 스코어링을 하는 통계적 기법을 사용하여 시각에 의한 판단과 유사한 결과를 얻었다.

• 한국정보통신학회논문지
• /
• 제10권3호
• /
• pp.549-555
• /
• 2006

에지검출은 영상처리와 컴퓨터비젼의 매우 중요한 연구분야이다. 그리고 일반적인 에지검출 연산자인 Robert, Sobel, Kirsh등의 연산자는 계단에지를 검출하는데는 적합하나 잡음에 매우 민감한 단점을 가지고 있다. 따라서 본 논문에서는 영상정보척도와 신경회로망을 이용한 잡음에 매우 강한 계단에지 검출방법을 제안한다. 계단에지의 명암도 분포의 차, 방향성, 연속성, 구조성 등의 계단에지의 기본적인 정보특성을 이용한 함수를 BP 신경회로망의 입력벡터로 구성한 결과 매우 위치가 정확한 계단에지를 얻을 수 있었다. 또한 실험 영상으로 장미 영상과 세포영상을 사용하여 매우 만족스런 실험 결과를 얻을 수 있었다.

• 한국통신학회논문지
• /
• 제21권3호
• /
• pp.587-599
• /
• 1996

In general fractal imge compression, each range block is approximated by a contractive transform of the matching domain block under the mean squared error criterion. In this paper, a distortion measure reflecting the properties of human visual system is defined and applied to a fractal image compression. the perceptual distortion measure is obtained by multiplying the mean square error and the noise sensitivity modeled by using the background brightness and spatial masking. In order to compare the performance of the mean squared error and perceptual distortion measure, a simulation is carried out by using the 512*512 Lena and papper gray image. Compared to the results, 6%-10% compression ratio improvements under improvements under the same image quality are achieved in the perceptual distortion measure.

• International Journal of Computer Science & Network Security
• /
• 제21권9호
• /
• pp.275-280
• /
• 2021

With the development of communication networks, the processes of exchanging and transmitting information rapidly developed. As millions of images are sent via social media every day, also wireless sensor networks are now used in all applications to capture images such as those used in traffic lights, roads and malls. Therefore, there is a need to reduce the size of these images while maintaining an acceptable degree of quality. In this paper, we use Python software to apply K-mean Clustering algorithm to compress RGB images. The PSNR, MSE, and SSIM are utilized to measure the image quality after image compression. The results of compression reduced the image size to nearly half the size of the original images using k = 64. In the SSIM measure, the higher the K, the greater the similarity between the two images which is a good indicator to a significant reduction in image size. Our proposed compression technique powered by the K-Mean clustering algorithm is useful for compressing images and reducing the size of images.

• 대한원격탐사학회지
• /
• 제28권6호
• /
• pp.611-622
• /
• 2012

This study proposed two multisensor fusion methods for segment-based image classification utilizing a region-growing segmentation. The proposed algorithms employ a Gaussian-PDF measure and an evidential measure respectively. In remote sensing application, segment-based approaches are used to extract more explicit information on spatial structure compared to pixel-based methods. Data from a single sensor may be insufficient to provide accurate description of a ground scene in image classification. Due to the redundant and complementary nature of multisensor data, a combination of information from multiple sensors can make reduce classification error rate. The Gaussian-PDF method defines a regional measure as the PDF average of pixels belonging to the region, and assigns a region into a class associated with the maximum of regional measure. The evidential fusion method uses two measures of plausibility and belief, which are derived from a mass function of the Beta distribution for the basic probability assignment of every hypothesis about region classes. The proposed methods were applied to the SPOT XS and ENVISAT data, which were acquired over Iksan area of of Korean peninsula. The experiment results showed that the segment-based method of evidential measure is greatly effective on improving the classification via multisensor fusion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권3호
• /
• pp.522-538
• /
• 2013

Content based image retrieval has become an increasingly important research topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The retrieval systems rely on a key component, the predefined or learned similarity measures over images. We note that, the similarity measures can be potential improved if the data distribution information is exploited using a more sophisticated way. In this paper, we propose a similarity measure learning approach for image retrieval. The similarity measure, so called Fisher kernel, is derived from the probabilistic distribution of images and is the function over observed data, hidden variable and model parameters, where the hidden variables encode high level information which are powerful in discrimination and are failed to be exploited in previous methods. We further propose a discriminative learning method for the similarity measure, i.e., encouraging the learned similarity to take a large value for a pair of images with the same label and to take a small value for a pair of images with distinct labels. The learned similarity measure, fully exploiting the data distribution, is well adapted to dataset and would improve the retrieval system. We evaluate the proposed method on Corel-1000, Corel5k, Caltech101 and MIRFlickr 25,000 databases. The results show the competitive performance of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2895-2912
• /
• 2014

Content-based image retrieval has been the most important technique for managing huge amount of images. The fundamental yet highly challenging problem in this field is how to measure the content-level similarity based on the low-level image features. The primary difficulties lie in the great variance within images, e.g. background, illumination, viewpoint and pose. Intuitively, an ideal similarity measure should be able to adapt the data distribution, discover and highlight the content-level information, and be robust to those variances. Motivated by these observations, we in this paper propose a probabilistic similarity learning approach. We first model the distribution of low-level image features and derive the free energy kernel (FEK), i.e., similarity measure, based on the distribution. Then, we propose a learning approach for the derived kernel, under the criterion that the kernel outputs high similarity for those images sharing the same class labels and output low similarity for those without the same label. The advantages of the proposed approach, in comparison with previous approaches, are threefold. (1) With the ability inherited from probabilistic models, the similarity measure can well adapt to data distribution. (2) Benefitting from the content-level hidden variables within the probabilistic models, the similarity measure is able to capture content-level cues. (3) It fully exploits class label in the supervised learning procedure. The proposed approach is extensively evaluated on two well-known databases. It achieves highly competitive performance on most experiments, which validates its advantages.

• 대한원격탐사학회지
• /
• 제27권6호
• /
• pp.693-701
• /
• 2011

Image registration is an essential process to analyze the time series of satellite images for the purpose of image fusion and change detection. The Mutual Information (MI) is commonly used as similarity measure for image registration because of its robustness to noise. Due to the radiometric differences, it is not easy to apply MI to multi-temporal satellite images using directly the pixel intensity. Image features for MI are more abundantly obtained by employing a Gabor filter which varies adaptively with the filter characteristics such as filter size, frequency and orientation for each pixel. In this paper we employed Bidirectional Gabor Filter Energy (BGFE) defined by Gabor filter features and applied the BGFE to similarity measure calculation as an image feature for MI. The experiment results show that the proposed method is more robust than the conventional MI method combined with intensity or gradient magnitude.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1811-1814
• /
• 2003

In this paper, a novel watermarking technique is proposed to authenticate the owner-ship of copyright for the digital contents. Using the 2-level DWT(Discrete Wavelet Transform) we divide a specific frequency band into detailed blocks and apply PIM(picture information measure). After the complexity is calculated, the watermark is embedded in only on high complexity areas. Conventional watermarking technique damages to the original image, because it does not consider the feature of the whole area or a specific frequency band. Easily affected by noise and compression, it is difficult to extract the watermark. However, the proposed watermarking technique, considering the complexity of input image, does not damage to the original image Simulation result show that the proposed technique has the robustness of JPEG compression, noise and filtering such as a general signal processing