• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.83-91
• /
• 2006

Flashlights in video has many problem to detect the scene change because of high difference values from successive frames. In this paper propose the reliable scene change detection algorithms by extracting the flashlights. This paper proposes a robust scene change detection technique that uses the weighted chi-square test and the automated threshold-decision algorithms. The weighted chi-square test can subdivide the difference values of individual color channels by calculating the color intensities according to NTSC standard, and it can detect the scene change by joining the weighted color intensities to the predefined chi-square test which emphasize the comparative color difference values. The automated threshold-decision algorithm uses the difference values of frame-to-frame that was obtained by the weighted chi-square test. At first, The Average of total difference values is calculated and then, another average value is calculated using the previous average value from the difference values, finally the most appropriate mid-average value is searched and considered the threshold value. Experimental results show that the proposed algorithms are effective and outperform the previous approaches.

• Journal of Broadcast Engineering
• /
• v.11 no.3 s.32
• /
• pp.363-378
• /
• 2006

The Digital Multimedia Broadcasting(DMB) system is developed to offer high quality audio-visual multimedia contents to the mobile environment. The system adopts MPEG-4 standard for the main video, audio and other media format. It also adopts the MPEG-4 scene description for interactive multimedia contents. The animated and interactive contents can be actualized by BIFS(Binary Format for Scene), the binary format for scene description that refers to the spatio-temporal specifications and behaviors of the individual objects. As more interactive contents are, the scene description is also needed more high bitrate. However, the bandwidth for allocating meta data such as scene description is restrictive in mobile environment. On one hand, the DMB terminal starts demultiplexing content and decodes individual media by its own decoder. After decoding each media, rendering module presents each media stream according to the scene description. Thus the BIFS stream corresponding to the scene description should be decoded and parsed in advance of presenting media data. With these reason, the transmission delay of BIFS stream causes the delay of whole audio-visual scene presentation although the audio or video streams are encoded in very low bitrate. This paper presents the effective optimization technique for adapting BIFS stream into expected MPEG-2 TS bitrate without any bandwidth waste and avoiding the transmission delay of the initial scene description for interactive DMB contents.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.635-646
• /
• 2011

In distributed video coding, low complexity encoder can be realized by shifting encoder-side complex processes to decoder-side. However, not only motion estimation/compensation processes but also complex LDPC decoding process are imposed to the Wyner-Ziv decoder, therefore decoder-side complexity has been one important issue to improve. LDPC decoding process consists of numerous iterative decoding processes, therefore complexity increases as the number of iteration increases. This iterative LDPC decoding process accounts for more than 60% of whole WZ decoding complexity, therefore it can be said to be a main target for complexity reduction. Previously, HDA (Hard Decision Aided) method is introduced for fast LDPC decoding process. For currently received parity bits, HDA method certainly reduces the complexity of decoding process, however, LDPC decoding process is still performed even with insufficient amount of parity request which cannot lead to successful LDPC decoding. Therefore, we can further reduce complexity by avoiding the decoding process for insufficient parity bits. In this paper, therefore, a parity request estimation method is proposed using bit plane-wise correlation and temporal correlation. Joint usage of HDA method and the proposed method achieves about 72% of complexity reduction in LDPC decoding process, while rate distortion performance is degraded only by -0.0275 dB in BDPSNR.

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

The H.264 has been adopted as the video codec for various multimedia services such as DMB and next-generation DVD because of its superior coding performance. However, the reference codec of the standard, the joint model (JM) contains quite a few algorithms which are too complex to be used for the resource-constraint embedded environment. This paper introduces very low-complexity H.264 encoding algorithm which is applicable for the embedded environment. The proposed algorithm was realized by restricting some coding tools on the basis that it should not cause too severe degradation of RD-performance and adding a few early termination and bypass conditions during the motion estimation and mode decision process. In case of encoding of 7.5fps QCIF sequence with 64kbpswith the proposed algorithm, the encoder yields worse PSNRs by 0.4 dB than the standard JM, but requires only $15\%$ of computational complexity and lowers the required memory and power consumption drastically. By porting the proposed H.264 codec into the PDA with Intel PXA255 Processor, we verified the feasibility of the H.264 based MMS(Multimedia Messaging Service) on PDA.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.346-352
• /
• 2020

