• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.2027-2041
• /
• 2013

In this paper, we propose a novel reversible data hiding scheme in the index tables of the vector quantization (VQ) compressed images based on index set construction strategy. On the sender side, three index sets are constructed, in which the first set and the second set include the indices with greater and less occurrence numbers in the given VQ index table, respectively. The index values in the index table belonging to the second set are added with prefixes from the third set to eliminate the collision with the two derived mapping sets of the first set, and this operation of adding prefixes has data hiding capability additionally. The main data embedding procedure can be achieved easily by mapping the index values in the first set to the corresponding values in the two derived mapping sets. The same three index sets reconstructed on the receiver side ensure the correctness of secret data extraction and the lossless recovery of index table. Experimental results demonstrate the effectiveness of the proposed scheme.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.797-798
• /
• 2006

In this paper, a codec design method is pro-posed for the face images based on JPEG and its application to face recognition is presented. Quantization table design is dis-cussed using R-D optimization for Yale face data. For the usage in the embedded systems, fast codec design is also considered. The proposed codec has better performance than JPEG codec for face images. Through the recognition experiment using PCA and LDA, it has been shown that the proposed codec has better performance than JPEG codec.

• Journal of Information Processing Systems
• /
• 제6권4호
• /
• pp.435-452
• /
• 2010

This paper proposes a novel reversible data hiding scheme based on a Vector Quantization (VQ) codebook. The proposed scheme uses the principle component analysis (PCA) algorithm to sort the codebook and to find two similar codewords of an image block. According to the secret to be embedded and the difference between those two similar codewords, the original image block is transformed into a difference number table. Finally, this table is compressed by entropy coding and sent to the receiver. The experimental results demonstrate that the proposed scheme can achieve greater hiding capacity, about five bits per index, with an acceptable bit rate. At the receiver end, after the compressed code has been decoded, the image can be recovered to a VQ compressed image.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.5170-5188
• /
• 2015

This paper proposes a novel progressive secret image-hiding scheme based on the inpainting technique, the vector quantization technique (VQ) and the exploiting modification direction (EMD) technique. The proposed scheme first divides the secret image into non-overlapping blocks and categorizes the blocks into two groups: complex and smooth. The blocks in the complex group are compressed by VQ with PCA sorted codebook to obtain the VQ index table. Instead of embedding the original secret image, the proposed method progressively embeds the VQ index table into the cover images by using the EMD technique. After the receiver recovers the complex parts of the secret image by decoding the VQ index table from the shadow images, the smooth parts can be reconstructed by using the inpainting technique based on the content of the complex parts. The experimental results demonstrate that the proposed scheme not only has the advantage of progressive data hiding, which involves more shadow images joining to recover the secret image so as to produce a higher quality steganography image, but also can achieve high hiding capacity with acceptable recovered image quality.

• 한국멀티미디어학회논문지
• /
• 제11권5호
• /
• pp.579-587
• /
• 2008

JPEG 알고리듬은 같은 크기의 영상이라도 영상의 복잡도에 따라 다른 크기의 압축된 파일이 생성된다. 따라서, 디지털 카메라와 같은 제한된 저장용량을 갖는 기기에서 추후에 저장될 수 있는 영상의 개수를 추정하기 어렵다. 이를 해결하기 위한 대표적인 JPEG 비트율 조절알고리듬은 양자화표를 조절하는 방식이다. 기존의 연구가 영상의 복잡성과 양자표의 관계를 선형적으로 보는 반면, 본 연구에서는 복잡성과 양자표의 조절에 정교한 통계적 모델을 적용하여, 목표가 되는 비트율을 얻을 수 있는 함수관계를 추출하여, 기존의 방식보다 개선된 비트율 조절결과를 얻을 수 있었다. 모의실험결과 제안한 방식이 목표 비트율과의 오차의 표준편차가 2배 이상 감소하는 결과를 얻었다.

