scholarly journals Codec for transfer Maritime Images in Bandwidth Constrained

2020 ◽  
Author(s):  
Ш.С. Фахми ◽  
Ю.Е. Крылов ◽  
Я.А.А. Хасан ◽  
Е.В. Костикова
Keyword(s):  
Three Dimensional ◽  
Adaptive Method ◽  
Video Data ◽  
Video Codec ◽  
Compressed Video ◽  
Discrete Cosine Transformation ◽  
Video Information ◽  
Transmission Errors ◽  
Testing Algorithms ◽  
Spatial Redundancy

В работе представлен видеокодек с адаптивным способом сканирования спектральных трансформант, основанный на применении трехмерных (3D) дискретных косинусных преобразований. Кодек имеет низкую вычислительную сложность и высокую устойчивость к ошибкам передачи по каналу связи и предназначен для мобильных устройств. Кодек представляет собой устройство, которое последовательно выполняет дискретное косинусное преобразование для устранения пространственной избыточности в пределах кадра и временной межкадровой избыточности в последовательности кадров с учетом скорости движения объектов на изображениях морских сюжетов. Приведены результаты моделирования алгоритмов кодирования и декодирования видеоинформации для различных видеопотоков, полученных из камер наблюдения. Получены результаты тестирования алгоритмов кодирования и декодирования изображений в виде графиков зависимости точности восстановления от скорости передачи сжатых видеоданных и зависимости точности от сложности устройств сжатия изображений. This paper presents a video codec with an adaptive method for scanning spectral transformants based on the use of three-dimensional (3D) discrete cosine transformations. The codec has a low computational complexity and high resistance to transmission errors over the communication channel and is designed for mobile devices. A codec is a device that sequentially performs a discrete cosine transformation to eliminate spatial redundancy within a frame and temporal inter-frame redundancy in a sequence of frames, taking into account the speed of movement of objects in images of marine subjects. The results of modeling algorithms for encoding and decoding video information for various video streams obtained from surveillance cameras are presented. The results of testing algorithms for encoding and decoding images in the form of graphs of the dependence of the recovery accuracy on the speed of transmission of compressed video data and the dependence of accuracy on the complexity of image compression devices are obtained.

scholarly journals A Novel High Efficiency Fractal Multiview Video Codec

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Shiping Zhu ◽  
Dongyu Zhao ◽  
Ling Zhang
Keyword(s):  
High Efficiency ◽  
Translational Motion ◽  
Three Dimensional ◽  
Rate Distortion ◽  
Spatial Prediction ◽  
Estimation Algorithm ◽  
Video Data ◽  
Video Codec ◽  
Disparity Estimation ◽  
Multiview Video

Multiview video which is one of the main types of three-dimensional (3D) video signals, captured by a set of video cameras from various viewpoints, has attracted much interest recently. Data compression for multiview video has become a major issue. In this paper, a novel high efficiency fractal multiview video codec is proposed. Firstly, intraframe algorithm based on the H.264/AVC intraprediction modes and combining fractal and motion compensation (CFMC) algorithm in which range blocks are predicted by domain blocks in the previously decoded frame using translational motion with gray value transformation is proposed for compressing the anchor viewpoint video. Then temporal-spatial prediction structure and fast disparity estimation algorithm exploiting parallax distribution constraints are designed to compress the multiview video data. The proposed fractal multiview video codec can exploit temporal and spatial correlations adequately. Experimental results show that it can obtain about 0.36 dB increase in the decoding quality and 36.21% decrease in encoding bitrate compared with JMVC8.5, and the encoding time is saved by 95.71%. The rate-distortion comparisons with other multiview video coding methods also demonstrate the superiority of the proposed scheme.

scholarly journals Development of the method for encoding service data in cryptocompression image representation systems