Versatile Video Coding (VVC), a next-generation video coding standard that is in the final stage of standardization, has adopted various techniques to achieve more than twice the compression performance of HEVC (High-Efficiency Video Coding). VVC adopted Bi-prediction with CU-level Weight (BCW), which generates the final prediction signal with the weighted combination of bi-predictions with various weights, to enhance the performance of the bi-predictive inter prediction. The syntax element of the BCW index is adaptively coded according to the value of NoBackwardPredFlag which indicates if there is no future picture in the display order among the reference pictures. Such syntax structure for signaling the BCW index could violate the flexibility of video codec and cause the dependency issue at the stage of bitstream parsing. To address these issues, this paper proposes an efficient BCW weight signaling method which enables all weights and parsing without any condition check. The performance of the proposed method was evaluated with various weight searching methods in the encoder. The experimental results show that the proposed method gives negligible BD-rate losses and minor gains for 3 weights searching and 5 weights searching, respectively, while resolving the issues.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.179-190
• /
• 2012

In Distributed Video Coding(DVC), a low complexity encoder can be realized by shifting complex processes of encoder such as motion estimation to decoder. Since not only motion estimation/compensation processes but also channel decoding process needs to be performed at DVC decoder, the complexity of a decoder is significantly increased in consequence. Therefore, various fast channel decoding methods are proposed for the most computationally complex part, which is the channel decoding process in DVC decoding. As the channel decoding process becomes faster using various methods, however, the complexity of the other processes are relatively highlighted. For instance, the complexity of side information generation process in the DVC decoder is relatively increased. In this paper, therefore, a fast method for the DVC decoding is proposed by using adaptive search range method in side information generation process. Experimental results show that the proposed method achieves time saving of about 63% in side information generation process, while its rate distortion performance is degraded only by about 0.17% in BDBR.

• Proceedings of the Mineralogical Society of Korea Conference
• /
• 2003.05a
• /
• pp.51-51
• /
• 2003

임진강대의 변성이질암은 전형적인 바로비안형 변성분대를 보이며, 남쪽으로 갈수록 변성도가 증가하여 석류석$\longrightarrow$십자석$\longrightarrow$남정석 대를 정의한다. 우리는 반상변정의 성장과 여러번에 걸친 광역변형작용의 연관성을 밝히기 위해 광물의 반응관계와 성장순서 그리고 미구조(microstructure)를 -특히 석류석에 대해서- 연구하였다. 임진강대는 크게 세 번에 걸쳐 변형작용을 받은 것으로 해석된다: (1) 지각 두께의 증가에 수반된 압축변형작용 (D$_{n-1}$), (2) 주 엽리(Sn)를 만든 변형작용(Dn), 그리고 (3) 연성전단작용에 수반된 신장변형작용(D$_{n+1}$ ). 석류석대의 석류석 반상변정에서는 약간 휘어진 포유물 궤적(inclusion trail)이 주 엽리면에 대해 연속적이며, 이는 Dn과 동시기에 반상변정이 생성되었음을 지시한다. 이러한 석류석은 녹니석과 백운모로 구성된 주 엽리를 치환하면서 자라기 때문에, 녹니석+백운모+석영=석류석+흑운모+$H_2O$의 반응에 의해 만들어진 것으로 해석된다. 석류석 자형변정(idioblast)이 주 엽리를 자르면서 성장하기도 하는데, 이는 Dn 이후에도 석류석이 후구조(post-tectonic) 광물로 성장했음을 지시한다. 또한, 이러한 석류석은 흑운모를 치환하기 때문에, 동구조(syn-tectonic) 석류석의 생성반응에서와는 달리 흑운모가 반응물임을 알 수 있다. 한편, 십자석대의 석류석은 포유물 궤적에 의해 정의되는 S$_{n-1}$면이 주 엽리면과 사각을 이루며 단속적이기 때문에, D$_{n-1}$과 Dn 사이에 자란 것으로 해석된다. 이와는 대조적으로 십자석은 주 엽리를 치환하면서 자라고 있어서 Dn과 동시기 혹은 Dn 이후에 자랐을 것으로 해석된다..의 환경문제를 발생하지 않으며, 공정액에 첨가제를 투입하지 않으므로 순환형 친환경공정으로 각광받을 수 있다. 본 연구에서는 고온, 고농도의 NaOH 수용액의 처리에 적합한 막소재와 발생될 수 있는 제반 문제점 등을 파악하였고, 장기간의 실험을 거쳐 최적 투과 압력(Trans membrane pressue), 세정 조건 및 주기, 막재질에 있어서 보강하여야 할 Point, 최적 운전 조건들을 토출해 내었고, 향후 실제 Plant에 적용할 계획이다.는 양적으로 다른 두 가지의 유사한 마그마가 수반된 것으로 추정된다. 것으로 추정된다.를 사용하지 않음으로써 효과적이고 만족할 만한 심근보호 효과를 보였다.를 보였다.4주까지에서는 비교적 폐포는 정상적 구조를 유지하면서 부분적으로 소폐동맥 중막의 비후와 간질에 호산구 침윤의 소견이 특징적으로 관찰되었다. 결론: 분리 폐 관류는 정맥주입 방법에 비해 고농도의 cisplatin 투여로 인한 다른 장기에서의 농도 증가 없이 폐 조직에 약 50배 정도의 고농도 cisplatin을 투여할 수 있었으며, 또한 분리 폐 관류 시 cisplatin에 의한 직접적 폐 독성은 발견되지 않았다이 낮았으나 통계학적 의의는 없었다[10.0%(4/40) : 8.2%(20/244), p>0.05]. 결론: 비디오흉강경술에서 재발을 낮추기 위해 수술시 폐야 전체를 관찰하여 존재하는 폐기포를 놓치지 않는 것이 중요하며, 폐기포를 확인하지 못한 경우와 이차성 자연기흉에 대해서는 흉막유착술에 더 세심한 주의가 필요하다는 것을 확인하였다. 비디오흉강경수술은 통증이 적고, 입원기간이 짧고, 사회로의 복귀가 빠르며, 고위험군에 적용할 수 있고, 무엇보다도 미용상의 이점이 크다는 면에서 자연기흉에 대해 유용한 치료방법임에는 틀림이 없으나 개흉술에 비해 재발율이 높고 비용이 비싸다는 문제가 제기되고 있는 만큼 더 세심한 주의와 장기 추적관찰이 필요하리라 사료된다.전 도부타민 심초음파는 관상동맥우회로술 후

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.309-318
• /
• 2004

