• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.175-178
• /
• 2009

H.264/AVC is a video coding standard of ITU-T and ISO/IEC, and widely spreads its application due to its high compression ratio more than twice that of MPEG-2 and high image quality. In this paper, we explained Intra Prediction in H.264/AVC, which is able to achieve higher compressing efficiency from correlation removal of adjacent samples in spatial domain, and proposed efficient Intra Predictor architecture design for H.264/AVC decoder. The proposed system reduced computation cycle using processing element and precomputation processing element and also reduced the number of access to external memory using efficient register. We designed the proposed system with Verilog-HDL and verified with suitable test vector. The proposed Intra Predictor achieved about 60% cycle reduction comparing with existing Intra Predictors.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.388-397
• /
• 2015

High Efficiency Video Coding (HEVC)/H.265 is a new video coding standard which is known as high compression ratio compared to the previous standard, Advanced Video Coding (AVC)/H.264. Due to achievement of high efficiency, HEVC sacrifices the time complexity. To apply HEVC to the market applications, one of the key requirements is the fast encoding. To achieve the fast encoding, exploiting thread-level parallelism is widely chosen mechanism since multi-threading is commonly supported based on the multi-core computer architecture. In this paper, we implement both the Tile-level parallelism and the Frame-level parallelism for HEVC encoding on multi-core platform. Based on the implementation, we present two approaches in combining the Tile-level parallelism with Frame-level parallelism. The first approach creates the fixed number of tile per frame while the second approach creates the number of tile per frame adaptively according to the number of frame in parallel and the number of available worker threads. Experimental results show that both improves the parallel scalability compared to the one that use only tile-level parallelism and the second approach achieves good trade-off between parallel scalability and coding efficiency for both Full-HD (1080 x 1920) and 4K UHD (3840 x 2160) sequences.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.271-282
• /
• 2013

Recently, ITU-T/VCEG and ISO/IEC MPEG have started a new joint standardization activity on video coding, called High Efficiency Video Coding (HEVC). This new standard gives significant improvement in terms of picture quality for high resolution video. The main challenge in this upcoming standard is the time complexity. In this paper we have focused on CU splitting algorithm. We have proposed a novel algorithm which can terminate the CU splitting process early based on the RD cost of the parent and current level and the motion vector value of the current CU. Experimental result shows that our proposed algorithm gives on average more than about 10% decrement in time over ECU [8] with on average 1.78% of BD loss on the original.

• Radiation Oncology Journal
• /
• v.25 no.2
• /
• pp.125-133
• /
• 2007

[ $\underline{Purpose}$ ]: This study was to design and fabricate a phantom for prostate cancer brachytherapy to validate a developed program applying a 3-film technique, and to compare it with the conventional 2-film technique for determining the location of an implanted seed. $\underline{Materials\;and\;Methods}$: The images were obtained from overlapped seeds by randomly placing a maximum of 63 seeds in the anterior-posterior (AP) position and at $-30^{\circ} to $30^{\circ} at $15^{\circ} intervals. Images obtained by use of the phantom were applied to the image processing procedure, and were then processed into the development program for seed localization. In this study, cases were set where one seed overlapped, where two seeds overlapped and where none of the three views resolved all seeds. The distance between the centers of each seed to the reference seed was calculated in a prescribed region. This distance determined the location of each seed in a given band. The location of the overlapped seeds was compared with that of the 2-film technique. $\underline{Results}$: With this program, the detection rate was 92.2% (at ${\pm}15^{\circ}), 94.1% (at ${\pm}30^{\circ}) and 70.6% (compared to the use of the 2-film technique). The overlaps were caused by one or more than two seeds that overlapped; the developed program can identify the location of each seed perfectly. However, for the third case the program was not able to resolve the overlap of the seeds. $\underline{Conclusion}$: This program can be used to improve treatment outcome for the brachytherapy of prostate cancer by reducing the number of errors in the process of reconstructing the locations of perfectly overlapped seeds.

• Journal of the Korean Society of Radiology
• /
• v.7 no.3
• /
• pp.181-189
• /
• 2013

The optimum exposure parameters are found when examined using the automatic mode in FFDM. improve the image quality by applying denoising algorithm and propose methods to reduce AGD(Average Grandular Dose) a patient can receive. For the experiment, Nuclear Associates Model 18-222 phantom was the used, and the entrance dose and AGD were measured. And then, Signal, Noise, SNR and FOM(Figure of Merit) were measured, compared and analyzed image denoising before and after. As the experiment result, first, SNR was the highest at Mo/Mo 23kVp and W/Rh 35kvp was the lowest for the average glandular dose. It showed to use 28kVp of W/Rh to be the best through the result of FOM. SNR was the highest at Mo/Mo 23kVp(image denoising), and it showed to W/Rh and 28kVp to be the best in the FOM result which AGD was considered at the same time. By the image denoising, it is possible to reduce noise while maintain important information in the image.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.548-556
• /
• 2005

