Results 51 to 60 of about 316,193 (316)

Graph Analysis Using Fast Fourier Transform Applied on Grayscale Bitmap Images

open access: yesInformation, 2021
There is spiking interest in graph analysis, mainly sparked by social network analysis done for various purposes. With social network graphs often achieving very large size, there is a need for capable tools to perform such an analysis.
Pawel Baszuro, Jakub Swacha
doaj   +1 more source

Scaling Up Computer Vision Neural Networks Using Fast Fourier Transform [PDF]

open access: yesarXiv, 2023
Deep Learning-based Computer Vision field has recently been trying to explore larger kernels for convolution to effectively scale up Convolutional Neural Networks. Simultaneously, new paradigm of models such as Vision Transformers find it difficult to scale up to larger higher resolution images due to their quadratic complexity in terms of input ...
arxiv  

Enhanced Mechanical Properties of Injectable Chitosan–Guar Gum Hydrogel Reinforced with Bacterial Cellulose Nanofibers for Tissue Engineering Applications

open access: yesAdvanced Engineering Materials, EarlyView.
This study presents the development and characterization of injectable nanocomposite hydrogels based on N‐succinyl chitosan, oxidized guar gum, and bacterial cellulose nanofibers. Emphasizing enhanced mechanical properties and biocompatibility, the hydrogels exhibit fast gelation, improved structural integrity, and reduced swelling. Their potential for
Raimundo Nonato Fernandes Moreira Filho   +8 more
wiley   +1 more source

Sliding signal processing in telecommunication networks based on two-dimensional discrete Fourier transform [PDF]

open access: yesITM Web of Conferences, 2019
A method of vertical sliding processing of two-dimensional discrete signals in the spatial frequency domain is proposed — a method of fast vertically sliding two-dimensional discrete Fourier transform.
Ponomarev Vladimir   +3 more
doaj   +1 more source

Approximating the Analytic Fourier Transform with the Discrete Fourier Transform [PDF]

open access: yesarXiv, 2015
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more rapidly than via a direct matrix multiplication.
arxiv  

Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms [PDF]

open access: yesarXiv, 2021
In this paper we study the nonuniform fast Fourier transform with nonequispaced spatial and frequency data (NNFFT) and the fast sinc transform as its application. The computation of NNFFT is mainly based on the nonuniform fast Fourier transform with nonequispaced spatial nodes and equispaced frequencies (NFFT). The NNFFT employs two compactly supported,
arxiv  

Recent Progress on 2D‐Material‐Based Smart Textiles: Materials, Methods, and Multifunctionality

open access: yesAdvanced Engineering Materials, EarlyView.
Advancements in 2D‐material‐integrated smart textiles are reviewed, with a focus on materials, fabrication methods, and multifunctional applications, including energy harvesting, monitoring, EMI shielding, energy storage, and thermal management. The discussion addresses key challenges and provides insights into the future development of next‐generation
Yong Choi   +5 more
wiley   +1 more source

Discrete and Fast Fourier Transform Made Clear [PDF]

open access: yesarXiv, 2019
Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means of elementary linear algebra.
arxiv  

Fast inverse nonlinear Fourier transform [PDF]

open access: yesPhysical Review E, 2018
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transform (NFT). The theoretical underpinnings of this generalization of the conventional Fourier transform is quite well established in the Ablowitz-Kaup-Newell-Segur (AKNS) formalism; however, efficient ...
openaire   +6 more sources

Covalently‐Bonded Diaphite Nanoplatelet with Engineered Electronic Properties of Diamond

open access: yesAdvanced Functional Materials, EarlyView.
A novel approach to engineering the electronic properties of diamond is reported on the diaphite nanoplatelet consisting of (11¯${{\bar{1}}}$1) planes of diamond nanoplatelet covalently bonded with graphite (0001) planes. The strong sp3/sp2‐hybridized interfacial covalent bonding induces the electron transfer from diamond to graphite, resulting in a ...
Zhaofeng Zhai   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy