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

SYNTACTIC pattern recognition OF EEG SPIKES.

1975年 135-138页

作者： Lee, Samuel C.

A new approach to automatic detection and pattern recognition of epileptic EEG spikes is proposed. A total of m channels of EEG signals are fed into m analog low-pass filters (roll-off 18 db/octave beginning at 100 Hz) to minimize frequency aliasing. The analog signals are sampled by a set of samplers with sampling rate of 1 kHz. These signals are then digitized by the A/D converters. For each channel, spike primitive features p//1,. . . ,P//9 are extracted, and fed into the spike detector. When one or more spikes are detected by the spike detectors, an interpretation of the spikes will take place. The main objective of this stage is to determine whether the spike is produced by an artifact or an epileptic disease. The final stage is an evaluation of the spike.

关键词： pattern recognition SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

pattern recognition FOR UNDERSTANDING AND MODELING MATERIALS PROBLEMS.

引用

1975年 380-384页

作者： Bender, C.F. Pritchard, R.H.

pattern recognition has shown great promise in providing a general approach to solutions of a large class of data analysis problems in such diverse areas as medial diagnosis, environmental protection, materials science, production control, and the experimental physical sciences. The authors review their interactive and iterative use of pattern recognition techniques and demonstrate the approach by the use of several examples. The problems that arise in the areas mentioned above are roughly parallel to determining the shape of a multivariate function in many-dimensional space, given a number of functional values in the space. The difficulty is that it is not clear either what functional form is or what the proper choice of variables ought to be. A pattern recognition analysis can help to determine those choices. The remaining sections discuss the methodology of pattern recognition, several successful applications to materials problems, and give conclusions regarding its future use.

关键词： pattern recognition SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

SYSTEM DESIGN ISSUES IN PROSODIC RULE IMPLEMENTATION.

SYSTEM DESIGN ISSUES IN PROSODIC RULE IMPLEMENTATION.

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： O'Malley, Michael H.

Acoustic prosodic information about syntactic boundaries was incorporated into two different types of speech understanding systems. This paper presents a brief outline of English prosodies and then reports the effect on system performance of using prosodic information. Issues of overall system design which effect the implementation of prosodic rules are discussed.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

METHOD FOR MAXIMUM LIKELIHOOD PARAMETER ESTIMATION BASED UPON A REDUCED data FILE.

METHOD FOR MAXIMUM LIKELIHOOD PARAMETER ESTIMATION BASED UPO...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Tarter, Michael E.

procedures are considered which can supply a variety of maximum likelihood estimators from a reduced data setUnlike method involving the use of grouped data, this new approach is based upon new model-free, e. g. , nonparametric, estimation techniques and consequently is well suited for pattern recognition applications. An example is given of a class of estimators which contains the sample mean and sample median.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

data structURES FOR pattern recognition ALGORITHMS: A CASE STUDY.

引用

1975年 191-195页

作者： Zahn Jr., Charles T.

Experiences gained while programming several pattern recognition algorithms in the languages ALGOL, FORTRAN, PL/1 and PASCAL are described. The algorithms discussed are for boundary encodings of two-dimensional binary pictures, calculating and exploring the minimum spanning tree for a set of points, recognizing dotted curves from a set of planar points and performing a template matching in the presence of severe noise distortions. The lesson seems to be that pattern recognition algorithms require a range of data structuring capabilities for their implementation, in particular arrays, graphs and lists. The languages PL/1 and PASCAL have facilities to accommodate graphs and lists but there are important differences for the programmer. The ease with which the template matching program was written, debugged and modified during a 3 week period, using PASCAL, suggests that this small but powerful language should not be overlooked by those researchers who need a quick, reliable, and efficient implementation of a pattern recognition algorithm requiring graphs, lists and arrays.

关键词： data procESSING

来源：评论

学校读者我要写书评

暂无评论

ITS TIME FOR A DIFFERENT VIEW OF data structURES FOR computER graphics.

ITS TIME FOR A DIFFERENT VIEW OF DATA STRUCTURES FOR COMPUTE...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Allan III, John J.

A background on computer graphics is developed with special emphasis on the types of data representation one might want to see. The point is then made that another survey is unnecessary. What we need to do is further work on formal data base descriptions so that transformers that yield graphic post conditions can be applied. This has been referred to by one reference as ″superimposition of multiple views″ . What we will need - in a few years - is a survey of data structure operators.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

data CLUSTERING ALGORITHM FOR FEATURE EXTRACTION & UNSUPERVISED LEARNING.

引用

1975年 323-332页

作者： Gala, Basil E.

A clustering algorithm is proposed based on the minimization of the sum of the mean-square intra-cluster distances. The data are passed through an array of decision rules (corresponding to the clusters) several times or cycles. During the initial cycle, numerous hyper-spherical data windows are generated, uniformly distributed throughout the data regions. During the final cycle, the data windows have grown, changed shape, and been reduced in number to fit exactly the underlying data structure. Thus, the algorithm describes a dynamic process of data aggregation, which leads the computer from a high level of entropy and uncertainty about the data patterns to a level of low entropy and knowledge. Line features from hand-printed characters have been extracted by use of the algorithm in visual space and remarkably easy and accurate recognition of the characters was achieved by a classification program operating on the line features. Feature extraction was also made possible in the case of chromosome images for automatic karyotyping.

关键词： CHARACTER recognition

来源：评论

学校读者我要写书评

暂无评论

TRANSITION NETWORK GRAMMARS FOR SYNTACTIC pattern recognition.

TRANSITION NETWORK GRAMMARS FOR SYNTACTIC PATTERN RECOGNITIO...

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Chou, S.M. Fu, K.S.

Transition Networks (TN) have been proposed by Woods models for language analysis. It has been found that transition networks grammars are powerful and practical to model natural languages. It achieves some of the objectives of a transformational grammar, which represents a sentence structure in terms of surface and deep structures. In addition, it is efficient in representation and parsing and is flexible for expanding experiments.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

SCENARIO FOR data structURE DESIGN.

SCENARIO FOR DATA STRUCTURE DESIGN.

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Tompa, Frank Wm.

An approach to designing data structures which uses step-wise refinement incorporating five distinct stages is presented. The description of the proposal includes its relation both to other research in data structures and to other approaches to data structures design. Finally an application taken from the literature is described in terms of the design framework, and the effects of some data reorganizations are indicated briefly.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

CHARACTERIZING SETS OF data structURES BY GRAPH GRAMMARS.

CHARACTERIZING SETS OF DATA STRUCTURES BY GRAPH GRAMMARS.

引用

ieee conf on comput graphics, pattern recognition, and data struct, proc, pap and abstr

作者： Furtado, A.L.

A graph grammar formalism for defining sets of data structures and characterizing the structural operations on them is described and illustrated by a number of examples. By relying on diagrams the formalism achieves a high degree of non-proceduralness. It is especially adequate for proving the correctness of programs that handle non-trivial data structures. A data definition facility based on the formalism has been implemented.

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：