• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.665-668
• /
• 2012

멀티미디어 콘텐츠는 디지털 데이터의 특성상 수정과 복제가 쉽고, 이에 따라 불법 유통과 위 변조 등의 문제가 발생할 수 있으므로 콘텐츠 보안의 중요성이 높아지고 있고 가역 워터마킹 방법은 하나의 솔루션이다. 본 논문에서는 JPEG 압축 표준에서 사용할 수 있는 가역 워터마킹 기법을 제안한다. JPEG 압축 과정 중 비손실 과정에서 유지되는 양자화 DCT 블록 데이터에 대하여 인접 블록의 계수간 차이값의 히스토그램을 계산하고, 히스토그램 쉬프팅을 통하여 가역 워터마크를 삽입한다. 디코딩 과정에서 영상에 삽입된 워터마크를 추출함과 동시에 원본 JPEG 표준 영상의 품질을 복원한다. 제안 알고리즘의 성능 평가를 위해 다양한 영상을 대상으로 영상 품질과 압축률을 평가하였다. 삽입된 영상의 PSNR과 압축률은 32.33dB과 89.69%로, 표준 JPEG 압축된 영상 대비 각 3.24dB의 PSNR 차이와 2.58%의 압축률 차이를 보였다.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.93-100
• /
• 2024

In this paper, we propose a novel robust blind crypto-watermarking method for medical images security based on hiding of DICOM patient information (patient name, age...) in the medical imaging. The DICOM patient information is encrypted using the AES standard algorithm before its insertion in the medical image. The cover image is divided in blocks of 8x8, in each we insert 1-bit of the encrypted watermark in the hybrid transform domain by applying respectively the 2D-LWT (Lifting wavelet transforms), the 2D-DCT (discrete cosine transforms), and the SVD (singular value decomposition). The scheme is tested by applying various attacks such as noise, filtering and compression. Experimental results show that no visible difference between the watermarked images and the original images and the test against attack shows the good robustness of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.29-38
• /
• 2012

Due to the rapid development of network environment and wireless communication technology, the distribution of digital video has made easily and the importance of the protection for digital video has been increased. This paper proposes the digital video encryption system based on multiple chaos maps for MPEG-2 video encoding process. The proposed method generates secret hash key of having 128-bit characteristics from hash chain using Tent map as a basic block and generates $8{\times}8$ lattice cipher by applying this hash key to Logistic map and Henon map. The method can reduce the encryption overhead by doing selective XOR operations between $8{\times}8$ lattice cipher and some coefficient of low frequency in DCT block and it provides simple and randomness characteristic because it uses the architecture of combining chaos maps. Experimental results show that PSNR of the proposed method is less than or equal to 12 dB with respect to encrypted video, the time change ratio, compression ratio of the proposed method are 2%, 0.4%, respectively so that it provides good performance in visual security and can be applied in real time.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1521-1530
• /
• 2004

In this paper, we present effective quantization noise reduction algorithm using signal adaptive filter and linear combination between blocks in multimedia system. In the proposed method, all of the blocks are classified into low frequency blocks, high frequency blocks, and midrange blocks according to DCT coefficients. Ringing artifacts are shown in high frequency blocks. So ringing artifact reduction algorithm is performed in high frequency blocks using a signal adaptive filter. And the blocking artifact reduction is performed by replacing the pixel value of blocky blocks using linear combination between blocky block and remote unblocky block. The simulation results shows better performance in respective of the subjective and objective image quality than the conventional method.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.451-454
• /
• 2004

The reconfigurable architecture is increasingly important for design of multi-mode communication systems and computation-intensive DSP systems. The proposed coarse-grain architecture is based on a reconfigurable processing element consisting of a MAC unit, a register file, a context data register, and PE interconnect control blocks. The main feature of the Proposed architecture is the loop context which enables faster configuration. Also, we propose another area-efficient reconfigurable architecture with improved reconfigurability. The SystemC modeling results show that the proposed architecture can reduce 9 clock cycles of 2D DCT compared to existing architectures.

• Proceedings of the KOSOMBE Conference
• /
• v.1992 no.05
• /
• pp.58-63
• /
• 1992

The discrete cosine transform (DCT)-based progressive coding standard proposed by the International Standardization Orgnnization (ISO) Joint Photographic Experts Groups (JPEG) is investigated for medical image compression and the performance of the JPEG is compared to that of the full-frame bit-allocation (FFBA) technique. From the comparison, the JPEG standard appeals superior to the FFBA technique in the following aspects: 1) JPEG achieves higher compression than the FFBA technique with less mean square error. 2) Less Gibb's artifact is observed in the compressed images by the JPEG. 3) Computational time for the JPEG is about one-fourth or the FFBA technique. Other attractive points of the JPEG include: Implementation of the JPEG with VLSIs is commercially available in relative low price and the JPEG compression format can easily be interchangeable with other applications.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.97-105
• /
• 1994

Transform image coding using DCT is proved to be efficient in the absence of channel error but its performance degrades rapidly over noisy channel. In this paper, in the case of appling bit selcetive error correction coding that protects some significant bits in a codeword, an efficient allocation method of imformation bits and additive redundancy bits used for quantization and error correction coding respectively under constant transmission bit rate is proposed, and its performance is analyzed. As a result, without increasing trasmission bit rate, PSNR can be improved up to 7~8 [dB] below bit error rate $10^2$ and the image without blocking effect caused by bit error resulted from channel noise can be recostructed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.99-108
• /
• 1994

In this paper an image compression technique based on fractal theory using iterated contractive transformation is analysed and an improved image coder is suggested. Existing methods used the classifier proposed by Ramamurthi and Gersho which utilize the properties of neighboring pixels in the spatial domain. In this paper DCT-based classification is applied to 512$\times$512 images and PSNR improvement of 0.4~2.7 dB is obtained at lower bit rate over conventional algorithms. In addition the effect of varying the domain block size and quantization step size of the luminance shift parameter on the compression ratio and the image quality is compared and analysed.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.46-49
• /
• 2000

An iterative deblocking algorithm for DCT-compressed images using two-dimensional FIR filters adapted for local directionality of each block, is proposed. First, we introduce a set of simple lowpass filters, which are adapted for edges of different angles. In conventional deblocking methods based on lowpass-filtering and convex projections, a single filter is applied to a whole image. In the proposed method, on the other hand, a suitable filter is chosen out of the directional filters designed previously in every subimage (typically $8{\times}8$ block). Experimental results indicate that adaptive filtering improves PSNR at each iteration.