• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1209-1221
• /
• 2010

Three dimensional (3D) video is expected to be an important application for broadcast and IP streaming services. One of the main limitations for the transmission of 3D video over IP networks is network bandwidth mismatch due to the large size of 3D data, which causes fatal decoding errors and mosaic-like damage. This paper presents a novel selective frame discard method to address the problem. The main idea of the proposed method is the symmetrical discard of the two dimensional (2D) video frame and the depth map frame. Also, the frames to be discarded are selected after additional consideration of the playback deadline, the network bandwidth, and the inter-frame dependency relationship within a group of pictures (GOP). It enables the efficient utilization of the network bandwidth and high quality 3D IPTV service. The simulation results demonstrate that the proposed method enhances the media quality of 3D video streaming even in the case of bad network conditions.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권7호
• /
• pp.387-396
• /
• 2004

본 논문에서는 화상회의 시스템의 서비스 품질(QoS)을 최대화하기 위해 프레임 복원 태스크들에게 프로세서 시간을 효율적으로 분산하는 방안을 제시하고자 한다. 압축된 프레임은 복원에 소요된 프로세서 시간이 증가함에 따라 복원된 영상의 QoS 또한 증가하는 특성을 가진다. 따라서 각 프레임별 복원영상의 품질은 복원을 위해 주어진 서비스 시간의 QoS 함수로 표현될 수 있다. 또한 각 화상회의 스트림은 연속된 프레임간 밀접한 시간 의존성을 가진다. 이러한 특성과 QoS 함수를 기반으로 본 논문에서는 총 QoS를 최대화하면서 모든 프레임이 아닌 일부 프레임들만 스케줄링하는 온-라인 프레임 스케줄링 알고리즘을 제안한다. 실험 결과 시스템 부하가 증가함에 따라 제안 알고리즘은 기존 EDF에 비해 보다 부드럽게 화질이 감소하고, 연속된 프레임들이 끊김 없이 출력되어 보다 자연스런 화자의 동작을 보일 수 있었다.

• ETRI Journal
• /
• 제33권2호
• /
• pp.155-162
• /
• 2011

The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. Joint source and channel coding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.

• 한국컴퓨터정보학회논문지
• /
• 제7권2호
• /
• pp.95-100
• /
• 2002

피드백 채널을 이용한 디코더는 인코더로 전송에러에 의한 오염된 매크로 블록들의 주소를 알려준다. NACK 메시지의 수신으로 인코더는 전송에러가 발생된 프레임의 GOB와 MB를 기준으로 forward dependency를 적용으로 확산된 에러전파영역을 지닌 다음순서의 프레임을 만들어낸다. 이 프레임으로 현재 인코딩 하려는 프레임의 각 MB안에 4-corner에 존재하는 픽셀들에 대한 backward dependency를 적용함으로써 오염된 MB을 찾아낼 수가 있다. 이들 오염된 MB들에 대한 INTRA코딩을 적용함으로써 에러확산을 완전히 중단시킬 수 있다. 이와 같이 빠른 알고리즘의 적용으로 보다 적은 연산량과 보다 적은 양의 메모리 요구를 얻을 수 있다 또한 이러한 장점은 실시간 비디오 전송에 특히 적합하다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2006년도 학술대회
• /
• pp.127-132
• /
• 2006

Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

• ETRI Journal
• /
• 제24권4호
• /
• pp.280-289
• /
• 2002

In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.925-938
• /
• 2010

