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

recognition algorithms for orders of small width and graphs of small Dilworth number

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS 2003年第4期20卷 351-364页

作者： Felsner, S Raghavan, V Spinrad, J Free Univ Berlin Fachbereich Math & Informat D-14195 Berlin Germany Vanderbilt Univ CS Dept Nashville TN 37235 USA

Partially ordered sets of small width and graphs of small Dilworth number have many interesting properties and have been well studied. Here we show that recognition of such orders and graphs can be done more efficiently than by using the well-known algorithms based on bipartite matching and matrix multiplication. In particular, we show that deciding deciding if an order has width k can be done in O(kn(2)) time and whether a graph has Dilworth number k can be done in O(k(2)n(2)) time. For very small k we have even better results. We show that orders of width at most 3 can be recognized in O(n) time and of width at most 4 in O(n log n).

关键词： partial order width Dilworth number recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

recognition algorithms Based on the Selection of 2D Representative Pseudo-objects 11th

Recognition Algorithms Based on the Selection of 2D Represen...

引用

11th International Conference on High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production (HPCST)

作者： Mirzaev, Olimjon N. Radjabov, Sobirjon S. Mirzaeva, Gulmira R. Usmanov, Kuvvat T. Mirzaev, Nomaz M. Res Inst Dev Digital Technol & Artificial Intelli 17ABuz 2 Tashkent 100125 Uzbekistan Tashkent Univ Informat Technol Named Muhammad Al 108 Amir Temur Ave Tashkent 100200 Uzbekistan Tashkent Inst Architecture & Civil Engn 13 Navoi Ave Tashkent 100011 Uzbekistan

ISBN: (纸本)9783030941413;9783030941406

Building of a recognition algorithms (RA) based on the selection of representative pseudo-objects and providing a solution to the problem of recognition of objects represented in a big-dimensionality feature space (BDFS) are described in this article. The proposed approach is based on the formation of a set of 2D basic pseudo-objects and the determination of a suitable set of 2D proximity functions (PF) when designing an extreme RA. The article contains a parametric description of the proposed RA. It is presented in the form of sequence of computational procedures. And the main ones are procedures for determining: the functions of differences among objects in a 2D subspace of representative features (TSRF);groups of interconnectedness pseudo-objects (GIPO) in the same subspace;a set of basic pseudo-objects;functions of differences between the basic pseudo-object in a TSRF. There are also groups of interconnectedness and basic PF;the integral recognizing operator with respect to basic PF. The results of a comparative analysis of the proposed and known RA are presented. The main conclusion is that the implementation of the approach proposed in this paper makes it possible to switch from the original BDFS to the space of representative features (RF), the dimension of which is significantly lower.

关键词： recognition algorithms Representative feature 2D pseudo-objects Proximity function Basic proximity functions

来源：评论

学校读者我要写书评

暂无评论

Linear Time recognition algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs

引用

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2010年第5期12卷 63-82页

作者： Brown, David E. Busch, Arthur H. Isaak, Garth Utah State Univ Dept Math & Stat Logan UT 84341 USA Univ Dayton Dept Math Dayton OH 45465 USA Lehigh Univ Dept Math Bethlehem PA 18015 USA

A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with an interval associated to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is a probe. A graph G = (V, E) is a tolerance graph if each vertex v is an element of V can be associated to an interval I-v of the real line and a positive real number t(v) such that uv is an element of E if and only if vertical bar I-u boolean AND I-v vertical bar >= min {t(u), t(v)}. In this paper we present O(vertical bar V vertical bar + vertical bar E vertical bar) recognition algorithms for both bipartite probe interval graphs and bipartite tolerance graphs. We also give a new structural characterization for each class which follows from the algorithms.

关键词： tolerance graphs probe interval graphs recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2005年第3期18卷 554-570页

作者： Hell, P Huang, J Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Univ Victoria Dept Math & Stat Victoria BC V8W 3P4 Canada

Recently, D. Corneil found a simple 3-sweep lexicographic breadth first search (LexBFS) algorithm for the recognition of proper interval graphs. We point out how to modify Corneil's algorithm to make it a certifying algorithm, and then describe a similar certifying 3-sweep LexBFS algorithm for the recognition of proper interval bigraphs. It follows from an earlier paper that the class of proper interval bigraphs is equal to the better known class of bipartite permutation graphs, and so we have a certifying algorithm for that class as well. All our algorithms run in time O(m+n), including the certification phase. The certificates of representability (the intervals) can be authenticated in time O(m+n). The certificates of nonrepresentability (the forbidden subgraphs) can be authenticated in time O(n).

关键词： proper interval graphs proper interval bigraphs bipartite permutation graphs bipartite trapezoid graphs proper circular arc graphs lexicographic breadth first search recognition algorithms certifying algorithms forbidden subgraph characterizations

来源：评论

学校读者我要写书评

暂无评论

Using SPQR-trees to speed up recognition algorithms based on 2-cutsets

引用

DISCRETE APPLIED MATHEMATICS 2018年 245卷 101-108页

作者： de Macedo Filho, H. B. de Figueiredo, C. M. H. Li, Z. Machado, R. C. S. Univ Fed Rio de Janeiro Rio De Janeiro Brazil Ecole Normale Super Paris France Inmetro Rio De Janeiro Brazil CEFET RJ Rio De Janeiro Brazil

