检索结果-内蒙古大学图书馆

A fast algorithm for Intra-Frame Versatile Video Coding Based on Edge Features

SENSORS 2023年第13期23卷 6244-6244页

作者： Zhao, Shuai Shang, Xiwu Wang, Guozhong Zhao, Haiwu Shanghai Univ Engn Sci Sch Elect Engn Shanghai 201620 Peoples R China

Versatile Video Coding (VVC) introduces many new coding technologies, such as quadtree with nested multi-type tree (QTMT), which greatly improves the efficiency of VVC coding. However, its computational complexity is higher, which affects the application of VVC in real-time scenarios. Aiming to solve the problem of the high complexity of VVC intra coding, we propose a low-complexity partition algorithm based on edge features. Firstly, the Laplacian of Gaussian (LOG) operator was used to extract the edges in the coding frame, and the edges were divided into vertical and horizontal edges. Then, the coding unit (CU) was equally divided into four sub-blocks in the horizontal and vertical directions to calculate the feature values of the horizontal and vertical edges, respectively. Based on the feature values, we skipped unnecessary partition patterns in advance. Finally, for the CUs without edges, we decided to terminate the partition process according to the depth information of neighboring CUs. The experimental results show that compared with VTM-13.0, the proposed algorithm can save 54.08% of the encoding time on average, and the BDBR (Bjontegaard delta bit rate) only increases by 1.61%.

关键词： versatile video coding (VVC) fast algorithm CU partition edge direction

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the measurement of stimulus-frequency otoacoustic emission suppression tuning curves based on multi-level swept suppressor tones

引用

APPLIED ACOUSTICS 2023年第1期211卷

作者： Xu, Runyi Liu, Yin Gong, Qin Tsinghua Univ Sch Med Dept Biomed Engn Beijing 100084 Peoples R China Shanghai Univ Sch Med Shanghai 200444 Peoples R China Tsinghua Univ Sch Med Off C212 Beijing 100084 Peoples R China

algorithms for measuring stimulus-frequency otoacoustic emission (SFOAE) suppression tuning curves (STCs) typically use pure tones as suppressors, leading to procedures which are time-consuming and difficult to apply in clinical settings. A fast algorithm based on multi-level swept suppressor tones (MLSST) is proposed in this study. Taking advantage of the time-varying frequencies of swept tones, the suppression effects on SFOAE produced by swept suppressor tones are obtained within a single test. Further, a SFOAE STC may be extracted by interpolation from a set of suppression-effect functions at multiple suppressor levels. In the present study, SFOAE STCs were obtained in twenty-six normal-hearing subjects using the fast MLSST and the traditional pure-tone algorithms. SFOAE STCs were measured with high test-retest repeatability using the MLSST algorithm (average mean absolute errors of 2.12 dB) and were nearly consistent with the SFOAE STCs obtained by the pure-tone algorithm (average mean absolute errors of 3.13 dB). In addition, with>1.8 times frequency solution of the acquired curves, the measurement speed of our MLSST algorithm was approximately 2.14 times faster than the traditional one.& COPY;2023 Published by Elsevier Ltd.

关键词： Stimulus frequency otoacoustic emission Suppression tuning curve Swept suppressor tone fast algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved fast algorithm Based on Image Edges for Complex Environment

引用

SENSORS 2022年第19期22卷 7127-7127页

作者： Lu, Cunzhe Qi, Xiaogang Ding, Kai Yu, Baoguo Xidian Univ Sch Math & Stat Xian 710071 Peoples R China Xian Key Lab Network Modeling & Resource Scheduli Xian 710071 Peoples R China Sci & Technol Near Surface Detect Lab Wuxi 214000 Jiangsu Peoples R China State Key Lab Satellite Nav Syst & Equipment Tech Shijiazhuang 050051 Hebei Peoples R China

In complex environments such as those with low textures or obvious brightness changes, point features extracted from a traditional fast algorithm cannot perform well in pose estimation. Simultaneously, the number of point features extracted from fast is too large, which increases the complexity of the build map. To solve these problems, we propose an L-fast algorithm based on fast, in order to reduce the number of extracted points and increase their quality. L-fast pays more attention to the intersection of line elements in the image, which can be extracted directly from the related edge image. Hence, we improved the Canny edge extraction algorithm, including denoising, gradient calculation and adaptive threshold. These improvements aimed to enhance the sharpness of image edges and effectively extract the edges of strong light or dark areas in the images as brightness changed. Experiments on digital standard images showed that our improved Canny algorithm was smoother and more continuous for the edges extracted from images with brightness changes. Experiments on KITTI datasets showed that L-fast extracted fewer point features and increased the robustness of SLAM.

关键词： visual SLAM point and line feature fast algorithm image edge adaptive Canny

来源：评论

学校读者我要写书评

暂无评论

Efficient fast algorithm and Parallel Hardware Architecture for Intra Prediction of AVS3 53

Efficient Fast Algorithm and Parallel Hardware Architecture ...

引用

IEEE International Symposium on Circuits and Systems (IEEE ISCAS)

