• Korean Journal of Remote Sensing
• /
• v.26 no.2
• /
• pp.87-98
• /
• 2010

For generating accurate land cover map over the whole Korean Peninsula, post-mosaic classification method is desirable in large area where multiple image data sets are used. We try to derive an optimal mosaic method of multi-temporal Landsat ETM+ scenes for the land cover classification over the Korea Peninsula. Total 65 Landsat ETM+ scenes were acquired, which were taken in 2000 and 2001. To reduce radiometric difference between adjacent Landsat ETM+ scenes, we apply three relative radiometric correction methods (histogram matching, 1st-regression method referenced center image, and 1st-regression method at each Landsat ETM+ path). After the relative correction, we generated three mosaic images for three seasons of leaf-off, transplanting, leaf-on season. For comparison, three mosaic images were compared by the mean absolute difference and computer classification accuracy. The results show that the mosaic image using 1st-regression method at each path show the best correction results and highest classification accuracy. Additionally, the mosaic image acquired during leaf-on season show the higher radiance variance between adjacent images than other season.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.152-152
• /
• 2019

This study demonstrates a novel approach of remotely sensed estimates of stream flow at fifteen hydrological station in the Han River Basin, Korea. Multi-temporal data of the European Space Agency's Sentinel-1 SAR satellite from 19 January, 2015 to 25 August, 2018 is used to develop and validate the flow estimation model for each station. The flow estimation model is based on a power law relationship established between the remotely sensed surface area of water at a selected reach of the stream and the observed discharge. The satellite images were pre-processed for thermal noise, radiometric, speckle and terrain correction. The difference in SAR image brightness caused by the differences in SAR satellite look angle and atmospheric condition are corrected using the histogram matching technique. Selective area filtering is applied to identify the extent of the selected stream reach where the change in water surface area is highly sensitive to the change in stream discharge. Following this, an iterative procedure called the Optimum Threshold Classification Algorithm (OTC) is applied to the multi-temporal selective areas to extract a series of water surface areas. It is observed that the extracted water surface area and the stream discharge are related by the power law equation. A strong correlation coefficient ranging from 0.68 to 0.98 (mean=0.89) was observed for thirteen hydrological stations, while at two stations the relationship was highly affected by the hydraulic structures such as dam. It is further identified that the availability of remotely sensed data for a range of discharge conditions and the geometric properties of the selected stream reach such as the stream width and side slope influence the accuracy of the flow estimation model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• 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 the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.29-37
• /
• 2006

Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding employed the normalized histogram as a discrete probability density function. Also it utilized a criterion that minimizes the between-class variance of pixel intensity to choose a threshold value for segmentation. However, the Otsu's method has a disadvantage of repeatedly searching optimal thresholds for the entire range. In this paper, a simple but fast multi-level thresholding approach is proposed by means of extending the Otsu's method. Rather than invoke the Otsu's method for the entire gray range, we advocate that the gray-level range of an image be first divided into smaller sub-ranges, and that the multi-level thresholds be achieved by iteratively invoking this dividing process. Initially, in the proposed method, the gray range of the object image is divided into 2 classes with a threshold value. Here, the threshold value for segmentation is selected by invoking the Otsu's method for the entire range. Following this, the two classes are divided into 4 classes again by applying the Otsu's method to each of the divided sub-ranges. This process is repeatedly performed until the required number of thresholds is obtained. Our experimental results for three benchmark images and fifty faces show a possibility that the proposed method could be used efficiently for pattern matching and face recognition.