• Korean Journal of Soil Science and Fertilizer
• /
• v.43 no.6
• /
• pp.968-974
• /
• 2010

We assessed the feasibility of discrete wavelet transform (DWT) applied for the spectral processing to enhance the estimation performance quality of soil organic matters using visible-near infrared spectra and mapped their distribution via block Kriging model. Continuum-removal and $1^{st}$ derivative transform as well as Haar and Daubechies DWT were used to enhance spectral variation in terms of soil organic matter contents and those spectra were put into the PLSR (Partial Least Squares Regression) model. Estimation results using raw reflectance and transformed spectra showed similar quality with $R^2$ > 0.6 and RPD> 1.5. These values mean the approximation prediction on soil organic matter contents. The poor performance of estimation using DWT spectra might be caused by coarser approximation of DWT which not enough to express spectral variation based on soil organic matter contents. The distribution maps of soil organic matter were drawn via a spatial information model, Kriging. Organic contents of soil samples made Gaussian distribution centered at around 20 g $kg^{-1}$ and the values in the map were distributed with similar patterns. The estimated organic matter contents had similar distribution to the measured values even though some parts of estimated value map showed slightly higher. If the estimation quality is improved more, estimation model and mapping using spectroscopy may be applied in global soil mapping, soil classification, and remote sensing data analysis as a rapid and cost-effective method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.604-610
• /
• 2009

This paper propose a digital watermarking method for digital contents which satisfies both the invisibility and the robustness to attacks to prohibit counterfeiting, modification, illegal usage and illegal re-production of video contents. This watermarking algorithm insert a watermark(digital hologram) by generated using Fresnel transform which improve the robustness. The inserting positions of the watermark choose by considering the frequency property of an image and a watermark. Also the amount of watermarking for watermark bit decide by considering the level of 2DDWT. This algorithm was implemented by C++ and experimented for invisibility and robustness with optical system. The experiment results showed that the method satisfied enough the invisibility of the inserted watermark and robustness against attacks. For the general attacks, the error rate of the extracted watermark was less than 15%, which is enough in robustness against the attacks.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.7
• /
• pp.29-38
• /
• 2009

In this paper, a high performance pipelined computing design of parallel multiplier-temporal buffer-parallel accumulator is present for the convolution-based non-cascaded architecture aiming at the real time Discrete Wavelet Transform(DWT) processing. The convolved multiplication of DWT would be reduced upto 1/4 by utilizing the filter coefficients symmetry and the up/down sampling; and it could be dealt with 3-5 times faster computation by LUT-based DA multiplication of multiple filter coefficients parallelized for product terms with an image data. Further, the reutilization of computed product terms could be achieved by storing in the temporal buffer, which yields the saving of computation as well as dynamic power by 50%. The convolved product terms of image data and filter coefficients are realigned and stored in the temporal buffer for the accumulated addition. Then, the buffer management of parallel aligned storage is carried out for the high speed sequential retrieval of parallel accumulations. The convolved computation is pipelined with parallel multiplier-temporal buffer-parallel accumulation in which the parallelization of temporal buffer and accumulator is optimize, with respect to the performance of parallel DA multiplier, to improve the pipelining performance. The proposed architecture is back-end designed with 0.18um library, which verifies the 30fps throughput of SVGA(800$\times$600) images at 90MHz.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.30-37
• /
• 2003

In this paper, a discrete wavelet transform (DWT)-based watermarking system is proposed. The main feature of proposed system is that the embedding system uses adaptive thresholds to control the trade-off between the qualify of the watermarked image and the capacity of the watermark, and the trade-off between the quality and robustness of the watermarked image. Also, the extracting system rebuilds threshold according to various attacks and decides a watermark bit from the least distorted coefficient after measuring the distortion of coefficient. Finally, a new measure to detect the uniqueness of watermark is proposed. The experimental result shows that the proposed watermarking system is robust against conventional signal processing and intentional attacks.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.53 no.2
• /
• pp.43-50
• /
• 2004

