• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.93-103
• /
• 2005

In this paper, we propose a RST resistant robust logo embedding technique for multimedia copyright protection Geometric manipulations are challenging attacks in that they do not introduce the quality degradation very much but make the detection process very complex and difficult. Watermark embedding in the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using an image normalization technique, instead of embedding in the normalized image. Conventional RST resistant schemes that use full frame transform suffer from the absence of effective perceptual masking methods. Thus, we adopt $8\times8$ block DCT and calculate masking using a spatio-frequency localization of the $8\times8$ block DCT coefficients. Simulation results show that the proposed algorithm is robust against various signal processing techniques, compression and geometrical manipulations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.67-73
• /
• 2015

In a distribution of digital image, there is a serious problem that is the image alteration by a forger. For the problem solution, this paper proposes the forensic decision algorithm of a median filtering (MF) image using the feature vector based on a coefficient of variation (c.v.) of Fourier transform. In the proposed algorithm, we compute Fourier transform (FT) coefficients of row and column line respectively of an image first, then c.v. between neighboring lines is computed. Subsquently, 10 Dim. feature vector is defined for the MF detection. On the experiment of MF detection, the proposed scheme is compared to MFR (Median Filter Residual) and Rhee's MF detection schemes that have the same 10 Dim. feature vector both. As a result, the performance is excellent at Unaltered, JPEG (QF=90), Down scaling (0.9) and Up scaling (1.1) images, and it showed good performance at Gaussian filtering ($3{\times}3$) image. However, in the performance evaluation of all measured items of the proposed scheme, AUC (Area Under ROC (Receiver Operating Characteristic) Curve) by the sensitivity and 1-specificity approached to 1 thus, it is confirmed that the grade of the performance evaluation is rated as 'Excellent (A)'.

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.39-44
• /
• 2011

This paper proposes the new high-performance circuit architecture of the transform and quantization for unified video CODEC. The proposed architecture can be applied to all kinds of transforms and quantizations for the video compression standards such as JPEG, MPEG-1/2/4, H.264 and VC-1. We defined the permutation matrices to reorder the transform matrix of the $8{\times}8$ DCT and partitioned the reordered $8{\times}8$ transform matrix into four $4{\times}4$ sub-matrices. The $8{\times}8$ DCT is performed by repeating the $4{\times}4$ DCT's based on the reordered and partitioned transform matrices. Since our circuit accepts the transform coefficients from the users, it can be extended very easily to cover any kind of DCT-based transforms for future standards. The multipliers in the DCT circuit are shared by the quantization circuit in order to minimize the circuit size. The quantization circuit is merged into the DCT circuit without any significant increase of circuit resources and processing time. We described the proposed DCT and quantization circuit at RTL, and verified its operation on FPGA board.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.65-71
• /
• 2000

Finite wordlength effect of the recursive implementation of SDFT(sliding-DFT) is analytically derived in this paper. Representation errors of the twiddle coefficients and the data registers are the two major causes of the spectral errors in the recursive implementation. The noise-to-signal ratio is analytically derived in terms of the coefficients wordlength, the data registers wordlength, and the DFT's block-length used in the computation Error dynamic equation is obtained from the recursive DFT and the probabilistic models for the coefficients error and the round-off error are introduced for the NSR derivation, The result of the NSR derivation is verified with the simulation data.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.8
• /
• pp.48-54
• /
• 1999

A new method for wavelet embedded image coding is presented extending the bases of the Shapiro's algorithm by incorporating edge detection, zerotree scheme, and classified VQ(CVQ). Generally edges in the image are regarded an visually important components and the previous literatures have proved that significant coefficients in wavelet transform domain correspond to the edges in spatial domain. Hence, by identifying the edge elements, the significant coefficient can be easily detected in wavelet domain without investigating descendant coefficients across layer. Hierarchical trees for the significant components are organized, and then CVQ method is applied to these trees. Since the significant information has higher priority in transmission, the simulation shows that our coder provides a superior performance over the conventional method and can be successfully applied to the application areas that require of progressive transmission.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.6
• /
• pp.32-40
• /
• 2000

