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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

44 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

56 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

40 篇 工学
- 29 篇 计算机科学与技术...
- 15 篇 软件工程
- 14 篇 电气工程
- 5 篇 光学工程
- 4 篇 电子科学与技术（可...
- 4 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
- 1 篇 机械工程
- 1 篇 冶金工程
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 轻工技术与工程
- 1 篇 生物工程
28 篇 理学
- 24 篇 数学
- 18 篇 物理学
- 3 篇 统计学（可授理学、...
- 1 篇 生物学
- 1 篇 系统科学
13 篇 医学
- 13 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
4 篇 管理学
- 3 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...
1 篇 法学
- 1 篇 法学

主题

11 篇 pattern recognit...
6 篇 image compressio...
5 篇 image coding
3 篇 neural networks
3 篇 data compression
3 篇 adaptive pattern...
3 篇 tdoa/fdoa emitte...
3 篇 encryption
3 篇 fisher informati...
3 篇 sensor networks
2 篇 pattern matching
2 篇 sensor managemen...
2 篇 three-dimensiona...
2 篇 sensor selection
1 篇 data encryption ...
1 篇 intraoperative p...
1 篇 three-dimensiona...
1 篇 event reconstruc...
1 篇 morphological ne...
1 篇 lattice independ...

机构

4 篇 univ florida dep...
3 篇 suny binghamton ...
2 篇 school of astron...
2 篇 xi an jiao tong ...
2 篇 beijing institut...
1 篇 univ jaume 1 dep...
1 篇 univ latvia fac ...
1 篇 school of comput...
1 篇 nottingham trent...
1 篇 natl univ irelan...
1 篇 natl univ irelan...
1 篇 bnrist thuibcs s...
1 篇 city university ...
1 篇 rajagiri sch eng...
1 篇 department of ma...
1 篇 xi’an jiaotong u...
1 篇 hohai univ dept ...
1 篇 srm university-a...
1 篇 chongqing univ c...
1 篇 frontier technol...

作者

5 篇 ritter gerhard x...
5 篇 schmalz mark s.
3 篇 hu xi
3 篇 pan zhibin
3 篇 fowler mark l.
2 篇 li shizhong
2 篇 astola jaakko t.
2 篇 wu jiaji
2 篇 hayden eric
2 篇 shi guangming
2 篇 zhao fei
2 篇 wang yang
2 篇 gu xuemai
2 篇 jiao licheng
2 篇 jia peng
1 篇 zanarini m.
1 篇 shen yao
1 篇 zhang zhuosheng
1 篇 xu haiyan
1 篇 mitrea m.

语言

53 篇 英文
2 篇 中文
1 篇 其他

检索条件"任意字段=Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI"

共 56 条记录，以下是11-20 订阅

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

详细简洁

排序：

Exploiting data compression methods for network-level management of multi-sensor systems

Exploiting data compression methods for network-level manage...

引用

Conference on mathematics of data/image pattern recognition, compression and encryption with Application IX

作者： Hu, xi Chen, Mo Fowler, Mark L. SUNY Binghamton Dept Elect & Comp Engn Binghamton NY 13902 USA

ISBN: (纸本)0819463949

data compression ideas can be extended to assess the data quality across multiple sensors to manage the network of sensors to optimize the location accuracy subject to communication constraints. From an unconstrained-resources viewpoint it is desirable to use the complete set of deployed sensors;however, that generally results in an excessive data volume. Selecting a subset of sensors to participate in a sensing task is crucial to satisfying trade-offs between accuracy and time-line requirements. For emitter location it is well-known that the geometry between sensors and the target plays a key role in determining the location accuracy. Furthermore, the deployed sensors have different data quality. Given these two factors, it is no trivial matter to select the optimal subset of sensors. We attack this problem through use of a data quality measure based on Fisher Information for set of sensors and optimize it via sensor selection and data compression.

关键词： sensor selection sensor management data compression sensor networks TDOA/FDOA emitter location Fisher information

来源：评论

学校读者我要写书评

暂无评论

The Research on pattern recognition in Distributed Fiber Vibrant Sensor System

The Research on Pattern Recognition in Distributed Fiber Vib...

引用

Conference on mathematics of data/image pattern Coding, compression, and encryption with applications xiII

作者： Wu, Hongyan Zhao, Dong Xu, Haiyan Fudan Univ Dept Mat Sci Shanghai 200433 Peoples R China HoHai Univ Dept Comp & Informat Changzhou 213022 Peoples R China

