$$\rightleftharpoonup{xx}$$
$$\longleftharp{xx}$$,
$$\longrightharp{xx}$$,
The software used is listed in the Table of Materials.
Dataset setup
The UCF-1013 dataset was obtained and extracted into the Videos/UCF-101 directory. Dataset integrity was assessed through checksum verification or manual playback, and any corrupted files were excluded from subsequent processing.
Computational environment
All experiments were performed in Python 3.10 on Windows 10/11 or Ubuntu 20.04+. The software environment included tensorflow==2.17.0, opencv-python, scikit-image, numpy, pandas, and tqdm. A minimum of 8 GB RAM was used, and GPU acceleration was employed when available.
Frame extraction
Video frames were read using cv2.VideoCapture(), and grayscale conversion was carried out using cv2.cvtColor. The resulting frames were stored in sequential order within the Frames directory to preserve temporal consistency.
Base feature network
A sequential convolutional neural network was employed to process the 224 × 224 grayscale frames. Convolutional, pooling, and dense layers were used, and the model was trained for five epochs with the Adam optimizer and Binary Cross-Entropy loss to establish baseline feature representations.
Bitrate allocation and compression
Pixel-level frame complexity was estimated and used to determine proportional bitrate allocation. JPEG compression with adaptive Q-values was applied, and the processed frames were saved in the Processed directory for further evaluation.
Quality evaluation
SSIM, PSNR, and MSE calculations were performed for each processed frame. The resulting metrics were compiled into CSV files, and visualization plots were generated and stored in the Output directory.
Final execution
The complete workflow was executed using framework.run(). This execution produced the final set of processed frames, metric summaries, and evaluation plots.
1. Adaptive Quality Video Streaming Optimization
1.1 System architecture overview
A method is presented here for optimizing video streaming specifically for 5G and beyond networks through the AQVSO framework. The approach combined several cutting-edge elements that complemented one another to improve QoE and maximize the use of network resources. A complex pipeline was utilized to process video streams, with each component specializing in a particular area of video optimization. Throughout the streaming process, the system ensured optimal quality maintenance and balanced processing.
1.2 Video pre-processing and initial analysis
1.2.1 Frame extraction and quality baseline
The given optimization framework was built upon the video pre-processing step, which used advanced analysis techniques to establish quality standards and prepare the video content for subsequent processing. Upon entering the system, a video stream was subjected to a thorough frame-extraction procedure that split the video into individual frames and examined temporal correlations between successive frames. This preliminary processing captured the temporal dynamics of the video and set the appropriate processing parameters for the entire stream. For an input video V, frames were extracted and processed through the following mathematical formulation:
(1)
The frame resolution was calculated as m and the total frame count as n. Frames were extracted while preserving the video's temporal coherence to enable parallel processing in later stages. The quality baseline was established by implementing a novel fusion approach. Multiple quality metrics were combined to create a comprehensive quality assessment. The overall initial QoE was determined using the specified parameters.
(2)
The significance of this fusion approach was considered, as it addressed the limitations of individual quality metrics. The Structural Similarity Index (SSIM) captured perceptual quality aspects that traditional metrics might have missed, while the Peak Signal-to-Noise Ratio (PSNR) provided an objective quality measurement, and the Mean Squared Error (MSE) offered a direct pixel-level comparison. The weighting factors α1,α2,α3 were not static; instead, they adapted dynamically based on content characteristics. The ith weight factor was calculated using:
(3)
Where,
Qi is the ith frame, i = 1,2…n
Qj is the jth frame, j = 1,2…n, i is not equal to j
The important factors μi were determined through extensive empirical analysis of various video content types to ensure that the dynamic weight adjustment maintained relevant quality assessment across different types of video content and viewing conditions. Factors such as motion complexity, texture density, and the perceptual importance of different regions were considered.
1.2.2 Content complexity analysis
Content complexity was analyzed as a crucial component of the framework through a multidimensional approach that quantified various aspects of video content. This analysis was fundamental for informed decisions about resource allocation and compression parameters in later stages. A comprehensive complexity metric was introduced that considered spatial, temporal, and perceptual aspects of video content, which was given by:
(4)
The spatial complexity component Cs(f) was calculated by analyzing the detail and texture distribution within each frame through gradient analysis. This measurement was used to identify areas that required a higher bit allocation for maintaining quality.
(5)
The temporal complexity component Ct(f) was calculated to quantify motion intensity between consecutive frames, as this measurement was essential for predicting compression behavior and determining appropriate buffer sizes.
(6)
The perceptual complexity component Cp(f) integrated human vision models to prioritize regions that were perceptually significant to viewers.
(7)
1.3 Feature extraction using sparse graph attention convolutional networks
A novel Sparse Graph Attention Convolutional Network (SGA-ConvNet) architecture was implemented in the feature extraction stage of AQVSO, marking a substantial improvement over conventional convolutional networks for video processing. The SGA-ConvNet was designed to be especially well-suited for handling high-dimensional video data in resource-constrained settings by blending the effectiveness of sparse convolutions with the adaptability of attention mechanisms. This network architecture addressed the basic problem of capturing temporal and spatial dependencies in video content. A dynamic graph was built during video frame processing, with each node representing an important feature point and edges indicating how these features related to one another. Computational overhead was significantly reduced by concentrating resources on relevant regions while preserving sparse connectivity, in contrast to conventional convolutional networks. The core operation at each layer was defined through:
(8)
H(l) represented the feature representations at layer l, with A ̃ denoting the normalized attention adjacency matrix. W(l) contained the learnable weight matrices, and σ represented the non-linear activation function. The network was enabled to learn hierarchical feature representations while maintaining sparsity in the computation graph. The attention mechanism, which was crucial for adaptive feature processing, was computed through:
(9)
αij represented the attention coefficient between nodes i and j, and [hi ∣∣ hj] denoted the concatenation of their feature vectors. The LeakyReLU activation was used to prevent vanishing gradients while preserving the network's ability to learn from negative features. The attention mechanism dynamically adjusted the importance of different feature connections based on their relevance to the current frame's content.
1.4 Dynamic rate control through adaptive spiking neural networks
Dynamic rate control was implemented in the AQVSO framework (Figure 1) via the ASNN architecture, a biologically inspired approach to managing video streaming rates. The ASNN was designed specifically to handle the temporal dynamics of video streaming while adapting to rapidly changing network conditions. This component was deemed crucial for preserving streaming quality while optimizing bandwidth usage across varying network conditions. Information was processed through discrete spikes in the ASNN, mimicking biological neural networks, which provided several advantages in terms of power efficiency and temporal processing. The membrane potential of the spiking neurons was allowed to evolve according to:
(10)
V(t) represented the membrane potential at time t, Vrest was set as the resting potential, and τm was defined as the membrane time constant. I(t) was calculated from network conditions and content complexity. Adaptive noise was introduced through σ(t)N(0,1) to improve robustness. This noise term helped the network maintain stability when facing rapid fluctuations in network conditions. The rate control mechanism was implemented using a sophisticated adaptation scheme:
(11)
R(t) represented the target bitrate, S(t) represented the spike rate of the neural network, B(t) denoted the available bandwidth, and E(t) represented the error term derived from quality metrics. The exponential term expp(-λE(t)) was used to provide smooth adaptation to quality variations while preventing oscillatory behavior in the rate control system.
1.5 Quality-driven compression optimization
A novel approach was implemented in the compression optimization stage that combined perceptual quality metrics with content-aware compression strategies. This stage was made fundamental to achieving optimal trade-offs between quality and size in the compressed video stream. A region-adaptive compression scheme was utilized that allocated bits based on both content importance and perceptual quality requirements.
(12)
C (r,t) represented the compression ratio for region r at time t, and Cbase(r) was used as the base compression ratio determined by content complexity. Q(r,t) was defined to denote the quality factor. ϕi (r,t) was implemented to represent various adjustment factors, including motion intensity, edge density, and perceptual importance.
1.6 Resource allocation through deep belief networks with ant colony optimization
The resource allocation mechanism in AQVSO was configured to implement a hybrid approach combining Deep Belief Networks (DBN) with Ant Colony Optimization (ACO), establishing a novel solution to the complex problem of optimal resource distribution in video streaming systems. The learning capabilities of deep belief networks were leveraged for pattern recognition in resource usage, while the optimization strengths of ant colony algorithms were utilized for real-time resource allocation decisions. The DBN-ACO system was designed to address the fundamental challenge of balancing immediate resource requirements with long-term optimization goals in dynamic network environments. The DBN component was implemented using a hierarchical learning structure composed of multiple Restricted Boltzmann Machines (RBMs), with each layer capturing increasingly abstract patterns in resource utilization. The probability distribution of hidden unit activation was modeled through:
(13)
hi represented the hidden units, v represented the visible units, bi represented the bias terms, and Wij represented the connection weights. This probabilistic modeling was used to capture complex dependencies in resource usage patterns while maintaining adaptability to changing conditions. The ACO component was implemented with a dynamic pheromone-based optimization strategy.
(14)
(15)
τij represented the pheromone levels, with p serving as the evaporation rate Δτij (t). was defined as the pheromone update, and ηij represented the heuristic value based on the current network conditions and resource availability.
1.7 Adaptive buffer management and error recovery
A sophisticated buffer management system was implemented in the AQVSO framework that dynamically adjusted to varying network conditions and content characteristics. This system was designed to maintain streaming continuity while minimizing latency and preventing buffer underflow or overflow conditions. A novel adaptive approach was deployed that considered both network statistics and content complexity.
(16)
B(t) was maintained as the target buffer size, QoE(t) was measured as the current quality of experience, σ(t) was tracked as the network stability metric, and ϕ(σ(t)) was implemented as an adaptive function to modulate buffer size based on network variability. The error recovery mechanism was executed using a multi-layered approach that combined proactive error prevention with reactive recovery strategies. A sliding window of frame references was kept within the system.
(17)
p was used to represent the success probability of a single recovery attempt, n was taken as the number of attempts, and T(t) was applied to represent the time since error detection. This exponential decay term was used to ensure that recovery efforts were properly prioritized based on temporal relevance.
1.8 Quality assessment and feedback integration
The quality assessment system implemented a comprehensive approach that combined multiple quality metrics with user experience factors. This integration was crucial for maintaining high QoE while optimizing resource utilization. The system implemented a novel quality metric fusion:
(18)
NB(t) was calculated as the normalized buffering ratio, SB(t) was calculated as the switching frequency, and M(t) was computed as the motion quality factor. The weights wi were adjusted dynamically based on content type and viewing conditions.
(19)
Θi was represented as the base weights, and f(C(t)) was applied as a content-dependent adjustment function. The feedback integration system was implemented as a closed-loop control mechanism.
(20)
e(t) was set to represent the error between the target and achieved quality metrics, and K1,K2,K3 were defined as adaptive gain parameters that adjusted based on network conditions and content characteristics.