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

IEEE International Conference on Image Processing

作者： Gang He Jing Hu Yunsong Li Wenxin Yu Xidian University Southwest University of Science and Technology

ISBN: (纸本)9781467399623

In High Efficiency Video Coding (HEVC), intra coding plays an important role, but also involves huge computational complexity due to a flexible coding unit (CU) structure and a large number of prediction modes. This paper presents a fast algorithm based on the sole- and multi-depth measurements to reduce the complexity from CU and prediction mode decisions. For the CU decision, evaluation results with sole and multiple depths are utilized to judge if the CU is a heterogeneous, homogeneous, or depth prominent one, where fast CU decisions are made. For the prediction mode decision, the tendencies for different CU sizes are detected based on multiple depths. The number of searching modes is decreased adaptively for the depth with fewer tendencies. Experimental results show the proposed algorithm reduces 61.49% computational complexity, with 0.75% bit-rate increasing, which is more efficient than state-of-the-arts.

关键词： HEVC fast algorithm Intra prediction Copper High efficiency video coding complexity classes algorithms tendencies

来源：评论

学校读者我要写书评

暂无评论

fast algorithm of Parameters Estimation of High Speed Moving Target Based on Conjugate Gradients and Its Test

Fast Algorithm of Parameters Estimation of High Speed Moving...

引用

2011 International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： GAO Zhu Unit 92635 PLA

ISBN: (纸本)9781612848334

Wideband signal processing is always realized by wideband correlative processing which has a time scale and time delay 2-D peak value search calculation structure. Aiming at the relatively high parameters estimation precision, the structure should have a high search density, but it would cause a heavy operation which system cannot afford. Then a fast algorithm of parameters estimation based on conjugate gradients was advanced. The computer simulation of fast algorithm was accomplished and parameters estimation deviation variance curves were calculated by Monte Carlo method. The simulated reflected signal of high-speed moving target was collected in lake test and the fast algorithm were applied on the target detection and parameters estimation under the low SNR. The results of simulation and lake test showed that the fast algorithm based on conjugate gradients could reach the peak value by low operation and relatively high parameters estimation precision by iterative calculation.

关键词： parameters estimation conjugate gradients fast algorithm Monte Carlo lake test

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the Schrödinger equation in quaternionic quantum mechanics

引用

APPLIED MATHEMATICS LETTERS 2024年 150卷

作者： Jiang, Tongsong Guo, Zhenwei Zhang, Dong Vasil'ev, V. I. Shandong Xiandai Univ Sch Elect Informat Jinan 250104 Peoples R China North Eastern Fed Univ Inst Math & Informat Sci Yakutsk 677000 Russia Linyi Univ Sch Math & Stat Linyi 276005 Peoples R China

The eigenvalue problem of a Hermitian quaternion matrix plays a crucial role in quaternion quantum mechanics because it is closely related to the solution of Schrodinger equation. In this paper, a fast algorithm is proposed for finding the eigenvalues and corresponding eigenvectors of a Hermitian quaternion matrix based on the real representation of a quaternion matrix as well as the special structure and properties of a Hermitian quaternion matrix. Numerical experiments demonstrate that, compared with the existing computational methods for the eigenvalue problem of a Hermitian quaternion matrix, the proposed method in this paper not only greatly improves the computational efficiency, but also achieves better experimental results in terms of the corresponding computational errors.

关键词： fast algorithm Schrodinger equation Hermitian quaternion matrix Real representation Eigenvalue problem

来源：评论

学校读者我要写书评

暂无评论

Robust multiscale analytic sampling approximation to periodic function and fast algorithm

引用

INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING 2017年第1期15卷 1750006-1750006页

作者： Li, Youfa Shang, Jing Zhang, Gengrong Dang, Pei Guangxi Univ Coll Math & Informat Sci Nanning Peoples R China Anyang Univ Architectural Engn Inst Anyang Peoples R China Macau Univ Sci & Technol Fac Informat Technol Macau Peoples R China

By applying the multiscale method to the Mobius transformation function, we construct the multiscale analytic sampling approximation (MASA) to any function in the Hardy space H-2(T). The approximation error is estimated, and it is proved that the MASA is robust to sample error. We prove that the MASA can be expressed by a Hankel matrix, making use of which, a fast algorithm is established to compute the MASA. Since what we acquire in practice may well be the samples on time domain instead of the analytic ones on the unit disc of the complex plane, we establish a fast algorithm for acquiring analytic samples. Numerical experiments are carried out to demonstrate the efficiency of the MASA.

关键词： Multiscale method analytic sampling approximation Hankel matrix fast algorithm Mobius transformation Hardy space

来源：评论

学校读者我要写书评

暂无评论

Explicit potential function and fast algorithm for computing potentials in α x β conic surface resistor network

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年第PartE期238卷

作者： Jiang, Xiaoyu Zhang, Gaojun Zheng, Yanpeng Jiang, Zhaolin Linyi Univ Sch Informat Sci & Engn Linyi 276000 Peoples R China Linyi Univ Sch Automat & Elect Engn Linyi 276000 Shandong Peoples R China Linyi Univ Sch Math & Stat Linyi 276000 Peoples R China

