• Journal of Korea Multimedia Society
• /
• v.24 no.6
• /
• pp.768-788
• /
• 2021

The reversible data hiding technique safely transmits secret data to the recipient from malicious attacks by third parties. In addition, this technique can completely restore the image used as a transmission medium for secret data. The reversible data hiding schemes have been proposed in various forms, and recently, the reversible data hiding schemes based on interpolation are actively researching. The reversible data hiding scheme based on the interpolation method expands the original image into the cover image and embed secret data. However, the existing interpolation-based reversible data hiding schemes did not embed secret data during the interpolation process. To improve this problem, this paper proposes embedding the first secret data during the image interpolation process and embedding the second secret data into the interpolated cover image. In the embedding process, the original image is divided into blocks without duplicates, and the maximum and minimum values are determined within each block. Three way searching based on the maximum value and two way searching based on the minimum value are performed. And, image interpolation is performed while embedding the first secret data using the PVD scheme. A stego image is created by embedding the second secret data using the maximum difference value and log function in the interpolated cover image. As a result, the proposed scheme embeds secret data twice. In particular, it is possible to embed secret data even during the interpolation process of an image that did not previously embed secret data. Experimental results show that the proposed scheme can transmit more secret data to the receiver while maintaining the image quality similar to other interpolation-based reversible data hiding schemes.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1058-1068
• /
• 2011

Video FRUC (Frame Rate Up Conversion) is one of the main issues that have arisen in recent years with the explosive growth of video sources and display formats in consumer electronics. Most advanced FRUC algorithms adopt an efficient motion interpolation technique to determine the motion vector field of interpolated frames. But, in some application areas such as post processing in receiver side, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame was reconstructed. In order to achieve this aim, first, this paper introduces some cost functions to estimate the reliability of a block in the MCI frame. Then, by using these functions, this paper proposes two distortion estimation models for evaluating how much noise was produced in the MCI frame. Through computer simulations, it is shown that the proposed estimation methods perform effectively in estimating the noises of the MCI frame.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.225-227
• /
• 2009

International standard specification, H.264/SVC improved from H.264/AVC, is set up so as to promote free use of huge multimedia data in various channel environments.;H.264/AVC is a international standard speicification for video compression, adopted and commercialized as standard for DMB broadcasting by JVT of ISO/IEC MPEG and ITU-T VCEG. SVC standard uses 'intra/inter prediction' in AVC as well as 'inter-layer intra prediction', 'inter-layer motion prediction' and 'inter-layer residual prediction' to improve efficiency of encoding. Among prediction technologies, 'inter-layer intra prediction' is to use co-located block of up sampled sublevels as a prediction signal. At this time, application of interpolation is one of the most important factors to determine encoding efficiency. SVC's currently using poly-phase FIR filter of 4-tap and 2-tap respectively to luma components. This paper is written for the purpose of analyzing encoding performance according to the interpolation. For this purpose, we applied poly-phase FIR filter of '2-tap', '4-tap' and '6-tap' respectively to luma components and then measured bit-rate, PNSR and running time of interpolation filter. We're expecting that the analysis results of this paper will be utilized for effective application of interpolation filter. SVC standard uses 'intra/inter prediction' in AVC as well as 'inter-layer intra prediction', 'inter-layer motion prediction' and 'inter-layer residual prediction' to improve efficiency of encoding.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.15 no.2
• /
• pp.165-173
• /
• 1997

The combined bundle block adjustment with projection center coordinates determined by kinematic DGPS-positioning has reached a high level of accuracy. Standard deviations of the ground coordinates of $\pm{10cm}$ or even better can be reached. On this accuracy level also smaller error components are becoming more important. One major point of this is the interpolation of the projection centers as a function of time between the GPS-antenna locations. A just linear interpolation is not respecting the not linear movement of the aircraft. Based on a least squares polynomial fitting the aircraft maneuver can be estimated more accurate and blunders of the GPS-positions caused by loss of satellite and cycle slips are determinable. The interpolation with a time interval of 3sec in the study area RHEINKAMP is quite different to the interpolation with a time interval of 6-7sec in the study area MAAS. The GPS-positions of the study area are identified as blunders based on a local polynomial regression. This cannot be neglected for precise block adjustment.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.85-91
• /
• 2015

This paper presents a novel frame rate up-conversion (FRUC) algorithm. Existing algorithms, in general, employ rectangular blocks for motion estimation and arbitrary shape of an actual object region cannot be precisely represented. On the other hand, the proposed wedge-shaped block partitioning algorithm partitions a rectangular block into two wedge-shaped blocks using the texture information, which makes better approximation for an actual object region. The wedge-shaped block partitioning algorithm as well as the adaptive motion vector prediction algorithm is used to reliably estimate the actual motion. Experimental results show that the proposed FRUC algorithm is superior to existing algorithms up to 1.988dB in PSNR and 0.0167 in SSIM comparisons.

• Journal of Broadcast Engineering
• /
• v.24 no.5
• /
• pp.785-790
• /
• 2019

In this paper, a new bilateral frame rate up-conversion algorithm using adaptive overlapped block motion compensation is proposed. In this algorithm, the adaptive overlapped block motion compensation is based on the motion complexity of the reference region. As the motion complexity is determined by the size of the previously coded motion estimation prediction, the overlapped block motion compensation method is selected without any additional computational complexity. Experimental results show that the proposed algorithm provides better image quality than conventional methods both objectively and subjectively.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.975-978
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.

• Journal of Power System Engineering
• /
• v.5 no.2
• /
• pp.43-49
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.6
• /
• pp.58-70
• /
• 1997

In this paper, an 8bit CMOS low power, high-speed current-mode folding and interpolation A/D converter is designed with te LG semicon $0.8\mu\textrm{m}$ N-well single-poly/double-metal CMOS process to be integrated into a portable image signal processing system such as a digital camcoder. For good linearity and low power consumption, folding amplifiers and for high speed performance of the A/D converter, analog circuitries including folding block, current-mode interpolation circuit and current comparator are designed as a differential-mode. The fabricated 8 bit A/D converter occupies the active chip area of TEX>$2.2mm \times 1.6mm$ and shows DNL of $\pm0.2LSB$, INL of <$\pm0.5LSB$, conversion rate of 40M samples/s, and the measured maximum power dissipation of 33.6mW at single +5V supply voltage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1027-1037
• /
• 2010

In this paper, we propose the linear interpolation-based BD (Block Diagonalization) precoding approximation algorithm for low complexity in downlink multiuser MIMO-OFDM (Multiple-input Multiple-output Orthogonal Frequency Division Multiplexing) systems. In the case of applying the general BD precoding algorithm to multiuser MIMO-OFDM systems, the computational complexity increases in proportional to the number of subcarriers. The proposed interpolation-based BD precoding approximation algorithm can be achieved similar SER performance with general BD algorithm and can decrease the computational complexity. It is proved that proposed algorithm can achieve the significantly decreased computational complexity by computer simulation.