In wireless network environments, wireless channels are characterized by time-varying fading and interference conditions, which may lead to burst packet corruptions and delay variation. This can cause severe quality degradation of streaming media. To guarantee successful transmission of media over the hostile wireless networks, where channel conditions are highly fluctuating, a flexible and network-adaptive transport method is required. Thus, we propose a network-adaptive transport error control consisting of packet-level interleaved FEC and delay-constrained ARQ, which acts as an application-level transport method of streaming media to alleviate burst packet losses while adapting to the changing channel condition in wireless networks. The performances of the proposed network-adaptive transport error control, general error control schemes, and hybrid schemes are evaluated by a developed simulator at the transport-level and video quality of streaming media. Simulation results show that the proposed mechanism provides the best overall performance among compared other schemes in terms of the transport-level performance of error control and the performance of video quality for streaming media.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.309-316
• /
• 2004

In this paper, we proposed the TDS(T-shape Diamond Search) based on the directions of above, below, left and right points to estimate the motion vector fast and more correctly in this method, we exploit the facts that most motion vectors are enclosed in a circular region with a radius of 2 fixels around search center(0,0). At first, the 4 points in the above, below, left and right around the search center is calculated to decide the point of the MBD(Minimum Block Distortion). And then w. above point of the MBD is checked to calculate the SAD. If the SAD of the above point is less than the previous MBD, this process is repeated. Otherwise, the right and left points of MBD are calculated to decide The points that have the MBD between right point and left point. Above processes are repeated to the predicted direction for motion estimation. Especially, if the motions of image are concentrated in the crossing directions, the points of other directions are omitted. As a result, we can estimate motion vectors fast. Experiments show that the speedup improvement of the proposed algorithm over Diamond Search algorithm(DS) and HEXgon Based Search(HEXBS) can be up to 38∼50％ while maintaining similar image Quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.391-399
• /
• 2006

We propose a novel low complexity video encoder, at the expense of a complex decoder, where video frames are intra-coded periodically and frames in between successive intra-coded frames are coded efficiently using a proposed irregular binning technique. We investigate a method of forming an irregular binning which is capable of quantizing any value effectively with only small number of bins, by exploiting the correlation between successive frames. This correlation is additionally exploited at the decoder, where the quality of reconstructed frames is enhanced gradually by applying POCS(projection on the convex sets). After an image frame is reconstructed with the irregular binning information at the proposed decoder, we can further improve the resulting quality by modifying the reconstructed image with motion-compensated image components from the neighboring frames which are considered to contain image details. In the proposed decoder, several iterations of these modification and re-projection steps can be invoked. Experimental results show that the performance of the proposed coding scheme is comparable to that of H.264/AVC coding in m mode. Since the proposed video coding does not require motion estimation at the encoder, it can be considered as an alternative for some versions of H.264/AVC in applications requiring a simple encoder.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.513-526
• /
• 2010

In this paper, we propose a de-blocking filter for improvement of coding efficiency and computational complexity reduction on a high definition video coding. Recently, the H.264/AVC standard-based research for high definition video coding method is under way because the amount of used of high definition videos is on the increase. The H.264/AVC de-blocking filter is designed for low bitrate video coding and it improves not only the subjective quality but also coding efficiency by minimizing the blocking artifact. However, the H.264/AVC de-blocking filter that strong filtering is performed is not suitable in a high definition video coding which occurs relatively low blocking artifact. Also, the conventional de-blocking filter has high computational complexity in decoder side. The computational complexity of the proposed method is reduced about maximum 8.8% than conventional method. Furthermore, the coding efficiency of the proposed method is about maximum 7.3% better than H.264/AVC de-blocking filter.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.174-184
• /
• 2008

Complementary color filter array (CCFA) is widely used in consumer-level digital video cameras, since it not only has high sensitivity and good signal-to-noise ratio in low-light condition but also is compatible with the interlaced scanning used in broadcast systems. However, the full-color images obtained from CCFA suffer from the color artifacts such as false color and zipper effects. These artifacts can be removed with edge-adaptive demosaicking (ECD) approaches which are generally used in rrimary color filter array (PCFA). Unfortunately, the unique array pattern of CCFA makes it difficult that CCFA adopts ECD approaches. Therefore, to apply ECD approaches suitable for CCFA to demosaicking is one of the major issues to reconstruct the full-color images. In this paper, we propose a new ECD algorithm for CCFA. To estimate an edge direction precisely and enhance the quality of the reconstructed image, a function of spatial variances is used as a weight, and new color conversion matrices are presented for considering various edge directions. Experimental results indicate that the proposed algorithm outperforms the conventional method with respect to both objective and subjective criteria.