首页 > 最新文献

模式识别与人工智能最新文献

英文 中文
An algorithm for finding nearest neighbours in constant average time with a linear space complexity 一种具有线性空间复杂度的在常数平均时间内寻找最近邻的算法
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201840
L. Micó, J. Oncina, E. Vidal
Given a set of n points or 'prototypes' and another point or 'test sample'. The authors present an algorithm that finds a prototype that is a nearest neighbour of the test sample, by computing only a constant number of distances on the average. This is achieved through a preprocessing procedure that computes only a number of distances and uses an amount of memory that grows lineally with n. The algorithm is an improvement of the previously introduced AESA algorithm and, as such, does not assume the data to be structured into a vector space, making only use of the metric properties of the given distance.<>
给定一组n个点或“原型”和另一个点或“测试样本”。作者提出了一种算法,该算法通过计算平均距离的常数个数来找到与测试样本最近的原型。这是通过一个预处理过程来实现的,该过程只计算一定数量的距离,并使用随n线性增长的内存量。该算法是对先前引入的AESA算法的改进,因此,不假设数据被构造成矢量空间,只使用给定距离的度量属性。
{"title":"An algorithm for finding nearest neighbours in constant average time with a linear space complexity","authors":"L. Micó, J. Oncina, E. Vidal","doi":"10.1109/ICPR.1992.201840","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201840","url":null,"abstract":"Given a set of n points or 'prototypes' and another point or 'test sample'. The authors present an algorithm that finds a prototype that is a nearest neighbour of the test sample, by computing only a constant number of distances on the average. This is achieved through a preprocessing procedure that computes only a number of distances and uses an amount of memory that grows lineally with n. The algorithm is an improvement of the previously introduced AESA algorithm and, as such, does not assume the data to be structured into a vector space, making only use of the metric properties of the given distance.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"4 1","pages":"557-560"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82108236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
Optimal learning for Hopfield associative memory Hopfield联想记忆的最佳学习
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201801
X. Zhuang, Y. Huang
Designs the optimal learning rule for the Hopfield associative memories (HAM) based on three well recognized criteria, that is, all desired attractors must be made not only isolately stable but also asymptotically stable, and the spurious stable states should be the fewest possible. To construct a satisfactory HAM, those criteria are crucial. The paper first analyzes the real cause of the unsatisfactory performance of the Hebb rule and many other existing learning rules designed for HAMs and then show that three criteria actually amount to widely expanding the basin of attraction around each desired attractor. One effective way to widely expand basins of attraction of all desired attractors is to appropriately dig their respective steep kernal basin of attraction. For this, the authors introduce a concept called the Hamming-stability. The Hamming-stability for all desired attractors can be reduced to a moderately expansive linear separability condition at each neuron and thus the well known Rosenblatt's perceptron learning rule is the right one for learning the Hamming-stability. Extensive and systematic experiments were conducted, convincingly showing that the proposed perceptron. Hamming-stability learning rule did take a good care of three optimal criteria.<>
基于三个公认的准则设计了Hopfield联想记忆(HAM)的最优学习规则,即所有期望的吸引子不仅必须是孤立稳定的,而且必须是渐近稳定的,并且伪稳定状态应尽可能少。为了构建一个令人满意的HAM,这些标准是至关重要的。本文首先分析了Hebb规则和许多其他现有的为HAMs设计的学习规则性能不理想的真正原因,然后表明三个准则实际上相当于在每个期望的吸引子周围广泛扩展吸引盆地。广泛扩展所有吸引子的吸引盆地的有效途径之一是适当挖掘它们各自陡峭的核心吸引盆地。为此,作者引入了一个叫做汉明稳定性的概念。所有期望吸引子的汉明稳定性可以简化为每个神经元上适度扩展的线性可分性条件,因此众所周知的Rosenblatt感知器学习规则是学习汉明稳定性的正确规则。进行了广泛而系统的实验,令人信服地表明所提出的感知器。汉明-稳定学习规则确实很好地处理了三个最优准则。
{"title":"Optimal learning for Hopfield associative memory","authors":"X. Zhuang, Y. Huang","doi":"10.1109/ICPR.1992.201801","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201801","url":null,"abstract":"Designs the optimal learning rule for the Hopfield associative memories (HAM) based on three well recognized criteria, that is, all desired attractors must be made not only isolately stable but also asymptotically stable, and the spurious stable states should be the fewest possible. To construct a satisfactory HAM, those criteria are crucial. The paper first analyzes the real cause of the unsatisfactory performance of the Hebb rule and many other existing learning rules designed for HAMs and then show that three criteria actually amount to widely expanding the basin of attraction around each desired attractor. One effective way to widely expand basins of attraction of all desired attractors is to appropriately dig their respective steep kernal basin of attraction. For this, the authors introduce a concept called the Hamming-stability. The Hamming-stability for all desired attractors can be reduced to a moderately expansive linear separability condition at each neuron and thus the well known Rosenblatt's perceptron learning rule is the right one for learning the Hamming-stability. Extensive and systematic experiments were conducted, convincingly showing that the proposed perceptron. Hamming-stability learning rule did take a good care of three optimal criteria.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"37 1","pages":"397-400"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87088814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deterministic pseudo-annealing: a new optimization scheme applied to texture segmentation 确定性伪退火:一种用于纹理分割的新优化方案
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201696
M. Berthod, Shan Yu, J. Stromboni
Proposes deterministic psuedo annealing (DPA), a variation of simulated annealing. The method is an extension of relaxation labeling, a once popular framework for a variety of computer vision problems. The authors present its application to textured image segmentation. The basic idea is to introduce weighted labelings, which assign a weighted combination of labels to any site, and then to build a merit function of all the weighted labels. This function, a polynomial with non-negative coefficients, is an extension to a compact domain of R/sup N/ of an application defined on the finite (but very large) set of labelings; its only extrema under suitable constraints correspond to discrete labelings. DPA consists of changing the constraints, and thus the domain, so as to convexify this function, find its unique global maximum, and then track down the solution until the original constraints are restored, thus obtaining usually good discrete labeling.<>
提出了确定性伪退火(DPA),一种模拟退火的变体。该方法是松弛标记的扩展,松弛标记曾经是各种计算机视觉问题的流行框架。介绍了该方法在纹理图像分割中的应用。其基本思想是引入加权标签,将标签的加权组合分配给任意站点,然后构建所有加权标签的价值函数。这个函数是一个非负系数的多项式,它是在有限(但非常大)标记集上定义的一个应用在R/sup N/紧定义域上的扩展;它在适当约束下的唯一极值对应于离散标记。DPA包括改变约束,从而改变域,从而使该函数凸化,找到其唯一的全局最大值,然后跟踪解,直到恢复原始约束,从而获得通常良好的离散标记。
{"title":"Deterministic pseudo-annealing: a new optimization scheme applied to texture segmentation","authors":"M. Berthod, Shan Yu, J. Stromboni","doi":"10.1109/ICPR.1992.201696","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201696","url":null,"abstract":"Proposes deterministic psuedo annealing (DPA), a variation of simulated annealing. The method is an extension of relaxation labeling, a once popular framework for a variety of computer vision problems. The authors present its application to textured image segmentation. The basic idea is to introduce weighted labelings, which assign a weighted combination of labels to any site, and then to build a merit function of all the weighted labels. This function, a polynomial with non-negative coefficients, is an extension to a compact domain of R/sup N/ of an application defined on the finite (but very large) set of labelings; its only extrema under suitable constraints correspond to discrete labelings. DPA consists of changing the constraints, and thus the domain, so as to convexify this function, find its unique global maximum, and then track down the solution until the original constraints are restored, thus obtaining usually good discrete labeling.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"22 1","pages":"533-536"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82745715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
SIBA: a VLSI systolic array chip for image processing SIBA:用于图像处理的VLSI收缩阵列芯片
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.202118
M. Patel, P. McCabe, N. Ranganathan
Describes the design and implementation of a two-dimensional systolic array processor for applications in image processing and computer vision. The processor architecture is based on a SIMD array of 4-bit processing elements, interconnected by a mesh network with four nearest neighbors. The PE array is programmable allowing the user to develop application-specific algorithms for performing analysis on image data. A prototype VLSI chip has been designed implementing a single PE and has been submitted for fabrication. The chip is expected to operate at 25 MHz.<>
描述用于图像处理和计算机视觉应用的二维收缩阵列处理器的设计和实现。处理器架构基于4位处理元素的SIMD阵列,通过具有四个最近邻居的网状网络相互连接。PE阵列是可编程的,允许用户开发用于执行图像数据分析的特定应用算法。一个原型VLSI芯片已经设计实现一个单一的PE,并已提交制造。该芯片预计工作频率为25mhz。
{"title":"SIBA: a VLSI systolic array chip for image processing","authors":"M. Patel, P. McCabe, N. Ranganathan","doi":"10.1109/ICPR.1992.202118","DOIUrl":"https://doi.org/10.1109/ICPR.1992.202118","url":null,"abstract":"Describes the design and implementation of a two-dimensional systolic array processor for applications in image processing and computer vision. The processor architecture is based on a SIMD array of 4-bit processing elements, interconnected by a mesh network with four nearest neighbors. The PE array is programmable allowing the user to develop application-specific algorithms for performing analysis on image data. A prototype VLSI chip has been designed implementing a single PE and has been submitted for fabrication. The chip is expected to operate at 25 MHz.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"5 1","pages":"15-18"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88881135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A fast and efficient method for extracting text paragraphs and graphics from unconstrained documents 一种快速有效的从无约束文档中提取文本段落和图形的方法
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201771
Franck Lebourgeois, Z. Bublinski, H. Emptoz
Outlines a fast and efficient method for extracting graphics and text paragraphs from printed documents. The method presented is based on bottom-up approach to document analysis and it achieves very good performance in most cases. During the preprocessing characters are linked together to form blocks. Created blocks are segmented, labelled and merged into paragraphs. Simultaneously, graphics are extracted from the image. Algorithms for each step of processing are presented. Also, the obtained experimental results are included.<>
概述了从打印文档中提取图形和文本段落的快速有效方法。本文提出的方法基于自底向上的文档分析方法,在大多数情况下都取得了很好的效果。在预处理过程中,字符被连接在一起形成块。创建的块被分割、标记并合并为段落。同时,从图像中提取图形。给出了各处理步骤的算法。此外,还包括了得到的实验结果
{"title":"A fast and efficient method for extracting text paragraphs and graphics from unconstrained documents","authors":"Franck Lebourgeois, Z. Bublinski, H. Emptoz","doi":"10.1109/ICPR.1992.201771","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201771","url":null,"abstract":"Outlines a fast and efficient method for extracting graphics and text paragraphs from printed documents. The method presented is based on bottom-up approach to document analysis and it achieves very good performance in most cases. During the preprocessing characters are linked together to form blocks. Created blocks are segmented, labelled and merged into paragraphs. Simultaneously, graphics are extracted from the image. Algorithms for each step of processing are presented. Also, the obtained experimental results are included.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"99 1","pages":"272-276"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88535355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 57
A survey of graph grammars: theory and applications 图文法概览:理论与应用
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201776
Hoda Fahmy, D. Blostein
Graph grammars provide a useful formalism for describing structural manipulations of multidimensional data. The authors review briefly theoretical aspects of graph grammars, particularly of the embedding problem, and then summarize graph-grammar applications. Currently graph grammars are used most successfully in application areas other than pattern recognition. Widespread application of graph grammars to picture processing tasks will require research into problems of large-scale grammars, readability of grammars, and grammatical processing of uncertain data.<>
图语法为描述多维数据的结构性操作提供了一种有用的形式。作者简要回顾了图语法的理论方面,特别是嵌入问题,然后总结了图语法的应用。目前,图语法在模式识别以外的应用领域最为成功。图语法在图像处理任务中的广泛应用将需要研究大规模语法、语法的可读性和不确定数据的语法处理问题。
{"title":"A survey of graph grammars: theory and applications","authors":"Hoda Fahmy, D. Blostein","doi":"10.1109/ICPR.1992.201776","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201776","url":null,"abstract":"Graph grammars provide a useful formalism for describing structural manipulations of multidimensional data. The authors review briefly theoretical aspects of graph grammars, particularly of the embedding problem, and then summarize graph-grammar applications. Currently graph grammars are used most successfully in application areas other than pattern recognition. Widespread application of graph grammars to picture processing tasks will require research into problems of large-scale grammars, readability of grammars, and grammatical processing of uncertain data.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"111 1","pages":"294-298"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90911369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 39
Contextual decision making with degrees of belief 基于信念程度的情境决策
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201732
R. Haralick
This paper gives a brief overview of the classical contextual pattern recognition problem. It is shown that the difficulty of this problem is really associated with the determination and use of the support of the joint prior distribution of the category labels. It is indicated how the consistent labeling framework can be used to define the support of the joint prior. It is then shown that this formulation of the problem can be generalized, and a general propositional logic framework which not only defines the support of the joint prior but also permits a calculation to be made evaluating the joint prior for any given set of joint labelings is introduced. It is shown that this formulation is indeed a formulation relating to the degree of belief. A formal system for the degree of belief in terms of an operational probability meaning is developed. The degree of belief in a proposition is exactly the probability with which the proposition can be asserted. It is then shown how the classical contextual problem can be generalized in the belief framework.<>
本文简要概述了经典的上下文模式识别问题。结果表明,该问题的难度实际上与类别标签联合先验分布支持的确定和使用有关。指出了如何使用一致标记框架来定义关节先验的支持度。然后证明了这个问题的表述是可以推广的,并引入了一个一般的命题逻辑框架,该框架不仅定义了联合先验的支持度,而且允许对任何给定的联合标记集进行计算,以评估联合先验。结果表明,这个公式确实是一个与信念程度有关的公式。在操作概率意义方面,开发了一个正式的相信程度系统。对一个命题的相信程度就是这个命题能够被断言的概率。然后展示了如何在信念框架中推广经典语境问题。
{"title":"Contextual decision making with degrees of belief","authors":"R. Haralick","doi":"10.1109/ICPR.1992.201732","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201732","url":null,"abstract":"This paper gives a brief overview of the classical contextual pattern recognition problem. It is shown that the difficulty of this problem is really associated with the determination and use of the support of the joint prior distribution of the category labels. It is indicated how the consistent labeling framework can be used to define the support of the joint prior. It is then shown that this formulation of the problem can be generalized, and a general propositional logic framework which not only defines the support of the joint prior but also permits a calculation to be made evaluating the joint prior for any given set of joint labelings is introduced. It is shown that this formulation is indeed a formulation relating to the degree of belief. A formal system for the degree of belief in terms of an operational probability meaning is developed. The degree of belief in a proposition is exactly the probability with which the proposition can be asserted. It is then shown how the classical contextual problem can be generalized in the belief framework.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"73 1","pages":"105-111"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76598660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Motion analysis using the neural accelerator board 使用神经加速板进行运动分析
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.202159
M. Cavaiuolo, A. Yakovleff, J. Kershaw, C. R. Watson, D. A. Krnak
For the analysis of motion in near real-time there are very high computational requirements. This is a limiting factor in the hardware implementation of such real-time systems. This application, however, is possible if implemented in the form of some parallel architecture. Neural network structures comprising a large number of simple processing elements can offer a solution to achieving the performance requirements of real-time motion analysis. This paper describes the Neural Accelerator, which is based on a systolic array architecture, and how it can be set up to sense the position and range of an object relative to the observer who is travelling towards it.<>
对于近实时的运动分析,有很高的计算要求。这是这种实时系统的硬件实现中的一个限制因素。然而,如果以某种并行体系结构的形式实现,这个应用程序是可能的。由大量简单处理单元组成的神经网络结构可以为实现实时运动分析的性能要求提供一种解决方案。本文描述了基于收缩阵列架构的神经加速器,以及如何设置它来感知物体相对于向它移动的观察者的位置和范围
{"title":"Motion analysis using the neural accelerator board","authors":"M. Cavaiuolo, A. Yakovleff, J. Kershaw, C. R. Watson, D. A. Krnak","doi":"10.1109/ICPR.1992.202159","DOIUrl":"https://doi.org/10.1109/ICPR.1992.202159","url":null,"abstract":"For the analysis of motion in near real-time there are very high computational requirements. This is a limiting factor in the hardware implementation of such real-time systems. This application, however, is possible if implemented in the form of some parallel architecture. Neural network structures comprising a large number of simple processing elements can offer a solution to achieving the performance requirements of real-time motion analysis. This paper describes the Neural Accelerator, which is based on a systolic array architecture, and how it can be set up to sense the position and range of an object relative to the observer who is travelling towards it.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"16 1","pages":"173-176"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75194305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A scalable real-time image processing pipeline 一个可扩展的实时图像处理管道
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.202151
P. Jonker, E. Komen
To speed up image processing in the field of robot vision and industrial inspection, a pipeline element was made which is able to perform fast cellular logic operations. This Cellular Logic Processing Element (CLPE) is able to process binary images with a speed of 100 ns per pixel. The processing element is a CMOS VLSI-device which includes a Writable Logic Array for the storage of sets of 3*3 structuring elements which define the cellular logic operations. This paper describes how such CLPEs can be used for building a pipeline for mixed grey value processing and cellular logic processing.<>
为了加快机器人视觉和工业检测领域的图像处理速度,设计了一种能够执行快速元胞逻辑运算的管道元件。这种细胞逻辑处理元件(CLPE)能够以每像素100纳秒的速度处理二值图像。处理元件是一个CMOS vlsi器件,其中包括一个可写逻辑阵列,用于存储定义单元逻辑操作的3*3结构元素集。本文描述了如何使用这种clpe来构建混合灰色值处理和元胞逻辑处理的管道
{"title":"A scalable real-time image processing pipeline","authors":"P. Jonker, E. Komen","doi":"10.1109/ICPR.1992.202151","DOIUrl":"https://doi.org/10.1109/ICPR.1992.202151","url":null,"abstract":"To speed up image processing in the field of robot vision and industrial inspection, a pipeline element was made which is able to perform fast cellular logic operations. This Cellular Logic Processing Element (CLPE) is able to process binary images with a speed of 100 ns per pixel. The processing element is a CMOS VLSI-device which includes a Writable Logic Array for the storage of sets of 3*3 structuring elements which define the cellular logic operations. This paper describes how such CLPEs can be used for building a pipeline for mixed grey value processing and cellular logic processing.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"115 1","pages":"142-146"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75335237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Performance evaluation of an HMM based OCR system 基于HMM的OCR系统性能评价
Q4 Computer Science Pub Date : 1992-08-30 DOI: 10.1109/ICPR.1992.201697
J. C. Anigbogu, A. Belaïd
Presents a performance analysis of a first order hidden Markov model based OCR system. Trade-offs between accuracy in terms of recognition rates and complexity in terms of the number of states in the model are discussed. For most fonts, optimal performance is achieved with 6-state models. With adequate heuristics and reliable post-processors, 5-state and even 4-state models give reasonable performances (up to 99.60% at 4-states).<>
给出了一阶隐马尔可夫模型OCR系统的性能分析。讨论了在识别率方面的准确性和模型中状态数方面的复杂性之间的权衡。对于大多数字体,使用6状态模型可以实现最佳性能。有了足够的启发式和可靠的后处理器,5-状态甚至4-状态模型都能给出合理的性能(4-状态下高达99.60%)。
{"title":"Performance evaluation of an HMM based OCR system","authors":"J. C. Anigbogu, A. Belaïd","doi":"10.1109/ICPR.1992.201697","DOIUrl":"https://doi.org/10.1109/ICPR.1992.201697","url":null,"abstract":"Presents a performance analysis of a first order hidden Markov model based OCR system. Trade-offs between accuracy in terms of recognition rates and complexity in terms of the number of states in the model are discussed. For most fonts, optimal performance is achieved with 6-state models. With adequate heuristics and reliable post-processors, 5-state and even 4-state models give reasonable performances (up to 99.60% at 4-states).<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":"34 1","pages":"565-568"},"PeriodicalIF":0.0,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73405401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
期刊
模式识别与人工智能
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1