Depending on network conditions, a communication network could be overloaded when media are transmitted. Research has been carried out to lessen network overloading, such as by filtering, load distribution, frame dropping, and other methods. Among these methods, one of the most effective is frame dropping, which reduces specified video frames for bandwidth diminution. In frame dropping, B-frames are dropped and then I- and P-frames are dropped, based on the dependency among the frames. This paper proposes a scheme for protecting copyrights by encryption, when frame dropping is applied to reduce the bandwidth of media based on the MPEG-4 file format. We designed two kinds of frame dropping: the first stores and then sends the dropped files and the other drops frames in real time when transmitting. We designed three kinds of encryption methods using the DES algorithm to encrypt MPEG-4 data: macro block encryption in I-VOP, macro block and motion vector encryption in P-VOP, and macro block and motion vector encryption in I-, P-VOP. Based on these three methods, we implemented a digital rights management solution for MPEG-4 data streaming. We compared the results of dropping, encryption, decryption, and the quality of the video sequences to select an optimal method, and found that there was no noticeable difference between the video sequences recovered after frame dropping and the ones recovered without frame dropping. The best performance in the encryption and decryption of frames was obtained when we applied the macro block and motion vector encryption in I-, P-VOP.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1463-1479
• /
• 2013

In this paper, we propose an unequal protection physical coding sub-layer (PCS) forward error correction (FEC) scheme for efficient and high-quality transmission of video data over optical access networks. Through identifying and resolving the unequal importance of different video frames and passing this importance information from MAC-layer to PCS, FEC scheme of PCS can be adaptive to application-layer data. Meanwhile, we jointly consider the different channel situations of optical network unit (ONU) and improve the efficiency of FEC redundancy by channel adaptation. We develop a theoretical algorithm and a hardware method to achieve efficient FEC assignment for the proposed unequal protection scheme. The theoretical FEC assignment algorithm is to obtain the optimal FEC redundancy allocation vector that results in the optimum performance index, namely frame error rate, based on the identified differential importance and channel situations. The hardware method aims at providing a realistic technical path with negligible hardware cost increment compared with the traditional FEC scheme. From the simulation results, the proposed Channel and Application-layer data Adaptation Unequal Protection (CAAUP) FEC scheme along with the FEC ratio assignment algorithm and the hardware method illustrates the ability of efficient and high-quality transmission of video data against the random errors in the channel of optical access networks.

• 정보처리학회논문지B
• /
• 제15B권6호
• /
• pp.575-584
• /
• 2008

미디어의 전송시 네트워크의 상황에 따라 통신망의 과부하가 발생할 수 있으며, 이를 줄이기 위해서 필터링, 부하 분산기법, 막힘 제어 기법, 프레임 드로핑 등의 많은 연구가 진행되었다. 이들 중 효과적인 방법은 동영상의 비트율을 조절하기 위해 특정 비디오 프레임을 제거함으로써 대역폭의 감소를 가능하게 하는 프레임 드로핑(Frame dropping)이다. 프레임 드로핑은 프레임 간의 종속성이 가장 적은 B 프레임을 먼저 제거하고 종속성의 관계에 따라 I, P 프레임 순서대로 제거한다. 본 논문에서는 MPEG-4 미디어의 전송에 프레임 드로핑을 적용 하였으며 이때 암호화를 통하여 저작권을 보호할 수 있는 방법을 제안한다. 이를 위하여 서버에 저장되어있는 프레임 드로핑 이 이미 적용된 파일을 클라이언트에게 전송하는 방법과 서버에 저장되어있는 미디어 파일을 클라이언트에게 전송시 실시간으로 프레임 드로핑하는 두 가지 방법을 설계 구현 하였다. MPEG-4 데이터의 암호화에는 3가지 방법을 제안하였다: I-VOP내의 매크로 블록(Macro block) 암호화, P-VOP내의 매크로 블록과 모션벡터 암호화(Motion Vector), I-VOP내의 매크로블록과 P-VOP내의 모션벡터 암호화. MPEG-4 미디어의 전송시, 최적의 방법을 선택하기 위해 드로핑, 암호화, 복호화 및 영상의 품질을 비교하였으며 드로핑 후에도 원래의 영상과 큰 차이가 없었다. 암호화와 복호화에서는 I-VOP와 P-VOP를 모두 암호화 하였을 때가 가장 성능이 좋았다.