• Title/Summary/Keyword: coding flow

Search Result 91, Processing Time 0.025 seconds

Floop: An efficient video coding flow for unmanned aerial vehicles

  • Yu Su;Qianqian Cheng;Shuijie Wang;Jian Zhou;Yuhe Qiu
    • ETRI Journal
    • /
    • v.45 no.4
    • /
    • pp.615-626
    • /
    • 2023
  • Under limited transmission conditions, many factors affect the efficiency of video transmission. During the flight of an unmanned aerial vehicle (UAV), frequent network switching often occurs, and the channel transmission condition changes rapidly, resulting in low-video transmission efficiency. This paper presents an efficient video coding flow for UAVs working in the 5G nonstandalone network and proposes two bit controllers, including time and spatial bit controllers, in the flow. When the environment fluctuates significantly, the time bit controller adjusts the depth of the recursive codec to reduce the error propagation caused by excessive network inference. The spatial bit controller combines the spatial bit mask with the channel quality multiplier to adjust the bit allocation in space to allocate resources better and improve the efficiency of information carrying. In the spatial bit controller, a flexible mini graph is proposed to compute the channel quality multiplier. In this study, two bit controllers with end-to-end codec were combined, thereby constructing an efficient video coding flow. Many experiments have been performed in various environments. Concerning the multi-scale structural similarity index and peak signal-to-noise ratio, the performance of the coding flow is close to that of H.265 in the low bits per pixel area. With an increase in bits per pixel, the saturation bottleneck of the coding flow is at the same level as that of H.264.

A Motion Vector Recovery Method based on Optical Flow for Temporal Error Concealment in the H.264 Standard (H.264에서 에러은닉을 위한 OPtical Flow기반의 움직임벡터 복원 기법)

  • Kim, Dong-Hyung;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2C
    • /
    • pp.148-155
    • /
    • 2006
  • For the improvement of coding efficiency, the H.264 standard uses new coding tools which are not used in previous coding standards. Among new coding tools, motion estimation using smaller block sizes leads to higher correlation between the motion vectors of neighboring blocks. This characteristic of H.264 is useful for the motion vector recovery. In this paper, we propose the motion vector recovery method based on optical flow. Since the proposed method estimates the optical flow velocity vector from more accurate initial value and optical flow region is limited to 16$\times$16 block size, we can alleviate the complexity of computation of optical flow velocity. Simulation results show that our proposed method gives higher objective and subjective video quality than previous methods.

A study of a motion estimation with an optical flow (Optical flow를 이용한 motion estimation에 관한 연구)

  • 변재응;김재영;이원희;정진현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.12-15
    • /
    • 1996
  • The purpose of image sequence coding is to reduce the spatio-temporal redundancies. The transform coding such as DCT is used for the spatial redundancies. In this paper, the optical flow method is applied to solve the problem of temporal redundancies. So far, pixel intensity conservation has been used to solve the optical flow. We used the neighborhood information as well as pixel intensity conservation. And we compared the merits and demerits of the conventional method and the proposed method in this paper.

  • PDF

A Research on the PIV Algorithm Using Image Coding (영상코드화 기법을 이용한 PIV 알고리듬에 대한 연구)

  • Kim, Sung-Kyun
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.24 no.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.

QoSNC: A Novel Approach to QoS-Based Network Coding for Fixed Networks

  • Salavati, Amir Hesam;Khalaj, Babak Hossein;Crespo, Pedro M.;Aref, Mohammad Reza
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.86-94
    • /
    • 2010
  • In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network.

Optimal Facial Emotion Feature Analysis Method based on ASM-LK Optical Flow (ASM-LK Optical Flow 기반 최적 얼굴정서 특징분석 기법)

  • Ko, Kwang-Eun;Park, Seung-Min;Park, Jun-Heong;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.4
    • /
    • pp.512-517
    • /
    • 2011
  • In this paper, we propose an Active Shape Model (ASM) and Lucas-Kanade (LK) optical flow-based feature extraction and analysis method for analyzing the emotional features from facial images. Considering the facial emotion feature regions are described by Facial Action Coding System, we construct the feature-related shape models based on the combination of landmarks and extract the LK optical flow vectors at each landmarks based on the centre pixels of motion vector window. The facial emotion features are modelled by the combination of the optical flow vectors and the emotional states of facial image can be estimated by the probabilistic estimation technique, such as Bayesian classifier. Also, we extract the optimal emotional features that are considered the high correlation between feature points and emotional states by using common spatial pattern (CSP) analysis in order to improvise the operational efficiency and accuracy of emotional feature extraction process.

A study of motion estimation with optical flow (Optical flow를 이용한 motion estimation에 관한 연구)

  • Byun, Cha-Eung;Kim, Jae-Young;Chung, Chin-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1350-1352
    • /
    • 1996
  • The purpose of image sequence coding is to reduce the spatio-temporal redundancies. For the spatial redundancies, we can use the transform coding such as DCT. In this paper, the optical flow method is applied to solve the problem of temporal redundancies. There are several estimation methods like block matching method and pel-recursive method. Block matching method is easy for a hardware implementation because of the computational simplicity. So, it is now used as the estimation method in MPEG-l, MPEG-2, and H.261. We compared the merits and demerits of the optical flow method and the block matching method in this paper.

  • PDF

A Network Coding-Aware Routing Mechanism for Time-Sensitive Data Delivery in Multi-Hop Wireless Networks

  • Jeong, Minho;Ahn, Sanghyun
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1544-1553
    • /
    • 2017
  • The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

The Nature of Flow in Virtual Reality Education: Based on A Grounded Theory Approach (가상현실 교육에서 몰입의 생태: 근거이론적 접근을 중심으로)

  • Choi, Sung-Ho;Won, Jong-Seo
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.11
    • /
    • pp.446-460
    • /
    • 2017
  • The purpose of this study is to discover the nature of users' flow experience in virtual reality education services. To this end, we analyzed the factors that affect the user's immersion in virtual reality by applying grounded theory, which is one of the qualitative research method. An experiment was conducted on 11 subjects who were interested in conducting virtual reality education, and conducted interviews after experiments. All of the interviews were documented and configured to construct a paradigm model through the steps of opening coding, axial coding, selective coding. Based on the results, it presents suggestions for future virtual reality education services.

Destination-Based Network Coding Capable Node Determination in Multi-hop Wireless Networks (멀티홉 무선망에서 목적지 기반 네트워크 코딩 가능 노드 결정)

  • Ahn, Sanghyun;Tamir, Ganzorig
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.389-392
    • /
    • 2017
  • Previously, PCC and RFCC were proposed for the network coding possibility test of flow-intersecting nodes in a multi-hop wireless network. PCC works correctly only if there is only one intersecting node. RFCC solves this problem by defining the network coding conditions with considering decoding possibility at intermediate nodes. However, this may increase decoding possibility test overhead and coding operations at intermediate nodes. In this paper, we define DCC which can decrease this overhead by allowing decoding only at destinations. We analyze the performance of DCC by simulations.