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

international conference on Image Analysis and Processing

作者： L. Lombardi A. Petrosino Dipartimento di Informatica e Sistemistica Università di Pavia Pavia Italy Complesso Monte SantAngelo ICAR-National Research Council Napoli Italy

We present an efficient and fully parallel 2D object recognition method based on the use of a multiscale tree representation of the object boundary and recursive learning of trees. Specifically, the object is represented by means of a tree where each node, corresponding to a boundary segment at some level of resolution, is characterized by a real vector containing curvature, length, and symmetry of the boundary segment, while the nodes are connected by arcs when segments at successive levels are spatially related. the recognition procedure is formulated as a training procedure made by recursive neural networks followed by a testing procedure over unknown tree structured patterns.

关键词： Shape Neural networks Object recognition pattern recognition Image edge detection Automata Optical computing Image resolution Recurrent neural networks Aircraft

来源：评论

学校读者我要写书评

暂无评论

Hardware implementation of neural network on FPGA for accidents diagnosis of the multi-purpose research reactor of Egypt

Hardware implementation of neural network on FPGA for accide...

引用

international conference on Microelectronics, ICM

作者： M.M. Syiam H.M. Klash I.I. Mahmoud S.S. Haggag

Artificial Neural Networks are applied for solving a wide variety of problems in several areas such as signal processing, robotics, diagnosis, and pattern recognition. these applications demand a high computing power and the traditional software implementation are not sufficient. Hardware implementation of neural networks is very interesting due to its high performance and can easily be made parallel. this paper presents a hardware implementation of neural network after training and simulation on the MATLAB software. the excellent hardware performance has been performed through the use of field programmable gate array (FPGA). the diagnosis of the Multi-Purpose Research Reactor of Egypt accidents is used to test the proposed system.

关键词： Neural network hardware Neural networks Field programmable gate arrays Accidents Inductors Artificial neural networks Signal processing Robots pattern recognition Application software

来源：评论

学校读者我要写书评

暂无评论

Deferring range/domain comparisons in fractal image compression

Deferring range/domain comparisons in fractal image compress...

引用

international conference on Image Analysis and Processing

作者： D. Riccio M. Nappi Dipartimento di Matematica e Informatica Università di Salerno Baronissi Italy

Fractals are a promising framework for several applications other than image coding and transmission, such as database indexing, texture mapping and pattern recognition problems such as writer authentication. However, fractal based algorithms are strongly asymmetric because, in spite of the linearity of the decoding phase, the coding process is very time consuming. Many different solutions have been proposed for this problem, but there is not yet a standard for fractal coding. In this paper we analyze the problem of complexity reduction of the image coding phase and providing a new classification technique based on an approximation error measure. We show formally that postponing range/domain comparisons with respect to a preset block, it is possible to reduce the amount of operations needed to encode each range and therefore whole the image. the proposed strategy allows a drastic complexity reduction of the coding phase. the proposed method has been compared with another fractal coding method, showing in which circumstances the proposed algorithm performs better in terms of both bit rate and/or computing time.

关键词： Fractals Image coding Image databases Indexing pattern recognition Authentication Linearity Decoding Image analysis Approximation error

来源：评论

学校读者我要写书评

暂无评论

Interactive visual pattern recognition

Interactive visual pattern recognition

引用

16th international conference on pattern recognition (ICPR)

作者： Nagy, G Zou, J Rensselaer Polytech Inst Troy NY 12180 USA

ISBN: (纸本)076951695X

Computer Assisted Visual Interactive recognition (CAVIAR) draws on sequential pattern recognition, image database, expert systems, pen computing, and digital camera technology. It is designed to recognize wild flowers and other families of similar objects more accurately than machine vision and faster than most laypersons. the novelty of the approach is that human perceptual ability is exploited through interaction with the image of the unknown object. the computer remembers the characteristics of all previously seen classes, suggests possible operator actions, and displays confidence scores based on already detected features. In one application, consisting of 80 test images of wild flowers, 10 laypersons averaged 80% recognition accuracy, at 12 seconds per flower.

关键词： Expert systems

来源：评论

学校读者我要写书评

暂无评论

12th international conference on Rewriting Techniques and Applications, RTA 2001

引用

12th international conference on Rewriting Techniques and Applications, RTA 2001

ISBN: (纸本)3540421173

the proceedings contain 27 papers. the special focus in this conference is on Rewriting Techniques and Applications. the topics include: computing and proving;rewriting for deduction and verification;universal interaction systems with only two agents;general recursion on second order term algebras;beta reduction constraints;from higher-order to first-order rewriting;combining pattern E-unification algorithms;matching power;dependency pairs for equational rewriting;termination proofs by context-dependent interpretations;uniform normalisation beyond orthogonality;verifying orientability of rewrite rules using the knuth-bendix order;relating accumulative and non-accumulative functional programs;context unification and traversal equations;weakly regular relations and applications;on the parallel complexity of tree automata;transfinite rewriting semantics for term rewriting systems;goal-directed e-unification;the unification problem for confluent right-ground term rewriting systems;on termination of higher-order rewriting;matching with free function symbols;deriving focused calculi for transitive relations;a normal form for church-rosser language systems;confluence and termination of simply typed term rewriting systems and parallel evaluation of interaction nets with MPINE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A general rank-2 parameterization of the fundamental matrix

