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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

176 篇 会议

馆藏范围

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

日期分布

学科分类号

153 篇 工学
- 120 篇 电气工程
- 52 篇 信息与通信工程
- 50 篇 计算机科学与技术...
- 20 篇 软件工程
- 16 篇 仪器科学与技术
- 7 篇 测绘科学与技术
- 4 篇 电子科学与技术（可...
- 3 篇 光学工程
- 2 篇 力学（可授工学、理...
- 2 篇 控制科学与工程
- 2 篇 航空宇航科学与技...
97 篇 理学
- 64 篇 物理学
- 37 篇 数学
- 4 篇 统计学（可授理学、...
- 1 篇 系统科学
56 篇 医学
- 56 篇 临床医学

主题

54 篇 signal processin...
25 篇 time-frequency a...
16 篇 fourier transfor...
16 篇 image processing
12 篇 signal to noise ...
11 篇 digital signal p...
9 篇 sensors
9 篇 electronic filte...
8 篇 interference (co...
8 篇 time-frequency
7 篇 signal detection
7 篇 matrices
7 篇 computer arithme...
7 篇 radar
7 篇 signal processin...
7 篇 array processing
6 篇 parallel process...
6 篇 frequency modula...
6 篇 convolution
6 篇 computing system...

机构

7 篇 cuny ny 10021 us...
5 篇 us dept def ft g...
4 篇 univ windsor vls...
4 篇 univ pittsburgh ...
4 篇 michigan state u...
3 篇 villanova univ c...
3 篇 univ calif los a...
3 篇 drexel univ dept...
2 篇 ctr rech ecoles ...
2 篇 informat syst la...
2 篇 defence science ...
2 篇 univ calif los a...
2 篇 penn state univ ...
2 篇 politecn torino ...
2 篇 mit lincoln lab ...
2 篇 univ calif los a...
2 篇 politecn torino ...
2 篇 saab ab gothenbu...
2 篇 univ. of califor...
2 篇 villanova univ.

作者

11 篇 cohen l
7 篇 yao k
5 篇 nelson dj
5 篇 amin mg
5 篇 williams wj
4 篇 lorenzelli f
4 篇 loughlin p
4 篇 cohen leon
4 篇 jullien ga
3 篇 suter bw
3 篇 miller wc
3 篇 galleani l
3 篇 zhang ym
3 篇 paindavoine m
3 篇 rabinkin dv
3 篇 nawab sh
3 篇 chun j
3 篇 frazer gj
2 篇 oneill jc
2 篇 a. worm

语言

176 篇 英文

检索条件"任意字段=Conference on Advanced Signal Processing Algorithms, Architectures, and Implementations VI"

共 176 条记录，以下是101-110 订阅

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

详细简洁

排序：

A multivariate speech activity detector based on the syllable rate

A multivariate speech activity detector based on the syllabl...

引用

SPIE conference on advanced signal processing algorithms, architectures, and implementations viII

作者： Smith, D Townsend, J Nelson, DJ US Dept Def Ft George G Meade MD 20755 USA

ISBN: (纸本)0819429163

Computationally efficient algorithms which perform speech activity detection have significant potential economic and labor saving benefit, by automating an extremely tedious manual process. In many applications, it is desirable to extract intervals of speech which are bounded by segments of other signal types (fax/modem, music, static, dial tones, etc.). In the past, algorithms which successfully discriminate between speech and one specific other signal type have been developed. Frequently, these algorithms fail when the specific non-speech signal is replaced by a different non-speech signal. Little work has been done on combining such discriminators in order to solve the general speech vs. non-speech discrimination problem. Typically, several signal specific discriminators are blindly combined with predictable negative results. Moreover, when a large number of discriminators are involved, dimension reduction is achieved using Principal Components, which optimally compresses signal variance into the fewest number of dimensions. Unfortunately, these new coordinates are not necessarily optimal for discrimination. In this paper we apply graphical tools to determine a set of discriminators which produce excellent speech vs. non-speech clustering, thereby eliminating the guesswork in selecting good feature vectors. This cluster structure provides a basis for a general multivariate speech vs. non-speech discriminator, which compares very favorably with the TALKATIVE speech extraction algorithm.

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

How bad are symmetric Pick matrices

How bad are symmetric Pick matrices

引用

conference on advanced signal processing algorithms, architectures, and implementations X

作者： Fasino, D Olshevsky, V Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy

ISBN: (纸本)0819437611

Let P be a symmetric positive definite Pick matrix of order n. The following facts will be proven here: 1. P is the Gram matrix of a set of rational functions, with respect to a inner product defined in terms of a "generating function" associated to P;2. Its condition number is lower-bounded by a function growing exponentially in n. 3. P can be effectively preconditioned by the Pick matrix generated by the same nodes and a constant function.

关键词： Matrices Condition numbers algorithms Computing systems Control systems Image information entropy Linear algebra Mathematics Platinum signal processing

来源：评论

学校读者我要写书评

暂无评论

Performance of space-frequency codes for MIMO OFDM systems

Performance of space-frequency codes for MIMO OFDM systems

引用

conference on advanced signal processing algorithms architectures and implementations XIII

作者： Wang, JB Yao, K Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

ISBN: (纸本)0819450782

Concatenation of space-time (ST) coding with orthogonal frequency-division multiplexing (OFDM) has gained much interest recently. In this work, we derive the exact pairwise error probability (PEP) of space-frequency (SF) codes for MIMO OFDM Systems. Based on the exact PEP, we derive the tighter upper and lower bounds for the PEP. For asymptotically high SNRs, the design criteria for SF codes differ significantly from those for ST codes over flat fading channels. In this paper, by drawing an analogy between SF and ST codes, we show that when the number of receive antennas is large, the minimum Euclidean distance among code words dominates the performance of SF codes. Therefore, SF codes can be optimized by using the Euclidean-distance criterion valid for AWGN channels. Simulation results are given to show that the results valid for a number of receive antennas tending to infinity still provide correct indications when the number of antennas is small.

关键词： Orthogonal frequency division multiplexing Antennas Modulation Lutetium signal to noise ratio Computer simulations Demodulation signal processing

来源：评论

学校读者我要写书评

暂无评论

Performance of coherent adaptation algorithms for the WCDMA smart antenna system in Rayleigh flat-fading channel

Performance of coherent adaptation algorithms for the WCDMA ...

引用

conference on advanced signal processing algorithms, architectures, and implementations XI

作者： Kong, DG Lee, K Chun, J Choi, P Yun, JC Lee, SJ Lee, JH Samsung Adv Inst Technol Human Comp Interact Lab Suwon South Korea

ISBN: (纸本)0819441880

Coherent adaptation algorithms are proposed for a beamformer in the WCDMA reverse link. The coherent adaptation algorithm improves the convergence speed by constraining the desired signal component of the filtered output to be always coherent in phase with the reference signal at each iteration. With the coherent constraint, the performance of coherent methods is significantly improved. We present the simulation results that show the various desirable characteristics of coherent methods such as a fast convergence speed. insensitiveness to fading parameters over conventional methods.

关键词： coherent adaptation algorithm smart antenna WCDMA array signal processing

来源：评论

学校读者我要写书评

暂无评论

Spatial polarimetric time-frequency distributions and applications to direction-of-arrival estimation

Spatial polarimetric time-frequency distributions and applic...

引用

conference on advanced signal processing algorithms architectures and implementations XIII

作者： Zhang, YM Amin, MG Obeidat, BA Villanova Univ Ctr Adv Commun Villanova PA 19085 USA

ISBN: (纸本)0819450782

Time-frequency distributions (TFDs) have evolved to be a powerful technique for nonstationary signal analysis and synthesis. With the use of a multi-sensor array, spatial time-frequency distributions (STFDs) have been developed and successfully applied to high-resolution direction-of-arrival (DOA) estimation and blind recovery of the source waveforms. In this paper, the polarimetric dimension is introduced to the STFDs resulting in the spatial polarimetric time-frequency distributions (SPTFDs) as a platform for the processing of non-stationary polarized signals. In the SPTFD platform, polarized signals are decomposed (projected) into two orthogonal polarization components, such as horizontal and vertical, and later processed in a manner where their polarization characteristics are exploited. This empowers the STFDs with additional degrees of freedom and improves the robustness of the signal and noise subspaces, and therefore, serving to enhance DOA estimation, signal recovery, and source separation performance. To demonstrate the advantages of the SPTFDs, the polarimetric time-frequency MUSIC (PTF-MUSIC) method for DOA estimation is proposed based on the SPTFD platform and is shown to outperform the time-frequency, polarimetric, and conventional MUSIC methods.

关键词： time-frequency distributions array signal processing polarization smart antennas MUSIC

来源：评论

学校读者我要写书评

暂无评论

Image processing and low discrepancy sequences

Image processing and low discrepancy sequences

引用

conference on advanced signal processing algorithms, architectures, and implementations IX

作者： Nair, D Wenzel, L Natl Instruments Austin TX 78727 USA

ISBN: (纸本)0819432938

It is well known that high-dimensional integrals can be solved with Monte Carlo algorithms. Recently, it was discovered that there is a relationship between low discrepancy sets and the efficient evaluation of higher-dimensional integrals. Theory suggests that for midsize dimensional problems, algorithms based on low discrepancy sets should out perform all other existing methods by an order of magnitude in terms of the number of sample points used to evaluate the integrals. We show that the field of image processing can potentially take advantage of specific properties of low discrepancy sets. To illustrate this, we applied the theory of low discrepancy sequences to some relatively simple image processing and computer vision related operations such as the estimation of gray level image statistics, fast location of objects in a binary image and the reconstruction of images from a sparse set of points. Our experiments show that compared to standard methods, the proposed new algorithms are faster and statistically more robust. Classical low discrepancy sets based on the Halton and Sobol' sequences were investigated thoroughly and showed promising results. The use of low discrepancy sequences in image processing for image characterization, understanding and object recognition is a novel and promising area for further investigation.

关键词： sampling random sampling low-discrepancy sequences image statistics image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Approximation by structured lower rank matrices

Approximation by structured lower rank matrices

引用

SPIE conference on advanced signal processing algorithms, architectures, and implementations viII

作者： Chu, MT Funderlic, RE Plemmons, RJ N Carolina State Univ Dept Math Raleigh NC 27695 USA

ISBN: (纸本)0819429163

We consider two general procedures for constructing the nearest approximation of a given matrix by one with any lower rank and any linear structure. Nearness can be measured in any matrix norm. Structured low rank matrices arise in various applications, including image enhancement and model reduction. In practice, the empirical data collected in the matrix often either do not maintain the specified structure or do not induce the desirable rank. It is an important task to search for the nearest structured lower rank approximation of a given matrix. The techniques developed in this paper can easily be implemented for numerical computation. In particular, it is shown that the computations can be approached using efficient optimization packages. The special case of Toeplitz structure using the Frobenius matrix norm is discussed in detail to illustrate the ideas, and numerical tests are reported. The procedures developed herein can be generalized to consider a much broader range of approximation problems.

关键词： Matrices signal processing MATLAB Optimization (mathematics) Image enhancement Computer programming Computer science Fourier transforms Image processing Mathematics

来源：评论

学校读者我要写书评

暂无评论

A spectral phase algorithm for detecting and estimating pitch

A spectral phase algorithm for detecting and estimating pitc...

引用

conference on advanced signal processing algorithms, architectures, and implementations XI

作者： Tempkin, JA Nelson, DJ USA Dept Def Ft George G Meade MD 20755 USA

ISBN: (纸本)0819441880

We describe a fast and efficient algorithm for automatic detection and estimation of the fundamental frequency F0 of a harmonic time-domain signal. The method is based on differentiation of the short time Fourier transform (STFT) phase, which is implemented as a cross-spectral product. In estimating and isolating the fundamental frequency, several enhancement processes are developed and applied to the TF surface to improve the signal quality. We describe the algorithm in detail and demonstrate the processing gain achieved at each step. In addition, we apply the algorithm to human speech to recover the pitch fundamental F0 and report the evaluation of the algorithm's performance on the Western Michigan vowel corpus [3].

关键词： signal processing

来源：评论

学校读者我要写书评

暂无评论

Time-varying frequencies of a signal

Time-varying frequencies of a signal

引用

conference on advanced signal processing - algorithms, architectures, and implementations viI

作者： Loughlin, PJ Univ. of Pittsburgh (United States)

ISBN: (纸本)0819425842

We consider the definition and interpretation of instantaneous frequency and other time-varying frequencies of a signal, and related concepts of instantaneous amplitude, instantaneous bandwidth and the time-varying spectrum of a signal. A definition for the average frequency at each time is given, and we show that spectrograms and Cohen-Posch time-frequency distributions can yield this result for the first conditional moment in frequency. For some signals this result equals the instantaneous frequency, but generally instantaneous frequency is not the average frequency at each time in the signal. We discuss monocomponent versus multicomponent signals, and give an estimate of the time-varying spectrum given the instantaneous frequencies and bandwidths of the components. We also consider the role of the complex signal in defining instantaneous amplitude, frequency and bandwidth, and ways to obtain a complex signal satisfying certain physical properties, given a real signal (or its time-varying spectrum). Depending upon the physical properties desired (e.g., the instantaneous amplitude of a magnitude-bounded signal should itself be bounded), one obtains different complex representations - and hence different instantaneous amplitudes, frequencies and bandwidths - of the given signal.

关键词： instantaneous frequency, bandwidth Hilbert transform analytic signal time-frequency conditional moments maximum entropy density

来源：评论

学校读者我要写书评

暂无评论

Progressive image decoding based on the inverse discrete cosine transform

Progressive image decoding based on the inverse discrete cos...

引用

conference on advanced signal processing - algorithms, architectures, and implementations viI

作者： Winograd, JM Nawab, SH Boston Univ. (United States)

ISBN: (纸本)0819425842

A new architecture is presented for incremental computation of the two-dimensional inverse discrete cosine transform (2D-IDCT) in the context of progressive image decoding. This architecture offers advantages over existing DCT inversion techniques for systems used in conjunction with progressive image coding schemes or those that must operate in environments with severe and/or time-varying resource constraints (e.g. real-time and low-power systems). The use of a bit-serial distributed arithmetic approach comprised of parallel input-pruned 2D-IDCT processing elements enables low-quality image reconstructions to be quickly and efficiently obtained using only a subset of the DCT coefficient bit stream. Initial approximate reconstructions can be improved in subsequent stages of incremental refinement according to the availability of processing resources or DCT coefficient data. Analysis is presented of image degradation at successive stages, illustrating uniform improvement according to quantitative and perceptual criteria.

关键词： progressive image decoding discrete cosine transform incremental refinement approximate processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：