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

22nd International Conference on Neural Information Processing (ICONIP)

作者： Baek, JeongHun Oba, Shigeyuki Yoshimoto, Junichiro Doya, Kenji Ishii, Shin Kyoto Univ Grad Sch Informat Yoshidahonmachi 36-1 Kyoto Japan Grad Univ Okinawa Inst Sci & Technol Neural Computat Unit Okinawa 9040495 Japan Nara Inst Sci & Technol Grad Sch Informat Sci Nara 6300101 Japan

ISBN: (纸本)9783319265551;9783319265544

Identification of functional connectivity between neurons is an important issue in computational neuroscience. Recently, the number of simultaneously recorded neurons is increasing, and computational complexity to estimate functional connectivity is exploding. In this study, we propose a two-stage algorithm to estimate spike response functions between neurons in a large scale network. We applied the proposed algorithm to various scales of neural networks and showed that the computational complexity is reduced without sacrificing estimation accuracy.

关键词： computational complexity reduction Functional connectivity Two-stage algorithm Large scale networks

来源：评论

学校读者我要写书评

暂无评论

Meso-scale coalitional control in large-scale networks☆

引用

AUTOMATICA 2025年 177卷

作者： Erofeeva, Victoria Granichin, Oleg Uzhva, Denis St Petersburg State Univ Univ Skaya Emb 7-9 St Petersburg 199034 Russia

Network systems are usually composed of many interacting nodes. A large number of nodes and their possibly high-dimensional dynamics may result in complex system designs, which pose challenges to control of such systems in real-time. The traditional methods generate reduced-order models that well approximate the behavior of a high-dimensional system. However, when applied to large-scale network systems, these approaches face the problem of structure preservation. The control of complex networks is highly dependent on their interconnection structure, which is usually lost in the process of the conventional model reduction. Frequently, large-scale systems possess structural features that divide the system into subsystems or clusters. In this paper, we propose a meso-scale control approach that employs structural features of the system to reduce computational complexity. This approach is integrated into the model predictive control (MPC) synthesis framework. Our theoretical analysis highlights the significant reduction in computations at the expense of a little decrease in accuracy. The simulation results demonstrate the benefits and limits of our proposed control method. (c) 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： Network systems Model predictive control Meso-scale Large-scale systems computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

Efficient hypothesis testing strategies for latent group lasso problem

引用

SIGNAL PROCESSING 2025年 226卷

作者： Mao, Xingyun Qiao, Heng Shanghai Jiao Tong Univ UM SJTU Joint Inst Shanghai Peoples R China

A hypothesis testing based pre-processing procedure is proposed in this paper to reduce the computational complexity of latent group lasso (LGL) problem. The redundant overlapping support groups can be efficiently pruned while the desired groups are kept at a guaranteed rate. Three different schemes of hypothesis testing are theoretically studied and empirically compared in terms of complexity reduction, pruning accuracy, and recovery error. Of possible independent interest, the optimal designs of test statistics are also pursued to make explicit use of different signal structural priors. The theoretical claims are demonstrated via extensive numerical experiments under different settings and the proposed pre-processing procedure exhibits obvious empirical superiority in the concerned aspects.

关键词： Latent group lasso computational complexity reduction Hypothesis testing Structural prior

来源：评论

学校读者我要写书评

暂无评论

Real-Valued Discrete Fractional Hadamard Transform: Fast Algorithms and Implementations

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2025年

作者： Fan, Zi-Chen Li, Di Rahardja, Susanto Northwestern Polytech Univ Sch Marine Sci & Technol Xian 710072 Peoples R China Singapore Inst Technol Singapore 138683 Singapore

This paper introduces a new real-valued discrete fractional Hadamard transform (RFHT) designed to address the issues of high computational complexity and large storage demands found in the traditional discrete fractional Hadamard transform (FHT) and its modifications. Additionally, a fast algorithm for the RFHT is developed, and the corresponding computational complexity analysis demonstrates that for sizes ranging from N=2 to 1024, the proposed fast algorithm can reduce the number of multiplications and additions by up to 50.0% and 83.3%, respectively, compared to state-of-the-art fast algorithms. The comparison results show that the RFHT also has lower execution time and power consumption. Furthermore, due to its real-valued property, the RFHT has been applied in an image watermarking system and implemented on real iOS devices, demonstrating enhanced information security. Lower execution and power consumption, reduced storage and transmission requirements, and superior information protection make the RFHT a superior candidate compared to WHT, FHT, and its modifications.

