• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.85-96
• /
• 1999

In a number of predictive video compression standards, the motion is compensated by the block-based motion compensation (BMC). The effective motion field used for the prediction by the BMC is obviously discontinuous since one motion vector is used for the entire macro-block. The usage of discontinuous motion field for the prediction causes the blocky artifacts and one obvious approach for eliminating such artifacts is to use a smoothed motion field. The optimal procedure will depend on the type of motion within the video. In this paper, several procedures for the motion vectors are considered. For any interpolation or approaches, however, the motion vectors as provided by the block matching algorithm(BMA) are no longer optimal. The optimum motion vectors(still one per macro-block) must minimize the of the displaced frame difference (DFD). We propose a unified algorithm that computes the optimum motion vectors to minimize the of the DFD using a conjugate gradient search. The proposed algorithm has been implemented and tested for the affine transformation based motion compensation (ATMC), the bilinear transformation based motion compensation (BTMC) and our own filtered motion compensation(FMC). The performance of these different approaches will be compared against the BMC.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.91-100
• /
• 2016

In FPGA-based real-time image warping systems, image caches are utilized for fast readout of image pixel data and reduction of memory access rate. However, a cache algorithm for a general computer system is not suitable for real-time performance because of time delays from cache misses and on-line computation complexity. In this paper, a simple image cache algorithm is presented for a FPGA-based real-time image warping system. Considering that pixel data access sequence is determined from the 2D coordinate transformation and repeated identically at every image frame, a cache load sequence is off-line programmed to guarantee no cache miss condition, and reduced on-line computation results in a simple cache controller. An overall system structure using a FPGA is presented, and experimental results are provided to show accuracy and validity of the proposed cache algorithm.

• Journal of Broadcast Engineering
• /
• v.20 no.1
• /
• pp.40-47
• /
• 2015

This paper discusses QoS enhancement in the Best-effort services of the service plan provided by MPEG Media Transport (MMT) systems for video streaming applications. Among MMT services, i.e. per-flow, per-class, and best-effort services, the server does not provide guaranteed bandwidth for the best-effort service only. Therefore, in the best-effort services, a bandwidth access priority is defined for various services, where the lowest priority is assigned to the low-level video services. To alleviate the issue of bandwidth limitation in the best-effort services, this paper investigates transmission of low-resolution video with low bitrate and up-sampling. Our experimental results prove the superiority of the proposed method in terms of delivered video quality.

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

This paper proposes new video signature using spatio-temporal information for copy detection. The proposed video copy detection method is based on concentric circle partitioning method for each key frame. Firstly, key frames are extracted from whole video using temporal bilinear interpolation periodically and each frame is partitioned as a shape of concentric circle. For the partitioned sub-regions, 4 feature distributions of average intensity, its difference, symmetric difference and circular difference distributions are obtained by using the relation between the sub-regions. Finally these feature distributions are converted into binary signature by using simple hash function and merged together. For the proposed video signature, the similarity distance is calculated by simple Hamming distance so that its matching speed is very fast. From experiment results, the proposed method shows high detection success ratio of average 97.4% for various modifications. Therefore it is expected that the proposed method can be utilized for video copy detection widely.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.643-646
• /
• 2006

An operational calibration is applied to improve radar rainfall intensity using rainfall obtained from rain gauge. The method is applied under the assumption of the temporal continuity of rainfall, the rainfall intensity from rain gauge is linearly related to that from radar. The method is applied to the cases of typhoon and rain band using the reflectivity of CAPPI at 1.5km obtained from Jindo radar. The CAPPI is obtained by bilinear interpolation. For the two cases, the rainfall intensities obtained by operational calibration are very consistent with the ones by the rain gauges. The present study shows that the correlation between the rainfall intensity by operational calibration and rain gauges is better than the one between the rainfall intensity by M-P relationship and rain gauges. The correlation coefficients between the total rainfall intensity obtained by operational calibration and rain gauges in typhoon and rain band cases are 0.99 and 0.97, respectively. Areal rainfalls are estimated using the field of calibration factor interpolated by Barnes objective analysis. The method applied here shows an improvement in the areal rainfall estimation. For the cases of typhoon and rain band, the correlation between the areal rainfall by operational calibration and rain gauges is better than the one between the area rainfall by M-P relationship and rain gauges. The correlation coefficients between the areal rainfall obtained by operational calibration and rain gauges in typhoon and rain band cases are 0.97 and 0.84, respectively. The present study suggests that the operational calibration is very useful for the real-time estimation of rainfall intensity and areal rainfall.

• Atmosphere
• /
• v.25 no.2
• /
• pp.271-281
• /
• 2015

