Distributed video coding scheme of multimedia data compression algorithm for wireless sensor networks

Ma, Ning

doi:10.1186/s13638-019-1571-5

Cited by 21 publications

(8 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simulation results show the effectiveness of the proposed scheme. A distributed video coding scheme and its improvements are present based on distributed video codec and its associated knowledge in the literature [24]. This algorithm can enhance the coding efficiency of the severe motion region and improve the decoded image.…”

Section: Imge/video Compression Efficient Schemesmentioning

confidence: 99%

Mobile Wireless Multimedia Sensor Networks Image Compression Task Collaboration Based on Dynamic Alliance

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In mobile wireless multimedia sensor networks' image compression task collaborations, the existing methods do not consider the dynamic changes in the processing ability and the locations of the cooperative nodes. when processing the image compression tasks, these methods will cause frequent interruptions and result in data re-transmission for those tasks. in this paper, an image compression task collaboration algorithm based on dynamic alliance is proposed to solve this problem in mobile wireless multimedia sensor networks. first, a dynamic task alliance is established by the camera node based on the location, computing capability and resource usage of ordinary nodes. then, the location and average moving velocity of the camera nodes and ordinary nodes are considered to calculate the task stable execution time. the image compression task is divided into an image transfer sub task and an image compression sub task based on the task stable execution time. finally, an image compression task collaboration allocation optimization model is established according to the transmission time, the execution time, the execution cost, and the network energy consumption. the gradient method is used to realize the cooperative allocation of image compression tasks. simulation results show that the proposed algorithm can realize task load balancing, reduce the execution time, and network energy consumption. INDEX TERMS Mobile multimedia sensor networks, image compression, task coordination, task decomposition.

show abstract

Section: Imge/video Compression Efficient Schemesmentioning

confidence: 99%

Mobile Wireless Multimedia Sensor Networks Image Compression Task Collaboration Based on Dynamic Alliance

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…For example, Antonopoulos et al [ 5 ] embedded compression algorithms into hardware systems to improve the work efficiency of transmitting large amounts of data wirelessly. Ma et al [ 6 ] used a distributed video codec scheme to enhance the processing power of a single node for traditional data compression. Yi et al [ 7 ] proposed an adaptive data compression and transmission range extension scheme to improve the data collection rate of sink nodes.…”

Section: Introductionmentioning

confidence: 99%

Compression Reconstruction and Fault Diagnosis of Diesel Engine Vibration Signal Based on Optimizing Block Sparse Bayesian Learning

Bai

Wen

et al. 2022

Sensors

View full text Add to dashboard Cite

It is critical to deploy wireless data transmission technologies remotely, in real-time, to monitor the health state of diesel engines dynamically. The usual approach to data compression is to collect data first, then compress it; however, we cannot ensure the correctness and efficiency of the data. Based on sparse Bayesian optimization block learning, this research provides a method for compression reconstruction and fault diagnostics of diesel engine vibration data. This method’s essential contribution is combining compressive sensing technology with fault diagnosis. To achieve a better diagnosis effect, we can effectively improve the wireless transmission efficiency of the vibration signal. First, the dictionary is dynamically updated by learning the dictionary using singular value decomposition to produce the ideal sparse form. Second, a block sparse Bayesian learning boundary optimization approach is utilized to recover structured non-sparse signals rapidly. A detailed assessment index of the data compression effect is created. Finally, the experimental findings reveal that the approach provided in this study outperforms standard compression methods in terms of compression efficiency and accuracy and its ability to produce the desired fault diagnostic effect, proving the usefulness of the proposed method.

show abstract

“…Due to the obvious rapid development of diverse multimedia technology, a large number of audiovisual data are created and conveyed in the medical, advertisement, and military domains, which may contain sensitive information that should not be accessed by normal users or should only be partially disclosed to them [3][4][5]. Privacy and security have grown in importance while several encryption techniques have been employed to enable secure video transmission [6].…”

Section: Introductionmentioning

confidence: 99%

Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data

Adeniyi¹,

Misra

Daniel

et al. 2022

Algorithms

View full text Add to dashboard Cite

Background: The technological revolution has allowed users to exchange data and information in various fields, and this is one of the most prevalent uses of computer technologies. However, in a world where third parties are capable of collecting, stealing, and destroying information without authorization, cryptography remains the primary tool that assists users in keeping their information secure using various techniques. Blowfish is an encryption process that is modest, protected, and proficient, with the size of the message and the key size affecting its performance. Aim: the goal of this study is to design a modified Blowfish algorithm by changing the structure of the F function to encrypt and decrypt video data. After which, the performance of the normal and modified Blowfish algorithm will be obtained in terms of time complexity and the avalanche effect. Methods: To compare the encryption time and security, the modified Blowfish algorithm will use only two S-boxes in the F function instead of the four used in Blowfish. Encryption and decryption times were calculated to compare Blowfish to the modified Blowfish algorithm, with the findings indicating that the modified Blowfish algorithm performs better. Results: The Avalanche Effect results reveal that normal Blowfish has a higher security level for all categories of video file size than the modified Blowfish algorithm, with 50.7176% for normal Blowfish and 43.3398% for the modified Blowfish algorithm of 187 kb; hence, it is preferable to secure data and programs that demand a high level of security with Blowfish. Conclusions: From the experimental results, the modified Blowfish algorithm performs faster than normal Blowfish in terms of time complexity with an average execution time of 250.0 ms for normal Blowfish and 248.4 ms for the modified Blowfish algorithm. Therefore, it can be concluded that the modified Blowfish algorithm using the F-structure is time-efficient while normal Blowfish is better in terms of security.

show abstract

Distributed video coding scheme of multimedia data compression algorithm for wireless sensor networks

Cited by 21 publications

References 24 publications

Mobile Wireless Multimedia Sensor Networks Image Compression Task Collaboration Based on Dynamic Alliance

Mobile Wireless Multimedia Sensor Networks Image Compression Task Collaboration Based on Dynamic Alliance

Compression Reconstruction and Fault Diagnosis of Diesel Engine Vibration Signal Based on Optimizing Block Sparse Bayesian Learning

Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data

Contact Info

Product

Resources

About