• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.113-122
• /
• 2005

In this paper, we propose a multi-watermarking algorithm to satisfy two purposes: fragility against malicious attacks and robustness against non-malicious attacks. The algorithm can be used for image authentication using coefficients of Discrete Wavelet Transform(DWT). In the proposed method, watermarks are generated by combining binary image with some features extracted from the subband LL3, and then they are embedded into both the spatial and frequency domain. That is, on the spatial domain they are embedded into the Least Significant Bit(LSB) of all pixels of image blocks, and on the frequency domain the coefficients of the subband LH2 and HL2 are adjusted according to the watermarks. Thus the algorithm not only resists malicious attack but also permits non-malicious attacks such as blurring, sharpening, and JPEG compression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.336-344
• /
• 2005

Discrete Wavelet Transform(DWT) is the oncoming generation of compression technique that has been selected for MPEG4 and JEPG2000, because it has no blocking effects and efficiently determines frequency property of temporary time. In this paper, we propose an efficient bit-serial architecture for the low-power and low-complexity DWT filter, employing two-channel QMF(Qudracture Mirror Filter) PR(Perfect Reconstruction) lattice filter. The filter consists of four lattices(filter length=8) and we determine the quantization bit for the coefficients by the fixed-length PSNR(peak-signal-to-noise ratio) analysis and propose the architecture of the bit-serial multiplier with the fixed coefficient. The CSD encoding for the coefficients is adopted to minimize the number of non-zero bits, thus reduces the hardware complexity. The proposed folded 1D DWT architecture processes the other resolution levels during idle periods by decimations and its efficient scheduling is proposed. The proposed architecture requires only flip-flops and full-adders. The proposed architecture has been designed and verified by VerilogHDL and synthesized by Synopsys Design Compiler with a Hynix 0.35$\mu$m STD cell library. The maximum operating frequency is 200MHz and the throughput is 175Mbps with 16 clock latencies.

• Journal of Platform Technology
• /
• v.6 no.4
• /
• pp.26-33
• /
• 2018

In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.713-718
• /
• 1987

In this paper, an iterative restoration algorithm from power spectral density with 1 bit sign information of real part of two dimensional Fourier transform of image corrupted by additive white Gaussian noise is proposed. This method is a modified version of image reconstruction algorithm from power spectral density. From the results of computer simulation with original 32 gray level imgae of 64x64 pixels, we can find that restorated image after each iteration converge to original image very fast, and SNR gain be at least 8[dB] after 10th iteration for corrupted image with additive white Gaussian noise.

• Phonetics and Speech Sciences
• /
• v.1 no.4
• /
• pp.97-103
• /
• 2009

This paper describes a new algorithm for encoding spectral envelope in the time domain alias cancellation (TDAC) part of G.729.1. The spectral envelope and modified discrete cosine transform (MDCT) coefficients of the weighted code-excited linear predictive (CELP) coding error in lower-band and the higher-band input signal are encoded in the TDAC part. In order to reduce allocation bits for spectral envelope coding, a new algorithm using sub-band correlation between adjacent frames is proposed. In addition, to improve the quality of decoded signals, two bit allocation strategies using reduced bits from the proposed algorithm are proposed. The performance of the proposed algorithm is evaluated in terms of objective quality and bit reduction rates. Experimental results show that the proposed algorithm increases the quality of sounds significantly.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.277-280
• /
• 2002

Many digital watermarking methods have been proposed for copyright protection. Especially, methods to add a watermark in the frequency domain are often used. In those methods, only a few components of frequencies are changed according to watermark information, so that the pixel values of the image obtained by the inverse transform sometimes exceed the dynamic range and owing to the clipping process at this time watermark information is changed. This phenomenon even occurs without attacks like image processing. In this paper, we propose two methods to prevent loss of watermark information, applicable to such cases, it is said that one is the method called "inversion of increase and decrease" and another is "conservation of amounts of changes." We can extract the watermark information correctly under the condition of no attacks by using these proposed methods.

• ETRI Journal
• /
• v.46 no.4
• /
• pp.595-603
• /
• 2024

This paper presents methods for reducing the peak-to-average power ratio (PAPR) of the orthogonal time frequency space (OTFS) signal. These methods mainly consist of two operations: symbol interferometry (SI) and either 𝜇-law or A-law companding. SI spreads the data of one OTFS symbol onto all symbols and is implemented using a simple inverse fast Fourier transform operation on each OTFS symbol. During the second operation, the PAPR of the OTFS signal is significantly reduced. For our performance analysis, the complementary cumulative distribution function, probability density function, and bit error rate are illustrated through simulations performed in MATLAB. The performance is also analyzed using a solid-state power amplifier at the transmitter and compared with OTFS, 𝜇-law-based OTFS, and SI OTFS systems. The results indicate that the proposed OTFS system achieves a low PAPR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.25-34
• /
• 2004

The ability to perform the same operations in the transform domain as in the spatial domain is important for efficient image transmission through a channel. We perform image resizing, which includes magnifying and reducing the size, in the discrete cosine transform(DCT) domain and the effects of the transform domain approach are analyzed in the corresponding spatial domain. Based on this analysis, the two resizing algorithms are proposed. The first one further compresses the images encoded by the compression standard by reducing the size before compression, and the other reduces the loss of information while maintaining the conventional compression rate. Because of its compatibility with standard codec, these algorithms can be easily embedded in JPEG and MPEG codecs, which are widely used for the purpose of image storage and transmission. Experimental results show a reduction of about half the bit size with similar image quality and about a 2- or 3-dB quality improvements in the similar compression rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.2
• /
• pp.162-171
• /
• 1991

This paper presents an algorithm for compressing image data by separating the image into two parts. I.e. edge image containing high-frequency components and non-edge image containing low-frequency components of image. The edge image is extracted by using 8 level compass gradient masks and the non-edge image is obtained by removing the edge image from the original image. The edge image is coded by Huffman run-length code and the non edge image is transformed first by DCT and the transformed images is coded next by a quantized bit allocation table. For an example image. GIRL. the proposed algorithm shows bit rate of 0.52 bpp with PSNR of 36dB.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.5
• /
• pp.737-746
• /
• 2004

Two-channel multiwavelet system is investigated for image compression application in this paper. Generally, multiwavelets are known for their superb capability of compressing non-stationary signals like voice. However, multivavelet system have a critical problem in processing and compressing image data due to mesh-grid visual artifacts. In our two-channel multiwavelet system we have investigated incorporation of pre and post filtering to the multiwavelet transform and compression system for alleviating those ingerent visual artifacts due to multiwavelet effect. In addition, to quantify the image data compression performance of proposed multiwavelet system, computer simulations have been performed using various image data. For bit allocation and quantization, the Lagrange multiplier technique considering data rate vs. distortion rate along with a nonlinear companding method are applied equallly to all systems considered, here. The simulation results have yielded 1 ~ 2 dB compression enhancement over the scalar savelet systems. If the more advanced compression methods like SPIHT and run-length channel coding were adopted for the proposed multiwavelet system, a much higher compression gain could be obtained.