• Journal of Korea Game Society
• /
• v.20 no.3
• /
• pp.65-74
• /
• 2020

In the shadow map method, if the shadow map is magnified, the shadow has a jagged silhouette. Herein, we propose a soft shadow method that filters reshaped silhouettes analytically. First, the shadow silhouette is reshaped through sub-texel edge detection, which is based on linear or quadratic curve models. Second, an integral shadow filtering algorithm is used to accurately obtain the average shadow intensity from a definite integral estimation. The implementation demonstrates that our solution can effectively eliminate jagged aliasing and efficiently generate soft shadows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4968-4986
• /
• 2017

In this paper, we primarily address the difficulty of automatic generation of a plausible depth map from a single image in an unstructured environment. The aim is to extrapolate a depth map with a more correct, rich, and distinct depth order, which is both quantitatively accurate as well as visually pleasing. Our technique, which is fundamentally based on a preexisting DepthTransfer algorithm, transfers depth information at the level of superpixels. This occurs within a framework that replaces a pixel basis with one of instance-based learning. A vital superpixels feature enhancing matching precision is posterior incorporation of predictive semantic labels into the depth extraction procedure. Finally, a modified Cross Bilateral Filter is leveraged to augment the final depth field. For training and evaluation, experiments were conducted using the Make3D Range Image Dataset and vividly demonstrate that this depth estimation method outperforms state-of-the-art methods for the correlation coefficient metric, mean log10 error and root mean squared error, and achieves comparable performance for the average relative error metric in both efficacy and computational efficiency. This approach can be utilized to automatically convert 2D images into stereo for 3D visualization, producing anaglyph images that are visually superior in realism and simultaneously more immersive.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.4
• /
• pp.431-441
• /
• 2016

Since the use of UAV (Unmanned Aerial Vehicle) is convenient for the acquisition of data on broad or inaccessible regions, it is nowadays used to establish spatial information for various fields, such as the environment, ecosystem, forest, or for military purposes. In this study, the process of estimating FVC (Fractional Vegetation Cover), based on multi-spectral UAV, to overcome the limitations of conventional methods is suggested. Hence, we propose that the FVC map is generated by using multi-spectral imaging. First, two types of result classifications were obtained based on RF (Random Forest) using RGB images and NDVI (Normalized Difference Vegetation Index) with RGB images. Then, the result map was reclassified into vegetation and non-vegetation. Finally, an FVC map-based RF were generated by using pixel calculation and FVC map-based GI (Gutman and Ignatov) model were indirectly made by fixed parameters. The method of adding NDVI shows a relatively higher accuracy compared to that of adding only RGB, and in particular, the GI model shows a lower RMSE (Root Mean Square Error) with 0.182 than RF. In this regard, the availability of the GI model which uses only the values of NDVI is higher than that of RF whose accuracy varies according to the results of classification. Our results showed that the GI mode ensures the quality of the FVC if the NDVI maintained at a uniform level. This can be easily achieved by using a UAV, which can provide vegetation data to improve the estimation of FVC.

• Journal of Broadcast Engineering
• /
• v.18 no.1
• /
• pp.21-30
• /
• 2013

It is a challenging problem to most of the image processing when the light source is unknown. The color of the light source must be estimated in order to compensate color changes. To estimate the color of the light source, additional assumption is need, so that we assumed color distribution according to the light source. If the pixels, which do not satisfy the assumption, are used, the estimation fails to provide an accurate result. The most popular color distribution assumption is Grey-World Assumption (GWA); it is the assumption that the color in each scene, the surface reflectance averages to gray or achromatic color over the entire images. In this paper, we analyze the characteristics of the camera response function, and the effect of the Grey-World Assumption on the pixel value and chromaticity, based on the inherent characteristics of the light source. Besides, we propose a novel method that detects important pixels for the color estimation of the light source. In our method, we firstly proposed a method that gives weights to pixels satisfying the assumption. Then, we proposed a pixel detection method, which we modified max-RGB method, to apply on the weighted pixels. Maximum weighted pixels in the column direction and row direction in one channel are detected. The performance of our method is verified through demonstrations in several real scenes. Proposed method better accurately estimate the color of the light than previous methods.

• Korean Journal of Remote Sensing
• /
• v.34 no.2_2
• /
• pp.339-349
• /
• 2018

