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

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

CLUSTERING CONCEPT AND SECONDARY KEY RETRIEVAL FOR ON-LINE SYSTEMS.

引用

1975年 181-190页

作者： Subas, S. Kashyap, R.L. Yao, S.B.

The doubly-chained tree for single-attribute files, has received fresh interest lately in the context of secondary key retrieval in multiple attribute files. It is demonstrated that the construction of such trees corresponds to a form of hierarchical clustering of the records in the data base. This concept enables one to obtain a realistic estimate for the expected number of pages retrieved per query. Using a small generated file and by simulating the retrieval process it is shown that this estimate approximates the actual average number of pages retrieved per query more closely than the earlier estimate used by A. F. Cardenas and J. P. Sagamang. The clustering concept also offers a basis for ranking attributes according to their probability of occurrence in a query is shown to have a much greater advantage than ranking them so as to have increasing average filial set size. A parametric study is also made of the effect of changes in the query set (changes which affect the probability of occurrence of an attribute in a query).

关键词： data procESSING

来源：评论

学校读者我要写书评

暂无评论

data structURES FOR pattern recognition ALGORITHMS: A CASE STUDY.

DATA STRUCTURES FOR PATTERN RECOGNITION ALGORITHMS: A CASE S...

引用

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

FUZZY REPRESENTATIONS AS MEANS OF OVERCOMING THE OVERCOMMITMENT OF SEGMENTATION.

引用

1975年 215-219页

作者： Pavlidis, Theodosios