• 한국통신학회논문지
• /
• 제27권1A호
• /
• pp.26-34
• /
• 2002

IS-95 또는 IMT-2000 등의 이동통신 시스템에서는 10~20msec 길이의 프레임 단위로 정보를 교환하게 되므로 수신측에서는 이와 같은 크기의 프레임을 저장할 버퍼가 필요하다. 연성판정 비터비 복호기를 사용할 때, 이를 위한 버퍼의 크기, 즉 한 프레임에 들어 있는 비트 수는 길쌈부호의 부호율(1 대 n), 전송속도(bps), 그리고 연성판정 비트 수에 비례하여 증가한다. 본 논문에서는 연성판정 비트 수를 4 비트에서 3 비트로 낮추면서 비터비 복호기의 성능 저하를 줄이기 위한 양자화 방법을 제안한다. 연성판정 비트 수(4,3,2,1)별로 양자화 판정 기준 점의 오프셋 크기와 양자화 간격에 대해 비터비 복호기의 성능을 AWGN 환경에서 시뮬레이션 하였고, 이를 토대로 최적의 BER 성능을 갖는 오프셋 크기와 양자화 간격을 결정하였다. 그 결과로서 4 비트 연성판정의 성능에 근접하는 3비트 연성판정 양자화 방법을 도출하였고, IS-95(4 비트)의 최대 40배의 전송속도를 지원하는 IMT-2000 시스템에 적용하였을 대 미미한 성능 손실(-0.05 dB)을 유지하면서 입력 버퍼의 크기를 3/4 배로 줄일 수 있음을 보였다. 또한, 다양한 전송속도에 따라 반복된 누산 입력신호를 제안된 비트 수로 변환하기 위한 최적 SMT(symbol metric table)를 고안하였다.

• 음성과학
• /
• 제10권3호
• /
• pp.241-250
• /
• 2003

In this paper, we implemented the vocoder of variable rate by applying the SOLA-B algorithm to the G.729A to the TMS320C5416 in real-time. This method using the SOLA-B algorithm is that it is reduced the duration of the speech in encoding and is played at the speed of normal by extending the duration of the speech in decoding. But the method applied to the existed G.729A and SOLA-B algorithm is caused the loss of speech quality in G.729A which is not reflected about length variation of speech. Therefore the proposed method is encoded according as it is modified the structure of LSP quantization table about the length of speech is reduced by using the SOLA-B algorithm. The vocoder of variable rate by applying the G.729A and SOLA-B algorithm is represented the maximum complexity of 10.2MIPS about encoder and 2.8MIPS about decoder in 8kbps transmission rate. Also it is evaluated 17.3MIPS about encoder, 9.9MIPS about decoder in 6kbps and 18.5MIPS about encoder, 11.1MIPS about decoder in 4kbps according to the transmission rate. The used memory is about program ROM 9.7kwords, table ROM 4.69kwords, RAM 5.2kwords. The waveform of output is showed by the result of C simulator and Bit Exact. Also, the result of MOS test for evaluation of speech quality of the vocoder of variable rate which is implemented in real-time, it is estimated about 3.68 in 4kbps.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.281-284
• /
• 2002

Error resilience for image coding is an important component of multimedia communication system. Error resilience schemes address loss recovery from the compression perspective. Multiple description coding (MDC) is one of the error resilience techniques promising for robust video transmission. It is the way to achieve tradeoff description such as scalar quantization, correlating transform and the quantized frame expansion. In this paper, we consider Multiple Description Scalar Quantization (MDSQ) to wavelet domain. Conventional MDSQ schemes considered description with equal weights in each sub-bands. But, we can see that the each sub-bands is unequal contribution to whole image quality. Therefore, we experiment the multiple design MDSQ table to make probability of zero index high, which gives high efficiency in arithmetic symbol coder. We also compare our proposed method with the conventional methods and show improved performance in terms of redundancy-rate-distortion.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• Journal of Electrical Engineering and Technology
• /
• 제4권4호
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.