Resistor network research is of great importance, yet many resistor networks and their large-scale fast computations have not received sufficient attention. This paper proposes a new resistor network with idiosyncratic shape, i.e., a alpha x beta conic surface (CS) resistor network that resembles the upper part of a three-dimensional Dirac function. Utilizing the Recursion Transform (RT-V) method of Tan, a recursive matrix equation model is constructed based on Kirchhoff's law and nodal voltages, which contains the modified tridiagonal Toeplitz matrix. By using the orthogonal matrix transformation, the eigenvalues and eigenvectors of the modified tridiagonal Toeplitz are obtained. The discrete sine transform of the fourth type (DST - IV) is utilized to solve node voltages, while the explicit potential function is represented by the Chebyshev polynomials of the second kind. In addition, explicit potential functions for some special cases are provided, and the potential distribution is illustrated using dynamic three-dimensional graph. To achieve a rapid calculation of the potential, a fast algorithm based on the multiplication of DST-IV with a vector is proposed. In the end, analysis of computational efficiency for the explicit potential function and the fast algorithm are shown.

关键词： Resistor network Chebyshev polynomials DST-IV 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

来源：评论

学校读者我要写书评

暂无评论

A physics-based fast algorithm for structural responses of generalized rotationally axisymmetric structures: the generalized rotation-superposition method

引用

LATIN AMERICAN JOURNAL OF SOLIDS AND STRUCTURES 2024年第6期21卷 1-22页

作者： Yang, Mao Zhang, Jun Chen, Hao Yang, Jialin Mao, Yongjian China Acad Engn Phys Inst Syst Engn Mianyang 621999 Sichuan Peoples R China

fast calculations are widely required in the traditional applications and the emerging digital twin fields. For those considerations, a novel physics-based fast algorithm, namely generalized rotation-superposition method, is proposed for fast calculating linear elastic responses of generalized rotationally axisymmetric structures under arbitrary mechanical loads. This improved method breaks through the limitations of the previous basic rotationsuperposition method in rotational similarity of load and structural axisymmetry, and greatly expands its application scope. In this paper, firstly, the basic theory of the rotation-superposition algorithm is introduced;secondly, the theoretical model of the generalized rotation-superposition method is established;thirdly, the effectiveness and accuracy are verified by using finite element simulations;finally, through a complex case study, the applicability of the generalized rotation-superposition method for complex engineering problems and its advantages in efficiently obtaining massive amounts of data are further illustrated.

关键词： fast algorithm structural response axisymmetric structure rotationally axisymmetric structure rotation-superposition method digital twin

来源：评论

学校读者我要写书评

暂无评论

Multi-stage affine motion estimation fast algorithm for versatile video coding using decision tree

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2023年第1期96卷

作者： Huang, Xiaofeng Zhou, Fangtao Niu, Weihong Li, Tianci Lu, Yu Zhou, Yang Yin, Haibing Yan, Chenggang Hangzhou Dianzi Univ Sch Commun Engn 2 St Hangzhou 310018 Peoples R China Peking Univ Adv Inst Informat Technol Hangzhou 311215 Peoples R China

Affine motion estimation (AME) which is newly introduced in versatile video coding (VVC) plays a significant role in the bit-rate reduction for rotation and zooming scenes. However, it brings the complexity extremely increased. In this paper, a fast AME algorithm is designed to cope with the high-complexity problem. Three crucial stages are involved in the fast algorithm, which is the optimal inter-mode decision based on the coding unit (CU) partition, the fast algorithm in affine motion search (AMS), and the fast inter-mode decision based on a decision tree. Specifically, the optimal inter-mode will be determined straightforwardly when the parent CU is checked whether it is translational motion estimation (TME). Then, three fast algorithms are made in AMS, which are early termination based on control point motion vector (CPMV), early termination of the iteration process, and fast fine granularity CPMV search. Finally, the optimal inter-mode is predicted using a decision tree based on eight essential features. Experimental results show that the proposed algorithm achieves 10.20% and 10.33% encoding time-saving on average under Low Delay B (LDB) and Random Access (RA) configuration, while the BD-Rate loss is only 0.12% and 0.14%, respectively.

关键词： Affine motion estimation Versatile video coding Inter-mode decision Decision tree fast algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the electromagnetic scattering from a large rectangular cavity in three dimensions

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2021年 437卷 110331-110331页

作者： Chen, Yanli Jiang, Xue Lai, Jun Li, Peijun Northeastern Univ Dept Math Shenyang 110819 Peoples R China Beijing Univ Technol Coll Math Fac Sci Beijing 100124 Peoples R China Zhejiang Univ Sch Math Sci Hangzhou 310027 Zhejiang Peoples R China Purdue Univ Dept Math W Lafayette IN 47907 USA

The paper is concerned with the three-dimensional electromagnetic scattering from a large open rectangular cavity that is embedded in a perfectly electrically conducting infinite ground plane. By introducing a transparent boundary condition, the scattering problem is formulated into a boundary value problem in the bounded cavity. Based on the Fourier expansions of the electric field, the Maxwell equation is reduced to one-dimensional ordinary differential equations for the Fourier coefficients. A fast algorithm, employing the fast Fourier transform and the Gaussian elimination, is developed to solve the resulting linear system for the cavity which is filled with either a homogeneous or a layered medium. In addition, a novel scheme is designed to evaluate rapidly and accurately the Fourier transform of singular integrals. Numerical experiments are presented for large cavities to demonstrate the superior performance of the proposed method. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Electromagnetic scattering problem Maxwell's equations Open cavity fast algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：