2021 ◽  
Vol 3 (9(111)) ◽  
pp. 103-115
Author(s):  
Vladimir Barannik ◽  
Serhii Sidchenko ◽  
Natalia Barannik ◽  
Valeriy Barannik
Keyword(s):  
Information Quality ◽  
Three Dimensional ◽  
Video Data ◽  
Original Video ◽  
Service Component ◽  
Video Information ◽  
Coding Systems ◽  
Data Volume ◽  
Information Components ◽  
Service Data

The demand for image confidentiality is constantly growing. At the same time, ensuring the confidentiality of video information must be organized subject to ensuring its reliability with a given time delay in processing and transmission. Methods of cryptocompression representation of images can be used to solve this problem. They are designed to simultaneously provide compression and protection of video information. The service component is used as the key of the cryptocompression transformation. However, it has a significant volume. It is 25 % of the original video data volume. A method for coding systems of service components in a differentiated basis on the second cascade of cryptocompression representation of images has been developed. The method is based on the developed scheme of data linearization from three-dimensional coordinates of representation in a two-dimensional matrix into a one-dimensional coordinate for one-to-one representation of this element in a vector. Linearization is organized horizontally line by line. On the basis of the developed method, a non-deterministic number of code values of information components is formed. They have non-deterministic lengths and are formed on a non-deterministic number of elements. The uncertainty of positioning of cryptocompression codograms in the general code stream is provided, which virtually eliminates the possibility of their unauthorized decryption. The method provides a reduction in the volume of the service component of the cryptocompression codogram. The service data volume is 6.25 % of the original video data volume. The method provides an additional reduction in the volume of cryptocompression representation of images without loss of information quality relative to the original video data on average from 1.08 to 1.54 times, depending on the degree of their saturation

On the Correlation Between Dynamic Transmission Error and Dynamic Tooth Loads in Three-Dimensional Gear Systems

2015 ◽  
Author(s):  
Nina Sainte-Marie ◽  
Philippe Velex ◽  
Guillaume Roulois ◽  
Franck Marrot
Keyword(s):  
Experimental Evidence ◽  
Three Dimensional ◽  
Transmission Error ◽  
Test Rig ◽  
Transmission Errors ◽  
Linear Dependency ◽  
Lumped Parameter ◽  
Dynamic Transmission Error ◽  
Time Variations ◽  
The Relationship

A three-dimensional dynamic model is presented to simulate the dynamic behavior of single stage gears by using a combination of classic shaft, lumped parameter and specific 2-node gear elements. The mesh excitation formulation is based on transmission errors whose mathematical grounding is briefly described. The validity of the proposed methodology is assessed by comparison with experimental evidence from a test rig. The model is then employed to analyze the relationship between dynamic transmission errors and dynamic tooth loads or root stresses. It is shown that a linear dependency can be observed between the time variations of dynamic transmission error and tooth loading as long as the system can be assimilated to a torsional system but that this linear relationship tends to disappear when the influence of bending cannot be neglected.

scholarly journals Devising a conceptual method for generating cryptocompression codograms of images without loss of information quality

2021 ◽  
Vol 4 (2(112)) ◽  
pp. 6-17
Author(s):  
Vladimir Barannik ◽  
Serhii Sidchenko ◽  
Dmitriy Barannik ◽  
Sergii Shulgin ◽  
Valeriy Barannik ◽  
...  
Keyword(s):  
Information Quality ◽  
Dynamic Range ◽  
Video Data ◽  
Service Component ◽  
Loss Of Information ◽  
Video Information ◽  
Information Components ◽  
Service Data ◽  
Processing Steps ◽  
Better Than