ISBN: (纸本)9780819487469

Distributed Fiber Vibrant Sensor System is a new type of system, which could be used in long-distance, strong-EMI condition for monitoring vibration and sound signals. Position determination analysis toward this system is popular in previous papers, but pattern recognition of the output signals of the sensor has been missed for a long time. This function turns to critical especially when it is used for real security project in which quick response to intrusion is a must. After pre-processing the output signal of the system, a MFCC-based approach is provided in this paper to extract features of the sensing signals, which could be used for pattern recognition in real project, and the approach is proved by large practical experiments and projects.

关键词： fiber vibrant sensor pattern recognition MFCC

来源：评论

学校读者我要写书评

暂无评论

Generation of lattice independent vector sets for pattern recognition applications

Generation of lattice independent vector sets for pattern re...

引用

Conference on mathematics of data/image pattern Recongnition, compression, Coding, and encryption X, with applications

作者： Urcid-S., Gonzalo Valdiviezo-N., Juan-Carlos INAOE Dept Opt Puebla 72000 Mexico

ISBN: (纸本)9780819468482

Lattice independence and strong lattice independence of a set of pattern vectors are fundamental mathematical proper-ties that lie at the core of pattern recognition applications based on lattice theory. Specifically, the development of morphological associative memories robust to inputs corrupted by random noise are based on strong lattice independent sets, and real world problems, such as, autonomous endmember detection in hyperspectral imagery, use auto-associative morphological memories as detectors of lattice independence. In this paper, we present a unified mathematical framework that-develops the relationship between different notions of lattice independence currently used in the literature. Computational procedures are provided to test if a given set of pattern vectors is lattice independent or strongly lattice independent;in addition, different techniques are fully described that can be used to generate sets of vectors with the aforementioned lattice properties.

关键词： lattice associative memories lattice independence morphological neural networks

来源：评论

学校读者我要写书评

暂无评论

The synaptic morphological perceptron

The synaptic morphological perceptron

引用

Conference on mathematics of data/image pattern recognition, compression and encryption with Application IX

作者： Myers, Daniel S. Sandia Natl Labs Albuquerque NM 87185 USA

ISBN: (纸本)0819463949

In recent years, several researchers have constructed novel neural network models based on lattice algebra. Because of computational similarities to operations in the system of image morphology, these models are often called morphological neural networks. One neural model that has been successfully applied to many pattern recognition problems is the single-layer morphological perceptron with dendritic structure (SLMP). In this model, the fundamental computations are performed at dendrites connected to the body of a single neuron. Current training algorithms for the SLMP work by enclosing the target patterns in a set of hyperboxes orthogonal to the axes of the data space. This work introduces an alternate model of the SLMP, dubbed the synaptic morphological perceptron (SMP). In this model, each dendrite has one or more synapses that receive connections from inputs. The SMP can learn any region of space deter-mined by an arbitrary configuration of hyperplanes, and is not restricted to forming hyperboxes during training. Thus, it represents a more general form of the morphological perceptron than previous architectures.

关键词： morphological neural network morphological perceptron lattice algebra pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Maximizing reading: pattern analysis to describe points of gaze

Maximizing reading: pattern analysis to describe points of g...

引用

Conference on mathematics of data/image pattern recognition, compression and encryption with Application IX

作者： Paeglis, Roberts Bagucka, Kristine Sjakste, Nikolajs Lacis, Ivars Latvian Univ Dept Vis Sci 8 Kengaraga Str LV-1063 Riga Latvia Univ Latvia Fac Med LV-1001 Riga Latvia

ISBN: (纸本)0819463949

As people read texts, their points of gaze can be described either as a sequence or as a pattern of dots. If reading fixations are visualized as a pattern and their duration is graphically attributed to the 3(rd) dimension, image processing techniques can be employed to describe individual reading styles. Two reader groups of text editors and of University students were matching according to parametric tests. Yet they appeared to have marked inter-subject variability of fixation distribution when individual cases were considered. To illustrate this, we applied a simple "Coulomb law"- like model that takes both fixation duration and spacing into account. Further the image entropy filter was shown to distinguish the readers by the extreme value points. Statistical averaging can level out differences in reading patterns that appear by image processing techniques.

关键词： skilled reader eye movements fixation texture MATLAB iViewX

来源：评论

学校读者我要写书评

暂无评论

Benchmarking techniques for evaluation of compression transform performance in ATR applications

Benchmarking techniques for evaluation of compression transf...