In this paper, we proposed a wavelet-based digital watermarking algorithm using human visual system and subband-adaptive threshold. After the original image is transformed by discrete wavelet transform, the perceptually significant coefficients of the each subband excluding the lowest level subbands are utilized to embed the watermark. To select perceptually significant coefficients for each subband, we use subband-adaptive threshold. For the selected coefficients in the high frequency subbands, the watermark is embedded using HVS. For those of the baseband, the watermark is embedded by conventional embedding method. We tested the performance of the proposed algorithm compared with conventional watermarking algorithm by computer simulation. The experimental results show that the proposed watermarking algorithm is less visible to human eyes and more robust to image compressions, image processings, and geometric transformations than the conventional algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.16-23
• /
• 2007

Changeable biometrics has been developed as a solution to problem of enhancing security and privacy. The idea is to transform a biometric signal or feature into a new one for the purposes of enrollment and matching. In this paper, we propose a changeable biometric system that can be applied to appearance based face recognition system. In the first step when using feature extraction, ICA(Independent Component Analysis) coefficient vectors extracted from an input face image are replaced randomly using their mean and variation. The transformed vectors by replacement are scrambled randomly and a new transformed face coefficient vector (transformed template) is generated by combination of the two transformed vectors. When this transformed template is compromised, it is replaced with new random numbers and a new scrambling rule. Because e transformed template is generated by e addition of two vectors, e original ICA coefficients could not be easily recovered from the transformed coefficients.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.55-62
• /
• 2005

This paper proposes a method to recognize a face using DCT/LDA where LDA is applied to DCT coefficients of an input face image. In the proposed method, SSS problem of LDA due to less number of training data than the size of feature space can be avoided by expressing an input image in low dimensional space using DCT coefficients. In terms of the recognition rate, both the proposed method and the PCA/LDA method have shown almost equal performance while the training time of the proposed method is much shorter than the other. This is because DCT has the fixed number of basis vectors while the property of energy compaction rate is similar to that of PCA. Although depending on the number of coefficients employed for the recognition, the experimental results show that the performance of the proposed method in terms of recognition rate is very comparable to PCA/LDA method and other DCT/LDA methods, and it can be trained 13,000 times faster than PCA/LDA method.

• The Journal of Engineering Geology
• /
• v.14 no.4 s.41
• /
• pp.461-468
• /
• 2004

In order to characterize hydraulic property dependant on join roughness in rock mass, this study computed permeability coefficients on each range of joint roughness coefficient (JRC) suggested by Barton(1976). For a quantitative analysis of roughness components spectral analysis using the fast fourier transform was performed to select effective frequencies on each PC range. The results of spectral analyses show that low ranges of the JRC are mainly composed of low frequency domain, while high ranges of the JRC have dominant components at high frequency domain. The inverse Fourier transform made it possible to generate joint models of each JRC range using the effective frequencies of roughness spectrum. The homogenization analysis was applied to calculate permeability coefficient at homogeneous microscale, and then, computes a homogenized permeability coefficient (C-permeability coefficient) at macro scale. Therefore, it is possible to analyze accurate characteristics of permeability reflected with local effect of facture geometry. According to the calculation results, permeability coefficients were distributed between $10^{-3}m/sec\;and\;10^{-4}/sec$. In cases of sheared joint models permeability coefficients were plotted between $10^{-4}m/sec\;and\;10^{-5}/sec$, showing irregular distribution of permeability coefficients on each IRC range. The differences of permeability coefficients for the same aperture models or for the sheared joint models indicate that changes of roughness pattern influence on permeability coefficients. Therefore, the effect of joint roughness should be considered to characterize hydraulic properties in rock joints.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.45-54
• /
• 2002

This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.