The objectives of this study are to develop a hydrological drought outlook system using GloSea5 (Global Seasonal forecasting system 5) which has recently been used by KMA (Korea Meteorological Association) and to evaluate the forecasting capability. For drought analysis, the bilinear interpolation method was applied to spatially downscale the low-resolution outputs of GloSea5 and PR (Predicted Runoff) was produced for different lead times (i.e., 1-, 2-, 3-month) running LSM (Land Surface Model). The behavior of PR anomaly was similar to that of HR (Historical Runoff) and the estimated values were negative up to lead times of 1- and 2-month. For the evaluation of drought outlook, SRI (Standardized Runoff Index) was selected and PR_SRI estimated using PR. ROC score was 0.83, 0.71, 0.60 for 1-, 2- and 3-month lead times, respectively. It also showed the hit rate is high and false alarm rate is low as shorter lead time. The temporal Correlation Coefficient (CC) was 0.82, 0.60, 0.31 and Root Mean Square Error (RMSE) was 0.52, 0.86, 1.20 for 1-, 2-, 3-month lead time, respectively. The accuracy of PR_SRI was high up to 1- and 2-month lead time on local regions except the Gyeonggi and Gangwon province. It can be concluded that GloSea5 has high applicability for hydrological drought outlook.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.194-200
• /
• 2013

In this paper, we propose a multi-scale crack detection method using scaling. It is based on morphology algorithm, crack features, and scaling. We use a morphology operator which extracts patterns of crack. It segments cracks and background using opening and closing operations. Morphology based segmentation is better than existing integration methods using subtraction in detecting a crack it has small width. However, morphology methods using only one structure element could detect only fixed width crack. Thus, we use a scaling method. We use bilinear interpolation for scaling. Our method calculates values of properties such as the number of pixels and the maximum length of the segmented region. We decide whether the segmented region belongs to cracks according to those data. Experimental results show that our proposed multi-scale crack detection method has better results than those of existing detection methods.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.339-349
• /
• 2008

We present a novel method to estimate the light source direction and relight a face texture image of a single 3D model under arbitrary unknown illumination conditions. We create a virtual irradiance sphere to detect the light source direction from a given illuminated texture image using both normal vector mapping and weighted bilinear interpolation. We then induce a relighting equation with estimated ambient and diffuse coefficients. We provide the result of a series of experiments on light source estimation, relighting and face recognition to show the efficiency and accuracy of the proposed method in restoring the shading and shadows areas of a face texture image. Our approach for face relighting can be used for not only illuminant invariant face recognition applications but also reducing visual load and Improving visual performance in tasks using 3D displays.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.7-13
• /
• 1996

MASF is a kind of temporal filter proposed for noise reduction and temporal band limitation. MASF uses motion vectors to extract temporal information in spatial domain. Therefore, inaccurate motion information causes some distortions in MASF operation. Currently, bilinear interpolation after BMA(Block Matching Algorithm) is used for the motion estimation sheme of MASF. But, this method results in unreliable estimation when the object in image sequence has larger movement than the maximum displacement assumed in BMA or the input images are severely corrupted with noise. In order to i:;olve this problem, we analyse the effect of inaccurate motion on MASF and propose a hierarchical motion estimation algorithm based on the analysis results. Experimental results show that the proposed method produces reliable output under large motion and noisy situations.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.109-113
• /
• 2007

The COMS provides the LRIT/HRIT services to users. The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The requirement is important and critical enough to impact overall performance of the LHGS. HRIT image data is acquired from INRSM output receiving but LRIT image data is generated by sub-sampling HRIT image data in the LHGS. Specially, since LRIT is acquired from sub-sampled HRIT image data, LRIT processing spent more time. Besides, some of data loss for LRIT occurs since LRIT is compressed by lossy JPEG. Therefore, algorithm with the fastest processing speed and simplicity to be implemented should be selected to satisfy the requirement. Investigated sub-sampling algorithm for the LHGS were nearest neighbour algorithm, bilinear algorithm and bicubic algorithm. Nearest neighbour algorithm is selected for COMS LHGS considering the speed, simplicity and anti-aliasing corresponding to the guideline of user (KMA: Korea Meteorological Administration) to maintain the most cloud itself information in a view of meteorology. But the nearest neighbour algorithm is known as the worst performance. Therefore, it is studied in this paper that the selection of nearest neighbour algorithm for the LHGS is reasonable. First of all, characteristic of 3 sub-sampling algorithms is studied and compared. Then, several sub-sampling algorithm were applied to MTSAT-1R image data corresponding to COMS HRIT. Also, resized image was acquired from sub-sampled image with the identical sub-sampling algorithms applied to sub-sampling from HRIT to LRIT. And the difference between original image and resized image is compared. Besides, PSNR and MSE are calculated for each algorithm. This paper shows that it is appropriate to select nearest neighbour algorithm for COMS LHGS since sub-sampled image by nearest neighbour algorithm is little difference with that of other algorithms in quality performance from PSNR.