引用

7th Conference on mathematics of data/image Coding, compression, and encryption

作者： Schmalz, MS Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA

ISBN: (纸本)0819454990

image compression is increasingly employed in applications such as medical imaging, for reducing data storage requirement, and Internet video transmission, to effectively increase channel bandwidth. Similarly, military applications such as automated target recognition (ATR) often employ compression to achieve storage and communication efficiencies, particularly to enhance the effective bandwidth of communication channels whose throughput suffers, for example, from overhead due to error correction/detection or encryption. In the majority of cases, lossy compression is employed due the resultant low bit rates (high compression ratio). However, lossy compression produces artifacts in decompressed imagery that can confound ATR processes applied to such imagery, thereby reducing the probability of detection (Pd) and possibly increasing the rate or number of false alarms (Rfa or Nfa). In this paper, the authors' previous research in performance measurement of compression transforms is extended to include (a) benchmarking algorithms and software tools, (b) a suite of error exemplars that are designed to elicit compression transform behavior in an operationally relevant context, and (c) a posteriori analysis of performance data. The following transforms are applied to a suite of 64 error exemplars: Visual pattern image Coding (VPIC [1]), Vector Quantization with a fast codebook search algorithm (VQ [2,3]), JPEG and a preliminary implementation of JPEG 2000 [4,5], and EBLAST [6-8]. compression ratios range from 2:1 to 200:1, and various noise levels and types are added to the error exemplars to produce a database of 7,680 synthetic test images. Several global and local (e.g., featural) distortion measures are applied to the decompressed test imagery to provide a basis for rate-distortion and rate-performance analysis as a function of noise and compression transform type.

关键词： image compression error measurement automated target recognition

来源：评论

学校读者我要写书评

暂无评论

Noise Tolerant Dendritic Lattice Associative Memories

Noise Tolerant Dendritic Lattice Associative Memories

引用

Conference on mathematics of data/image pattern Coding, compression, and encryption with applications xiII

作者： Ritter, Gerhard X. Schmalz, Mark S. Hayden, Eric Tucker, Marc Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA

ISBN: (纸本)9780819487469

Linear classifiers based on computation over the real numbers R (e. g., with operations of addition and multiplication) denoted by (R, +, x), have been represented extensively in the literature of pattern recognition. However, a different approach to pattern classification involves the use of addition, maximum, and minimum operations over the reals in the algebra (R, +, v, Lambda). These pattern classifiers, based on lattice algebra, have been shown to exhibit superior information storage capacity, fast training and short convergence times, high pattern classification accuracy, and low computational cost. Such attributes are not always found, for example, in classical neural nets based on the linear inner product. In a special type of lattice associative memory (LAM), called a dendritic LAM or DLAM, it is possible to achieve noise-tolerant pattern classification by varying the design of noise or error acceptance bounds. This paper presents theory and algorithmic approaches for the computation of noise-tolerant lattice associative memories (LAMs) under a variety of input constraints. Of particular interest are the classification of nonergodic data in noise regimes with time-varying statistics. DLAMs, which are a specialization of LAMs derived from concepts of biological neural networks, have successfully been applied to pattern classification from hyperspectral remote sensing data, as well as spatial object recognition from digital imagery. The authors' recent research in the development of DLAMs is overviewed, with experimental results that show utility for a wide variety of pattern classification applications. Performance results are presented in terms of measured computational cost, noise tolerance, classification accuracy, and throughput for a variety of input data and noise levels.

关键词： pattern recognition Adaptive pattern classification Neural networks

来源：评论

学校读者我要写书评

暂无评论

recognition of Compton scattering patterns in advanced Compton telescopes

Recognition of Compton scattering patterns in advanced Compt...

引用

Conference on mathematics of data/image pattern Recongnition, compression, Coding, and encryption X, with applications

作者： Zoglauer, Andreas Boggs, Steven E. Andritschke, Robert Kanbach, Gottfried Univ Calif Berkeley Space Sci Lab 7 Gauss Way Berkeley CA 94720 USA Max Planck Inst Halbleiterlab Munich Germany Max Planck Inst Extraterr Phys Garching Germany

ISBN: (纸本)9780819468482