Several well-studied classes of graphs admit structural characterizations via proper 2-cutsets which lead to polynomial-time recognition algorithms. The algorithms so far obtained for those recognition problems do not guarantee linear-time complexity. The bottleneck to those algorithms is the Omega(nm)-time complexity to fully decompose by proper 2-cutsets a graph with n vertices and m edges. In the present work, we investigate the 3-connected components of a graph and propose the use of the SPQR-tree data structure to obtain a fully decomposed graph in linear time. As a consequence, we show that the recognition of chordless graphs and of graphs that do not contain a propeller as a subgraph can be done in linear time, answering questions in the existing literature. (C) 2017 Elsevier B.V. All rights reserved.

关键词： recognition algorithms Linear-time complexity SPQR-trees Chordless graphs Propeller-free graphs

来源：评论

学校读者我要写书评

暂无评论

A study of two image-recognition algorithms for the classification of flaws in a test object according to its digital image

引用

RUSSIAN JOURNAL OF NONDESTRUCTIVE TESTING 2015年第10期51卷 644-651页

作者： Vorobeichikov, S. E. Fokin, V. A. Udod, V. A. Temnik, A. K. Tomsk State Univ Tomsk 634050 Russia Siberian State Med Univ Tomsk Russia Tomsk Polytech Univ Inst Nondestruct Testing Tomsk Russia

The mathematical model of a digital radiation image is given that corresponds to a test object that contains two types of defects, namely, pores and cracks (or non-penetrating defects). Two algorithms for automatic image recognition of these defects on a digital radiation image of an object are given. The effectiveness of the algorithms was evaluated via mathematical simulation.

关键词： test object defects digital radiation image recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Binary signed-graphic matroids: Representations and recognition algorithms

引用

DISCRETE MATHEMATICS 2020年第7期343卷 111887-111887页

作者： Papalamprou, Konstantinos Pitsoulis, Leonidas S. Vretta, Eleni-Maria E. Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki 54124 Greece

recognition algorithms determining whether a given matroid is binary signed-graphic or not are presented in this work. Depending on whether the input is a cographic, a binary or a general matroid different algorithms are provided utilizing mainly decomposition results for the class of signed-graphic matroids. Finally, in order to devise such algorithms, necessary results regarding the representability of signed-graphic matroids in various fields are also given. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Signed-graphic matroids recognition algorithms Signed graphs

来源：评论

学校读者我要写书评

暂无评论

An analysis of real time implementation of Fourier transform-based frequency recognition algorithms

An analysis of real time implementation of Fourier transform...

引用

IEEE International Symposium on Consumer Electronics

作者： Bartels, M Linfoot, S Univ Reading Sch Syst Engn Reading RG6 2AH Berks England

ISBN: (纸本)0780385268

Frequency recognition is an important task in many engineering fields such as audio signal processing and telecommunications engineering, for example in applications like Dual-Tone Multi-Frequency (DTMF) detection or the recognition of the carrier frequency of a Global Positioning, System (GPS) signal. This paper will present results of investigations on several common Fourier Transform-based frequency recognition algorithms implemented in real time on a Texas Instruments (TI) TMS320C6713 Digital Signal Processor (DSP) core. In addition, suitable metrics are going to be evaluated in order to ascertain which of these selected algorithms is appropriate for audio signal processing(1).

关键词： fourier transform-based frequency recognition algorithms generic musical instrument system digital signal processor real time analysis

来源：评论

学校读者我要写书评

暂无评论

Improve on recognition algorithms of RoboCup

Improve on recognition algorithms of RoboCup

引用

4th World Congress on Intelligent Control and Automation

作者： Peng, XY Zhang, Y Tan, HL HuNan Univ Coll Machine & Automobile Changsha 410082 HuNan Peoples R China

ISBN: (纸本)0780372689

This paper proposes some solutions to improve on recognition algorithms of RoboCup, which is including methods to improve recognition efficiency, recognition precision, and to restrain effect caused by reflex. Multiresolution scanning and dynamic window technique can be used to improve efficiency and precision. In order to restrain effect of reflex, gray-level threshold will be self-adaptive. This paper also proposes a method helping to geometric calibration of image.

关键词： mobile robots image recognition recognition algorithms RoboCup recognition efficiency recognition precision multiresolution scanning dynamic window technique

来源：评论

学校读者我要写书评

暂无评论

A Study of recognition algorithms of Large-scale Image Based on the Fusion of SIFT Features and BP Neutral Network 4

A Study of Recognition Algorithms of Large-scale Image Based...

引用

4th International Conference on Intelligent System and Applied Material (GSAM)

作者： Ding, Xue Han, Shun Yang, Honghong Xu, Jin Yang, Guang YunNan Normal Univ Sch Enrolment Kunming 650500 Peoples R China China Aerosp Sci & Ind Corp Res Inst 33 Beijing 100074 Peoples R China YunNan Normal Univ Sch Arts Kunming 650500 Peoples R China Prod Practice Base Management Ctr YunNan Jiaotong Coll Kunming 650500 Peoples R China Recruitment & Employment Off YunNan Culture & Arts Vocat & Tech Coll Kunming 650111 Peoples R China

ISBN: (纸本)9783038353140

Large-scale image recognition refers to giving computer the human visiual intelligent, in the massive data mode using computer to rrecognize the input image rapidly and exactly. In the process of recognition, the light, rotation and other factors will be the effects, meanwhile these noises will increase the difficulty of visual object recognition. How to recognize the large-scale image in the real scene and complex environment becomes a research topic. In order to recognize the large-scale image in real and complex envvironment and get a better recognition effect, this paper presents large-scale image based recognition algorithms with fusion of SIFT features and BP neutral network.

关键词： large-scale image SIFT features BP neutral network recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：