• 반도체디스플레이기술학회지
• /
• 제5권2호
• /
• pp.19-25
• /
• 2006

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and coding unit sizes. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. The encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with certain filters performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

• 한국항해학회지
• /
• 제19권3호
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• 한국정보처리학회논문지
• /
• 제3권5호
• /
• pp.1317-1328
• /
• 1996

본 논문에서는 프래탈 영상 부호화시 부호화 시간이 장시간 소요되는 단점을 보완하기 위한 고속 프랙탈 영상 부호화 알고리즘을 제안하고, 그 알고리즘의 성능 을 기존의 방법과 비교 분석하였다. 기존의 프랙탈 영상부호화 방식은 원영상을 축소하여 비교 될 영상으로 만들고, 축소된 영상에 대한 원영상의 축소변환의 고정 점을얻기 위해 축소된 영상의 전체영역을 탐색하므로써 많은 부호화 시간이 소요 되었다. 그러나, 제안한 알고리즘은 스케일링과 탐색영역제한 방식을 이용하여 부호화 시간을 대폭 단축 시켰다. 그 결과로서 Jacquin 방법과의 비교시, 제안한 알고리즘은 최보 180배 이상의 부호화 시간을 단축시켰으며, 복원된 영상의 화질은 다소 감소하고 압축율은 약간 증가하였다. 따라서 제안한 알고리즘이 기존의 방법 들에 비해 부호화 시간 면에서 크게 향상되었음을 확인할 수 있었다.

• 한국콘텐츠학회논문지
• /
• 제15권2호
• /
• pp.1-10
• /
• 2015

본 논문에서는 집적 영상의 부호화효율을 향상시키는 부호화 방법을 제안한다. 카메라와 물체와의 거리, 물체와 배경의 복잡도 등에 따라 집적 영상의 특징이 매우 다양함에 따라 이에 적합한 부호화 방법을 사용한다면 부호화효율을 향상시킬 수 있다. 또한 집적영상은 요소영상 단위의 압축을 수행함에 따라 요소영상에 대한 부호화 방향을 고려할 때 부호화효율을 향상시킬 수 있다. 그래서, 우선 6가지 종류의 재배치 방법으로 집적 영상을 재배치한 후, 재배치된 영상을 3D-DCT 기반의 부호화를 적용한다. 마지막으로 비트율-왜곡 최적화 기법을 수행하여 6가지 재배치 방법 중 최선의 방법을 선택한다. 실험 결과, 제안방법은 기존 방법과 비교해 영상 화질과 비트율 측면에서 높은 이득을 보였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1003-1006
• /
• 2002

In the communications systems with diversity, we are commonly faced on needing of new source coding technique, error resilient coding. The error resilient coding addresses the coding algorithm that has the robustness to unreliability of communications channel. In recent years, many error resilient coding techniques were proposed such as data partitioning, resynchronization, error detection, concealment, reference picture selection and multiple description coding (MDC). Especially, the MDC using correlating transform explicitly adds correlation between two descriptions to enable the estimation of one set from the other. However, in the conventional correlating transform method, there is a critical problem that decoder must know statistics of original image. In this paper, we propose an enhanced method, the MDC using whitening transform that is not necessary additional statistical information to decode image because the DCT coefficients to apply whitening transform to an image have uni-variance statistics. Our experimental results show that the proposed method achieves a good trade-off between the coding efficiency and the reconstruction quality. In the proposed method, the PSNR of images reconstructed from two descriptions is about 0.7dB higher than conventional method at the 1.0 BPP and from only one description is about 1,8dB higher at the same rate.

• 전기학회논문지
• /
• 제61권8호
• /
• pp.1199-1203
• /
• 2012

H.264 adopted many compression tools to increase image data compression efficiency such as B frame bi-directional predictions, the direct mode coding and so on. Despite its high compression efficiency, H.264 can suffer from its long coding time due to the complicated tools of H.264. To realize a high performance H.264, several fast algorithms were proposed. One of them is adaptive fast direct mode decision algorithm using mode and Lagrangian cost prediction for B frame in H.264/AVC (MLP) algorithm which can determine the direct coding mode for macroblocks without a complex mode decision process. However, in this algorithm, macroblocks not satisfying the conditions of the MLP algorithm are required to process the complex mode decision calculation, yet suffering a long coding time. To overcome the problem, this paper proposes a fast direct mode prediction algorithm. Simulation results show that the proposed algorithm can determine the direct mode coding without a complex mode decision process for 42% more macroblocks and, this algorithm can reduce coding time by up to 23%, compared with Jin's algorithm. This enables to encode B frames fast with a less quality degradation.

