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

Improved iteration Centroid algorithm Based on Linear CCD Light-spot Location

Improved Iteration Centroid Algorithm Based on Linear CCD Li...

2009 9th International Conference on Electronic Measurement & Instruments(第九届电子测量与仪器国际会议 ICEMI'2009)

作者： Shengjin Tang Zhaofa Zhou Xiaosong Guo Yongchao Xiao Xi'an Research Inst.of Hi-tec Hongqing Town Xi'an 710025 China

ISBN: (纸本)9781424438631;9781424438624

In order to increase the linear CCD light-spot location accuracy and strengthen the ant-noise ability of centroid algorithm, an improved algorithm is presented. According to the symmetry distribution and high gray value of the object region, squared weight method and linear interpolation are used to enhance the effect of object region. Meanwhile, linear interpolation and iteration algorithm are utilized to improve the resolution and accuracy on signal segmentation. The simulation result shows that it is more accurate and stable than other sub-pixel algorithm, and the satisfying result is obtained

关键词： light-spot location centroid algorithm squared weighting linear interpolation iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved iteration Centroid algorithm Based on Linear CCD Light-spot Location

Improved Iteration Centroid Algorithm Based on Linear CCD Li...

引用

2009 9th International Conference on Electronic Measurement & Instruments（ICEMI’2009）

作者： Shengjin Tang Zhaofa Zhou Xiaosong Guo Yongchao Xiao Xi’an Research Inst. of Hi-tec Hongqing Town, Xi’an 710025 China

关键词： light-spot location centroid algorithm squared weighting linear interpolation iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

MPIS-IDTM: Multi-plane assisted iterative solution against scattering in intensity diffraction tomographic microscopy

引用

OPTICS AND LASER TECHNOLOGY 2025年 184卷

作者： Li, Jiaji Shao, Wenjun Li, Tianliang Mou, Xingang Hubei Digital Mfg Key Lab Wuhan 430070 Hubei Peoples R China Minist Educ Key Lab Adv Mfg Technol High Performance Parts Wuhan 430070 Hubei Peoples R China Wuhan Univ Technol Sch Mech & Elect Engn Wuhan 430070 Hubei Peoples R China Wuhan Univ Technol Sch Transportat & Logist Engn Wuhan 430070 Hubei Peoples R China

We here propose a multi-plane based iterative solution in intensity diffraction tomographic microscopy (MPIS-IDTM) to solve the problem of inverse scattering without making any assumptions and reconstruct high- resolution refractive index (RI) tomography of three-dimensional (3D) thick biological samples. By invoking the idea of transport of intensity and sparse intensity stacks, the defocused intensity image boosts the low frequency of RI via the axially defocusing strategy. Additionally, the illumination case can be extended to the un-matched condition, where illumination numerical-aperture (NA) allows for much smaller detection NA without low-frequency missing issues, enabling oil-immersion objective detection beyond dry/water-immersion detection. The comparison results between the conventional single-layer intensity constraint propagation-based method and the proposed approach demonstrate the advantage of MPIS in both simulation and experiment. Also, we experimentally validate the reconstruction of samples with varying amounts of fixed and live samples, and the results of MPIS-IDTM makes the 3D tomography possible under more extreme detection conditions and expands the possibilities for future studies in the highly scattering imaging of biomedicine and life sciences.

关键词： Computational microscopy 3D imaging Diffraction tomography iteration algorithm Phase retrieval

来源：评论

学校读者我要写书评

暂无评论

Robust H2 and H∞ Filter Design for Polytopic Systems by Dilating Matrices

引用

OPTIMAL CONTROL APPLICATIONS & METHODS 2025年第0期

作者： Cui, Yuefeng Wang, Likui Hebei Univ Technol Sch Artificial Intelligence Tianjin Peoples R China

In this article, the problem of robust H (2) and H (infinity) filter design for linear systems with polytopic parameters is studied. First, the dimensions of filter design matrices are dilated. For H (2) filter, the matrix is dilated from 3 to 4, and for H (infinity) filter, the corresponding matrix is dilated from 4 to 5, such that more slack variables can be introduced. Then, the polynomial parameter-dependent method is applied to design the Lyapunov function and filter gains. In addition, an iteration algorithm is used to further reduce the conservativeness. Finally, the effectiveness and the superiority of the proposed conditions are shown by four examples.

关键词： iteration algorithm polynomial parameter-dependent Lyapunov functions polytopic uncertainties robust H-2 and H-infinity filter

来源：评论

学校读者我要写书评

暂无评论

Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年第5期45卷 121-121页

作者： Yang, Zhengxi Jiang, Zhipeng Yang, Wenguo Gao, Suixiang Univ Chinese Acad Sci Sch Math Sci Beijing 100049 Peoples R China

Graph partitioning is a classical NP problem. The goal of graphing partition is to have as few cut edges in the graph as possible. Meanwhile, the capacity limit of the shard should be satisfied. In this paper, a model for graph partitioning is proposed. Then the model is converted into a mixed 0-1 linear programming by introducing variables. In order to solve this model, we select some variables to design the vertex relocation model. This work designs a variable selection strategy according to the effect of vertex relocation on the number of local edges. For purpose of implementing graph partitioning on large scale graph, we design an iterative algorithm to solve the model by selecting some variables in each iteration. The algorithm relocates the shard of the vertex according to the solution of the model. In the experiment, the method in this paper is simulated and compared with BLP and its related methods in the different shard sizes on the five social network datasets. The simulation results show that the method of this paper works well. In addition, we compare the effects of different parameter values and variables selection strategies on the partitioning effect.

关键词： Graph partitioning 0-1 mixed linear programming iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast BIE iteration method for an arbitrary body in a flow of incompressible inviscid fluid

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2013年第1期237卷 508-519页

作者： Scalia, Antonio Sumbatyan, Mezhlum A. Popuzin, Vitaly So Fed Univ Fac Math Mech & Comp Sci Rostov Na Donu 344090 Russia Univ Catania DMI I-95125 Catania CT Italy

The paper is concerned with the new iteration algorithm to solve boundary integral equations arising in boundary value problems of mathematical physics. The stability of the algorithm is demonstrated on the problem of a flow around bodies placed in the incompressible inviscid fluid. With a discrete numerical treatment, we approximate the exact matrix by a certain Toeplitz one and then apply a fast algorithm for this matrix, on each iteration step. We illustrate the convergence of this iteration scheme by a number of numerical examples, both for hard and soft boundary conditions. It appears that the method is highly efficient for hard boundaries, being much less efficient for soft boundaries. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Boundary integral equations iteration algorithm Toeplitz matrix Complex-shape objects

来源：评论

学校读者我要写书评

暂无评论

A NEW iteration APPROACH TO SOLVE A CLASS OF FINITE-HORIZON CONTINUOUS-TIME NONAFFINE NONLINEAR ZERO-SUM GAME

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2011年第2期7卷 597-608页

作者： Zhang, Xin Zhang, Huaguang Wang, Xingyuan Luo, Yanhong Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China Minist Educ Key Lab Integrated Automat Proc Ind Shenyang 110004 Peoples R China Dalian Univ Technol Sch Elect & Informat Engn Dalian 116024 Peoples R China

In this paper, a new iteration approach is derived to solve the optimal strategies for quadratic zero-sum game of finite-horizon continuous-time nonaffine nonlinear system. Through iteration algorithm, between two sequences which are a sequence of state trajectories of linear quadratic zero-sum games and a sequence of corresponding Riccati differential equations, the optimal strategies for the nonaffine nonlinear zero-sum game are given. Under very mild conditions of local Lipschitz continuity, the convergence of approximating linear time-varying sequences is proved. A numerical example is given to demonstrate the convergence and effectiveness of the proposed approach.

关键词： Zero-sum game Nonaffine nonlinear system Riccati equation Approximation theory iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

iteration METHODS FOR FINDING ALL ZEROS OF A POLYNOMIAL SIMULTANEOUSLY

引用

MATHEMATICS OF COMPUTATION 1973年第122期27卷 339-344页

作者： ABERTH, O TEXAS A&M UNIV MATH DEPTCOLLEGE STNTX 77843

Abstract: Durand and Kerner independently have proposed a quadratically convergent iteration method for finding all zeros of a polynomial simultaneously. Here, a new derivation of their iteration equation is given, and a second, cubically convergent iteration method is proposed. A relatively simple procedure for choosing the initial approximations is described, which is applicable to either method.

关键词： Polynomial zeros iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

Upper-bound limit analysis based on the natural element method

引用

Acta Mechanica Sinica 2012年第5期28卷 1398-1415页

作者： Shu-Tao Zhou Ying-Hua Liu Department of Engineering Mechanics AMLTsinghua University

The natural element method （NEM） is a newly- developed numerical method based on Voronoi diagram and Delaunay triangulation of scattered points, which adopts natural neighbour interpolation to construct trial functions in the framework of Galerkin method. Owing to its distinctive advantages, the NEM is used widely in many problems of computational mechanics. Utilizing the NEM, this paper deals with numerical limit analysis of structures made up of perfectly rigid-plastic material. According to kinematic the- orem of plastic limit analysis, a mathematical programming natural element formulation is established for determining the upper bound multiplier of plane problems, and a direct iteration algorithm is proposed accordingly to solve it. In this algorithm, the plastic incompressibility condition is handled by two different treatments, and the nonlinearity and nons- moothness of the goal function are overcome by distinguishing the rigid zones from the plastic zones at each iteration. The procedure implementation of iterative process is quite simple and effective because each iteration is equivalent to solving an associated elastic problem. The obtained limit load multiplier is proved to monotonically converge to the upper bound of true solution. Several benchmark examples are investigated to validate the significant performance of the NEM in the application field of limit analysis.

关键词： Upper bound limit analysis Meshless methodNatural neighbour interpolation Natural element methodMathematical programming iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

Specmurt analysis of polyphonic music signals

引用

IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING 2008年第3期16卷 639-650页

作者： Saito, Shoichiro Kameoka, Hirokazu Takahashi, Keigo Nishimoto, Takuya Sagayama, Shigeki Univ Tokyo Grad Sch Informat Sci & Technol Tokyo 1138656 Japan

This paper introduces a new music signal processing method to extract multiple fundamental frequencies, which we call specmurt analysis. In contrast with cepstrum which is the inverse Fourier transform of log-scaled power spectrum with linear frequency, specmurt is defined as the inverse Fourier transform of linear power spectrum with log-scaled frequency. Assuming that all tones in a polyphonic sound have a common harmonic pattern, the sound spectrum can be regarded as a sum of linearly stretched common harmonic structures along frequency. In the log-frequency domain, it is formulated as the convolution of a common harmonic structure and the distribution density of the fundamental frequencies of multiple, tones. The fundamental frequency distribution can be found by deconvolving the observed spectrum with the assumed common harmonic structure, where the common harmonic structure is given heuristically or quasi-optimized with an iterative algorithm. The efficiency of specmurt analysis is experimentally demonstrated through generation of a piano-roll-like display from a polyphonic music signal and automatic sound-to-MIDI conversion. Multipitch estimation accuracy is evaluated over several polyphonic music signals and compared with manually annotated MIDI data.

关键词： inverse filtering iteration algorithm multipitch analysis pitch visualization polyphonic music signals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：