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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

471 篇 会议
253 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

565 篇 工学
- 505 篇 计算机科学与技术...
- 467 篇 软件工程
- 165 篇 光学工程
- 50 篇 生物医学工程（可授...
- 43 篇 生物工程
- 40 篇 电气工程
- 37 篇 信息与通信工程
- 25 篇 控制科学与工程
- 22 篇 材料科学与工程（可...
- 19 篇 仪器科学与技术
- 12 篇 建筑学
- 10 篇 电子科学与技术（可...
- 10 篇 航空宇航科学与技...
- 7 篇 土木工程
- 5 篇 力学（可授工学、理...
- 5 篇 机械工程
- 4 篇 轻工技术与工程
- 3 篇 冶金工程
- 2 篇 化学工程与技术
- 2 篇 交通运输工程
263 篇 理学
- 176 篇 物理学
- 140 篇 数学
- 42 篇 生物学
- 31 篇 统计学（可授理学、...
- 2 篇 地球物理学
12 篇 管理学
- 8 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
4 篇 医学
- 4 篇 临床医学
2 篇 农学
- 2 篇 作物学
2 篇 军事学

主题

336 篇 image processing
217 篇 pattern recognit...
62 篇 pattern recognit...
6 篇 satellites
6 篇 computer vision
5 篇 computer graphic...
5 篇 imaging techniqu...
5 篇 remote sensing
4 篇 data processing
4 篇 biomedical engin...
4 篇 robots
4 篇 image coding
4 篇 computer program...
4 篇 systems science ...
4 篇 vision
4 篇 image reconstruc...
3 篇 computational mo...
3 篇 automata theory
2 篇 learning systems
2 篇 noise reduction

机构

8 篇 artificial intel...
7 篇 univ of michigan...
6 篇 univ of southern...
5 篇 harvard univ cam...
5 篇 univ of maryland...
4 篇 univ chinese aca...
4 篇 chinese acad sci...
4 篇 peng cheng lab p...
4 篇 columbia univ ny
3 篇 univ sci & techn...
3 篇 michigan state u...
3 篇 state univ of ne...
3 篇 univ of illinois...
3 篇 new york univ ny
2 篇 univ of massachu...
2 篇 comput & inf sci...
2 篇 inria le chesnay
2 篇 hebrew univ of j...
2 篇 mit cambridge ma
2 篇 dept of comput s...

作者

13 篇 anon
11 篇 haralick robert ...
11 篇 fu k.s.
8 篇 pavlidis theodos...
8 篇 shapiro stephen ...
7 篇 rosenfeld azriel
7 篇 huang thomas s.
7 篇 hall ernest l.
6 篇 mitchell o.r.
6 篇 hall e.l.
6 篇 jain anil k.
6 篇 schunck brian g.
6 篇 toussaint godfri...
6 篇 sklansky j.
5 篇 peleg shmuel
5 篇 davis larry s.
5 篇 chien y.t.
5 篇 shapiro linda g.
5 篇 srihari sargur n...
5 篇 oosterlinck a.

语言

470 篇 英文
254 篇 其他

检索条件"任意字段=IEEE Comput Soc Conf on Pattern Recognition and Image Process, Proc"

共 724 条记录，以下是231-240 订阅

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

详细简洁

排序：

Applying uncertainty reasoning to model based object recognition

Applying uncertainty reasoning to model based object recogni...

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Hutchinson, S.A. Cromwell, R.L. Kak, A.C.

ISBN: (纸本)081861952x

An architecture for reasoning with uncertainty about the identities of objects in a scene is described. The main components of this architecture create and assign credibility to object hypotheses based on feature-match, object, relational, and aspect consistencies. The Dempster-Shafer formalism is used for representing uncertainty, so these credibilities are expressed as belief functions which are combined using Dempster's combination rule to yield the system's aggregate belief in each object hypothesis. One of the principal objections to the use of Dempster's rule is that its worst-case time complexity is exponential in the size of the hypothesis set. The structure of the hypothesis sets developed by this system for a polynomial implementation of the combination rule. Experimental results affirm the effectiveness of the method in assessing the credibility of candidate object hypotheses.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

1-subcycle parallel thinning algorithm for producing perfect 8-curves and obtaining isotropic skeleton of an L-shape pattern

1-subcycle parallel thinning algorithm for producing perfect...

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Chen, Yung-Sheng Hsu, Wen-Hsing Natl Tsing Hua Univ Hsinchu Taiwan

ISBN: (纸本)081861952x