The next generation of Compton telescopes (such as MEGA or NCT) will detect impinging gamma rays by measuring one or more Compton interactions, possibly electron tracks, and a final photo absorption. However, the recovery of the original parameters of the photon, especially its energy and direction, is a challenging task, since the measured data only consists of a set of energy and position measurements and their ordering, i.e. the path of the photon, is unknown. Thus the main tasks of the pattern recognition algorithm are to identify the interaction sequence of the photon (i.e. which hit is the start point) and distinguish the pattern from background signatures, especially incompletely absorbed events. The most promising approach up to now is based on Bayesian statistics: The Compton interactions are parameterized in a multi-dimensional data space, which contains the interaction information of the Compton sequence as well as geometry information of the detector. For each data space cell the probability that the corresponding interaction sequence is one of a correctly ordered, completely absorbed source photon can be determined by Bayesian statistics and detailed simulations. This probability can then be used to distinguish source photons from incompletely absorbed photons. Simulations show that the Bayesian approach can improve the 68% event containment of the ARM distribution by up to 40%, and results in a much better separation between '' good '' and '' bad '' events. In addition, sensitivity improvements up to a factor 1.7 can be achieved.

关键词： pattern recognition event reconstruction Compton scattering Compton telescope Bayes' law

来源：评论

学校读者我要写书评

暂无评论

data payload optimality:: a key issue for video watermarking applications

Data payload optimality:: a key issue for video watermarking...

引用

Conference on mathematics of data/image pattern recognition, compression and encryption with Application IX

作者： Mitrea, M. Duta, S. Preteux, F. Vlad, A. GET INT ARTEMIS Dept Evry France POLITEH Univ Fac Elect & Telecommun Bucharest Romania Romanian Acad Res Inst Artificial Intelligence Bucharest Romania

ISBN: (纸本)0819463949

Watermarking aims at enforcing property right for digital video: a mark is imperceptibly - transparently - embedded into original data. The true owner is identified by detecting this mark. The robust watermarking techniques allow the mark detection even when the protected video is attacked. Transparency and robustness constraints restrict the mark size: the better transparency and robustness, the smaller the data payload. The paper presents a method to evaluate the maximum quantity of information which can be theoretically inserted into the 2D-DCT coefficient hierarchy, for prescribed transparency and robustness. This approach relies on the noisy channel model for watermarking. Within this mathematical framework, the maximal data payload is expressed by the channel capacity. As any capacity evaluation procedure requires an intimate knowledge of the noise sources, the paper first describes the developed statistical approach enabling: (1) to properly handle the inner dependency existing among successive frames in a video sequence, and (2) to accurately check-out the Gaussian behaviour for each noise source. The experiments were carried out in partnership with the SFR mobile service provider in France (Vodafone group).

关键词： video watermarking attack statistical analysis watermarking capacity

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Adaptive Nonlinear pattern recognition

Algorithms for Adaptive Nonlinear Pattern Recognition

引用

Conference on mathematics of data/image pattern Coding, compression, and encryption with applications xiII

作者： Schmalz, Mark S. Ritter, Gerhard X. Hayden, Eric Key, Gary Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA Frontier Technol Inc Altamonte Springs FL 32701 USA

ISBN: (纸本)9780819487469

In Bayesian pattern recognition research, static classifiers have featured prominently in the literature. A static classifier is essentially based on a static model of input statistics, thereby assuming input ergodicity that is not realistic in practice. Classical Bayesian approaches attempt to circumvent the limitations of static classifiers, which can include brittleness and narrow coverage, by training extensively on a data set that is assumed to cover more than the subtense of expected input. Such assumptions are not realistic for more complex pattern classification tasks, for example, object detection using pattern classification applied to the output of computer vision filters. In contrast, we have developed a two step process, that can render the majority of static classifiers adaptive, such that the tracking of input nonergodicities is supported. Firstly, we developed operations that dynamically insert (or resp. delete) training patterns into (resp. from) the classifier's pattern database, without requiring that the classifier's internal representation of its training database be completely recomputed. Secondly, we developed and applied a pattern replacement algorithm that uses the aforementioned pattern insertion/deletion operations. This algorithm is designed to optimize the pattern database for a given set of performance measures, thereby supporting closed-loop, performance-directed optimization. This paper presents theory and algorithmic approaches for the efficient computation of adaptive linear and nonlinear pattern recognition operators that use our pattern insertion/deletion technology - in particular, tabular nearest-neighbor encoding (TNE) and lattice associative memories (LAMs). Of particular interest is the classification of nonergodic datastreams that have noise corruption with time-varying statistics. The TNE and LAM based classifiers discussed herein have been successfully applied to the computation of object classification in hyperspectral re

关键词： pattern recognition Adaptive pattern classification Neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：