作者： Cai, Zhanyuan Gao, Wei Peking Univ Sch Elect & Comp Engn Shenzhen Grad Sch Shenzhen Peoples R China

ISBN: (纸本)9781728192017

The complexity of hardware implementation of the third generation audio video coding standard (AVS3) has been significantly improved due to more flexible intra prediction methods. In this paper, an efficient intra mode decision algorithm for parallel hardware architecture of the AVS3 intra encoder is presented. The key idea is to process coding units (CUs) in parallel, including intra prediction and estimating Rate-Distortion (RD) cost for mode decision. Specially, regression tree-based fast algorithm is adopted to decide several preselected modes, together with sufficient consideration into the tradeoff between RD-cost and complexity of prediction engines. In order to obtain the optimal intra mode and improve throughput, prediction module and Hadamard-cost module are devised to process all the candidate modes in parallel. To the best of our knowledge, this is the first parallel hardware architecture of AVS3 intra prediction. Compared with the HPM-6.0 reference software, the proposed algorithm leads to a reduction of 78% in computation workload, while the average BD-PSNR is -0.40 dB for the common test videos. When implemented on the Vertex UltraScale VU440 targeting at 300MHz, the proposed design can support the real-time encoding of 4K videos at 30fps.

关键词： intra prediction fast algorithm hardware architecture AVS3

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for two-dimensional distributed-order time-space fractional diffusion equations

引用

APPLIED MATHEMATICS AND COMPUTATION 2022年 425卷

作者： Sun, Lu-Yao Fang, Zhi-Wei Lei, Siu-Long Sun, Hai-Wei Zhang, Jia-Li Univ Macau Dept Math Macau Peoples R China

In this paper, a fast algorithm is proposed for solving distributed-order time-space fractional diffusion equations. Integral terms in time and space directions are discretized by the Gauss-Legendre quadrature formula. The Caputo fractional derivatives are approximated by the exponential-sum-approximation method, and the finite difference method is applied for spatial approximation. The coefficient matrix of the discretized linear system is symmetric positive definite and possesses block-Toeplitz-Toeplitz-block structure. The preconditioned conjugate gradient method with a block-circulant-circulant-block pre conditioner is employed to solve the linear system. Theoretically, the stability and convergence of the proposed scheme are discussed. Numerical experiments are carried out to demonstrate the effectiveness of the scheme.(c) 2022 Elsevier Inc. All rights reserved.

关键词： Time-space fractional equation Distributed-order fractional derivative fast algorithm Block-circulant-circulant-block preconditioner Exponential-sum-approximation method Stability and convergence

来源：评论

学校读者我要写书评

暂无评论

FTA-GAN: A Computation-Efficient Accelerator for GANs With fast Transformation algorithm

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2023年第6期34卷 2978-2992页

作者： Mao, Wendong Yang, Peixiang Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing 210008 Peoples R China

Nowadays, generative adversarial network (GAN) is making continuous breakthroughs in many machine learning tasks. The popular GANs usually involve computation-intensive deconvolution operations, leading to limited real-time applications. Prior works have brought several accelerators for deconvolution, but all of them suffer from severe problems, such as computation imbalance and large memory requirements. In this article, we first introduce a novel fast transformation algorithm (FTA) for deconvolution computation, which well solves the computation imbalance problem and removes the extra memory requirement for overlapped partial sums. Besides, it can reduce the computation complexity for various types of deconvolutions significantly. Based on FTA, we develop a fast computing core (FCC) and the corresponding computing array so that the deconvolution can be efficiently computed. We next optimize the dataflow and storage scheme to further reuse on-chip memory and improve the computation efficiency. Finally, we present a computation-efficient hardware architecture for GANs and validate it on several GAN benchmarks, such as deep convolutional GAN (DCGAN), energy-based GAN (EBGAN), and Wasserstein GAN (WGAN). The experimental results show that our design can reach 2211 GOPS under 185-MHz working frequency on Intel Stratix 10SX field-programmable gate array (FPGA) board with satisfactory visual results. In brief, the proposed design can achieve more than 2x hardware efficiency improvement over previous designs, and it can reduce the storage requirement drastically.

关键词： Deconvolution Generative adversarial networks Convolution Kernel Hardware Generators Memory management Deconvolution fast algorithm generative adversarial network (GAN) hardware architecture transposed convolution

来源：评论

学校读者我要写书评

暂无评论

Analysis of electromagnetic non-destructive evaluation modelling using Stratton-Chu formulation-based fast algorithm

引用

PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 2020年第2182期378卷 20190583-20190583页

作者： Bao, Yang Song, Jiming Nanjing Univ Posts & Telecommun Coll Elect & Opt Engn Nanjing 210023 Jiangsu Peoples R China Southeast Univ State Key Lab Millimeter Waves Nanjing 210096 Jiangsu Peoples R China Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA Iowa State Univ Ctr Nondestruct Evaluat Ames IA 50011 USA

