Adaptive Method of Spectral Transformation of Video Information of Transport Images

2020 ◽  
Vol 26 (1) ◽  
pp. 39-45
Author(s):  
Y. A. Hasan ◽  
◽  
N. G. Ryzhov ◽  
Sh. S. Fahmi ◽  
E. V. Kostikova ◽  
...  
Keyword(s):  
Adaptive Method ◽  
Spectral Transformation ◽  
Video Information

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.

Finite element adaptive method for hypersonic thermochemical nonequilibrium flows

AIAA Journal ◽  
1997 ◽  
Vol 35 ◽  
pp. 1294-1302
Author(s):  
Djaffar Ait-Ali-Yahia ◽  
Wagdi G. Habashi
Keyword(s):  
Finite Element ◽  
Adaptive Method ◽  
Nonequilibrium Flows

Circles on lattices and Hadamard matrices

2019 ◽  
pp. 2-9 ◽  
Author(s):  
N. A. Balonin ◽  
M. B. Sergeev ◽  
J. Seberry ◽  
O. I. Sinitsyna
Keyword(s):  
Hadamard Matrices ◽  
Lattice Points ◽  
Practical Significance ◽  
Upper And Lower Bounds ◽  
Problem Size ◽  
Orthogonal Matrices ◽  
Video Information ◽  
Scientific Schools ◽  
Gauss Theorem ◽  
Triangular Numbers

Introduction: The Hadamard conjecture about the existence of Hadamard matrices in all orders multiple of 4, and the Gauss problem about the number of points in a circle are among the most important turning points in the development of mathematics. They both stimulated the development of scientific schools around the world with an immense amount of works. There are substantiations that these scientific problems are deeply connected. The number of Gaussian points (Z3 lattice points) on a spheroid, cone, paraboloid or parabola, along with their location, determines the number and types of Hadamard matrices.Purpose: Specification of the upper and lower bounds for the number of Gaussian points (with odd coordinates) on a spheroid depending on the problem size, in order to specify the Gauss theorem (about the solvability of quadratic problems in triangular numbers by projections onto the Liouville plane) with estimates for the case of Hadamard matrices. Methods: The authors, in addition to their previous ideas about proving the Hadamard conjecture on the base of a one-to-one correspondence between orthogonal matrices and Gaussian points, propose one more way, using the properties of generalized circles on Z3 .Results: It is proved that for a spheroid, the lower bound of all Gaussian points with odd coordinates is equal to the equator radius R, the upper limit of the points located above the equator is equal to the length of this equator L=2πR, and the total number of points is limited to 2L. Due to the spheroid symmetry in the sector with positive coordinates (octant), this gives the values of R/8 and L/4. Thus, the number of Gaussian points with odd coordinates does not exceed the border perimeter and is no less than the relative share of the sector in the total volume of the figure.Practical significance: Hadamard matrices associated with lattice points have a direct practical significance for noise-resistant coding, compression and masking of video information.

Sign in / Sign up

Export Citation Format

Share Document