The authors review their pseudo-one-subcycle parallel thinning algorithm. Y.S. Chen and W.H. Hsu present two improved versions of this algorithm, and describe a two-stage structure to realize the one-subcycle parallel algorithm. The first stage is to produce a perfect 8-curve excluding T-junction thin line. The second is to obtain the isotropic skeleton of an L-shaped pattern. The two-stage structure consists of a thinning table and a control unit. The thinning table is used to provide the attributions for an input 3 × 3 local pattern. The control unit is used to check the removal of the center pixel of this local pattern, and the inputs of the control unit also comprise the outputs of other neighboring thinning tables. This structure can exactly implement the proposed one-subcycle parallel algorithms. The two improved algorithms have been implemented. Experiments confirm that the improved algorithms can produce the desired effective thin line and also show that the structure realized is feasible and practicable.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Feature selection with stochastic complexity

Feature selection with stochastic complexity

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Dom, Byron Niblack, Wayne Sheinvald, Jacob IBM Almaden Research Cent San Jose CA USA

ISBN: (纸本)081861952x

The application of J. Rissanen's theory of stochastic complexity (1986) to the problem of features selection in statistical pattern recognition (SPR) is discussed. Stochastic complexity provides a general framework for statistical problems such as coding, prediction, estimation, and classification. A brief review of the SPR paradigm and traditional methods of feature selection is presented, followed by a discussion of the basic of stochastic complexity. Two forms of stochastic complexity, minimum description length and an integral form, are applied to the problem of feature selection. Experimental results using simulated data generated with Gaussian distributions are given and compared with results from cross validation, a traditional technique. The stochastic complexity measures give superior results, as measured by their ability to select subsets of relevant features, as well as probability of error computed based on the selected feature subset.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Developments and experimental results of K-B system for workpieces recognition

Developments and experimental results of K-B system for work...

引用