• 대한기계학회논문집B
• /
• 제24권2호
• /
• pp.153-160
• /
• 2000

A Particle Image Velocimetry(PIV) algorithm is developed to analyze whole flow field both qualitatively and quantitatively. The practical use of PIV requires the use of fast, reliable, computer-based methods for tracking numerous particles suspended in a flow field. The TSS, NTSS, FFT-Hybrid, which are developed in the area of image compression and coding, are introduced to develop fast vector search algorithm. The numerical solution of the lid-driven cavity flow by the ADI algorithm with the Wachspress Formula is introduced to produce synthetic data for the validation of the tracking algorithms. The algorithms are applied to image data of real flow experiments. The comparisons in CPU time and mean error show, with a small loss of accuracy, CPU time for tracking is reduced considerably.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3211-3230
• /
• 2014

Recently, sparse coding has achieved remarkable success in image representation tasks. In practice, the performance of clustering can be significantly improved if limited label information is incorporated into sparse coding. To this end, in this paper, a novel semi-supervised algorithm, called constrained sparse concept coding (CSCC), is proposed for image representation. CSCC considers limited label information into graph embedding as additional hard constraints, and hence obtains embedding results that are consistent with label information and manifold structure information of the original data. Therefore, CSCC can provide a sparse representation which explicitly utilizes the prior knowledge of the data to improve the discriminative power in clustering. Besides, a kernelized version of our proposed CSCC, namely kernel constrained sparse concept coding (KCSCC), is developed to deal with nonlinear data, which leads to more effective clustering performance. The experimental evaluations on the MNIST, PIE and Yale image sets show the effectiveness of our proposed algorithms.

• 패션비즈니스
• /
• 제26권3호
• /
• pp.98-115
• /
• 2022

The purpose of study was to analyze the process of accepting by BTS fans. The methodology used in this study was qualitative research using grounded theory and the results of the study follow. As a result of open coding, 47 concepts, 23 subcategories, and 14 categories were derived. In the axis coding stage, the casual conditions were "Recognition of BTS image," "Fascinated by BTS image," "Simple consumption of BTS image," and "Arising and expansion of curiosity about BTS image." The contextual conditions were "Accessibility of BTS image" and "Abundance of BTS image searching paths." The central phenomenon appeared to be "Immersing and studying BTS image." The arbitration conditions were "Capabilities required to reproduce BTS image" and "Motivation for contributing BTS image." The actions/interactions were "Presenting BTS image," "Contribution to the spread of BTS image," and "Involved in forming new BTS image." The result was "Emergence and expansion of new BTS image meaning" and "Strengthening attachment to BTS." Through process analysis, it was found that acceptance of BTS images consisted of five stages: "Recognition of BTS image," "Becoming curious about BTS image," "Searching BTS image," "Intervention of BTS image." and "Reproduction of BTS image." As a result of deriving the core categories through selective coding, the core category was "Forming a bond while participating in the BTS image."

• 자연과학논문집
• /
• 제5권2호
• /
• pp.33-38
• /
• 1992

텍스처럴 리전의 러프니스와 사람의 시각 시스템의 특성에 기초하여 세크멘테이션을 수행하는, 멀티미디어 텔레컨퍼런스를 위한 새로운 텍스처 세그멘테이션-베이스 영상 코우딩 기술을 제안한다. 세그멘테이션은, 텍스처의 영역이, 지각된 콘스탄트 인텐시티와 스무드 텍스처 및 러프 텍스처의 세가지 텍스처 클래스로 분류되도록 프랙탈 디멘전을 쓰레쉬호울딩하여 이루어진다. 각 세그먼트 바운더리와 각 텍스처 클래스를 위한 효과적인 코우딩 기술을 개발하여 높은 압축률과 좋은 영상 품질을 갖는 영상 코우딩 시스템을 달성하고, 이 기술의 코우딩 효율을 잘 확립된 기술 (디스크릿 코사인 트랜스폼(DCT) 영상 코우딩)의 코우딩 효율과 비교한다.