• Journal of the Korea Computer Graphics Society
• /
• v.14 no.3
• /
• pp.1-9
• /
• 2008

This paper presents a novel optimization-based saliency-preserving method for converting color images to grayscale in a manner consistent with conventional approaches of black-and-white photographers. In black-and-white photography, a colored filter called a contrast filter has been commonly employed on a camera to lighten or darken selected colors. In addition, local exposure controls such as dodging and burning techniques are typically employed in the darkroom process to change the exposure of local areas within the print without affecting the overall exposure. Our method seeks a digital version of a conventional contrast filter to preserve visually-important image features. Furthermore, conventional burning and dodging techniques are addressed, together with image similarity weights, to give edge-aware local exposure control over the image space. Our method can be efficiently optimized on GPU. According to the experiments, CUDA implementation enables 1 megapixel color images to be converted to grayscale at interactive frames rates.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.3
• /
• pp.126-135
• /
• 2011

In this study, the algorithm for priority area of forest fire surveillance was developed to enhance the effectiveness of fire detection. The high priority surveillance area for forest fire detection was defined as the area with not only low value of viewshed analysis of the lookouts and detection cameras but also high fire occurrence probability. To build the priority map, fuzzy function and map algebra were used. The analysis results of Bonghwa-gun, Gyeongbuk Province, showed that the surveillance priority of central and southern area is higher than north area. This algorithm could be used in the allocation of fire prevention resources and selection of suitable point for new fire detection system.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.501-508
• /
• 2004

This paper proposes a virtual relevant document technique in the teaming phase for text categorization. The method uses a simple transformation of relevant documents, i.e. making virtual documents by combining document pairs in the training set. The virtual document produced by this method has the enriched term vector space, with greater weights for the terms that co-occur in two relevant documents. The experimental results showed a significant improvement over the baseline, which proves the usefulness of the proposed method: 71% improvement on TREC-11 filtering test collection and 11% improvement on Routers-21578 test set for the topics with less than 100 relevant documents in the micro average F1. The result analysis indicates that the addition of virtual relevant documents contributes to the steady improvement of the performance.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.253-262
• /
• 2000

This paper proposes a new RBF neural network that determines the number and the center of hidden neurons based on the adaptive feature extraction for the input data. The principal component analysis is applied for extracting adaptively the features by reducing the dimension of the given input data. It can simultaneously achieve a superior property of both the principal component analysis by mapping input data into set of statistically independent features and the RBF neural networks. The proposed neural networks has been applied to classify the 200 breast cancer databases by 2-class. The simulation results shows that the proposed neural networks has better performances of the learning time and the classification for test data, in comparison with those using the k-means clustering algorithm. And it is affected less than the k-means clustering algorithm by the initial weight setting and the scope of the smoothing factor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2199-2205
• /
• 2013

In modern society the image processing has been applied to various digital devices such as smartphone, digital camera, and digital TV. In the field of image processing the edge detection is one of the important parts in the image processing procedure. The image edge means point that the pixel value is changed between background and object rapidly, and includes the important information such as magnitude, location, and orientation. The performance of the existing edge detection method is insufficient for the image degraded by AWGN(additive white Gaussian noise) because it detects edges by using small weighted masks. Therefore, in this paper, to detect edge in AWGN environment effectively, we proposed an algorithm that detects edge as calculated gradient of sorting vector which is transformed by estimated mask from new pixel according to each region.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.369-376
• /
• 2006

The degradation and its inverse modeling can achieve restoration of corrupted image, caused by scaled digitization and electronic transmission. De-speckle process on the noisy document(or SAR) images is one of the basic examples. Non-linearity of the speckle noise model may hinder the inverse process. In this paper, our study is focused on investigation of the restoration methods for bi-level document image degraded by the impulse noise model. Our study shows that, on bi-level document images, the weighted-median filter and the Lee filter methods are very effective among other spatial filtering methods, but wavelet filter method is ineffective in aspect of processing speed: approximately 100 times slower. Optimal values of the weight to be used in the weighted median filter are investigated and presented in this paper.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.3
• /
• pp.323-329
• /
• 2002

This paper proposes a frame reliability weighting method to compensate for a time-selective noise that occurs at random positions of speech signal contaminating certain parts of the speech signal. Speech frames have different degrees of reliability and the reliability is proportional to SNR (signal-to noise ratio). While it is feasible to estimate frame Sl? by using the noise information from non-speech interval under a stationary noisy situation, it is difficult to obtain noise spectrum for a time-selective noise. Therefore, we used statistical models of clean speech for the estimation of the frame reliability. The proposed MFR (model-based frame reliability) approximates frame SNR values using filterbank energy vectors that are obtained by the inverse transformation of input MFCC (mal-frequency cepstral coefficient) vectors and mean vectors of a reference model. Experiments on various burnt noises revealed that the proposed method could represent the frame reliability effectively. We could improve the recognition performance by using MFR values as weighting factors at the likelihood calculation step.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.2
• /
• pp.162-170
• /
• 2015

Commute time embedding involves computing the spectral decomposition of the graph Laplacian. It requires the computational burden proportional to $o(n^3)$, not suitable for large scale dataset. Many methods have been proposed to accelerate the computational time, which usually employ the Nystr${\ddot{o}}$m methods to approximate the spectral decomposition of the reduced graph Laplacian. They suffer from the lost of information by dint of sampling process. This paper proposes to reduce the errors by approximating the spectral decomposition of the graph Laplacian using that of the affinity matrix. However, this can not be applied as the data size increases, because it also requires spectral decomposition. Another method called approximate commute time embedding is implemented, which does not require spectral decomposition. The performance of the proposed algorithms is analyzed by computing the commute time on the patch graph.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.108-117
• /
• 2015

If typical contrast enhancement algorithms for natural images are applied to X-ray images, they may cause artifacts such as overshooting or produce unnatural visual quality because they do not consider inherent characteristics of X-ray images. In order to overcome such problems, we propose a locally adaptive block-based contrast enhancement algorithm for X-ray images. After we derive a weighted cumulative distribution function for each block, we apply it to each block for contrast enhancement. Then, we obtain images that are removed from block effect by adopting block-based overlapping. In post-processing, we obtain the final image by emphasizing high frequency components. Experimental results show that the proposed block-based contrast enhancement algorithm provides at maximum 5-times higher visual quality than the exiting algorithm in terms of quantitative contrast metric.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.55-67
• /
• 1998

This paper presents an automatic facial feature point extraction algorithm in sequential color images. To extract facial region in the video sequence, a moving color detection technique is proposed that emphasize moving skin color region by applying motion detection algorithm on the skin-color transformed images. The threshold value for the pixel difference detection is also decided according to the transformed pixel value that represents the probability of the desired color information. Eye candidate regions are selected using both of the black/white color information inside the skin-color region and the valley information of the moving skin region detected using morphological operators. Eye region is finally decided by the geometrical relationship of the eyes and color histogram. To decide the exact feature points, the PCA(Principal Component Analysis) is used on each eye and mouth regions. Experimental results show that the feature points of eye and mouth can be obtained correctly irrespective of background, direction and size of face.