• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.45-52
• /
• 2008

In this paper, we describe the Perceptually Weighted Histogram(PWH) and the Gaussian Weighted Histogram Intersection(GWHI) algorithms. These algorithms are able to provide positive results in image retrieval. But these histogram methods alter the histogram of an image by using particular lighting conditions. Even two pictures with little differences in lighting are not easily matched. Therefore, we propose that the Histogram Matching Algorithm(HMA) is able to overcome the problem of an image being changed by the intensity or color in the image retrieval. The proposed algorithm is insensitive to changes in the lighting. From the experiment results, the proposed algorithm can achieve up to 32% and up to 30% more recall than the PWH and GWHI algorithms, respectively. Also, it can achieve up to 38% and up to 34% more precision than PWH and GWHI, respectively Therefore, with our experiments, we are able to show that the proposed algorithm shows limited variation to changes in lighting.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.312-322
• /
• 2012

The paper presents an approach for recognizing the broken area of the traffic signs. The method is based on the Recognition System for Traffic Signs (RSTS). This paper describes an approach to using the location histogram matching for the broken traffic signs recognition, after the general process of the image detection and image categorization. The recognition proceeds by using the SIFT matching to adjust the acquired image to a standard position, then the histogram bin will be compared preprocessed image with reference image, and finally output the location and percents value of the broken area. And between the processing, some preprocessing like the blurring is added in the paper to improve the performance. And after the reorganization, the program can operate with the GPS for traffic signs maintenance. Experimental results verified that our scheme have a relatively high recognition rate and a good performance in general situation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.385-388
• /
• 2013

In this paper, we show the weakness of the image matching method by using MPEG-7 EHD(Edge Histogram Descriptor) and suggest how to improve this weakness by using image normalization. EHD algorithm is an image matching technique that collects edge's slope of distribution and same distribution. However, the EHD error rate is high because EHD is sensitive for changes of object distortion and rotation that will be matched. We improve matching performance by accurately extract edge information in image by using normalization. We compare and analyze the normalized EHD algorithm by using distortion and rotation and it shows robustness for changes of the size and rotation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.159-167
• /
• 2013

In stereo-view system, variations of target camera position or lighting conditions cause discrepancies on the luminance and chrominance components of stereo views. These discrepancies lead to inaccurate frame view prediction and low quality of 3 D video coding. In this paper, an efficient histogram interval calibration method is proposed for stereo-view coding, so as to compensate for the luminance component of target view. First the proposed method is analyzed by the histogram of the target image frame. Then, it divide two sections of histogram of that frame to correct the color discrepancies. Secondly, each section of the target frame is corrected the luminance component by identify the maximum matching region between the reference frame and the target frame. We have verified our proposed histogram matching method in comparison with the other color correction ones. Experimental results show that it can correct better luminance calibration results of PSNR(Peak Signal to Noise Ratio) and has less computation time.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.768-782
• /
• 2010

Because of the different shooting position between multi-view cameras and the imperfect camera calibration, Illumination mismatches of multi-view video can happen. This variation can bring about the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be applied to recompensate these inconsistencies in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However the histogram distribution can be different not only between neighboring views but also between sequential views on account of movements of camera angle and some objects, especially human. Therefore the histogram matching algorithm which references all frames in chose view is not appropriate for compensating the illumination differences of these sequence. Thus we propose new algorithms both the image classification algorithm which is applied two criteria to improve the correlation between inter-view frames and the histogram matching which references and matches with a group of pictures(GOP) as a unit to advance the correlation between successive frames. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional algorithms.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.131-143
• /
• 1998

This paper presents a high performance disparity extraction algorithm that generate a dense and accurate disparity map using low-resolution disparity histogram. Disparity distribution of background and object areas can besegmented from low-resolution disparity histogram. These information can be used to reduce the search area and search range of the high-resolution image resulting reliable disparity information in high speed. The computationally efficient matching pixel count(MPC) similarity measure technique is useed extensively toremove the redundancies inherent in the area-based matching method, and also results robust matching at the boundary region. Resulting maches are further improved using iterative support algorithm and post processing. We have obtained good results on randomdot stereogram and real images obtained in our carmera system.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.902-915
• /
• 2011

Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.10
• /
• pp.1030-1035
• /
• 2014

Machine vision inspection systems have replaced human inspectors in defect inspection fields for several decades. However, the inspection results of machine vision are often affected by small changes of illumination. When small changes of illumination appear in image histograms, the influence of illumination can be decreased by transformation of the histogram. In this paper, we propose an enhanced histogram matching algorithm which corrects distorted histograms by variations of illumination. We use the resolution resizing method for an optimal matching of input and reference histograms and reduction of quantization errors from the digitizing process. The proposed algorithm aims not only for improvement of the accuracy of defect detection, but also robustness against variations of illumination in machine vision inspection. The experimental results show that the proposed method maintains uniform inspection error rates under dramatic illumination changes whereas the conventional inspection method reveals inconsistent inspection results in the same illumination conditions.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.231-233
• /
• 2009

The object recognition is one of the major computer vision fields. The object recognition using features(SIFT) is finding common features in input images and query images. But the object recognition using feature methods has suffered of difficulties due to heavy calculations when resizing input images and query images. In this paper, we focused on speed up finding features in the images. we proposed method using block segmentation and histogram. Block segmentation used diving input image and than histogram decided correlation between each 1]lock and query image. This paper has confirmed that tile matching time reduced for object recognition since reducing block.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.2
• /
• pp.45-56
• /
• 2015

In this paper we propose a very rapid moving object tracking method for an object-based auto focus on a smart phone camera. By considering the limit of non-learning approach on low-performance platforms, we use a sliding-window detection technique based on histogram features. By adapting the integral histogram, we solve the problem of the time-consuming histogram computation on each sub-window. For more speed up, we propose a local candidate search, and an adaptive scaling template method. In addition, we propose to apply a stabilization term in the matching function for a stable detection location. In experiments on our dataset, we demonstrated that we achieved a very rapid tracking performance demonstrating over 100 frames per second on a PC environment.