• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.395-402
• /
• 2004

In this paper, we proposed a new method of the large capacity steganography using adaptive threshold on bit planes. Applying fixing threshold, if we insert information into all bit planes, all bit planes showed different image quality. Therefore, we first defined the bit plane weight to solve the fixing threshold problem. We then proposed a new adaptive threshold method using the bit plane weight and the average complexity to increase insertion capacity adaptively. In the experiment, we inserted information into the standard images with the same image quality and same insertion capacity, and we analyzed the insertion capacity and image duality. As a result, the proposed method increased the insertion capacity of about 6% and improved the image quality of about 24dB than fixed threshold method.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.12
• /
• pp.683-689
• /
• 2000

Two-dimensional(2-D) fiber-optic code-division multiple-access(FO-CDMA) system utilizes the optical orthogonal signature pattern code(OOSPC) to encode and decode 2-D data. Encoded 2-D data are spatially multiplexed and transmitted through an image fiber and receiver recovers the intended data by means of thresholding process. OOSPC's construction methods based on expansion of the optical orthogonal code, which is used in one-dimensional(1-D) FO-CDMA system, are introduced. Each OOSPC's performances are compared by using the bit error rate(BER) of interfering OOSPC's of other users. From the results we verify that a balanced incomplete block design(BIBD) construction has the best performance among other mehtods. We also propose a decomposed bit-plane method for parallel transmission and recovery of 256 gray-scale images using OOSPC's constructed by the BIBD method. The simulation result encourages the feasibility of parallel transmission and recovery of multiuser's images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1169-1174
• /
• 2001

A new approach for determining global threshold value of binary image is proposed in this paper. In the proposed algorithm, bit-plane information which involve the shapes of original image is used for dividing image into two parts; object and background. Optimal threshold value are selected based on difference values of average between two regions, which is considered in global binary thresholding. Proposed method is no need to set a initial value, and consequently, it is relatively simple as well as robust. Experimental results showed a good performance in preserving edge not only continuous tone images but also document image.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.89-98
• /
• 1998

In this paper, we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The proposed algorithm not only supports multi-resolution, dividing original image into special band and various resolution but also reduces blocking effects that come into JPEG In encoding time, this algorithm considers each band characters and priority of transport order, and applies to fast search of image.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.11a
• /
• pp.119-122
• /
• 1997

움직임 추정(motion estimation)은 압축 부호화나 영상 안정화 시스템, 비젼 시스템 등과 같은 동영상 처리에 있어서 핵심 기술 중의 하나이다. 그러나 기존의 전역 탐색(brute-force) 알고리즘과 같은 움직임 추정 기법은 방대한 양의 계산을 필요로 하기 때문에 처리 시간이 커지고, 하드웨어로 구현하였을 때 회로가 복잡해진다는 문제점을 안고 있다. 본 논문에서는 비트 플레인(bit-plane)에서의 정합을 이용하여 움직임을 추정하는 새로운 기법을 제안한다. 제안된 기법에서는 기존의 전역 탐색 알고리즘을 하나의 비트 플레인으로부터 추출한 이진 영상에 적용함으로써 움직임 추정에 소요되는 계산량을 크게 줄이면서도 우수한 움직임 추정 성능을 갖도록 하였다. 실험 부분에서는 동영상으로부터 카메라의 이동으로 인한 전역적인 움직임을 추정하는데 제안된 기법을 사용한 결과를 제시하였다. 특히 제안된 기법은 비트 플레인을 선정하는데 있어서 적응 기법을 적용하였기 때문에 조도 변화 등과 같은 열악한 환경에서도 안정적으로 동작한다는 것을 실험을 통하여 보였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.269-272
• /
• 2005

For the efficient image encryption, we proposed the encryption algorithm using the chaotic function and elementary matrix operation defined on the bit plane decomposition. Though the chaotic encryption algorithm is faster than block encryption, it uses a real number computation. In this sense, we use the row and column operations on the bit-plane decomposed images combined with logistic function for the recursive rounding number, too.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.867-870
• /
• 2004

본 논문은 비디오 워터마킹에 관한 연구로서 기존의 DCT변환을 한 후 동영상에 워터마크를 삽입하는 방법과는 달리, 압축과정이나 다른 다양한 공격에 대한 강인성에 초점을 두었다. 이 기법은 DWT 기반의 블라인드 비디오 워터마킹으로서 인간 시각적 특성에서 비지각성을 유지하기 위한 방법이다. 칼라영상을 LUV 좌표계로 변환하여 인간 시각에 둔감한 U영역에 서로 다른 장면의 I-프레임에 대해서 웨이블릿 영역 안에 8bit-plane을 한 후, 1단계 웨일블릿 변환을 거친 부호화된 워터마크에 랜덤한 키를 이용하여 삽입한다. 이 기법은 독립적인 워터마크를 HH1를 제외한 나머지 고주파 부대역 영역에 워터마크를 삽입하고 추출 시에는 삽입된 키를 이용하여 추출하였다. 그리고, 제안한 비디오 워터마킹 알고리즘은 효과적으로 풀리지 않았던 프레임 드로핑과 같은 공격들에 대한 강인함을 기존의 방법과 비교 실험하였다. 이는 최초의 영상 없이 삽입된 워터마크 정보를 실시간으로 검색하여 추출할 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2640-2650
• /
• 1997

In this paper we propose new image coding using wavelet transform. The new method constructs hierarchical bit plane and progressively transports each bit plane. The proposed algorithms not only supports multi-resolution, dividing original image into special band and various resolution but also reduces blocking effects that come int JPEG. In encoding time this algorithm considers each band characters and priority of transport order, and applies to fast search of image.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.1-5
• /
• 2001

A new approach for determining global threshold value for image binarization is proposed in this paper. In the proposed algorithm, bit-plane information which involve the shapes of original image is used for dividing image into two parts object and background, and then compared each average values. Optimal threshold value are selected in center of two averages. Proposed method is relatively simple but robust and achieved good results in continuous tone images and document image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2750-2767
• /
• 1996

In this papr, a new lossless compression method is presented based on the Binary Adaptive Arithmetic Coder(BAAC). A simple unbalanced binary tree is created by recursively dividing the BAAC unit interval into two probability sub-inervals. On the tree the More Probable Predicted Value(MPPV) and Less Probable Predicated Value(LPPV) estimated by local statistics of the image pixels are arranged in decreasing order. The BAAC or Huffman coder is thus applied to the branches of the tree. The proposed method allows the coder be directly applied to the full bit-plane medical image without a decomposition of the full bit-planes into a series of binary bit-planes. The use of the full bit model template improves the compresion ratio. In addition, a fast computation for adjusting the interval is possible since a simple arithmetic operation based on probability interval estimation state machine is used for interval sub-division within the BAAC unit interval.