• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제15권2호
• /
• pp.455-461
• /
• 2011

In object tracking using the block mating algorithm, it is not proper to use a fixed matching block to track an object of which size may be various and can be changed at any time. This paper defines an adaptive matching block for the dynamic environment and proposes a block matching algorithm for it. The matching block is composed of a main-block of $10{\times}10$ pixels and 8 sub-blocks of $6{\times}6$ pixels in a wide area of $42{\times}42$ pixels, the main-block located its center is used as an object block, and the sub-blocks located its boundary are used as candidates for the object block. The proposed algorithm extracts the object blocks from the sub-blocks by using their motion vectors for 10 previous frames and performs the block matching with the main block and them. The experiments for perform estimation show that the proposed algorithm extracts just valid object blocks from the matching block and keeps an object having free movement in image center area.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제47권6호
• /
• pp.1-9
• /
• 2010

In this paper, we propose an efficient compression method of the integral images. The integral imaging is a well-known technique to represent and record three-dimensional images. The proposed method is based on three dimensional discrete cosine transform (3D-DCT). The 3D-DCT techniques for the integral images have been reported as an efficient coding method for the integral images which reduces the redundancies between adjacent elemental images. The proposed method is a compression method efficient to integral images using adaptive block mode(ABM), based on the 3D-DCT technique. In the ABM, 3D-DCT blocks adaptive to the characteristics of integral images are constructed, which produces variable block size 3D-DCT blocks, and then 3D-DCTs for the 3D blocks are performed. Experimental results show that the proposed method gives significant improvement in coding efficiency. Especially, at the high bit-rates, the proposed method is more excellent since the overhead incurred by the proposed method take less part of the total bits.

• Journal of the Korean Society of Radiology
• /
• 제8권7호
• /
• pp.435-441
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the RGB image compression rate and image quality, such as gray-level images and showed good.

• Journal of the Korean Society of Radiology
• /
• 제10권4호
• /
• pp.263-270
• /
• 2016

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the YIQ image compression rate and image quality, such as RGB images and showed good.

• Journal of Broadcast Engineering
• /
• 제22권1호
• /
• pp.15-27
• /
• 2017

CRA(Conditional Replenishment Algorithm) was proposed to improve the visual quality of SC-MMH(Service Compatible 3DTV using Main and Mobile Hybrid delivery) which is a kind of hybrid 3DTV system and has been standardized by ATSC. In SC-MMH system, reference view and additional view may have different resolutions and/or encoding methods. To reconstruct 3D view, additional view needs to be enlarged as same as reference view. Although the performance of CRA is quite satisfactory, there may exist some blocky artifacts in the enlarged view since it adopts block-shaped processing unit with quad-tree structure. In this paper, we analyze the main causes of blocky artifacts in CRA and show these artifacts can be successfully suppressed by applying the deblocking filter at receiver side.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제11권9호
• /
• pp.1650-1657
• /
• 2007

In this paper, we propose an Overlapped Block and an Hanning Window to prevent a Block Discontinuity when we use an algorithm to eliminate ringing artifact which is based on a block structure. The algorithm to eliminate ringing artifact operates with a block structure and 24-RGB data and is based on a modified K-means algorithm. The proposed overlapped block method is piled up one on another per an half of the size of unit-block when an input image is split into several unit-blocks. Therefore, we define a data unit as the unit-block of the block size, $16{\times}16$ pixels. We reconstruct the processed data units into the original form of input image by using an isotropic form of Hanning Window. Finally, in order to evaluate the performance of the abovementioned algorithms, we compare three image, an input image with ringing artifact, an image result obtained by conventional method (non-overlapped), and an image result obtained the proposed method.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• 제12권3호
• /
• pp.186-191
• /
• 2019

In this paper, we propose a implementation approach of the high-speed feature extraction algorithm. The proposed method is based on the block type classification algorithm which reduces the computation time when target macro block is divided to smooth block type that has no image features. It is quantitatively identified that occurs at 29.5% of the total image using 200 standard test images with $64{\times}64$ macro block size. This means that within a standard test image containing various image information, 29.5% can reduce the complexity of the operation. When the proposed approach is applied to the Canny edge detection, the required latency of the edge detection can be completely eliminated, such as 2D derivative filter, gradient magnitude/direction computation, non-maximal suppression, adaptive threshold calculation, hysteresis thresholding. Also, it is expected that operation time of the feature detection can be reduced by applying block type classification algorithm to various feature extraction algorithms in this way.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제46권1호
• /
• pp.49-55
• /
• 2009

This paper develops a methodology for resizing the resolution of an image in an arbitrary block transform domain. To accomplish this, we represent the procedures resizing images in an orthogonal transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces the reliable performances without increasing the computational complexity, compared to conventional methods when applied to various transforms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 한국방송공학회 2005년도 학술대회
• /
• pp.43-46
• /
• 2005

H.264/AVC 동영상 부호화 표준에서는 새로운 부호화 도구들이 추가되었으며 이를 통해 이전의 동영상 표준과 비교하여 높은 압축 효율을 가진다. 특히, VBS(Variable Blok Size)와 다중 참조 프레임의 사용으로 H.264내의 매크로블록은 이전의 부호화 표준들에 비하여 보다 많은 정보들을 포함한다. H.264 부호화 표준에서는 하나의 매크로블록이 최대 16개까지의 서로 다른 움직임 벡터를 가질 수 있으며 최대 4개의 서로 다른 참조프레임을 가질 수 있다. 또한 다양한 블록크기로의 움직임 추정을 하며 이는 매크로블록 모드로서 정의된다. 따라서 H.264내의 매크로블록은 기존의 동영상 부호화 표준보다 많은 움직임 벡터를 가질 뿐만 아니라 기존에는 없던 참조프레임과 매크로블록 모드의 정보를 새로이 포함하고 있다. 본 논문은 H.264 부호화 표준의 특성을 고려하여 매크로블록이 포함하고 있는 다양한 크기의 움직임 벡터 및 참조 프레임뿐 아니라 주변 매크로블록들의 모드를 이용하여 손실된 매크로블록에 대해 에러를 은닉함으로써 매크로블록이 포함하고 있는 정보를 최대한 활용하는 효율적인 에러은닉 알고리즘을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제21권10호
• /
• pp.2645-2652
• /
• 1996

In this paper wepropose a sub-block retransmission scheme for ARQ and hybrid ARQ schemes. When the cannel is quiet the sub-block retransmission scheme behaves like a conventional ARQ or hybrid ARQ scheme. As the channel is becoming noisy, the data block is dvided into small sub-blocks for transmission. Each sub-block is encoded for error control by an apprpriate shortened code and the code length of the shortened code is being adaptive to the corresponding channel BER. the reeived block is checked for errors sub-block by sub-block. The propsoed sub-block retransmission scheme provides improved throughput over conventional schemes by retransmitting only the naked sub-blocks in the occurrence of errors. An example of transferring ATM cells is considered for simulation.