关键词： Transforms computational complexity Watermarking Power demand Error correction codes Error correction Eigenvalues and eigenfunctions Fans Protection Image coding Real-valued discrete fractional Hadamard transform (RFHT) fast algorithms computational complexity reduction power consumption iOS implementation

来源：评论

学校读者我要写书评

暂无评论

Stability analysis of complex-valued impulsive system

引用

IET CONTROL THEORY AND APPLICATIONS 2013年第8期7卷 1152-1159页

作者： Fang, Tao Sun, Jitao Tongji Univ Dept Math Shanghai 200092 Peoples R China Shanghai Univ Engn Sci Sch Fundamental Studies Shanghai 201620 Peoples R China

Since quantum system, which is one of the foci of ongoing research, is the classical example of complex-valued systems, in this study, the stability of complex-valued impulsive system is addressed. Taking advantage of the Lyapunov function in the complex fields, the stability criteria of complex-valued impulsive system are established, which not only generalises the stability criteria on real-valued impulsive system, but also greatly reduces the complexity of analysis and computation. Moreover, as an application, a linear impulsive feedback controller for the complex-valued Lu system is designed.

关键词： computational complexity control system synthesis discrete systems feedback linear systems Lyapunov methods stability criteria stability analysis complex-valued impulsive system quantum system Lyapunov function stability criteria real-valued impulsive system computational complexity reduction linear impulsive feedback controller design complex-valued Lu system

来源：评论

学校读者我要写书评

暂无评论

High Bit-Depth Medical Image Compression With HEVC

引用

IEEE JOURNAL OF BIOMEDICAL AND HEALTH INFORMATICS 2018年第2期22卷 552-560页

作者： Parikh, Saurin S. Ruiz, Damian Kalva, Hari Fernandez-Escribano, Gerardo Adzic, Velibor Florida Atlantic Univ Boca Raton FL 33431 USA Nirma Univ Ahmadabad 382481 Gujarat India King Juan Carlos Univ URJC Mostoles 28933 Spain Florida Atlantic Univ Dept Elect & Comp Engn & Comp Sci Boca Raton FL 33431 USA Univ Castilla La Mancha Albacete 02071 Spain Florida Atlantic Univ Multimedia Lab Boca Raton FL 33431 USA

Efficient storing and retrieval of medical images has direct impact on reducing costs and improving access in cloud-based health care services. JPEG 2000 is currently the commonly used compression format for medical images shared using the DICOM standard. However, new formats such as high efficiency video coding (HEVC) can provide better compression efficiency compared to JPEG 2000. Furthermore, JPEG 2000 is not suitable for efficiently storing image series and 3-D imagery. Using HEVC, a single format can support all forms of medical images. This paper presents the use of HEVC for diagnostically acceptable medical image compression, focusing on compression efficiency compared to JPEG 2000. Diagnostically acceptable lossy compression and complexity of high bit-depth medical image compression are studied. Based on an established medically acceptable compression range for JPEG 2000, this paper establishes acceptable HEVC compression range for medical imaging applications. Experimental results show that using HEVC can increase the compression performance, compared to JPEG 2000, by over 54%. Along with this, a new method for reducing computational complexity of HEVC encoding for medical images is proposed. Results show that HEVC intra encoding complexity can be reduced by over 55% with negligible increase in file size.

关键词： computational complexity reduction digital imagig and communications in medicine (DICOM) JPEG 2000 high efficiency video coding (HEVC) intracoding irreversible compression medical image compression

来源：评论

学校读者我要写书评

暂无评论

Analytical method for optimum non-negative integer bit allocation

引用

IET SIGNAL PROCESSING 2016年第8期10卷 936-946页

作者： Hatam, Mahdi Masnadi-Shirazi, Mohammad Ali Firouzabad Inst Higher Educ Dept Elect Engn Firouzabad Iran Shiraz Univ Sch Elect & Comp Engn Dept Commun & Elect Shiraz Iran

The optimum bit allocation (OBA) problem was first investigated by Huang and Schultheiss in 1963. They solved the problem allowing the bits to be signed real numbers. Later, different algorithms were proposed for OBA problem when the bits were constrained to be integer and non-negative. In 2006, Farber and Zeger proposed new algorithms for solving optimum integer bit allocation (OIBA) and optimum non-negative integer bit allocation (ONIBA). None of the existing algorithms for OIBA and ONIBA problems end with an analytical solution. In this study, a new analytical solution is proposed for OIBA and ONIBA problems based on a novel analytical optimisation approach. At first, a closed form solution is derived for Lagrange unconstraint problem. Then, by removing the Lagrange multiplier, an analytical solution is obtained for OIBA and ONIBA problems. Using the selection and bisection algorithms, a low complexity algorithm is proposed for searching in a group of discrete functions which can reduce the computational complexity of the analytical solution. The complexity of computing the analytical solution is O(k) which is much lower than the complexity of existing ONIBA algorithms.