The results of a fuzzy segmentation can be used for subsequent classification algorithms which can evaluate fuzzy predicates. For example a peak detection algorithm searching for particular sequences of corners can answer a question about the presence of a peak not by yes or no but by the min left bracket f(x//i) right bracket where I is a member of the set I, and where I is the set of corners forming the peak. Such fuzzy predicates can be combined and used for the final classification. If the final classes are well defined then the fuzziness measured in this way can be used to adjust the design of the overall recognizer. Thus a ″well segmented″ sample will have a high degree of membership while the opposite will be true for a ″poorly segmented″ sample. Misclassification of the former indicates deficiencies in the structure of the classification algorithm which could be corrected without changing the original feature generation algorithm. On the other hand if numerous ″poorly segmented″ samples are found this would suggest the need for a thorough redesign of the feature generation procedure. Notice that ″poorly segmented″ samples are counted regardless of correct or erroneous classification.

关键词： pattern recognition SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

SOME OBSERVATIONS ON LINGUISTICS FOR SCENE ANALYSIS.

SOME OBSERVATIONS ON LINGUISTICS FOR SCENE ANALYSIS.

引用

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

作者： Kasvand, T.

Despite the numerous linguistic and syntactic procedures proposed for scene analysis, the features in terms of which a real scene can be modelled have not been defined in a comprehensive manner. In the processing of the image of a real scene a profusion of features are obtained. A large percentage of these are extraneous while some critical ones used in the linguistic description will be missing. To find a predefined combination of features from such a collection, even on a probabilistic basis, results in a combinatorial explosion. Yet, in the literature on psychology of vision, on the effects of brain damage, on how to draw pictures, etc. , there is a wealth of hints on how ″biological systems″ appear to solve the scene analysis problem. To biological systems, scene analysis ″comes naturally″;one is not even aware that the problem exists. Some observational results will be compared with computational procedures.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

TEXTURE IDENTIFICATION BY A DIRECTED SPLIT-AND-MERGE procEDURE.

TEXTURE IDENTIFICATION BY A DIRECTED SPLIT-AND-MERGE PROCEDU...

引用

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

作者： Pavlidis, T. Tanimoto, S.

Segmentation of a picture into regions of uniform ″visual impression″ is a necessary step in many pattern recognition applications. A data structure is described for efficient segmentation by texture in general, and computing Fourier transforms in particular. This is done by showing ways to estimate the transform over nonrectangular regions in a meaningful way. The basic data structure is formed by dividing the picture recursively into four, sixteen, sixty-four, etc. , parts and then creating a tree whose nodes correspond to regions of the picture. The successors of a node correspond to the four subsets of its region. Such a data structure has already been used for segmentation by average brightness level. This tree is referred to as the picture pyramid. The basis algorithm for segmentation is outlined. In general the use of the split-and-merge procedure in combination with the picture pyramid data structure allows fast updating of the texture descriptors (including the Fourier transform) as the regions are modified during interations of the algorithm.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC DETECTION OF SUSPICIOUS ABNORMALITIES IN BREAST RADIOGRAPHS.

引用

1975年 84-88页

作者： Kimme, Carolyn O'Loughlin, Bernard J. Sklansky, Jack

The authors describe some of the techniques they employ in processing xeromammograms so that abnormal regions of the breasts can be detected automatically. computing is restricted to a minicomputer with 8,000, 16-bit words of core memory, thereby stimulating the construction of cost-effective algorithms. The methods proceed as follows. First breast tissue in the xeromammogram is identified. The tissue is then partitioned into at most 144 sections per breast in such a way that a particular section on the right breast has a similarly placed section on the left breast. Next, 10 statistics are computed for each section to use as features representing texture. The features are normalized and then selected or eliminated by evaluating how well they separate abnormal from normal tissue on a small training set of sections. The training set is also used to devise simple classification rules for the selected features. The complete classification of 2,270 sections for eight patients takes less than 2 minutes of minicomputer time and yields a false positive rate of 26 percent and a false negative rate (for cancerous sections) of . 6 percent.

关键词： pattern recognition SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

RANDOM ACCESS, MULTI FILE structURE ORGANIZATION.

引用

1975年 177-179页

作者： Von Miden, Paul

When utilizing an on-line communication system in an interactive mode, one need is to have easy access to a multiple (unlimited) file structure organization. This paper describes the fundamentals of such a system, which can be logically generated on a computer system by the definition of one physical file on a mass-storage random access device. The physical file forms the scratch pad on which the logical subfiles are generated. Since the system is generalized it can provide quick start-up for new system development, and allow new logic to be validated to satisfy new requirements. Although the prototype system was developed to emulate a small scale data base as its first objective, the main intent was to give maximum fluidity for the application of automated file definition relevant to heuristic analysis and allow incorporation of logic structures not yet defined. The data structure is reviewed from three aspects. First, the thought process which led to the formation of the need for a multiple file structure organization. Second, theoretical design of the data structure and components in the system. Third, application of the design in the development of a communication oriented data base.

关键词： data procESSING

来源：评论

学校读者我要写书评

暂无评论

ON THE OPTIMAL EXTRACTION OF BOUNDARY CURVES.

ON THE OPTIMAL EXTRACTION OF BOUNDARY CURVES.

引用

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

作者： Chien, Y.P.

The major problem encountered in scene analysis is that the picture patterns to be examined are always subject to changes in translation, scale, contrast or more generally to so-called ″rubber sheet″ distortions. Then any scene analysis system using the models that represent and match a picture pattern in the actual image in terms of a fixed template will be infeasible in actual applications. A reasonable solution to the failure of the fixed template model is suggested. A model in the form of a flexible template, in which information concerning the variations that actual visual objects are allowed to have are included in the representation, is used to represent and match the picture patterns. To do this, the template is parameterized in such a way that it will not be sensitive, or even variant, to any of the rubber-sheet distortions. Then by assigning a cost function which corresponds to the way that the set of parameters might be adjusted, a decision scheme is used to evaluate the cost and render the set of optimum parameters that constitute the visual object.

关键词： pattern recognition systems

来源：评论

学校读者我要写书评

暂无评论

data CLUSTERING ALGORITHM FOR FEATURE EXTRACTION & UNSUPERVISED LEARNING.

DATA CLUSTERING ALGORITHM FOR FEATURE EXTRACTION & UNSUPERVI...

引用

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：