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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,037 篇 会议
501 篇 期刊文献
5 册 图书

馆藏范围

1,543 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

780 篇 工学
- 389 篇 计算机科学与技术...
- 326 篇 软件工程
- 230 篇 信息与通信工程
- 176 篇 电气工程
- 125 篇 电子科学与技术（可...
- 113 篇 光学工程
- 107 篇 控制科学与工程
- 77 篇 生物工程
- 72 篇 生物医学工程（可授...
- 62 篇 仪器科学与技术
- 54 篇 机械工程
- 38 篇 材料科学与工程（可...
- 35 篇 动力工程及工程热...
- 32 篇 化学工程与技术
- 28 篇 土木工程
- 19 篇 航空宇航科学与技...
- 18 篇 建筑学
486 篇 理学
- 246 篇 数学
- 188 篇 物理学
- 88 篇 生物学
- 85 篇 统计学（可授理学、...
- 57 篇 系统科学
- 36 篇 化学
133 篇 管理学
- 79 篇 管理科学与工程(可...
- 55 篇 图书情报与档案管...
- 36 篇 工商管理
62 篇 医学
- 53 篇 临床医学
- 41 篇 基础医学(可授医学...
- 26 篇 药学(可授医学、理...
19 篇 法学
- 18 篇 社会学
14 篇 农学
9 篇 经济学
5 篇 艺术学
3 篇 文学
2 篇 军事学
1 篇 教育学

主题

129 篇 laboratories
97 篇 signal processin...
78 篇 image processing
67 篇 image segmentati...
56 篇 feature extracti...
52 篇 image coding
51 篇 signal processin...
48 篇 shape
42 篇 image reconstruc...
42 篇 robustness
41 篇 algorithm design...
38 篇 neural networks
37 篇 pixel
34 篇 image analysis
34 篇 information proc...
33 篇 application soft...
32 篇 testing
31 篇 support vector m...
31 篇 data mining
29 篇 filtering

机构

35 篇 information proc...
23 篇 department of el...
21 篇 signal and image...
20 篇 informatics and ...
20 篇 department of el...
20 篇 control and inte...
16 篇 remote sensing s...
15 篇 remote sensing s...
14 篇 department of el...
14 篇 department of au...
14 篇 shanghai key lab...
13 篇 remote sensing s...
12 篇 school of electr...
11 篇 national mobile ...
11 篇 laboratory of si...
11 篇 department of au...
11 篇 information proc...
11 篇 video and image ...
11 篇 parallel process...
10 篇 key laboratory o...

作者

44 篇 m.g. strintzis
34 篇 chein-i chang
31 篇 zongli lin
29 篇 jafar saniie
24 篇 strintzis michae...
24 篇 chang chein-i
21 篇 hamid soltanian-...
17 篇 gardner wa
15 篇 chang chein-i.
15 篇 gabbouj moncef
15 篇 s.k. mitra
14 篇 t.l. casavant
14 篇 d. tzovaras
14 篇 i. kompatsiaris
13 篇 soltanian-zadeh ...
13 篇 iosifidis alexan...
13 篇 yuanlong li
13 篇 xinrui yu
12 篇 hsiao-chun wu
12 篇 e.j. delp

语言

1,473 篇 英文
53 篇 其他
16 篇 中文
1 篇 德文

检索条件"机构=SignaVImage Processing Laboratory Department of Electrical and Computer Engineering"

共 1543 条记录，以下是1261-1270 订阅

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

详细简洁

排序：

Unsupervised linear unmixing Kalman filtering approach to signature extraction and estimation for remotely sensed imagery

Unsupervised linear unmixing Kalman filtering approach to si...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： C. Brumbley Chein-I Chang Remote Sensing Signal and Image processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD USA

Linear Unmixing Kalman Filtering (LUKF) approach was recently developed which incorporates the concept of linear unmixing into Kalman filtering so as to achieve signature abundance estimation, subpixel detection and classification for remotely sensed images. However, LUKF assumes a complete knowledge of the signature matrix used in the linear mixture model. In this paper, the LUKF is extended to an unsupervised LUKF where no knowledge about the signature matrix is required a priori. The unsupervised learning method proposed for the ULUKF is derived from a vector quantization-based clustering algorithm. It employs a nearest-neighbor rule to group potential signatures resident within an image scene into a class of distinct clusters whose centers represent different types of signatures. These clusters' centers are then used as if they were true signatures in the signature matrix LUKF. In order to evaluate the effectiveness of ULUKF, HYDICE images were used for assessment. The results produced by ULUKF show that subpixel detection and classification can be performed.

关键词： Kalman filters Nonlinear filters Filtering Vector quantization Clustering algorithms Iterative algorithms State estimation Remote sensing Signal processing Image processing

来源：评论

学校读者我要写书评

暂无评论

Subband based classification of speech under stress

Subband based classification of speech under stress

引用

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

作者： R. Sarikaya J.N. Gowdy Department of Electrical and Computer Engineering Clemson University Clemson SC USA Robust Speech Processing Laboratory Duke University Durham NC USA

This study proposes a new set of feature parameters based on subband analysis of the speech signal for classification of speech under stress. The new speech features are scale energy (SE), autocorrelation-scale-energy (ACSE), subband based cepstral parameters (SC), and autocorrelation-SC (ACSC). The parameters' ability to capture different stress types is compared to widely used mel-scale cepstrum based representations: mel-frequency cepstral coefficients (MFCC) and autocorrelation-mel-scale (AC-mel). Next, a feedforward neural network is formulated for speaker-dependent stress classification of 10 stress conditions: angry, clear, cond50/70, fast, loud, lombard, neutral, question, slow, and soft. The classification algorithm is evaluated using a previously established stressed speech database (SUSAS) (Hansen and Bou-Ghazale 1997). Subband based features are shown to achieve +7.3% and +9.1% increase in the classification rates over the MFCC based parameters for ungrouped and grouped stress closed vocabulary test scenarios respectively. Moreover the average scores across the simulations of new features are +8.6% and +13.6% higher than MFCC based features for the ungrouped and grouped stress test scenarios respectively.

关键词： Stress Speech analysis Mel frequency cepstral coefficient Cepstral analysis Autocorrelation Testing Signal analysis Cepstrum Neural networks Feedforward neural networks

来源：评论

学校读者我要写书评

暂无评论

Image region extraction for content-based image retrieval 9

Image region extraction for content-based image retrieval

引用

9th European Signal processing Conference, EUSIPCO 1998

作者： Androutsos, D. Plataniotis, K.N. Venetsanopoulos, A.N. Department of Electrical and Computer Engineering Digital Signal and Image Processing Laboratory University of Toronto 10 King's College Road TorontoONMoS3G4 Canada Ryerson Polytechnic University 350 Victoria Street Toronto ONM5B2K3 Canada

We present a technique for coarsely extracting the regions of natural color images which contain directional detail, e.g.. edges, texture, etc.. and smooth color regions. which we then use for image database indexing. As a measure of color activity, we use a perceptually modified distance measure based on the sum-of-Angles criterion. We then apply histogram thresholding techniques to separate the image into smooth color regions and busy regions where edge, texture and color activity exists. Color segmentation is performed on the smooth areas using HSV histogram techniques, to obtain image regions with one dominant average color. Database indices are then created from the busy regions using the directional detail histogram technique along with the color vectors representing the segmented smooth areas. Image retrieval is then performed using the histogram intersection method for the detailed areas and color vector distance measures are utilized for retrieval of the smooth color regions.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

A comparative study of five parallel genetic algorithms using the traveling salesman problem

A comparative study of five parallel genetic algorithms usin...

引用

International Symposium on Parallel processing

作者： L. Wang A.A. Maciejewski H.J. Siegel V.P. Roychowdhury Microsoft Corporation Redmond WA USA Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Electrical Engineering Department UCLA Los Angeles CA USA

Parallel generic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial generic algorithms (SGAs). They have also been used to solve larger problems and to find better solutions. A comparative analysis of five different coarse-grained PGAs is conducted using the traveling salesman problem as the basis of this case study. To make fair comparisons, all of these PGAs are based on the same baseline SGA, implemented on the same parallel machine (IBM SP2), tested on the same set of traveling salesman problem instances, and started from the same set of initial populations. As a result of the experiments conducted in this study, a particular PGA that combines a new subtour technique with a known migration approach is identified to be the best for the traveling salesman problem among the five PGAs being compared.

关键词： Genetic algorithms Traveling salesman problems Electronics packaging Cities and towns Testing Parallel machines Space exploration computer architecture Contracts Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the task graph scheduling algorithms

Benchmarking the task graph scheduling algorithms

引用

International Symposium on Parallel processing

作者： Y.-K. Kwok I. Ahmad Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NP-completeness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compare against each other. A comprehensive performance evaluation and comparison of these algorithms entails addressing a number of difficult issues. One of the issues is that a large number of scheduling algorithms are based upon radically different assumptions, making their comparison on a unified basis a rather intricate task. Another issue is that there is no standard set of benchmarks that can be used to evaluate and compare these algorithms. Furthermore, most algorithms are evaluated using small problem sizes, and it is not clear how their performance scales with the problem size. The authors first provide a taxonomy for classifying various algorithms into different categories according to their assumptions and functionalities. They then propose a set of benchmarks which are of diverse structures without being biased towards a particular scheduling technique and still allow variations in important parameters. They have evaluated 15 scheduling algorithms, and compared them using the proposed benchmarks. Based upon the design philosophies and principles behind these algorithms, they interpret the results and discuss why some algorithms perform better than the others.

关键词： Scheduling algorithm Processor scheduling Parallel processing Concurrent computing Heuristic algorithms Laboratories computer science Taxonomy Algorithm design and analysis Scalability

来源：评论

学校读者我要写书评

暂无评论

Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques

Optimal and near-optimal allocation of precedence-constraine...

引用

International Conference on Parallel processing (ICPP)

作者： I. Ahmad Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a well-known NP-complete problem. However, optimal solutions are desired in many situations. In this paper we propose search-based algorithms for determining optimal schedules for moderately large problem sizes. The first algorithm which is based on the A* search technique uses a computationally efficient cost function for guiding the search with reduced complexity. We propose a number of state-pruning techniques to reduce the size of the search space. For further lowering the complexity, we parallelize the search. The parallel version is based on reduced interprocessor communication and is guided by static and dynamic load-balancing schemes to evenly distribute the search states to the processors. We also propose an approximate algorithm that guarantees a bounded deviation from the optimal solution but takes considerably shorter time. Based on an extensive experimental evaluation of the algorithms, we conclude that the parallel algorithm with pruning techniques is an efficient scheme for generating optimal solutions for medium to moderately large problems while the approximate algorithm is a useful alternative if slightly degraded solutions are acceptable.

关键词： Optimal scheduling Processor scheduling Computational efficiency Costs Concurrent computing Network topology Scheduling algorithm computer science Laboratories Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

A mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment

A mathematical model, heuristic, and simulation study for a ...

引用

Heterogeneous Computing Workshop

作者： Min Tan M.D. Theys H.J. Siegel N.B. Beck M. Jurczyk Cisco Systems Inc. San Jose CA USA Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Engineering and Computer Science University of Missouri Columbia Columbia MO USA

Data staging is an important data management problem for a distributed heterogeneous networking environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links. Sites in the network request data items and each item is associated with a specific deadline and priority. It is assumed that not all requests can be satisfied by their deadline. The work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. A mathematical model for the basic data staging problem is introduced. Then, a multiple-source shortest-path algorithm based heuristic for finding a suboptimal schedule of the communication steps for data staging is presented. A simulation study is provided, which evaluates the performance of the proposed heuristic. The results show the advantages of the proposed heuristic over two random based scheduling techniques. This research, based on the simplified static model, serves as a necessary step toward solving the more realistic and complicated version of the data staging problem involving dynamic scheduling, fault tolerance, and determining where to stage data.

关键词： Mathematical model computer networks Distributed computing Data engineering Military computing Intelligent networks computer network management Environmental management Memory Satellite broadcasting

来源：评论

学校读者我要写书评

暂无评论

A Family Of Order Statistic Based Dissimilarity Measures And Their Application In Image processing

A Family Of Order Statistic Based Dissimilarity Measures And...

引用

International Conference on Optimization of electrical and Electronic Equipment, OPTIM

作者： C. Vertan V. Buzuloiu R.M. Rangayyan Image Processing and Analysis Laboratory (IPAL) Applied Electronics and Information Engineering DepartmentFaculty of Electronics and Telecommunications Politehnica University Bucharest Romania Department of Electrical and Computer Engineering University of Calgary Calgary AB Canada

来源：评论

学校读者我要写书评

暂无评论

Subset selection analysis for the reduction of hyperspectral imagery

Subset selection analysis for the reduction of hyperspectral...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： M. Velez-Reyes L.O. Jimenez Laboratory for Applied Remote Sensing and Image Processing Tropical Center for Earth and Space Studies Electrical and Computer Engineering Department University of Puerto Rico Mayagìez Mayaguez Puerto Rico

Presents the formulation of the dimension reduction problem using subset selection as a matrix approximation problem. A heuristic algorithm to solve this problem is presented. Numerical results using LANDSAT and AVIRIS images show that the selected bands are contained in a space that is almost aligned with the first few principal components.

关键词： Image analysis Hyperspectral imaging Hyperspectral sensors Covariance matrix Random variables Remote sensing Satellites Vectors Laboratories Image processing

来源：评论

学校读者我要写书评

暂无评论

Video segmentation of MPEG compressed data

Video segmentation of MPEG compressed data

引用

IEEE International Conference on Electronics, Circuits and Systems (ICECS)

作者： I. Koprinska S. Carrato Indian Institute of Technology Bangalore Sofia Bulgaria Department of Electrical Engineering and Computer Science (D.E.E.I.) Image Processing Laboratory University of Trieste Trieste Italy

An approach for parsing MPEG compressed video into shots and sub-shots based only on the macroblock (MB) and motion vector (MV) information is presented. The system follows a two-pass scheme and has a hybrid rule-based/neural structure. A rough scan over the P frames locates the potential shot boundaries and the solution is then refined by a precise scan over the B frames of the respective neighborhoods. The "simpler" boundaries are recognized by the rule-based module, while the decisions for the "complex" ones are refined by the neural part. The latter is also used to distinguish dissolves from object and camera motions and to break the shots into sub-shots. The experiments demonstrate high speed and accuracy in shot detection and their characterization.

关键词： Video compression Transform coding Cameras Image coding Image reconstruction Image segmentation Gunshot detection systems Histograms Image processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共155页 << < 123 124 125 126 127 128 129 130 131 132 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：