Estimation of the bitrate and complexity of spectral image transformation algorithms in marine vessel surveillance systems

Исследуется процесс развития современных систем видеонаблюдения на морском транспорте, а также затронуты некоторые приложения и особенности передачи изображений и способы повышающие ее эффективность. Системы морского наблюдения могут использоваться для повышения безопасности портов, аэропортов, торговых и военных судов, а также для контроля морского движения в портах и каналах, защиты прибрежных и нефтяных платформ. Камеры являются одним из основных датчиков этих систем. Они дешевы и дополняют другие типы датчиков. В данной работе представлен результаты исследований по использованию алгоритм быстрого преобразования Фурье с децимацией во времени при размерности-22´22 при обработке морских сюжетов, полученных из различных камер наблюдения за крымским мостом. Предложенный алгоритм получен путем применения двухэтапного подхода к декомпозиции и внедрению эффективной методики группировки поворотных множителей Фурье-преобразования в комплексной форме. Анализируется арифметическая сложность предлагаемого алгоритма и вычисляется количество действительных умножений и сложений для различных размеров преобразования и изображений морских судов. Кроме того, выполнена оценка скорости передачи и сложности обработки морских изображений для различных форматов и разрешения. The process of development of modern video surveillance systems in maritime transport is investigated, as well as some applications and features of image transmission and methods that increase its efficiency are touched upon. Maritime surveillance systems can be used to improve the security of ports, airports, commercial and military vessels, as well as to control sea traffic in ports and channels, protect coastal and oil platforms. Cameras are one of the main sensors of these systems. They are cheap and complement other types of sensors. This paper presents the results of research on the use of the fast Fourier transform algorithm with decimation in time at a dimension of-22´22 when processing marine scenes obtained from various surveillance cameras for the Crimean bridge. The proposed algorithm is obtained by applying a two-stage approach to decomposition and implementing an effective method for grouping the rotary multipliers of the Fourier transform in a complex form. The arithmetic complexity of the proposed algorithm is analyzed and the number of real multiplications and additions for various sizes of transformation and images of sea vessels is calculated. In addition, the estimation of the transmission speed and complexity of processing marine images for various formats and resolutions was performed.

Developmental fronto-parietal shift of brain activation during mental arithmetic across the lifespan: A registered report protocol

Arithmetic processing is represented in a fronto-parietal network of the brain. However, activation within this network undergoes a shift from domain-general cognitive processing in the frontal cortex towards domain-specific magnitude processing in the parietal cortex. This is at least what is known about development from findings in children and young adults. In this registered report, we set out to replicate the fronto-parietal activation shift for arithmetic processing and explore for the first time how neural development of arithmetic continues during aging. This study focuses on the behavioral and neural correlates of arithmetic and arithmetic complexity across the lifespan, i.e., childhood, where arithmetic is first learned, young adulthood, when arithmetic skills are already established, and old age, when there is lifelong arithmetic experience. Therefore, brain activation during mental arithmetic will be measured in children, young adults, and the elderly using functional near-infrared spectroscopy (fNIRS). Arithmetic complexity will be manipulated by the carry and borrow operations in two-digit addition and subtraction. The findings of this study will inform educational practice, since the carry and borrow operations are considered as obstacles in math achievement, and serve as a basis for developing interventions in the elderly, since arithmetic skills are important for an independent daily life.

What Deters Online Grocery Shopping? Investigating the Effect of Arithmetic Complexity and Product Type on User Satisfaction

This paper explores the influence of product type and arithmetic task complexity on users’ perceived mental effort and satisfaction in the context of online grocery shopping. A two-factor within-subject experiment was conducted with 32 participants. Results show that experience products and complex arithmetic tasks are associated with higher perceived mental effort compared to search products and simple arithmetic tasks. Perceived mental effort and satisfaction are negatively related. The more cognitive effort users need to invest in their online shopping tasks, the less satisfied they are likely to be with their online experience. Our results suggest that cognitive absorption mediates the relationship between cognitive effort and satisfaction. The study contributes to our understanding of online grocery shopping by explaining the effect of arithmetic complexity and product type on user satisfaction. It also offers shopping website designers a way to improve consumers’ online grocery shopping experience by implementing simple technology features in their websites to help users reduce their mental effort.

A Depth-First Iterative Algorithm for the Conjugate Pair Fast Fourier Transform

The Split-Radix Fast Fourier Transform has the same low arithmetic complexity as the related Conjugate Pair Fast Fourier Transform. Both transforms have an irregular datapath structure which is straightforwardly expressed only in recursive forms. Furthermore, the conjugate pair variant has a complicated input indexing pattern which requires existing iterative implementations to rely on precomputed tables. It however allows optimization of the memory bandwidth as it requires a single twiddle factor load per radix-4 butterfly. In existing algorithms, this comes at the cost of using additional precomputed tables or performing recursive function calls. In this paper we present two novel approaches that handle both the butterfly scheduling and the input index generation of the Conjugate Pair Fast Fourier Transform. The proposed algorithm is cache-friendly because it is depth-first, non-recursive and does not rely on precomputed index tables. In order to achieve this, we relate the butterfly execution pattern of the Split-Radix and Conjugate Pair FFTs to the binary carry sequence. Based on this finding, we describe how common integer arithmetic and bitwise operations can be used to perform input reordering and depth-first traversal of the transform datapath with O(1) space complexity.<br>

A Depth-First Iterative Algorithm for the Conjugate Pair Fast Fourier Transform

The Split-Radix Fast Fourier Transform has the same low arithmetic complexity as the related Conjugate Pair Fast Fourier Transform. Both transforms have an irregular datapath structure which is straightforwardly expressed only in recursive forms. Furthermore, the conjugate pair variant has a complicated input indexing pattern which requires existing iterative implementations to rely on precomputed tables. It however allows optimization of the memory bandwidth as it requires a single twiddle factor load per radix-4 butterfly. In existing algorithms, this comes at the cost of using additional precomputed tables or performing recursive function calls. In this paper we present two novel approaches that handle both the butterfly scheduling and the input index generation of the Conjugate Pair Fast Fourier Transform. The proposed algorithm is cache-friendly because it is depth-first, non-recursive and does not rely on precomputed index tables. In order to achieve this, we relate the butterfly execution pattern of the Split-Radix and Conjugate Pair FFTs to the binary carry sequence. Based on this finding, we describe how common integer arithmetic and bitwise operations can be used to perform input reordering and depth-first traversal of the transform datapath with O(1) space complexity.<br>

Time and Area Efficient 2-D DWT using Multiplier-less Canonic Signed Digit Technique

A few models have been recommended for proficient VLSI usage of 2-D DWT for constant applications. It is disc overed that multipliers devour more chip zone and expands multifaceted nature of the DWT design. Multiplier-less equipment usage approach gives an answer for diminish chip region, lower equipment intricacy and higher throughput of calculation of the DWT design.The proposed design outline is (i) priority must be given for memory complexity optimization over the arithmetic complexity optimization or reduction of cycle period and (ii) memory utilization efficiency to be considered ahead of memory reduction due to design complexity of memory optimization method. Based on the proposed design outline four separate design approaches and concurrent architectures are presented in this thesis for area-delay and power efficient realization of multilevel 2-D DWT.In this theory a multiplier-less VLSI engineering is proposed utilizing new dispersed number juggling calculation named CSD. We show that CSD is an effective engineering with adders as the principle part and free of ROM, duplication, and subtraction. The proposed design utilizing CSD gives less postponement and least number of cut thought about the current engineering. The reenactment was performed utilizing XILINX 14.1i and ModelSim test system.