This paper proposes the H.264-based selective fine granular scalable (FGS) coding scheme that selectively uses the temporal prediction data in the enhancement layer. The base layer of the proposed scheme is basically coded by the H.264 (MPEG-4 Part 10 AVC) visual coding scheme that is the state-of-art in codig efficiency. The enhancement layer is basically coded by the same bitplane-based algorithm of the MPEG-4 (Part 2) fine granular scalable coding scheme. In this paper, we introduce a new algorithm that uses the temproal prediction mechanism inside the enhancement layer and the effective selection mechanism to decide whether the temporally-predicted data would be sent to the decoder or not. Whenever applying the temporal prediction inside the enhancement layer, the temporal redundancies may be effectively reduced, however the drift problem would be severly occurred especially at the low bitrate transmission, due to the mismatch bewteen the encoder's and decoder's reference frame images. Proposed algorithm selectively uses the temporal-prediction data inside the enhancement layer only in case those data could siginificantly reduce the temporal redundancies, to minimize the drift error and thus to improve the overall coding efficiency. Simulation results, based on several test image sequences, show that the proposed scheme has 1∼3 dB higher coding efficiency than the H.264-based FGS coding scheme, even 3∼5 dB higher coding efficiency than the MPEG-4 FGS international standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.368-376
• /
• 2009

Over recent years, the development of multimedia devices has meant that a wider multimedia streaming service can be supported, and there are now many ways in which TV channels can communicate with different terminals. Generally, scalable video streaming is known to provide more efficient channel capacity than simulcast video streaming. Simulcast video streaming requires a large network bandwidth for all resolutions, but scalable video streaming needs only one flow for all resolutions. On the contrary, to preserve the same video quality, SVC(Sealable Video Coding) needs a higher bit-rate than AVC(non-layered Video Coding) due to the coding penalty($10%{\sim}30%$). In previous research, scalable video streaming has been compared with simulcast video streaming for network channel capacity, in two-user simulation environments. The simulation results show that the channel capacity of SVC is $16{\sim}20%$ smaller than AVC, but scalable video streaming is not efficient because of the limit of the present network framework. In this paper, we propose a new network framework with a new router using EDE(Extraction Decision Engine) and SVC Extractor to improve network performance. In addition, we compare the SVC environment in the proposed framework with previous research on the same way subject. The proposed network framework shows a channel capacity 50%(maximum) lower than that found in previous research studies.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.107-118
• /
• 2015

Although most current video coding standards set a fixed motion vector resolution like quarter-pel accuracy, a scheme supporting multiple motion vector resolutions can improve the coding efficiency of video since it can allow to use just required motion vector accuracy depending on the video content and at the same time to generate more accurate motion predictor. However, the selected motion vector resolution for each motion vector is a signaling overhead. This paper proposes a contradiction testing-based signaling scheme of the motion vector resolution. The proposed method selects a best resolution for each motion vector among multiple candidates in such a way to produce the minimum amount of coded bits for the motion vector. The signaling overhead is reduced by contradiction testing that operates under a predefined criterion at both encoder and decoder with a purpose of pruning irrelevant candidate motion vector resolutions from signaling responsibility. Experimental results verified that the proposed scheme is effective in reducing coded motion information by achieving its $Bj{\o}ntegaard$ delta bit rate (BDBR) gain of about 4.01% on average (and up to 15.17%) compared to the conventional scheme with a fixed motion vector resolution.