关键词： video coding data compression computational complexity optimisation optimum nonnegative integer bit allocation problem ONIBA problem OIBA problem OBA problem optimum bit allocation problem optimum integer bit allocation problem analytical optimisation approach Lagrange unconstraint problem Lagrange multiplier removal selection and bisection algorithm low complexity algorithm discrete function computational complexity reduction video frame compression

来源：评论

学校读者我要写书评

暂无评论

Condition-based exciter model complexity reduction for improved transient stability simulation

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2015年第14期9卷 1894-1902页

作者： Kim, Soobae Overbye, Thomas J. Korea Elect Power Corp KEPCO Korea Elect Power Res Inst Deajeon 305760 South Korea Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

A reduced model approach to decrease computational complexity in power system transient stability simulation is presented. This study investigates conditions that make fast modes active or inactive using practical power system examples. Modes in the original system where fast dynamics do not appear can be neglected, allowing simulation steps to be increased without numerical stability issues. During a transient simulation, the proposed method switches dynamically between the original exciter model and the reduced one, depending on the switching criterion presented. A high level of accuracy is achieved and computational efficiency is increased. Case studies with the Western Electricity Coordinating Council system are provided to validate the performance of the proposed method.

关键词： computational complexity power system transient stability power system simulation exciters condition-based exciter model computational complexity reduction power system transient stability simulation improvement fast dynamics numerical stability issues switching criterion computational efficiency western electricity coordinating council system

来源：评论

学校读者我要写书评

暂无评论

Adaptive recursive inverse-based control algorithm for shunt active power filter

引用

IET POWER ELECTRONICS 2016年第5期9卷 1053-1064页

作者： Badoni, Manoj Singh, Alka Singh, Bhim Delhi Technol Univ Dept Elect Engn Delhi 110042 India Indian Inst Technol Dept Elect Engn New Delhi 110016 India

A new adaptive control technique is proposed for a three-phase shunt active power filter (SAPF) in this study. The proposed control algorithm is based on recursive inverse theory which is used here to extract weighted values corresponding to fundamental active and reactive power components of load currents. This adaptive control algorithm possesses advantages over other control algorithms in terms of its reduced computational complexity, fast weight convergence and robust performance in distorted environment. The SAPF is used to mitigate current related power quality problems such as harmonics, reactive power and load unbalancing in both modes of power factor correction and voltage regulation. The performance of proposed control algorithm of SAPF is demonstrated through simulation results in Matlab/Simulink environment, which are validated with test results obtained on the developed experimental prototype of SAPF in the laboratory.

关键词： active filters adaptive control reactive power control load regulation electric current control computational complexity convergence power supply quality power harmonic filters adaptive recursive inverse-based control algorithm shunt active power filter three-phase SAPF three-phase shunt active power filter recursive inverse theory load current reactive power component load current active power component computational complexity reduction fast weight convergence distorted environment robust performance current related power quality problem mitigation

来源：评论

学校读者我要写书评

暂无评论

Theoretical approach for target detection and interference cancellation in passive radars

引用

IET RADAR SONAR AND NAVIGATION 2013年第3期7卷 205-216页

作者： Masjedi, Maryam Moddares-Hashemi, Mahmood Sadri, Saeed Isfahan Univ Technol Dept Elect & Comp Engn Esfahan Iran

Many studies have been done so far based on the detection theory for target detection in active radars, but not for passive radars. Owing to some substantial differences, detection methods used in active radars do not lead to accurate results if applied to passive radars. So, in the current study, cancellation, detection and target parameter extraction are investigated for passive radar based on the detection theory. To do this, the passive radar hypothesis test is written in the form of a multiple composite test. Unknown parameters are estimated using maximum likelihood (ML) criterion for the achievement of generalised likelihood ratio test detection statistic and elimination of direct path and clutter that contain nuisance parameters. The required threshold is set so that the false alarm probability in each cell and each step would become a constant value. Also, since this method requires heavy computations, a method for the reduction of computational complexity is proposed. Finally, various detection methods in passive radars are compared using simulation to show the effectiveness of the suggested method.

关键词： computational complexity interference suppression object detection radar clutter radar detection theoretical approach target detection interference cancellation passive radars detection theory active radars cancellation target parameter extraction detection theory multiple composite test ML criterion generalised likelihood ratio test detection statistic clutter computational complexity reduction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：