• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.383-385
• /
• 2007

웨이블릿 화상 코딩 기법은 자연적으로 레이어드된 비트스트림을 생성해 내기 때문에, 주파수 제한적인 채널 상황에서 에러에 강한 성능을 나타내고 있다. 본 논문에서는 Progressive Image Coder의 성능을 비교하고 평가하는 새로운 기법인 시각적 엔트로피를 이용해, 웨이블릿 영역에서 시각적인 가중치를 이용해 정량화하려고 한다. 이 시각적인 가중치는 주파수 영역과 공간 영역에서, 인간의 시각 체계(HVS, human visual system)에 기반 하여 만들어진 것으로, 웨이블릿 계수들의 코딩 순서를 결정하는 기준으로 사용되고, 이렇게 해서 시각적인 화질을 개선할 수가 있다. 정규화된 채널 용량이 0.3일 때, 전송 이득은 시각적 엔트로피로 측정해 보았을 때 23% 이상 얻을 수 있다.

• 전자공학회논문지B
• /
• 제32B권8호
• /
• pp.1091-1098
• /
• 1995

This paper proposes an efficient noiseless encoding method of vector quantization(VQ) index using a dynamic index mapping. Using high interblock correlation, the proposed index mapper transforms an index into a new one with lower entropy. In order to achieve good performance with low computational complexity, we adopt 'the sum of differences in pixel values on the block boundaries' as the cost function for index mapping. Simulation results show that the proposed scheme reduces the average bitrate by 40 - 50 % in ordinary VQ system for image compression. In addition, it is shown that the proposed index mapping method can be also applied to mean-residual VQ system, which allows the reduction of bitrate for VQ index by 20 - 30 %(10 - 20 % reduction in total bitrate). Since the proposed scheme is one for noiseless encoding of VQ index, it provides the same quality of the reconstructed image as the conventional VQ system.

• 디지털콘텐츠학회 논문지
• /
• 제6권2호
• /
• pp.119-123
• /
• 2005

본 논문에서는 HVS 기반 효과적인 워터마킹 방법을 제안하였다. 인간시각시스템의 파라미터로 명암대비, 텍스쳐, 엔트로피, 그리고 표준편차 등을 사용하였고, 외부공격에 대한 각 파라미터들의 성능을 평가한다. 실험결과, 스므드한 영상의 경우 명암대비 파라미터를 사용했을 때 워터마크의 추출이 좋았고, 거친 영상은 표준편차 파라미터에 강인함을 보였다. 결론적으로 영상의 특징에 맞는 파라미터를 선택하는 것이 효과적인 워터마킹을 위해 선행처리 되어야 한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.458-461
• /
• 2000

Variable length codes are often used in entropy coding, but are very vulnerable in noisy environments. Reversible variable length codes, however, muse possible to decode instantaneously in both forward and backward directions, so that more usable data can be retrieved when bit errors occur via transmission. Furthermore, partial decodability is desirable to introduce in the reversible variable length code because ROI (Region Of Interest) decoding function is sometimes required in recent image information systems such as the medical imaging, the digital museum and so on. In this paper, we propose a partially decodable and reversible variable length code by modifying Golomb-Rice code.

• 전기학회논문지
• /
• 제61권12호
• /
• pp.1926-1931
• /
• 2012

We investigated a novel fast non-uniform illumination correction method for bi-level images. The proposed method divides a bi-level image into sub-images and roughly estimates block-wise illumination by low pass filtered maximum values of sub-images. After that, we apply bilinear interpolation using the block-wise illumination to estimate non-uniform illumination, and compensate for the effect of non-uniform illumination using the estimated illumination. Since the proposed method is not based on computation intensive iterative optimization, the proposed method can be used effectively for applications that require fast correction of non-uniform illumination. In simulations, the proposed method showed more than 20 times faster speed than existing entropy minimization method. Moreover, in simulations and experiments, the restored images by the proposed method were more close to true images than images restored by conventional method.

• 한국통신학회논문지
• /
• 제21권9호
• /
• pp.2341-2348
• /
• 1996

This paper proposes an image compression algorithm that adopts projection scheme on mean-residual metod. Sub-blocks of an image are encoded using mean-residual method where mean value is predicted according to that of neighboring blocks. Projection scheme with 8 directions is applied to the compression of residual signals of blocks. Projection vectors are finite-state vector quantized according to the projection angle of nighboring blocks in order to exploit the correlation among them. Side information to represent the repetition of projection is run-length coded while the information for projection direction is compressed using entropy encoding. The proposed scheme apears to be better in PSNR performance when compared with conventional projection scheme as well as in subjective quality preserving the edges of images better than most tranform methods which usually require heavy computation load.

• 전자공학회논문지B
• /
• 제32B권11호
• /
• pp.1383-1392
• /
• 1995

In this paper, the method to incorporate TCVQ(Trellis Copded Vector Quantizer) into the encoding of the wavelet trans formed(WT) image followed by a variable length coding(VLC) or an entropy coding(EC) is considered. By WT, an original image is separated into 10 bands with various resolutions and directional components. TCVQ used to compress these WT coefficients is a finite state machine that encodes the input source on the basis of the current input and the current state. Wavelet basis used in this paper is designed by orthogonal spline function. A modified set partitioning algorithm to Wang's is also presented. A simple modification to Wang's algorithm gives a highly time-efficient result. Proposed WT-TCVQ encoder shows a very competitive result, giving 37.46dB in PSNR at 1.002bpp when encoding 512$\times$512 LENA.

• Journal of Biosystems Engineering
• /
• 제17권2호
• /
• pp.132-142
• /
• 1992

The main objective of this paper is to evaluate and modify the existing algorithms for the automatic threshold selection. Four existing algorithms were evaluated quantitatively using test images of coffee droplets and an apple. The images had the different area ratio of the object to the image size, different average gray values between the object and the background, and different S/N ratio of the Gaussian noise. The result showed that Histogram Clustering Method and Maximum Entropy Method were better than Moment Preserving Method and Simple Image Statistic Method in automatic thresholding.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.392-395
• /
• 2003

This paper describes a new iris segmentation and recognition method, which is robust to noises. Combining statistical classification and elastic boundary fitting, the iris is first segmented. Then, the localized iris image is smoothed by a convolution with a Gaussian function, down-sampled by a factor of filtered with a Laplacian operator, and quantized using the Lloyd-Max method. Since the quantized output is sensitive to a small shift of the full-resolution iris image, the outputs of the Laplacian operator are computed for all space shifts. The quantized output with maximum entropy is selected as the final feature representation. An appropriate formulation of similarity measure is defined for the classification of the quantized output. Experimentally we showed that the proposed method produces superb performance in iris segmentation and recognition.

• 대한전자공학회논문지SP
• /
• 제48권2호
• /
• pp.80-87
• /
• 2011

본 논문은 잡음에 강인한 초점 값을 이용한 피사체 중심의 자동초점 알고리듬을 제안한다. 제안된 방법은 영상의 엔트로피를 이용하여 피사체가 존재하는 영역을 자동으로 추정함으로써, 배경에 의해 잘못된 자동초점 결과를 얻는 문제점을 개선하였다. 또한 이산 코사인 변환 계수를 분석하여 새로운 초점 값 계산 방법을 제안하였고, 실험결과를 통해 기존의 알고리듬에 비해 제안된 방법이 가우시안 잡음과 임펄스 잡음이 있는 경우에도 초점 값 특성이 강인함을 검증하였다. 제안하는 자동초점 알고리듬은 지능형 감시 시스템의 팬-틸트-줌 카메라 등에 적용 가능하다.