The eddy current non-destructive evaluation (NDE) modelling using Stratton-Chu formulation-based fast algorithm is analysed. Stratton-Chu formulations, which have no low frequency breakdown issue, are selected for modelling electromagnetic NDE problems with low frequency and high conductivity approximations. As the main contribution of this article, the robustness and efficiency of the approximations, which result in big savings in both memory and CPU time, are validated and analysed using examples from practical EC testing. The boundary element method (BEM) is used to discretize the integral equations into a linear system of equations: the first order Rao-Wilton-Glisson (RWG) vector basis functions with the flat triangle meshes of the object and pulse basis functions are selected to expand the equivalent surface currents and the normal component of magnetic fields, respectively. Then the multilevel adaptive cross approximation (MLACA) algorithm is applied to accelerate the iterative solution process. The performance and efficiency of adaptively applying a multi-stage (level) algorithm based on the criteria concluded for the operators are shown. This article is part of the theme issue 'Advanced electromagnetic non-destructive evaluation and smart monitoring'.

关键词： electromagnetic non-destructive evaluation eddy current testing Stratton-Chu formulations with approximations fast algorithm

来源：评论

学校读者我要写书评

暂无评论

Thin interbed AVA inversion based on a fast algorithm for reflectivity

引用

ACTA GEOPHYSICA 2020年第4期68卷 1007-1020页

作者： Yang, Zhen Lu, Jun Chinese Acad Sci Inst Geol & Geophys Key Lab Earth & Planetary Phys Beijing 100029 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China China Univ Geosci Sch Geophys & Informat Technol Beijing 100083 Peoples R China

Zoeppritz equations form the theoretical basis of most existing amplitude variation with incident angle (AVA) inversion methods. Assuming that only primary reflections exist, that is, the multiples are fully suppressed and the transmission loss and geometric spreading are completely compensated for, Zoeppritz equations can be used to solve for the elastic parameters of strata effectively. However, for thin interbeds, conventional seismic data processing technologies cannot suppress the internal multiples effectively, nor can they compensate for the transmission loss accurately. Therefore, AVA inversion methods based on Zoeppritz equations or their approximations are not applicable to thin interbeds. In this study, we propose a prestack AVA inversion method based on a fast algorithm for reflectivity. The fast reflectivity method can compute the full-wave responses, including the reflection, transmission, mode conversion, and internal multiples, which is beneficial to the seismic inversion of thin interbeds. A further advantage of the fast reflectivity method is that the partial derivatives of the reflection coefficient with respect to the elastic parameters can be expressed as analytical solutions. Based on the Gauss-Newton method, we construct the objective function and model-updating formula considering sparse constraint, where the Jacobian matrix takes the form of an analytical solution, which can significantly accelerate the inversion convergence. We validate our inversion method using numerical examples and field seismic data. The inversion results demonstrate that the fast reflectivity-based inversion method is more effective for thin interbed models in which the wave-propagation effects, such as interval multiples, are difficult to eliminate.

关键词： Amplitude variation with incident angle Inversion Thin interbed fast algorithm Reflectivity method

来源：评论

学校读者我要写书评

暂无评论

Development of Embedded Temperature Regulator Based on DMC fast algorithm

Development of Embedded Temperature Regulator Based on DMC F...

引用

第34届中国控制与决策会议

作者： Zhen-He Wu Zhong Zhao College of Information Science and Technology Beijing University of Chemical Technology

A fast Dynamic Matrix Control(DMC) algorithm is proposed to satisfy the requirements of the embedded temperature *** exists online high-dimension matrix inversion in the DMC control algorithm,so it is difficult to apply to the embedded temperature regulator with limited computing *** this work,the high-dimension matrix is decomposed into the product of a triangular matrix and its transpose matrix by Cholesky decomposition,and the inversion of the matrix calculation could be calculated *** on the proposed algorithm,an embedded temperature regulator has been ***,the computation cost of the fast algorithm is greatly reduced compared to the traditional DMC *** experimental results have verified that the algorithm can be applied to the embedded temperature regulator and provides better regulation effect than that with the PID control algorithm.

关键词： Dynamic Matrix Control fast algorithm Embedded Regulator Temperature Control

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for Completion State Calculating of Wire Rope Cable Bridge

Fast Algorithm for Completion State Calculating of Wire Rope...

引用

作者： Yang Feng Dan Song Minghui Li Power China Northwest Engineering Corporation Limited

When determining the completion state of the main cable of a cableway bridge,although the catenary theory can accurately consider the nonlinear mechanical effect of the cable,the iterative calculation is cumbersome and not convenient for engineering *** the calculation based on the parabola theory is simple,the calculation accuracy for long cables is *** this paper,based on catenary theory and considering the calculation accuracy and avoiding iterative calculation,a fast algorithm for the completion state of the main cable of the wire rope cableway bridge is *** results show that the bridge state can be quickly and accurately determined by approximating the horizontal component of the cable tension and avoiding multiple iterative *** proposed algorithm can be used in engineering design and construction.

关键词： fast algorithm Wire rope Cable Bridge Catenary theory Parabola theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：