Along with the widespread use of digital images, an urgent scientific and applied issue arose regarding the need to reduce the volume of video information provided it is confidential and reliable. To resolve this issue, cryptocompression coding methods could be used. However, there is no method that summarizes all processing steps. This paper reports the development of a conceptual method for the cryptocompression coding of images on a differentiated basis without loss of information quality. It involves a three-stage technology for the generation of cryptocompression codograms. The first two cascades provide for the generation of code structures for information components while ensuring their confidentiality and key elements as a service component. On the third cascade of processing, it is proposed to manage the confidentiality of the service component. The code values for the information components of nondeterministic length are derived out on the basis of a non-deterministic number of elements of the source video data in a reduced dynamic range. The generation of service data is proposed to be organized in blocks of initial images with a dimension of 16×16 elements. The method ensures a decrease in the volume of source images during the generation of cryptocompression codograms, by 1.14–1.58 times (12–37 %), depending on the degree of their saturation. This is 12.7‒23.4 % better than TIFF technology and is 9.6‒17.9 % better than PNG technology. The volume of the service component of cryptocompression codograms is 1.563 % of the volume of the source video data or no more than 2.5 % of the total code stream. That reduces the amount of data for encryption by up to 40 times compared to TIFF and PNG technologies. The devised method does not introduce errors into the data in the coding process and refers to methods without loss of information quality.

scholarly journals A method for reducing information redundancy of digital images for cloud storage

Connectivity ◽  
2020 ◽  
Vol 148 (6) ◽  
Author(s):  
Yu. I. Katkov ◽  
◽  
O. S. Zvenigorodsky ◽  
O. V. Zinchenko ◽  
V. V. Onyshchenko ◽  
...  
Keyword(s):  
Image Compression ◽  
Video Compression ◽  
Cloud Storage ◽  
Video Data ◽  
Information Redundancy ◽  
High Quality ◽  
Video Information ◽  
Quality Video ◽  
High Quality Video

The article is devoted to the topical issue of finding new effective and improving existing widespread compression methods in order to reduce computational complexity and improve the quality of image-renewable image compression images, is important for the introduction of cloud technologies. The article presents a problem To increase the efficiency of cloud storage, it is necessary to determine methods for reducing the information redundancy of digital images by fractal compression of video content, to make recommendations on the possibilities of applying these methods to solve various practical problems. The necessity of storing high-quality video information in new HDTV formats 2k, 4k, 8k in cloud storage to meet the existing needs of users has been substantiated. It is shown that when processing and transmitting high quality video information there is a problem of reducing the redundancy of video data (image compression) provided that the desired image quality is preserved, restored by the user. It has been shown that in cloud storage the emergence of such a problem is historically due to the contradiction between consumer requirements for image quality and the necessary volumes and ways to reduce redundancy of video data, which are transmitted over communication channels and processed in data center servers. The solution to this problem is traditionally rooted in the search for effective technologies for compressing, archiving and compressing video information. An analysis of video compression methods and digital video compression technology has been performed, which reduces the amount of data used to represent the video stream. Approaches to image compression in cloud storage under conditions of preservation or a slight reduction in the amount of data that provide the user with the specified quality of the restored image are shown. Classification of special compression methods without loss and with information loss is provided. Based on the analysis, it is concluded that it is advisable to use special methods of compression with loss of information to store high quality video information in the new formats HDTV 2k, 4k, 8k in cloud storage. The application of video image processing and their encoding and compression on the basis of fractal image compression is substantiated. Recommendations for the implementation of these methods are given.

scholarly journals A novel chaotic system based on coupled map lattice and its application in HEVC encryption

2021 ◽  
Vol 18 (6) ◽  
pp. 9410-9429
Author(s):  
Qing Ye ◽  
◽  
Qiaojia Zhang ◽  
Sijie Liu ◽  
Kaiqiang Chen ◽  
...  
Keyword(s):  
Chaotic System ◽  
Stream Cipher ◽  
High Efficiency ◽  
Chaotic Map ◽  
Large Data ◽  
Coupled Map Lattice ◽  
Video Data ◽  
Video Encryption ◽  
High Efficiency Video Coding ◽  
Video Information

