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

The initial X-ray images obtained from a digital X-ray machine have a wide data range and uneven brightness level than normal images. In particular, in Chest X-ray images, it is necessary to improve naturally all of the parts such as ribs, spine, tissue, etc. These X-ray images can not be improved enough from conventional image quality enhancement algorithms because their characteristics are different from ordinary images'. This paper proposes to eliminate unnecessary background from an input image and expand the histogram range of the image. Then, we adjust the weight per frequency band of the image for improvement of contrast and sharpness. Finally, jointly taking the advantages of global contrast enhancement and local contrast enhancement methods we obtain an improved X-ray image suitable for effective diagnosis in comparison with the existing methods. Experimental results show quantitatively that the proposed algorithm provides better X-ray images in terms of the discrete entropy and saturation than the previous works.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.61-69
• /
• 2011

This paper proposes a new algorithm that improve color component of compensated image using Retinex method for back-light image. A back-light image has two regions, one of the region is too bright and the other one is too dark. If an back-light image is improved contrast using Retinex method, it loses color information in the part of brightness of the image. In order to make up loss information, proposed algorithm adds color components from original image. The histogram can be divided three parts that brightness, darkness, midway using K-mean (k=3) algorithm. For the brightness, it is used color information of the original image. For the darkness, it is converted using by Retinex method. The midway region is mixed between original image and Retinex result image in the ratio of histogram. The ratio is determined by distance from dark area. The proposed algorithm was tested on nature back-light images to evaluate performance, and the experimental result shows that proposed algorithm is more robust than original Retinex algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.930-938
• /
• 2005

We propose a content-based image retrieval(CBIR) method based on an efncient combination of a color feature and multiresolution texture features. As a color feature, a HSV autocorrelograrn is chosen which is blown to measure spatial correlation of colors well. As texture features, BDIP and BVLC moments are chosen which is hewn to measure local intensity variations well and measure local texture smoothness well, respectively. The texture features are obtained in a wavelet pyramid of the luminance component of a color image. The extracted features are combined for efficient similarity computation by the normalization depending on their dimensions and standard deviation vectors. Experimental results show that the proposed method yielded average $8\%\;and\;11\%$ better performance in precision vs. recall than the method using BDIPBVLC moments and the method using color autocorrelograrn, respectively and yielded at least $10\%$ better performance than the methods using wavelet moments, CSD, color histogram. Specially, the proposed method shows an excellent performance over the other methods in image DBs contained images of various resolutions.

• Convergence Security Journal
• /
• v.19 no.2
• /
• pp.91-104
• /
• 2019

In this paper, we present a novel local descriptor, Local Prominent Directional Pattern (LPDP), to represent the description of facial images for gender recognition purpose. To achieve a clearly discriminative representation of local shape, presented method encodes a target pixel with the prominent directional variations in local structure from an analysis of statistics encompassed in the histogram of such directional variations. Use of the statistical information comes from the observation that a local neighboring region, having an edge going through it, demonstrate similar gradient directions, and hence, the prominent accumulations, accumulated from such gradient directions provide a solid base to represent the shape of that local structure. Unlike the sole use of gradient direction of a target pixel in existing methods, our coding scheme selects prominent edge directions accumulated from more samples (e.g., surrounding neighboring pixels), which, in turn, minimizes the effect of noise by suppressing the noisy accumulations of single or fewer samples. In this way, the presented encoding strategy provides the more discriminative shape of local structures while ensuring robustness to subtle changes such as local noise. We conduct extensive experiments on gender recognition datasets containing a wide range of challenges such as illumination, expression, age, and pose variations as well as sketch images, and observe the better performance of LPDP descriptor against existing local descriptors.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.51-57
• /
• 2012