Percentage differential characteristic relaying(PDR) has been recognized as the principal basis for power transformer protection. Second harmonic restraint PDR has been widely used for magnetizing inrush in practice. Nowadays, relaying signals can contain 2nd harmonic component to a large extent even in a normal state, and 2nd harmonic ratio indicates a tendency of relative reduction because of the advancement of material. Further, as the power system voltage becomes higher and more underground cables are used, larger 2nd harmonic component in the differential current under internal fault is observed. And then, conventional 2nd harmonic restraint PDR exposes some doubt in reliability. It is, therefore, necessary to develop a new algorithm for performance improvement of conventional protective relaying. This paper proposes an advanced protective relaying algorithm by using voltage-current trend and flux-differential current slope characteristic. To evaluate the performance of the proposed algorithm, we have made comparative studies of PDR, fuzzy relaying and DWT relaying. The paper is constructed power system model including power transformer, utilizing the WatATP, and data collection is made through simulation of various internal faults and inrush. As the results of test, the new proposed algorithm was proven to be faster and more reliable.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.130-138
• /
• 2006

In this paper, a new stereo image watermarking scheme based-on adaptive disparity estimation algorithm is proposed. That is, a watermark image is embedded into the right image of a stereo image pair by using the DWT and disparity information is extracted from this watermarked right image and the left image. And then, both of this extracted disparity information and the left image are transmitted to the recipient through the communication channel. At the receiver, the watermarked right image is reconstructed from the received left image and disparity information through an adaptive matching algorithm. a watermark image is finally extracted from this reconstructed right image. From some experiments using CCETT's 'Manege' and 'Friends' images as a stereo image and English alphabet '3DRC' as a watermark image, it is found that the PSNRs of the watermarked image from the reconstructed right images through the adaptive matching algorithm & DWT is improved 2.03 dB, 3.03 dB and robusted against various attacks. These experimental results also suggest a possibility of practical implementation of an adaptive matching also-rithm-based stereo imagewatermarking scheme proposed in this paper.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.160-167
• /
• 2014

This paper presents a spliced color image detection method using Benford' Law and color difference. For a suspicious image, after color conversion, the discrete wavelet transform and the discrete cosine transform are performed. We extract the difference between the ideal Benford distribution and the empirical Benford distribution of the suspicious image as features. The difference between Benford distributions for each color component were also used as features. Our method shows superior splicing detection performance using only 13 features. After training the extracted feature vector using SVM classifier, we determine whether the presence of the image splicing forgery. Experimental results show that the proposed method outperforms the existing methods with smaller number of features in terms of splicing detection accuracy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.173-180
• /
• 2005

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform(DWT) and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system and cat map which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the Proposed methods implemented in software for about 500 images. Consequently, we are sure that the proposed is efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.3
• /
• pp.446-457
• /
• 2017

In order to reduce the size of frame memory or bus bandwidth, frame memory compression (FMC) recompresses reconstructed or reference frames of video codecs. This paper proposes a novel FMC design based on discrete wavelet transform (DWT) - set partitioning in hierarchical trees (SPIHT), which supports fine-scalable throughput and is area-efficient. In the proposed design, multi-cores with small block sizes are used in parallel instead of a single core with a large block size. In addition, an appropriate pipelining schedule is proposed. Compared to the previous design, the proposed design achieves the processing speed which is closer to the target system speed, and therefore it is more efficient in hardware utilization. In addition, a scheme in which two passes of SPIHT are merged into one pass called merged refinement pass (MRP) is proposed. As the number of shifters decreases and the bit-width of remained shifters is reduced, the size of SPIHT hardware significantly decreases. The proposed FMC encoder and decoder designs achieve the throughputs of 4,448 and 4,000 Mpixels/s, respectively, and their gate counts are 76.5K and 107.8K. When the proposed design is applied to high efficiency video codec (HEVC), it achieves 1.96% lower average BDBR and 0.05 dB higher average BDPSNR than the previous FMC design.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.55-63
• /
• 2010

In this paper, a new video watermarking algorithm using 3D wavelet transform and position encoding of spread spectrum correlation is proposed as a method for ensuring enough payload in order to protect copyright for video contents. This algorithm provides better robustness than other watermarking methods in bit error and rotation because it uses the position encoding and $4{\times}4$ sample space instead of $1{\times}1$ pixel to express a digit. The evaluation result over 6 video clips shows that the PSNR is over 31dB at strength 11 when histogram is narrow and it satisfies the transparency. Also, it shows the robustness of the proposed watermark algorithm that the BER is 0% to three codecs.