A general rank-2 parameterization of the fundamental matrix

引用

international conference on pattern recognition

作者： F. Isgro E. Trucco Department of Computing and Electrical Engineering Heriot-Watt University Edinburgh UK

ISBN: (纸本)0769507506

All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For this reason few rank-2 parameterizations of the fundamental matrix have been proposed over the years. In general they can be an over parameterization (12 parameters) being generally valid, or use a minimal set of parameters (eight) but do not cover all the rank-2 matrices. We propose a rank-2 parameterization which uses only 9 parameters, one more of the minimal parameterizations, and covers all the rank-2 matrices.

关键词： Stereo vision Constraint optimization Runtime Optimization methods Testing Encoding Equations Null space

来源：评论

学校读者我要写书评

暂无评论

POWERTEST: A tool for energy conscious weighted random pattern testing

POWERTEST: A tool for energy conscious weighted random patte...

引用

12th international conference on VLSI Design

作者： Zhang, XD Roy, K Bhawmik, S Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)0769500137

Due to the increasing use of portable computing and wireless communications systems, energy consumption is of major concern in today's VLSI circuits. With that in mind we present an energy conscious weighted random pattern testing technique for Built-In-Self-Test (BIST) applications. Energy consumption during BIST operation can be minimized while achieving high fault coverage. Simple measures of observability and controllability of circuit nodes are proposed based on primary input signal probability (probability that a signal is logic ONE). Such measures help determine the testability of a circuit. We developed a tool, POWERTEST, which uses a genetic algorithm based search to determine optimal weight sets (signal probabilities or input signal distribution) at primary inputs to minimize energy dissipations. the inputs conforming to the primary input weight see can be generated using cellular automata or LFSR (Linear Feedback Shift Register). We observed that a single input distribution (or weights) may not be sufficient for some random-pattern resistant circuits, while multiple distributions consume larger area. As a trade-off, two distributions have been used in our analysis. Results on ISCAS benchmark circuits show that energy reduction of up to 97.82% can be achieved (compared to equi-probable random-pattern testing with identical fault coverage) while achieving high fault coverage.

关键词： testing random testing weighted random pattern testing energy conscious testing

来源：评论

学校读者我要写书评

暂无评论

Efficient implementations of software architectures via partial evaluation

引用

Automated Software Engineering 1999年第4期6卷 411-440页

作者： Marlet, Renaud thibault, Scott Consel, Charles IRISA/INRIA-Univ. de Rennes 1 Campus Universitaire de Beaulieu 35042 Rennes Cedex France Gn. Mountain Computing Systems Inc. 83 River Road Essex Jct. VT 05452 United States

the notion of flexibility (that is, the ability to adapt to changing requirements or execution contexts) is recognized as a key concern in structuring software, and many architectures have been designed to that effect. However, the corresponding implementations often come with performance and code size overheads. the source of inefficiency can be identified to be in the loose integration of components, because flexibility is often present not only at the design level but also in the implementation. To solve this flexibility vs. efficiency dilemma, we advocate the use of partial evaluation, which is an automated technique to produce efficient, specialized instances of generic programs. As supporting case studies, we consider several flexible mechanisms commonly found in software architectures: selective broadcast, pattern matching, interpreters, software layers, and generic libraries. Using Tempo, our specializer for C, we show how partial evaluation can safely optimize implementations of those mechanisms. Because this optimization is automatic, it preserves the original genericity and extensibility of the implementation.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Communication pattern based checkpointing coordination for fault-tolerant distributed computing systems 12

Communication pattern based checkpointing coordination for f...

引用

12th international conference on Information Networking (ICOIN-12)

作者： Park, T Yeom, HY Sejong Univ Dept Informat Sci Seoul 143747 South Korea

ISBN: (纸本)0818672250

this paper presents a new checkpointing coordination scheme which utilizes the communication pattern of the cooperating processes. In the proposed scheme, the checkpointing is coordinated for the limited number of processes based on the information regarding the communication pattern of the target program. Unlike the previous solutions which do not utilize the communication pattern, it is possible to reduce the coordination effort as well as the checkpointing frequency. Extensive simulation has been performed to evaluate the performance of the proposed scheme and we concluded that the proposed scheme significantly reduces the checkpointing overhead compared with the loose coordination schemes.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Routing Algorithms in Wormhole Cube Networks

Comparative Analysis of Routing Algorithms in Wormhole Cube ...

引用

4th international conference on Computer Science and Informatics, JCIS 1998, 1st international Workshop on High Performance, 1st international Workshop on Computer Vision, pattern recognition and Image Processing Volume 4

作者： Ould-Khaoua, M. Loucif, S. Al-Dhelaan, A. Computer Science Dept. Strathclyde University Glasgow G1 1XH United Kingdom Computing Science Dept. Glasgow University Glasgow G12 8QQ United Kingdom Computer Science Dept. King Saud University Riyadh Saudi Arabia

there have been many adaptive routing algorithms proposed in the literature for wormhole-routed networks. this paper compares the performance of deterministic routing to two adaptive routing algorithms in the cube network. the comparison takes into account router delays introduced by adaptivity. the results show that in certain circumstances, deterministic routing can outperform adaptive routing.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：