• The Transactions of the Korea Information Processing Society
• /
• v.7 no.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.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.11
• /
• pp.786-792
• /
• 2004

A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.12
• /
• pp.110-119
• /
• 1996

A novel high speed VLSI architecture and its VLSI realization methodologies for a motion estimation processor based on full search block matching algorithm are presentd. The presented architecture is designed in order to be suitable for highly parallel and pipelined processing with identical PE's and adjustable in performance and hardware amount according to various application areas. Also, the throughput is maximized by enhancing PE utilization up to 100% and the chip pin count is reduced by reusing image data with embedded image memories. Also, the uniform and identical data processing structure of PE's eases VLSI implementation and the clock rate of external I/O data can be made slower compared to internal clock rate to resolve I/O bottleneck problem. The logic and spice simulation results of the proposed architecture are presented. The performances of the proposed architecture are evaluated and compared with other architectures. Finally, the chip layout is shown.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.2
• /
• pp.100-106
• /
• 1992

In this pape, we designed and implemented a hardware accelerator for the generation of bit map font from Hangul outline font description for LBP (Laser Beam Printer) and screen applications Whole system was implemented as a double size PC/AT application board which consists of processing bolck and display block. The processing block has a master processor (MC68000)and two slave processors which are MC56001 and KAFOG chip responsible for the short vector generation. In the display block, TMS34061 was used for monitor display and GP425 was used for LBP print out. The resolution of the monitor is 640$\times$480 and that of LBP is 2385$\times$3390. The current system called KHGB90-B generates about 100 characters per second where each character consists of 32$\times$32 bits

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.5
• /
• pp.56-65
• /
• 1994

We have carried out a research on automatic measurement of gage blocks below 250mm and then improved the accuracy of the system, and reduced the measurement time using image processing technique and computer interface. The accuracy of the system is (230+10330 $L^{2}$)$^{2}$ nm (L:m) with confidence level of 95%. We participated APMP gage block intercomparision-1993/1994. The 1st round intercomparision showed that the measured values of all 5 gage blocks were within 21 nm from average.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.311-315
• /
• 2006

Viterbi decoder는 크게 BM(Branch metric), ACS(Add-Compare-Select), SM(Survivor Memory) block 으로 구성되어 있다. 이중 ACSU 부분은 고속 데이터 처리를 위한 bottleneck이 되어 왔으며, 이의 해결을 위한 많은 연구가 활발히 진행되어 왔다. look ahead technique은 ACSU를 M-step으로 처리하고 CS(Carry save) number를 사용한 새로운 비교 알고리즘을 제안하여 high throughput을 추구했으며, minimized method는 block processing 방식으로 forward, backward 방향으로 decoding을 수행하여 ACSU 부분의 feedback을 완전히 제거하여 exteremely high throughput 을 추구하고 있다. 이에 대해 look ahead technique 의 기본 PE(Processing Element)를 바탕으로 minimized method 알고 리즘의 core block 을 bit-level 로 구현하였으며 : code converter 를 이용하여 CS number 가운데 redundat number(l)를 제거하여 비교기를 더 간단히 하였다. SYNOPSYS의 Design compiler 와 TSMC 0.18 um library 를 이용하여 합성하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.195-198
• /
• 2000

본 논문에서는 정보블록알고리즘(IBPA; Information Block Preprocessing Algorithm)을 이용한 정보블록 정렬알고리즘(IBSA; Information Block Sort Algorithm)을 제안하고 그 성능을 평가하였다. IBSA의 시간복잡도는 O(N)이며, 데이터의 분포상태에 영향을 받지 않는다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, 중복 값 허용의 경우(a)는 퀵 정렬의 32.42%, 기수정렬의 9%정도의 비교회수만으로도 정렬할 수 있음을 보여주었으며, 중복 값이 없는 경우(b)는 퀵 정렬의 53.12%, 기수정렬의 12.79%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1881-1884
• /
• 2003

본 논문은 시각적 워터마크의 삭제나 수정을 방지하기 위해 블록 기반 내용 인증(Block-wise content authentication) 방법을 제안한다. 제안한 방법은 원본 이미지와 워터마크 이미지를 사용하여 DCT 기반의 시각적 워터마크(Visible watermark)가 삽입된 이미지로 만든다. 다음, 블록 기반 서명(Block-wise signature)을 삽입하여 JPEG 과 같은 허용 가능한 이미지 조작에서는 정보가 유지되고, 워터마크의 삭제와 같은 악의적인 이미지 조작에는 인증을 허용하지 않는다. 또한 이미지의 조작된 부분을 알 수 있도록 로컬라이제이션(Localization)을 이용하여 조작된 부분의 위치를 파악한 수 있다. Lena를 포함한 여러 표준 영상을 사용하여 실험한 결과, 제안한 방법은 시각적 워터마크에 대한 다양한 공격에서 조작된 위치를 정확하게 표현할 수 있었다. 그리고 Photoshop 7.0의 Quality factor 11인 JPEG-90 압축에서 약 99%의 인증이 가능하였고, 블러링(Blurring)이나 샤프닝(Sharpening)과 같은 기타 공격에서는 각각 51%, 50%로 인증이 허용되지 않았다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.1042-1046
• /
• 2000

본 논문에서는 질감 정보를 나타낼 수 있는 Block-based 에지 히스토그램과 색상 정보를 표현할 수 있는 DCT 를 이용한 칼라 영상 검색 방법을 제안한다. 제안된 방법은 최소의 특징량으로 최대의 검색효율을 얻기 위해 YCbCr 칼라 모델상에서 Y 영상으로부터는 전체적인 영상에 대한 히스토그램과 에지 히스토그램을 특징량으로 추출하고 Cb, Cr 영상으로부터는 DCT 계수를 특징량으로 추출하여 칼라 영상을 검색한다. 이는 칼라와 질감을 동시에 고려하면서 특징량의 크기가 적어 웹, 대용량 검색 시스템 및 동영상 검색에 적합하다. 성능 평가는 MPEG-7 의 칼라 특징자들의 성능평가를 위해 사용된 S1 및 S3 그룹 영상을 대상으로 실험하였으며 제안한 복합 특징량은 칼라 영상 검색에서 우수한 성능을 나타냄을 실험으로 확인 하였다.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.261-270
• /
• 2019

In order to protect secret digital documents against vulnerabilities while communicating, steganography algorithms are applied. It protects a digital file from unauthorized access by hiding the entire content. Pixel-value-difference being a method from spatial domain steganography utilizes the difference gap between neighbor pixels to fulfill the same. The proposed approach is a block-wise embedding process where blocks of variable size are chosen from the cover image, therefore, a stream of secret digital contents is hidden. Least significant bit (LSB) substitution method is applied as an adaptive mechanism and optimal pixel adjustment process (OPAP) is used to minimize the error rate. The proposed application succeeds to maintain good hiding capacity and better signal-to-noise ratio when compared against other existing methods. Any means of digital communication specially e-Governance applications could be highly benefited from this approach.