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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

454 篇 会议
34 篇 期刊文献

馆藏范围

488 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

101 篇 工学
- 35 篇 电气工程
- 30 篇 计算机科学与技术...
- 28 篇 信息与通信工程
- 16 篇 机械工程
- 15 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 14 篇 软件工程
- 13 篇 仪器科学与技术
- 3 篇 船舶与海洋工程
- 3 篇 航空宇航科学与技...
- 3 篇 生物医学工程（可授...
- 2 篇 土木工程
- 2 篇 水利工程
- 1 篇 力学（可授工学、理...
- 1 篇 交通运输工程
14 篇 理学
- 7 篇 系统科学
- 3 篇 数学
- 3 篇 物理学
- 1 篇 地球物理学
- 1 篇 生物学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 管理学
- 5 篇 管理科学与工程(可...
4 篇 文学
- 4 篇 新闻传播学
1 篇 军事学
- 1 篇 军队指挥学
1 篇 艺术学
- 1 篇 设计学（可授艺术学...

主题

488 篇 pursuit algorith...
263 篇 matching pursuit...
147 篇 dictionaries
64 篇 signal processin...
52 篇 time frequency a...
48 篇 algorithm design...
46 篇 vectors
46 篇 iterative algori...
43 篇 signal processin...
40 篇 compressed sensi...
39 篇 signal analysis
39 篇 image coding
32 篇 convergence
30 篇 signal resolutio...
30 篇 channel estimati...
29 篇 video coding
27 篇 approximation al...
26 篇 computer science
26 篇 bit rate
26 篇 testing

机构

6 篇 carleton univ sc...
6 篇 school of inform...
5 篇 department of el...
5 篇 klipsch school o...
4 篇 department of el...
4 篇 department of ma...
3 篇 institute of inf...
3 篇 department of el...
3 篇 signal processin...
3 篇 univ agder dept ...
3 篇 department of el...
3 篇 school of comput...
3 篇 pee/coppe/del/ee...
3 篇 department of el...
3 篇 department of el...
3 篇 electrical and c...
3 篇 media & intercon...
3 篇 signal processin...
2 篇 department of el...
2 篇 lcc cellular ins...

作者

10 篇 p. vandergheynst
8 篇 j.h. husoy
7 篇 b.d. rao
6 篇 s. mallat
6 篇 d.m. monro
5 篇 k. engan
5 篇 e.a.b. da silva
5 篇 zhang xuan
5 篇 d.k. borah
5 篇 oommen b. john
5 篇 jiao lei
5 篇 s.o. aase
4 篇 m. vetterli
4 篇 a. yongacoglu
4 篇 g.z. karabulut
4 篇 b.j. oommen
4 篇 wen-liang hwang
4 篇 y.c. pati
4 篇 christian r. ber...
4 篇 h.r. rabiee

语言

476 篇 英文
7 篇 其他
5 篇 中文

检索条件"主题词=Pursuit Algorithms"

共 488 条记录，以下是71-80 订阅

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

详细简洁

排序：

Visual Distance Estimation for Pure pursuit Based Platooning with a Monocular Camera

Visual Distance Estimation for Pure Pursuit Based Platooning...

引用

American Control Conference

作者： Samuel Mitchell Imran Sajjad Ali Al-Hashimi Soodeh Dadras Ryan M. Gerdes Rajnikant Sharma Department of Electrical and Computer Engineering Utah State University Logan 84322 USA Department of Electrical and Computer Engineering Virginia Polytechnical Institute Blacksburg 24061 USA Department of Aerospace Engineering and Engineering Mechanics University of Cincinnati OH 45221 USA

ISBN: (纸本)9781509045839

We detail a sensing method used as a redundant sensor in automated vehicles. A monocular camera can be used to determine the bearing to a target, and this work extends the sensor capabilities to estimate the distance to the target. For a 640×400 pixel camera, the distance estimation has a 3m sensing range. A modified pure pursuit algorithm is presented which allows vehicle following at close proximity. The design of the experimental platform is described. The sensor system was utilized to enable a 1/10 scale vehicle to follow another vehicle at 3m s~(-1).

关键词： monocular camera Car following vehicle Sensor systems pursuit algorithms Automated vehicles

来源：评论

学校读者我要写书评

暂无评论

Basic pursuit of an adaptive impulse dictionary for bearing fault diagnosis

Basic pursuit of an adaptive impulse dictionary for bearing ...

引用

International Conference on Mechatronics and Control (ICMC)

作者： Jing Wang Jisheng Zhang Chang Chen Feng Tian Lingli Cui National Key Laboratory of Science and Technology on Aerospace Intelligence Control Beijing China Beijing Aerospace Automatic Control Institute Beijing China Key Laboratory of Advanced Manufacturing Technology Beijing University of Technology Beijing China

ISBN: (纸本)9781479925391

The sparse decomposition based on basic pursuit is an adaptive sparse expression of the signals. An adaptive basic pursuit algorithm that uses an impulse dictionary is introduced in this article for rolling bearing vibration signal processing and fault diagnosis. In the first, a new dictionary model is constructed according to the characteristics and mechanism of rolling bearing faults. Rotational speed of bearing, dimensions of bearing and bearing fault situation, among other parameters incorporates the new mode which could simulate the real fault impulse in different fault levels. Secondly a new method of dictionary establishment called adaptive impulse dictionary combine with basic pursuit introduced in this paper for bearing fault diagnosis. Adaptive impulse dictionary is created by changing characteristic parameters progressively, which make the dictionary built by this method has a lower redundancy and a higher relevance between each dictionary atom and the analyzed vibration signal. The basic pursuit algorithm of an adaptive impulse dictionary is adopted to analyze experiment signal of the early-stage fault signals and composite fault signals of the bearing. The results demonstrate the effectiveness of the basic pursuit algorithm that uses the adaptive impulse dictionary.

关键词： Dictionaries pursuit algorithms Fault diagnosis Vibrations Adaptation models Time-frequency analysis

来源：评论

学校读者我要写书评

暂无评论

Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition

Orthogonal matching pursuit: recursive function approximatio...

引用

Asilomar Conference on Signals, Systems & Computers

作者： Y.C. Pati R. Rezaiifar P.S. Krishnaprasad Information Systems Laboratory Department of Electrical Engineering University of Stanford Stanford CA USA Institute for Systems Research Department of Electrical Engineering University of Maryland College Park MD USA

We describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. affine (wavelet) frames. We propose a modification to the matching pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. We refer to this modified algorithm as orthogonal matching pursuit (OMP). It is shown that all additional computation required for the OMP algorithm may be performed recursively.< >

关键词： Matching pursuit algorithms Function approximation pursuit algorithms Dictionaries Convergence

来源：评论

学校读者我要写书评

暂无评论

pursuit Algorithm for optimized load scheduling

Pursuit Algorithm for optimized load scheduling

引用

International Power Engineering and Optimization Conference (PEOCO)

作者： S. Q. Ali S. D. Maqbool T. P. Imthias Ahamed N. H. Malik Saudi Aramco Chair in Electrical Power Department of Electrical Engineering King Saud University Riyadh Saudi Arabia

Demand Response (DR) has gained importance in the recent years. The prime objective of DR is to reduce the maximum demand. There are various DR schemes. This study focuses on price based DR schemes in which consumer is motivated to change his load demand pattern by pricing based incentives. The paper presents an algorithm to solve the load scheduling problem under variable pricing scheme. To this end the paper formulates the load scheduling problem as a singe stage decision making problem and solves it using pursuit Algorithm, which maintains an agreeable balance between exploration and exploitation. An algorithm to generate realistic loads is also presented. Simulation experiments were conducted considering different types of loads and pricing.

关键词： Load modeling Optimization pursuit algorithms Pricing Switches Scheduling Power engineering

来源：评论

学校读者我要写书评

暂无评论

A Group Matching pursuit Algorithm for Sparse Channel Estimation for OFDM Transmission

A Group Matching Pursuit Algorithm for Sparse Channel Estima...

引用

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

作者： Chun-Jung Wu D.W. Lin Department of Electronics Engineering and Center for Telecommunications Research National Chiao Tung University Hsinchu Taiwan

Time-domain channel estimation techniques have been proposed for OFDM systems for their ability to yield relatively accurate estimates with only a few pilots. Key information needed in such techniques is the multipath delays of the channel. Prior approaches to estimation of multipath delays require regular pilot structures and may not work in slow fading. We propose a group matching pursuit technique for channel estimation. The technique is an extension of the orthogonal matching pursuit technique. It employs the pilots in several OFDM symbols to estimate the multipath delays in a sequential manner, where the pilots can have an arbitrary structure. Simulation results show that the proposed algorithm has superior performance

关键词： Matching pursuit algorithms pursuit algorithms Channel estimation OFDM Delay estimation Signal processing algorithms Time domain analysis Frequency estimation Interpolation Fading

来源：评论

学校读者我要写书评

暂无评论

Projection pursuit in high dimensional data reduction: initial conditions, feature selection and the assumption of normality

Projection pursuit in high dimensional data reduction: initi...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： L. Jimenez D.A. Landgrebe School of Electrical Engineering Purdue University West Lafayette IN USA

Supervised classification techniques use labeled samples to train the classifier. Often the number of such samples is limited, thus limiting the precision with which class characteristics can be estimated. As the number of spectral bands becomes large, the limitation on performance imposed by the limited number of training samples can become severe. Such consequences suggest the value of reducing the dimensionality by a pre-processing method that takes advantage of the asymptotic normality of projected data. Using a technique called projection pursuit, a pre-processing dimensional reduction method has been developed based on the optimization of a projection index. A method to estimate an initial value that can more quickly lead to the global maximum is presented for projection pursuit using the Bhattacharyya distance as the projection index.

关键词： Hyperspectral imaging pursuit algorithms Gaussian distribution Optimization methods Data mining Statistics Parameter estimation Feature extraction H infinity control State estimation

来源：评论

学校读者我要写书评

暂无评论

Matching pursuit of images

Matching pursuit of images

引用

IEEE International Conference on Image Processing

作者： F. Bergeaud S. Mallat Applied Mathematics Laboratory Ecole Centrale Paris France Courant Institute of Mathematical Sciences New York University New York NY USA

A crucial problem in image analysis is to construct efficient low-level representations of an image, providing precise characterization of features which compose it, such as edges and texture components. An image usually contains very different types of features, which have been successfully modelled by the very redundant family of 2D Gabor oriented wavelets, describing the local properties of the image: localization, scale, preferred orientation, amplitude and phase of the discontinuity. However, this model generates representations of very large size. Instead of decomposing a given image over this whole set of Gabor functions, we use an adaptive algorithm (called matching pursuit) to select the Gabor elements which approximate at best the image, corresponding to the main features of the image. This produces compact representation in terms of few features that reveal the local image properties. Results proved that the elements are precisely localized on the edges of the images, and give a local decomposition as linear combinations of "textons" in the textured regions. We introduce a fast algorithm to compute the matching pursuit decomposition.

关键词： Matching pursuit algorithms Dictionaries pursuit algorithms Image representation Explosions Mathematics Image edge detection Image texture analysis Image analysis Data compression

来源：评论

学校读者我要写书评

暂无评论

Speech Unit Selection Based on Matching pursuit

Speech Unit Selection Based on Matching Pursuit

引用

ACS/IEEE International Conference on Computer Systems and Applications

作者： M. Hosseinpour M.N. Ranjbar M. Mousavinejad Multimedia Computing Group Iran Telecommunication Research Center Iran

This paper introduces a new method based on Matching pursuit for speech unit selection. We used the Matching pursuit transform parameters with a comparison algorithm to find the best match for a selected unit in a Text-To-Speech system based on concatenation. We chose Gabor atoms. Also Wigner-Ville distribution implemented for the time-frequency presentation of the transform and we used image processing approach to compare these time-frequency presentations of the acoustic units. On a database of 42 units 92% accuracy was obtained.

关键词： Matching pursuit algorithms Speech synthesis Time frequency analysis Concatenated codes Multimedia computing Electronic mail pursuit algorithms Image processing Image databases Acoustic waves

来源：评论

学校读者我要写书评

暂无评论

LOW COMPLEXITY APPROXIMATE CYCLIC ADAPTIVE MATCHING pursuit

LOW COMPLEXITY APPROXIMATE CYCLIC ADAPTIVE MATCHING PURSUIT

引用

European Signal Processing Conference

作者： Alexandru Onose Bogdan Dumitrescu Department of Signal Processing Tampere University of Technology

ISBN: (纸本)9781467310680

Based on the iterated cyclic adaptive matching pursuit algorithm, we construct a low complexity approximate variant for finding sparse solutions to systems of linear equations. We employ a greedy neighbor permutation strategy coupled with an approximate scalar product matrix to ensure that the complexity of the algorithm remains low. The sparse solution is cyclically updated improving the performance while the spar-sity level is estimated online using the predictive least squares criterion. The performance of the algorithm is similar to that of the non approximate variants while the complexity can be considerably lower.

关键词： Matching pursuit Sparse filters Greedy algorithm Channel identification Complexity Linear system of equations Approximate Matching pursuit algorithms pursuit algorithms Dot product algorithms

来源：评论

学校读者我要写书评

暂无评论

Application of tree-based searches to matching pursuit

Application of tree-based searches to matching pursuit

引用

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

作者： S.F. Cotter B.D. Rao Electrical and Computer Engineering Department University of California San Diego La Jolla CA USA

Matching pursuit (MP) uses a greedy search to construct a subset of vectors, from a larger set, which best represents a signal of interest. We extend this search for the best subset by keeping the K vectors which maximize the selection criterion at each iteration. This is termed the MP:K algorithm and represents a suboptimal search through the tree of all possible subsets where each node is limited to having K children. As a more suboptimal search, we can use the M-L search to select a subset of dictionary vectors, leading to the MP:M-L algorithm. We compare the computation and storage requirements for three variants of the MP algorithm using these searches. Through simulations, the significantly improved performance obtained using the MP:K and MP:M-L algorithms is demonstrated. We conclude that the modified matching pursuit (MMP) algorithm offers the best compromise between performance and complexity using these search techniques.

关键词： Matching pursuit algorithms Dictionaries pursuit algorithms Application software Speech coding Biomagnetics Inverse problems Stock markets Costs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：