Mediterranean Electrotechnical conference (MELECON'89) - proceedings

作者： Dellepiane, S. Narducci, A. Serpico, S.B. Vernazza, G. Zini, G. Dep of Biophys & Electron Eng Univ of Genoa Genoa Italy

A knowledge-based (KB) system for the recognition of partially occluded two-dimensional workpieces is described. After the image acquisition phase with a TV camera, the generalized Hough transform is used to extract elementary edge patterns and to derive a symbolic description. Hypothesis generation and test is the strategy utilized in the recognition process, on the basis of matchings between models and data. In particular, the system contains new modules devoted to automatic model acquisition and search-function generation for every model primitive. Results obtained confirm the validity of the proposed KB approach. The system has been tested on several images and has proved robust in terms of noise and occlusions.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Object wings - 2 1/2-D primitives for 3-D recognition

Object wings - 2 1/2-D primitives for 3-D recognition

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Chen, Sei-Wang Stockman, George Michigan State Univ East Lansing MI USA

ISBN: (纸本)081861952x

A set of 2 1/2-D primitives, called object wings, are introduced for representation and recognition of arbitrarily shaped 3-D objects. There are 34 simple wings. A simple wing is defined as a triple including a pair of surface patches separated by a contour segment. Simple wings can be grouped into composite wings through nonaccidental relationships such as cotermination, symmetry, parallelism, connectivity, colinearity, and curvilinearity. Both simple wings and composite wings, together with their spatial structures, can be used to construct internal models of real-world objects. The configurations of wings posses enough information to be of use for both indexing into models and determining instance pose. Wing definitions and techniques for their detection are presented. Representation in terms of the proposed wing primitives and recognition based on the wing representations are addressed. Experimental results are given to indicate that wing primitives can be stably extracted over a broad change of scale, and that reasonable representation can be constructed.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

computing oriented texture fields

Computing oriented texture fields

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Rao, A.Ravishankar Schunck, Brian G. Univ of Michigan Ann Arbor MI USA

ISBN: (纸本)081861952x

A novel algorithm for computing the orientation field for a flowlike texture is presented. The basic idea behind the algorithm is to use an oriented filter, namely the gradient of the Gaussian, and perform manipulations on the resulting gradient vector field. The most important aspect of the algorithm is that it is provably optimal in estimating the local orientations of an oriented texture. An added strength of the algorithm is that it is simpler and has a better signal-to-noise ratio than previous approaches, because it utilizes fewer derivative operations. Also proposed is a measure of coherence, which works better than previous measures. This approach is based on the use of the angle and coherence images as intrinsic images. An analysis of oriented textures requires the computation of these intrinsic images as a first step. In this sense, the computation of the orientation field, resulting in the intrinsic images, is indispensible in the analysis of oriented textures. Results from a number of experiments indicate the usefulness of the angle and coherence intrinsic images.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

computational model of texture segmentation

Computational model of texture segmentation

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Malik, Jitendra Perona, Pietro Univ of California Berkeley CA USA

ISBN: (纸本)081861952x

An algorithm for finding texture boundaries in images is developed on the basis of a computational model of human texture perception. The model consists of three stages: (1) the image is convolved with a bank of even-symmetric linear filters followed by half-wave rectification to give a set of responses;(2) inhibition, localized in space, within and among the neural response profiles results in the suppression of weak responses when there are strong responses at the same or nearby locations;and (3) texture boundaries are detected using peaks in the gradients of the inhibited response profiles. Unlike previous attempts along these lines, this model is precisely specified, equally applicable to grey-scale and binary textures, and is motivated by detailed comparison with psychophyics and physiology. This model makes predictions about the degree of discriminability of different texture pairs which match very well with experimental measurements of discriminability in human observers. From a machine-vision point of view, the scheme is a high-quality texture-edge detector which works equally on images of artificial and natural scenes. The algorithm makes the use of simple local and parallel operations, which makes it potentially real-time.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Segmentation of textured images

Segmentation of textured images

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Perry, Adi Lowe, David G. New York Univ New York NY USA

ISBN: (纸本)081861952x

The authors present a method for texture segmentation that does not assume any prior knowledge about either the type of textures or the number of textured regions present in the image. Local orientation and spatial frequencies are used as the key parameters for classifying texture. The information is obtained by creating a local multifrequency multiorientation channel decomposition of the image, with the width of each frequency band constant on a logarithmic scale. This decomposition is implemented by applying a set of Gabor-like functions that were modified to have a decreased frequency selectivity when the filter's center frequency increases. This transformation is actually a wavelet transform and not a Gabor transform. The set of filter outputs is then used to create robust texture descriptors. The segmentation algorithm uses the similarity of the descriptors to determine the existence of texture regions and to outline their border rather than concentrating on segregating the textures. First, seed regions are found. Then, texture region borders are extended and refined through an iterative stage. An adaptive threshold based on specific region characteristics is used rather than a fixed threshold. The method has been applied to image containing natural textures, resulting in a good segmentation of the texture regions.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Accurate measurement of orientation from stereo using line correspondence

Accurate measurement of orientation from stereo using line c...

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Wolff, Lawrence B. Columbia Univ New York NY USA

ISBN: (纸本)081861952x

The author analyzes a stereo method which determines lines in space from the intersection of projected planar sheets. Object descriptions are built from information about linear features instead of by points. It is shown that there are major advantages to accurately determining the orientation of object lines and surfaces using this stereo method. In the absence of errors (apart from the baseline translation error), the measurement of the orientation of lines and surfaces from this stereo method is translation-invariant in the sense that the orientation measurement is completely independent of knowledge of the baseline. computer simulations of realistic imaging configurations show that, even in the presence of errors from other camera parameters, this stereo method is nearly translation-invariant and can far outperform stereo methods based on the absolute correspondence of points. Another advantage of determining the orientation of lines and surfaces from stereo using intersecting planes is that orientation errors do not grow rapidly as the object distance from the baseline increases.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Optimal implementation of morphological operations on neighborhood connected array processors

Optimal implementation of morphological operations on neighb...

引用

proceedings CVPR '89: ieee computer society conference on computer Vision and pattern recognition

作者： Xu, Jianning Classboro State Coll NJ USA

ISBN: (纸本)081861952x

Neighborhood-connected array processors can implement Minkowski addition and Minkowski subtraction operations with structuring elements larger than the neighborhood size by breaking the operation into a sequence of successive neighborhood operations. The authors provide a complete solution to the problem of decomposing convex polygons into subsets of the 3 × 3 neighborhood set. With the help of he Freeman chain code notation, it is proved that all convex polygons have neighborhood decompositions. Based on this result, an efficient algorithm is developed which can find an optimal decomposition for any convex polygon. The decomposition algorithm itself does not have any particular hardware requirement. However, the decomposition produced by the algorithm can be used to determine the most efficient implementation of a morphological operation with convex polygonal structuring elements as a sequence of successive neighborhood operations. Therefore, the algorithm is applicable to neighborhood-connected array processors, or any machine structure that can quickly perform 3 × 3 neighborhood operations.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共73页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：