The massive green tide occurred every summer in the Yellow Sea since 2008, and many studies are being actively conducted to estimate the coverage of green tide through analysis of satellite imagery. However, there is no satellite images selection criterion for accurate coverage calculation of green tide. Therefore, this study aimed to find a suitable satellite image from for the comparison of the green tide coverage according to the spatial resolution of satellite image. In this study, Landsat ETM+, MODIS and GOCI images were used to coverage estimation and its spatial resolution is 30, 250 and 500 m, respectively. Green tide pixels were classified based on the NDVI algorithm, the difference of the green tide coverage was compared with threshold value. In addition, we estimate the proportion of the green tide in one pixel through the Linear Spectral Unmixing (LSU) method, and the effect of the difference of green tide ratio on the coverage calculation were evaluated. The result of green tide coverage from the calculation of the NDVI value, coverage of green tide usually overestimate with decreasing spatial resolution, maximum difference shows 1.5 times. In addition, most of the pixels were included in the group with less than 0.1 (10%) LSU value, and above 0.5 (50%) LSU value accounted for about 2% in all of three images. Even though classified as green tide from the NDVI result, it is considered to be overestimated because it is regarded as the same coverage even if green tide is not 100% filled in one pixel. Mixed-pixel problem seems to be more severe with spatial resolution decreases.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1587-1598
• /
• 2000

For the object-based video compression at very low bit rate, vieo segmentation is an essential part. In this paper, we propose a temporal video segmentation algorithms for motion pictures which is based on blocks. The algorithm is composed of three steps: (1) the change-detection, (2) the block merging, and (3) the block segmentation. The first step separates the change-detected region from background. Here, a new method for removing the uncovered region without motion estimation is presented. The second step, which is further divided into three substeps, estimates motions for the change-detected region and merges blocks with similar motions. The merging conditions for each substep as criteria are also given. The final step, the block segmentation, segments the boundary block that is excluded from the second step on a pixel basis. After describing our algorithm in detail, several experimental results along the processing order are shown step by step. The results demonstrate that the proposed algorithm removes the uncovered region effectively and produced objects that are segmented well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2094-2105
• /
• 1994

This paper contains a Hough transform based projection method derived from Radon transform for tracking dim unresolved(sub-pixel) moving targets that move along straight line parths across a time sequential image data. In contrast to several recently presented Hough transform methods using a compressed image referred to as the track map our proposed technique utilizing a set of projections taken along arbitrary orientations effectively increases the changes of target detection, and creates a robust track estimation environment by incorporating all the available knowledge obtained from the projections. Moreover, in order to quantitatively assess the estimation capability of the projection-based Hough transform algorithm, the analytical bounds on the Hough space parameter errors introduced by image space noise contamination are derived. The simulation yielded promising results of estimating the track parameters even under low signal to noise rations when our technique was tested against the time sequential sets of real infrared image data referred to as the HiCamps.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.418-428
• /
• 2002

In this paper, we propose a motion-adaptive de-interlacing method using motion compensated interpolation. In a conventional motion compensated method, a simple pre-filter such as line averaging is applied to interpolate missing lines before the motion estimation. However, this method causes interpolation error because of inaccurate motion estimation and compensation. In the proposed method, EBMF(Edge Based Median Filter) as a pre-filter is applied, and new matching method, which uses two same-parity fields and opposite-parity field as references, is proposed. For further improvement, motion correction filter is proposed to reduce the interpolation error caused by incorrect motion. Simulation results show that the proposed method provides better performance than existing methods.

• Journal of Digital Contents Society
• /
• v.8 no.4
• /
• pp.441-449
• /
• 2007

In video coding, motion estimation is a process to estimate the pixel of the current frame from the reference frame, which affects directly the predictive quality and the encoding time. This paper is related to AHHS(Adaptive Hierarchical Hexagon Search) using spatio-temporal motion activity for fast motion estimation. The proposed method defines the spatio-temporal motion activity of the current macroblock using the motion vectors of its spatio-temporally adjacent macroblocks, and then conventional AHS(Adaptive Hexagon Search) is performed if the spatio-temporal motion activity is lower, otherwise, hierarchical hexagon search is performed on a multi-layered hierarchical space constructed by multiple sub-images with low frequency in wavelet transform. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive quality and the computational time. Experimental results indicate that the proposed method is both suitable for (quasi-) stationary and large motion searches. The proposed method could keep the merit of the adaptive hexagon search capable of fast estimating motion vectors and also adaptively reduce the local minima occurred in the video sequences with higher spatio-temporal motion activity.

• Korean Journal of Remote Sensing
• /
• v.25 no.5
• /
• pp.455-464
• /
• 2009

Lee(2009) proposed the boundary-adaptive despeckling method using a Bayesian model which is based on the lognormal distribution for image intensity and a Markov random field(MRF) for image texture. This method employs the Point-Jacobian iteration to obtain a maximum a posteriori(MAP) estimate of despeckled imagery. The boundary-adaptive algorithm is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The boundary-adaptive scheme was comprehensively evaluated using simulation data and the effectiveness of boundary adaption was proved in Lee(2009). This study, as an extension of Lee(2009), has suggested a modified iteration algorithm of MAP estimation to enhance computational efficiency and to combine classification. The experiment of simulation data shows that the boundary-adaption results in yielding clear boundary as well as reducing error in classification. The boundary-adaptive scheme has also been applied to high resolution Terra-SAR data acquired from the west coast of Youngjong-do, and the results imply that it can improve analytical accuracy in SAR application.