• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.323-330
• /
• 2019

Radiometric normalization with multi-temporal satellite images is essential for time series analysis and change detection. Generally, relative radiometric normalization, which is an image-based method, is performed, and histogram matching is a representative method for normalizing the non-linear properties. However, since it utilizes global statistical information only, local information is not considered at all. Thus, this paper proposes a histogram matching method considering local information. The proposed method divides histograms based on density, mean, and standard deviation of image intensities, and performs histogram matching locally on the sub-histogram. The matched histogram is then further partitioned and this process is performed again, iteratively, controlled with the wasserstein distance. Finally, the proposed method is compared to global histogram matching. The experimental results show that the proposed method is visually and quantitatively superior to the conventional method, which indicates the applicability of the proposed method to the radiometric normalization of multi-temporal images with non-linear properties.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.304-306
• /
• 2007

Methods of Object recognition from camera image are to compare features of color. edge or pattern with model in a general way. SIFT(scale-invariant feature transform) has good performance but that has high complexity of computation. Using simple color histogram has low complexity. but low performance. In this paper we represent a model as a color cooccurrence histogram. and we improve performance using pyramid matching. The color cooccurrence histogram keeps track of the number of pairs of certain colored pixels that occur at certain separation distances in image space. The color cooccurrence histogram adds geometric information to the normal color histogram. We suggest object recognition by pyramid matching of color cooccurrence histogram.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.517-521
• /
• 2008

Hand motion classification problem is considered as basis for sign or gesture recognition. We promote optical flow as main feature extracted from images sequences to simultaneously segment the motion's area by its magnitude and characterize the motion' s directions by its orientation. We manage the flow orientation histogram as motion descriptor. A motion is encoded by concatenating the flow orientation histogram from several frames. We utilize simple histogram matching to classify the motion sequences. Attempted experiments show the feasibility of our method for hand motion localization and classification.

• ETRI Journal
• /
• v.24 no.1
• /
• pp.23-30
• /
• 2002

MPEG-7 Visual Standard specifies a set of descriptors that can be used to measure similarity in images or video. Among them, the Edge Histogram Descriptor describes edge distribution with a histogram based on local edge distribution in an image. Since the Edge Histogram Descriptor recommended for the MPEG-7 standard represents only local edge distribution in the image, the matching performance for image retrieval may not be satisfactory. This paper proposes the use of global and semi-local edge histograms generated directly from the local histogram bins to increase the matching performance. Then, the global, semi-global, and local histograms of images are combined to measure the image similarity and are compared with the MPEG-7 descriptor of the local-only histogram. Since we exploit the absolute location of the edge in the image as well as its global composition, the proposed matching method can retrieve semantically similar images. Experiments on MPEG-7 test images show that the proposed method yields better retrieval performance by an amount of 0.04 in ANMRR, which shows a significant difference in visual inspection.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.927-933
• /
• 2013

Face detection algorithm of OpenCV recognizes the faces by Haar matching between input image and Haar features which are learned through a set of training images consisting of many front faces. Therefore the face detection method by Haar matching yields a high face detection rate for the front faces but not in the case of the pan and deformed faces. On the assumption that distributional characteristics of color histogram is similar even if deformed or side faces, a face detection method using the histogram pattern matching is proposed in this paper. In the case of the missed detection and false detection caused by Haar matching, the proposed face detection algorithm applies the histogram pattern matching with the correct detected face area of the previous frame so that the face region with the most similar histogram distribution is determined. The experiment for evaluating the face detection performance reveals that the face detection rate was enhanced about 8% than the conventional method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1231-1236
• /
• 2006

The contrast control of images with narrow dynamic range is a simple method among enhancement methods for low intensity of image. Histogram equalization is the most common method for this purpose, which stretches the dynamic range of intensity Conventional methods would fail to enhance images with extremely dark and bright regions, because of not considering the shape of histogram. In this paper, we propose a novel adaptive histogram equalization based on histogram matching with multiple Gaussian transformation function. As a result, output images with a couple of peaks of histogram could be improved and the details such as edges in dark regions could be appeared better than conventional method subjectively.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1577-1584
• /
• 2007

Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.364-366
• /
• 2005

From the 90's, the image information retrieval methods have been on progress. As good examples of the methods, Conventional histogram method and merged-color histogram method were introduced. They could get good result in image retrieval. However, Conventional histogram method has disadvantages if the histogram is shifted as a result of intensity change. Merged-color histogram, also, causes more process so, it needs more time to retrieve images. In this paper, we propose an improved new method using Adaptive Color Histogram Bin Matching(AHB) in image retrieval. The proposed method has been tested and verified through a number of simulations using hundreds of images in a database. The simulation results have Quickly yielded the highly accurate candidate images in comparison to other retrieval methods. We show that AHB's can give superior results to color histograms for image retrieval.

• Korean Journal of Remote Sensing
• /
• v.38 no.1
• /
• pp.33-43
• /
• 2022

This study presents a method to restore an optical satellite image with distortion and occlusion due to fog, haze, and clouds to one that minimizes degradation factors by referring to the same type of peripheral image. Specifically, the time and cost of re-photographing were reduced by partially occluding a region. To maintain the original image's pixel value as much as possible and to maintain restored and unrestored area continuity, a simulation restoration technique modified with the Cycle Generative Adversarial Network (CycleGAN) method was developed. The accuracy of the simulated image was analyzed by comparing CycleGAN and histogram matching, as well as the pixel value distribution, with the original image. The results show that for Site 1 (out of three sites), the root mean square error and R² of CycleGAN were 169.36 and 0.9917, respectively, showing lower errors than those for histogram matching (170.43 and 0.9896, respectively). Further, comparison of the mean and standard deviation values of images simulated by CycleGAN and histogram matching with the ground truth pixel values confirmed the CycleGAN methodology as being closer to the ground truth value. Even for the histogram distribution of the simulated images, CycleGAN was closer to the ground truth than histogram matching.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.119-128
• /
• 2014

In this paper, a fast human detection method using adaptive UV-histogram and template matching is proposed. The proposed method improves the detection rate in the scene of complex environment. The method firstly generates U-histogram to extract human candidates and adaptively generates V-histogram for each labled U-histogram, thus it could extract humans correctly, which was impossible in the previous method. The method tries to match the human candidates with the adaptively sized omega shape template to the focal length and distance in order to improve the detection accuracy. It also detects false positives by rematching the template with accumulated foreground images and hence is robust to the occlusion. Experimental results showed that the proposed method has superior performance to the Bae's method in the complex environment with about 15% improvement in precision and 80% in recall and has 20 times faster processing time than Xia's method.