Hepatic vessel tree is the key structure for hepatic disease diagnosis and liver surgery planning. Especially, it is used to evaluate the donors' and recipients' liver for the LDLT(Living Donors Liver Transplantation) and estimate the volumes of left and right hepatic lobes for securing their life in the LDLT. In this study, we propose a method to apply canny edge detection that is not affected by noise to the liver images for automatic segmentation of hepatic vessels tree in contrast abdominal MDCT image. Using histograms and average pixel values of the various liver CT images, optimized parameters of the Canny algorithm are determined. It is more time-efficient to use the common parameters than to change parameters manually according to CT images. Candidates of hepatic vessels are extracted by threshold filtering around the detected the vessel edge. Finally, using a system which detects the true-negatives and the false-positives in horizontal and vertical direction, the true-negatives are added in candidate of hepatic vessels and the false-positives are removed. As a result of the process, the various hepatic vessel trees of patients are accurately reconstructed in 3D.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.507-515
• /
• 2015

This paper suggests 6 cases of TFA parameters algorithm(Mean, VA, RS, SKEW, UN, EN) to search for the detection of recognition rates regarding breast disease using CAD on ultrasound images. Of the patients who visited a university hospital in Busan city from August 2013 to January 2014, 90 cases of breast ultrasound images based on the findings in breast US and pathology were selected. $50{\times}50$ pixel size ROI was selected from the breast US images. After pre-processing histogram equalization of the acquired test images(negative, benign, malignancy), we calculated results of TFA algorithm using MATLAB. As a result, in the TFA parameters suggested, the disease recognition rates for negative and malignancy was as high as 100%, and negative and benign was approximately 83~96% for the Mean, SKEW, UN, and EN. Therefore, there is the possibility of auto diagnosis as a pre-processing step for a screening test on breast disease. A additional study of the suggested algorithm and the responsibility and reproducibility for various clinical cases will determine the practical CAD and it might be possible to apply this technique to range of ultrasound images.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.4
• /
• pp.14-23
• /
• 2005

This paper proposes a method for matching two different images, especially satellite images. In the general image matching fields, when an image is compared to other image, they may have different properties on the size, contents, brightness, etc. If there is no noise in each image, in other words, they have identical pixel level and unchanged edges, the image matching method will be simple comparison between two images with pixel by pixel. However, in many applications, most of images to be matched should have much different properties. This paper proposes an efficient method for matching satellite images. This method is to match a raw satellite image with GCP chips. From this we can make a geometrically corrected image. The proposed method is based on wavelet transformation, not required any pre-processing such as histogram equalization, analysis of raw image like the traditional methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.6
• /
• pp.485-494
• /
• 2017

This study focuses on automatic image registration between multiple IR images using simple preprocessing method and modified local feature extraction algorithm. The input images were preprocessed by using the median and absolute value after histogram equalization, and it could be effectively applied to reduce the brightness difference value between images by applying the similarity of extracted features to the concept of angle instead of distance. The results were evaluated using visual and inverse RMSE methods. The features that could not be achieved by the existing local feature extraction technique showed high image matching reliability and application convenience. It is expected that this method can be used as one of the automatic registration methods between multi-sensor images under specific conditions.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.1-14
• /
• 2011

While the circulation of images become active, various requirements to manage increasing database are raised. The content-based technology is one of methods to satisfy these requirements. The image is represented by feature vectors extracted by various methods in the content-based technology. The global feature method insures fast matching speed because the feature vector extracted by the global feature method is formed into a standard shape. The global feature extraction methods are classified into two categories, the spatial feature extraction and statistical feature extraction. And each group is divided by what kind of information is used, color feature or gray scale feature. In this paper, we introduce various global feature extraction technologies and compare their performance by accuracy, recall-precision graph, ANMRR, feature vector size and matching time. According to the experiments, the spatial features show good performance in non-geometrical modifications, and the extraction technologies that use color and histogram feature show the best performance.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.2
• /
• pp.231-236
• /
• 2011

The binarization algorithm frequently applies to one part of the preprocessing phase for a variety of image processing techniques such as image recognition and image analysis, etc. So it is important that binarization algorithm is determined by the selection of threshold value for binarization in image processing. The previous algorithms could get the proper threshold value in the case that shows all the difference of brightness between background and object, but if not, they could not get the proper threshold value. In this paper, we propose the efficient fuzzy binarization method which first, segments the brightness range of gray_scale images to 2 intervals to perform car license plate binarization and applies fuzzy member function to each intervals. The experiment for performance evaluation of the proposed binarization algorithm showed that the proposed algorithm generates the more effective threshold value than the previous algorithms in car license plate.