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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

14,473 篇 会议
2,158 篇 期刊文献
4 篇 学位论文
1 篇 资讯

馆藏范围

16,636 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,932 篇 工学
- 2,073 篇 电气工程
- 1,040 篇 计算机科学与技术...
- 631 篇 信息与通信工程
- 552 篇 控制科学与工程
- 394 篇 电子科学与技术（可...
- 340 篇 机械工程
- 315 篇 仪器科学与技术
- 272 篇 软件工程
- 117 篇 核科学与技术
- 100 篇 生物医学工程（可授...
- 81 篇 交通运输工程
- 54 篇 测绘科学与技术
- 40 篇 航空宇航科学与技...
- 32 篇 网络空间安全
- 24 篇 光学工程
- 24 篇 材料科学与工程（可...
- 19 篇 力学（可授工学、理...
- 15 篇 石油与天然气工程
813 篇 理学
- 331 篇 物理学
- 245 篇 数学
- 172 篇 系统科学
- 42 篇 地球物理学
- 20 篇 化学
- 16 篇 生物学
278 篇 管理学
- 274 篇 管理科学与工程(可...
222 篇 医学
- 181 篇 临床医学
- 74 篇 特种医学
- 19 篇 基础医学(可授医学...
136 篇 文学
- 136 篇 新闻传播学
29 篇 艺术学
- 28 篇 设计学（可授艺术学...
14 篇 军事学
11 篇 农学
8 篇 经济学
4 篇 教育学
2 篇 法学

主题

16,636 篇 iterative algori...
2,287 篇 iterative method...
2,035 篇 algorithm design...
1,671 篇 convergence
1,449 篇 iterative decodi...
1,122 篇 image reconstruc...
1,049 篇 signal processin...
1,044 篇 computer science
1,004 篇 clustering algor...
956 篇 equations
760 篇 testing
758 篇 robustness
638 篇 partitioning alg...
563 篇 computational mo...
549 篇 costs
549 篇 maximum likeliho...
489 篇 control systems
488 篇 hardware
486 篇 parity check cod...
479 篇 parameter estima...

机构

45 篇 institute for in...
43 篇 school of electr...
35 篇 department of el...
30 篇 department of el...
30 篇 department of el...
28 篇 school of electr...
28 篇 department of el...
27 篇 department of el...
27 篇 department of el...
27 篇 school of electr...
25 篇 department of el...
24 篇 department of el...
22 篇 department of el...
22 篇 microsoft resear...
22 篇 department of el...
21 篇 school of electr...
21 篇 ibm thomas j. wa...
21 篇 department of el...
21 篇 department of el...
19 篇 department of el...

作者

23 篇 e. rogers
22 篇 j.a. fessler
22 篇 a.k. katsaggelos
21 篇 xianlong hong
19 篇 d.h. owens
18 篇 c.-c.j. kuo
17 篇 li zhang
15 篇 j. white
14 篇 a.e. yagle
14 篇 jing wang
14 篇 yonghuai liu
13 篇 shidong zhou
13 篇 a. anastasopoulo...
13 篇 chong-yung chi
13 篇 w.c. chew
12 篇 dacheng yang
12 篇 an-yeu wu
12 篇 m. fossorier
12 篇 m.a. king
12 篇 eric rogers

语言

16,194 篇 英文
372 篇 其他
66 篇 中文
2 篇 法文
1 篇 西班牙文
1 篇 土耳其文

检索条件"主题词=Iterative algorithms"

共 16636 条记录，以下是221-230 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

General methodology for mapping iterative approximation algorithms to adaptive dynamically partially reconfigurable systems

General methodology for mapping iterative approximation algo...

引用

International Conference on Field Programmable Logic and Applications

作者： Josef Angermeier Abdulazim Amouri Jurgen Teich Department of Computer Science University of Erlangen Nuremberg Erlangen Germany

This paper presents a general methodology for mapping a class of algorithms known as iterative algorithms to FPGA-based dynamically partially reconfigurable architectures in an adaptive and efficient manner. Hereby, each iteration step is mapped to a partial module on the FPGA, and modules can be added or removed to these connected modules on the FPGA dynamically using partial reconfiguration. The more modules and iteration steps, respectively, are concurrently executed on the FPGA, the higher the achieved through-put due to exploitation of pipelining in the design. Especially, numerical approximation algorithms allow a trade-off between precision of the final result and the execution time, and benefit by the proposed mapping methodology: When mapping an element of that class of algorithms to a partially dynamically reconfigurable platform, the number of modules can be increased or decreased at runtime depending on the desired quality of the results and the available area. Thus, the proposed general mapping methodology provides an acceleration of an important class of algorithms due to the execution in hardware, and allows at runtime a trade-off decision between execution time and quality of the results. Furthermore, a detailed description of an experimental implementation of a square root calculation on a reconfigurable platform is given as a prototype example to explain and show the benefits of the proposed approach.

关键词： iterative methods Approximation algorithms Heuristic algorithms iterative algorithms Field programmable gate arrays Runtime Reconfigurable architectures Pipeline processing Acceleration Hardware

来源：评论

学校读者我要写书评

暂无评论

iterative projection algorithms for removing the blocking artifacts of block-DCT compressed images

Iterative projection algorithms for removing the blocking ar...

引用

1993 IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Y. Yang N.P. Galatsanos A.K. Katsaggelos Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago IL USA Department of Electrical Engineering and Computer Science Northwestern University Evanston IL USA

iterative projection algorithms for reconstructing visually pleasing images from block discrete cosine transform (BDCT) compressed image data are presented. Two algorithms are proposed. The first is based on the theory of projections onto convex sets (POCS). The second is motivated by the theory of POCS. In order for the POCS approach to be effective, the convex sets must be as pertinent as possible to the required objective. For the deblocking of the DCT compressed images two types of constraint sets capture most of the information pertinent to this problem: the set that contains the information of the transmitted DCT coefficients and the sets that express the between-block smoothness properties of the desired image. The proposed iterative reconstruction algorithms have been tested thoroughly on different DCT-based compression approaches for a number of 256*256 and 512*512 images. The experimental results demonstrate that the proposed algorithms yield superior images to those obtained by direct reconstruction from the compressed data only.< >

关键词： Projection algorithms Image coding Discrete cosine transforms iterative algorithms Image reconstruction Visual communication Convergence Data compression Discrete transforms Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Comparative study of iterative deconvolution algorithms

Comparative study of iterative deconvolution algorithms

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： R. Mersereau R. Schafer School of Electrical Engineering Georgia Institute of Technology Atlanta GA USA

It is shown that a number of well known iterative deconvolution algorithms are closely related members of a general class. This point of view leads to new understanding of previous approaches and to a new algorithm that incorporates both a finite interval constraint and a positivity constraint on the output of the deconvolution process. Examples are given to illustrate performance on gamma-ray spectra.

关键词： Deconvolution iterative algorithms Convergence Filters Bandwidth Frequency Fourier transforms Equations Convolution Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

Image contour analysis using iterative search algorithms based on wavelet transform

Image contour analysis using iterative search algorithms bas...

引用

IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications

作者： Svetlana Antoshchuk Anatoly Nikolenko Oksana Babilunga Katerina Kapunova Department of Information Systems Odessa National Polytechnic University Odessa Ukraine

The article is devoted to use wavelet transform, that have properties of frequency-spatial selectivity, and detect information elements of object (for example, contour) with required detailed elaboration. The morphological operator on wavelet transform base was developed. It allows receiving the contour description at different hierarchy levels. The algorithm of getting contour points on a base of iterative quasi Newton method of extremum search of function at wavelet transform space was developed. The algorithm of image contour analysis based on iterative search algorithms in wavelet transform space was offered.

关键词： Image analysis Algorithm design and analysis iterative algorithms Wavelet analysis Wavelet transforms Frequency Object detection Image recognition Image segmentation Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Characteristics of proton CT images reconstructed with filtered backprojection and iterative projection algorithms

Characteristics of proton CT images reconstructed with filte...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： Scott N. Penfold Reinhard W. Schulte Yair Censor Vladimir Bashkirov Anatoly B. Rosenfeld Centre for Medical Radiation Physics University of Wollongong Wollongong NSW Australia Department of Radiation Medicine Medical Center Loma Linda University Loma Linda CA USA Department of Mathematics University of Haifa Haifa Israel

In early studies of proton computed tomography (pCT), images were reconstructed with the fast and robust filtered backprojection (FBP) algorithm. Due to multiple Coulomb scattering of the protons within the object, the straight line path assumption of FBP resulted in poor spatial resolution. In an attempt to improve spatial resolution, a formalism to predict the proton path of maximum likelihood through the image space was created. The use of these paths with the iterative algebraic reconstruction technique (ART), have shown an improvement in spatial resolution, but also an increase in image noise, resulting in poor density resolution. In this work, we propose a reconstruction method that attempts to optimize both spatial and density resolution of pCT images. The new reconstruction approach makes use of the block-iterative diagonally relaxed orthogonal projections (DROP) algorithm with an initial FBP-reconstructed image estimate. Reconstruction of Monte Carlo simulated pCT data sets of spatial and density resolution phantoms demonstrated that the combined reconstruction approach resulted in better spatial resolution than the FBP algorithm alone and better density resolution than the DROP algorithm starting from a uniform initial image estimate.

关键词： Protons Computed tomography Image reconstruction Projection algorithms Spatial resolution Image resolution Robustness iterative algorithms Scattering Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Linear and iterative reconstruction algorithms for a novel PET-insert scanner

Linear and iterative reconstruction algorithms for a novel P...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： D. Pal Yuan-Chuan Tai M. Janecek Heyu Wu A. O'Sullivan Dept. of Biomedical Engineering Washington University St. Louis USA Mallinckrodt Institute of Radiology Washington University of Saint Louis USA Mallinckrodt Institute of Radiology Washington University St. Louis Electrical and Systems Engineering Washington University St. Louis

Tai, et al. are developing insert devices for existing clinical PET scanners to improve the image resolution. Adding the insert inside the scanner leads to three types of coincidences: insert-insert, insert-scanner and scanner-scanner. The challenges in image reconstruction include development of a linear reconstruction algorithm for the insert-scanner coincidences, development of a linear reconstruction algorithm that incorporates all measurements, and development of an iterative (expectation-maximization) algorithm to form a maximum likelihood estimate of the image given all of the data. The data from the set of insert-insert coincidences and from the set of scanner-scanner coincidences each can be used in conventional linear reconstruction algorithms based on data from a ring of detectors. However, the geometry of an insert ring and a scanner ring together is analogous to the fan-beam geometry of fourth generation transmission tomography systems; this analogy leads to a new linear reconstruction algorithm for these data. The resulting algorithm was implemented on both simulated and experimental data, yielding promising results with few artifacts. Our development of an iterative algorithm is based on the standard expectation-maximization algorithm. The novelty of the iterative algorithm is in the incorporation of the details of the geometry, which is based in part on our characterization of the insert-scanner geometry.

关键词： Reconstruction algorithms iterative algorithms Geometry Positron emission tomography Image resolution Image reconstruction Maximum likelihood detection Maximum likelihood estimation Detectors Standards development

来源：评论

学校读者我要写书评

暂无评论

iterative Reweighted algorithms for Joint User Identification and Channel Estimation in Spatially Correlated Massive MTC

Iterative Reweighted Algorithms for Joint User Identificatio...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Hamza Djelouat Markus Leinonen Markku Juntti Centre for Wireless Communications – Radio Technologies FI-90014 University of Oulu Finland

Joint user identification and channel estimation (JUICE) is a main challenge in grant-free massive machine-type communications (mMTC). The sparse pattern in users' activity allows to solve the JUICE as a compressed sensing problem in a multiple measurement vector (MMV) setup. This paper addresses the JUICE under the practical spatially correlated fading channel. We formulate the JUICE as an iterative reweighted l 2,1 -norm optimization. We develop a computationally efficient alternating direction method of multipliers (ADMM) approach to solve it. In particular, by leveraging the second-order statistics of the channels, we reformulate the JUICE problem to exploit the covariance information and we derive its ADMM-based solution. The simulation results highlight the significant improvements brought by the proposed approach in terms of channel estimation and activity detection performances.

关键词： Fading channels Simulation Channel estimation Signal processing algorithms Particle measurements Minimization iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

An experimental study of the effects of noise on a class of iterative deconvolution algorithms

An experimental study of the effects of noise on a class of ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： M. Richards R. Schafer R. Mersereau School of Electrical Engineering Georgia Institute of Technology Atlanta GA USA

There has recently been considerable interest in iterative deconvolution algorithms. Some of these algorithms seek to improve performance by incorporating á priori knowledge of the components of a convolution. For example, incorporation of both positivity and finite interval constraints tends to automatically introduce an extrapolation of the bandwidth. A question which naturally arises concerns the effect of noise on the performance of such algorithms. In this paper we describe an experimental evaluation of the effect of noise using synthetic data. Results of extensive tests are presented and some suggestions for mitigating the effects of noise are offered.

关键词： Deconvolution iterative algorithms Bandwidth Convolution Extrapolation Equations Testing Signal processing Convergence Image converters

来源：评论

学校读者我要写书评

暂无评论

Pipelined two step iterative matching algorithms for CIOQ crossbar switches 05

Pipelined two step iterative matching algorithms for CIOQ cr...

引用

ACM/IEEE Symposium Architecture for Networking and Communications Systems, ANCS

作者： Deng Pan Yuanyuan Yang Department of Computer Science State University of New York Stony Brook NY USA Department of Electrical & Computer Engineering State University of New York Stony Brook NY USA

ISBN: (纸本)9781595930828

Traditional iterative matching algorithms for VOQ switches need three steps, i.e., request, grant and accept. By incorporating arbitration into the request step, two step iterative matching can be achieved. This enables simpler implementation and shorter scheduling time, while maintaining almost identical performance. As an example of the two step iterative matching algorithms, in this paper we present two step parallel iterative matching (PIM2), and theoretically prove that its average convergence iterations are less than In N + e/(e - 1) for an N X N switch. Furthermore, two step iterative matching algorithms can be efficiently pipelined on CIOQ switches so that two matchings can be obtained in each time slot. We propose a scheme called second of line (SOL) matching to provide two independent virtual switches, with which the pipelining can be achieved without additional scheduling time and arbitration hardware. More importantly, the pipelined algorithms are theoretically guaranteed to achieve 100% throughput for any admissible traffic. Extensive simulations are conducted to show that our analytical result on the average convergence iterations In N + e/(e - 1) is more accurate than the classical result log 2 N + 4/3, and to test the performance of different pipelined algorithms on CIOQ switches.

关键词： iterative algorithms Switches Convergence Pipeline processing Hardware Throughput Traffic control Analytical models Performance analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Mean-variance analysis of block-iterative reconstruction algorithms modeling 3D detector response in SPECT

Mean-variance analysis of block-iterative reconstruction alg...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： D.S. Lalush B.M.W. Tsui Department of Biomedical Engineering and Department of Radiology University of North Carolina Chapel Hill USA

The authors study the statistical convergence properties of two fast iterative reconstruction algorithms, the rescaled block-iterative (RBI) and ordered subset (OS) EM algorithms, in the context of cardiac SPECT with 3D detector response modeling. The Monte Carlo method was used to generate nearly noise-free projection data modeling the effects of attenuation, detector response, and scatter from the MCAT phantom. One thousand noise realizations were generated with an average count level approximating a typical Tl-201 cardiac study. Each noise realization was reconstructed using the RBI and OS algorithms for cases with and without detector response modeling. For each iteration up to twenty, the authors generated mean and variance images, as well as covariance images for six specific locations. Both OS and RBI converged in the mean to results that were not significantly different from the noise-free ML-EM result using the same projection model. When detector response was not modeled in the reconstruction, RBI exhibited considerably lower noise variance than OS for the same resolution. When 3D detector response was modeled, the two algorithms provided the same noise variance to resolution recovery tradeoff, while OS required about half the number of iterations of RBI to reach the same point. The authors conclude that OS is faster than RBI, but may be sensitive to errors in the projection model. Both OS-EM and RBI-EM are effective alternatives to the ML-EM algorithm, but noise level and speed of convergence depend on the projection model used.

关键词： Algorithm design and analysis Reconstruction algorithms Detectors Convergence Noise generators Noise level Image reconstruction iterative algorithms Context modeling Attenuation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 19 20 21 22 23 24 25 26 27 28 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：