<abstract> <p>Video information is currently widely used in various fields. Compared with image and text data, video data has the characteristics of large data volume, strong data relevance, and large data redundancy, which makes traditional cryptographic systems no longer suitable for video encryption systems. The paper proposes a new chaotic system based on coupled map lattice (CML) and applies it to high efficiency video coding (HEVC) video encryption. The chaotic system logistic-iterative chaotic map with infinite collapses-coupled map lattice (L-ICMIC-CML), which is improved on the basis of the ICMIC system and combined with CML, generates stream ciphers and encrypts some syntax elements of HEVC. The experimental results show that the stream cipher generated by the L-ICMIC-CML system passes the SP800-22 Revla test and has strong randomness. Applying the stream cipher to the proposed HEVC encryption scheme, through the analysis of the encryption scheme's security, encryption time and encryption efficiency, it is better than other chaotic system encryption schemes. The video encryption system proposed in this paper is both safe and efficient.</p> </abstract>

Parallel-Pipelined Video Processing in Multicore Heterogeneous Systems on Chip

2021 ◽  
Vol 26 (2) ◽  
pp. 172-183
Author(s):  
E.S. Yanakova ◽  
◽  
G.T. Macharadze ◽  
L.G. Gagarina ◽  
A.A. Shvachko ◽  
...  
Keyword(s):  
Video Processing ◽  
High Efficiency ◽  
Heterogeneous Systems ◽  
Video Data ◽  
System Level ◽  
Video Information ◽  
Systems On Chip ◽  
The Face ◽  
Parallel Pipelined ◽  
On Chip

A turn from homogeneous to heterogeneous architectures permits to achieve the advantages of the efficiency, size, weight and power consumption, which is especially important for the built-in solutions. However, the development of the parallel software for heterogeneous computer systems is rather complex task due to the requirements of high efficiency, easy programming and the process of scaling. In the paper the efficiency of parallel-pipelined processing of video information in multiprocessor heterogeneous systems on a chip (SoC) such as DSP, GPU, ISP, VDP, VPU and others, has been investigated. A typical scheme of parallel-pipelined processing of video data using various accelerators has been presented. The scheme of the parallel-pipelined video data on heterogeneous SoC 1892VM248 has been developed. The methods of efficient parallel-pipelined processing of video data in heterogeneous computers (SoC), consisting of the operating system level, programming technologies level and the application level, have been proposed. A comparative analysis of the most common programming technologies, such as OpenCL, OpenMP, MPI, OpenAMP, has been performed. The analysis has shown that depend-ing on the device finite purpose two programming paradigms should be applied: based on OpenCL technology (for built-in system) and MPI technology (for inter-cell and inter processor interaction). The results obtained of the parallel-pipelined processing within the framework of the face recognition have confirmed the effectiveness of the chosen solutions.

Navigating Through Video Stories Using Clustering Sets

2011 ◽  
Vol 2 (3) ◽  
pp. 1-20 ◽  
Author(s):  
Sheila M. Pinto-Cáceres ◽  
Jurandy Almeida ◽  
Vânia P. A. Neris ◽  
M. Cecília C. Baranauskas ◽  
Neucimar J. Leite ◽  
...  
Keyword(s):  
Subjective Evaluation ◽  
Video Data ◽  
Empirical Comparison ◽  
Interactive Search ◽  
Video Information ◽  
Novel Approach ◽  
Evolution Of Technology ◽  
Similar Content ◽  
User Friendly ◽  
Fast Evolution

The fast evolution of technology has led to a growing demand for video data, increasing the amount of research into efficient systems to manage those materials. Making efficient use of video information requires that data be accessed in a user-friendly way. Ideally, one would like to perform video search using an intuitive tool. Most of existing browsers for the interactive search of video sequences, however, have employed a too rigid layout to arrange the results, restricting users to explore the results using list- or grid-based layouts. This paper presents a novel approach for the interactive search that displays the result set in a flexible manner. The proposed method is based on a simple and fast algorithm to build video stories and on an effective visual structure to arrange the storyboards, called Clustering Set. It is able to group together videos with similar content and to organize the result set in a well-defined tree. Results from a rigorous empirical comparison with a subjective evaluation show that such a strategy makes the navigation more coherent and engaging to users.

Sign in / Sign up

Export Citation Format

Share Document