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

Virtual Experiments on ArUco and AprilTag Systems Comparison for Fiducial Marker Rotation Resistance under Noisy Sensory Data

Virtual Experiments on ArUco and AprilTag Systems Comparison...

引用

International Joint Conference on Neural Networks (IJCNN) held as part of the IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Zakiev, Aufar Tsoy, Tatyana Shabalina, Ksenia Magid, Evgeni Saha, Subir Kumar Kazan Fed Univ Intelligent Robot Dept Kazan Russia Indian Inst Technol Delhi Dept Mech Engn Delhi India

ISBN: (纸本)9781728169262

Modern robotic researches propose various machine vision methods for accomplishing robotic tasks. The recognition quality in these tasks is very important for successful performance. A large number of them use fiducial marker systems as a main element of algorithms. However, only a few researches are comparing standard marker systems. This paper is dedicated to the comparison of AprilTag and ArUco markers resistance to rotations in the presence of synthetic noise. Experiments were conducted in ROS/Gazebo virtual environment in order to provide a fair comparison of marker detection and recognition algorithms while eliminating external environment conditions that influence the algorithms' performance. The presented virtual environments allow collecting a significant amount of data by experiment process automation. Different levels of additive white Gaussian noise were applied to input sensory data in order to simulate the imperfection of real digital cameras. The main contribution of the paper is the systematic comparison of AprilTag and ArUco markers for rotation resistance in the presence of optical sensor noise.

关键词： robotics fiducial marker system recognition algorithms experimental comparison ROS Gazebo

来源：评论

学校读者我要写书评

暂无评论

On algorithms for (P₅,gem)-free graphs

On algorithms for (<i>P</i><sub>5</sub>,gem)-free graphs

引用

Workshop on Graph Colorings

作者： Bodlaender, HL Brandstädt, A Kratsch, D Rao, M Spinrad, J Univ Metz Lab Informat Theor & Appl F-57045 Metz France Univ Utrecht Inst Informat & Comp Sci NL-3508 TB Utrecht Netherlands Univ Rostock Fachbereich Informat D-18051 Rostock Germany Vanderbilt Univ Dept Elect Engn & Comp Sci Nashville TN 37235 USA

A graph is (P-5,gem)-free, when it does not contain P-5 (an induced path with five vertices) or a gem (a graph formed by making an universal vertex adjacent to each of the four vertices of the induced path P-4) as an induced subgraph. We present O(n(2)) time recognition algorithms for chordal gem-free graphs and for (P-5,gem)-free graphs. Using a characterization of (P-5,gem)-free graphs by their prime graphs with respect to modular decomposition and their modular decomposition trees [A. Brandstadt, D. Kratsch, On the structure of (P-5,gem)-free graphs, Discrete Appl. Math. 145 (2005), 155-166], we give linear time algorithms for the following NP-complete problems on (P-5,gem)-free graphs: Minimum Coloring;Maximum Weight Stable Set;Maximum Weight Clique;and Minimum Clique Cover. (c) 2005 Elsevier B.V. All rights reserved.

关键词： (P(5,)gem)-free graphs recognition algorithms modular decomposition independent set clique coloring clique cover

来源：评论

学校读者我要写书评

暂无评论

Mining Online Homework Clickstream: Detecting Students' Cooperative Behavior 35

Mining Online Homework Clickstream: Detecting Students' Coop...

引用

35th Chinese Control and Decision Conference (CCDC)

作者： Xue, Jing Fan, Yan Shu, Zhongrui Zhang, Jiafeng Zhan, Chiheng Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing Peoples R China Nanjing Univ Posts & Telecommun Sch Commun Engn Nanjing Peoples R China

ISBN: (纸本)9798350334722

An algorithm model is proposed in this paper to detect learners' cooperative behaviors via online homework click actions, in which students' clickstream sequence is turned into behavior sets. This paper proposes an event-based algorithm model to capture characteristic actions in student behavior sequences, including doing, checking and seeking. These characteristic actions were found of being closely associated with cooperative behaviors among students. A recognition algorithm model based on disjointed set is proposed in this paper, which features both practicality and efficiency in case of limited training data.

关键词： Correlation Analysis Clickstream recognition algorithms Characteristic Action Cheating Detection

来源：评论

学校读者我要写书评

暂无评论

Building Digital Ink Recognizers Using Data Mining: Distinguishing between Text and Shapes in Hand Drawn Diagrams

Building Digital Ink Recognizers Using Data Mining: Distingu...

引用

23rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems

作者： Blagojevic, Rachel Plimmer, Beryl Grundy, John Wang, Yong Univ Auckland Private Bag 92019 Auckland 1 New Zealand Swinburne Univ Technol Hawthorn Vic 3122 Australia

ISBN: (纸本)9783642130212

The low accuracy rates of text-shape dividers or digital ink diagrams are hindering their use in real world applications While recognition of handwriting is well advanced and time have been many recognition approaches proposed for hand drawn sketches, there has been less attention on the division of text and drawing. The choice of features and algorithms is critical to the success of the recognition, yet heuristics currently form the basis of selection We purpose the use of data minim! techniques to automate the process of building text-shape recognizers This systematic approach identifies the algorithms best suited to the specific problem and generates the trained recognizer We have generated dividers using data mining and training with diagrams from three domains The evaluation of our new recognizer on realistic diagrams from two different domains, against two other recognizers shows it to be more successful at dividing shapes and text with 95 2% of strokes correctly classified compared with 86 9% and 83 3% for the two others

关键词： Sketch tools recognition algorithms sketch recognition pen-based interfaces

来源：评论

学校读者我要写书评

暂无评论

Distance-Hereditary Comparability Graphs

引用

Electronic Notes in Discrete Mathematics 2009年第C期35卷 227-233页

作者： Di Stefano, Gabriele Dipartimento di Ingegneria Elettrica e dell'Informazione Università degli Studi dell'Aquila L'Aquila Italy

We study the class of the distance-hereditary comparability graphs, that is, those graphs which admit a transitive orientation and are completely decomposable with respect to the split decomposition. We provide a characterization in terms of forbidden subgraphs. We also provide further characterizations and one of them, based on the split decomposition, is used to devise a recognizing algorithm working in linear time. Finally, we show how to build distance-hereditary comparability graphs. © 2009 Elsevier B.V. All rights reserved.

关键词： Graph theory recognition algorithms split decomposition

来源：评论

学校读者我要写书评

暂无评论

LARGE-GIRTH ROOTS OF GRAPHS

LARGE-GIRTH ROOTS OF GRAPHS

引用

27th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Adamaszek, Anna Adamaszek, Micha L. Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ Warwick Warwick Math Inst Coventry CV4 7AL W Midlands England

ISBN: (纸本)9783939897163

We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + 3, thus improving a bound conjectured by Farzad et al. (STACS 2009). Our algorithm also finds all r-th roots of a given graph that have girth at least 2r + 3 and no degree one vertices, which is a step towards a recent conjecture of Levenshtein that such root should be unique. On the negative side, we prove that recognition becomes an NP- complete problem when the bound on girth is about twice smaller. Similar results have so far only been attempted for r = 2, 3.

关键词： Graph roots Graph powers NP-completeness recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Using SPQR-trees to speed up algorithms based on 2-cutset decompositions

引用

Electronic Notes in Discrete Mathematics 2015年 50卷 169-174页

作者： de Figueiredo, C.M.H. de Macêdo Filho, H.B. Li, Z. Machado, R.C.S. Trotignon, N. COPPE UFRJ Rio de Janeiro Brazil LIENS ENS-Paris Paris France Dimci Inmetro Rio de Janeiro Brazil LIP ENS-Lyon Lyon France

We propose the use of SPQR-trees as a data structure to encode the 3-connected components of a graph and to obtain linear-time recognition algorithms for graph classes structurally characterized by 2-cutset decomposit... 详细信息

关键词： Chordless graphs Graph decomposition Propeller-subgraph-free graphs recognition algorithms SPQR-tree

来源：评论

学校读者我要写书评

暂无评论

(k, +)-distance-hereditary graphs

引用

Journal of Discrete algorithms 2003年第3-4期1卷 281-302页

作者： Cicerone, Serafino Di Stefano, Gabriele Dipartimento di Ingegneria Elettrica Università degli studi dell'Aquila I-67040 Monteluco di Roio L'Aquila Italy

In this work we introduce, characterize, and provide algorithmic results for (k, +)-distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networks with desirable connectivity properties;a network modeled as a (k, +)-distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is bounded by the distance in the non-faulty graph plus an integer constant k. The class of all these graphs is denoted by DH(k, +). By varying the parameter k, classes DH(k, +) include all graphs and form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs. © 2003 Elsevier B.V. All rights reserved.

关键词： Characterization of graph classes Dilation number Distance-hereditary graphs Forbidden subgraphs Interconnection networks recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

Building a larger class of graphs for efficient reconfiguration of vertex colouring

Building a larger class of graphs for efficient reconfigurat...

引用

作者： Merkel, Owen University of Waterloo

学位级别：硕士

A k-colouring of a graph G is an assignment of at most k colours to the vertices of G so that adjacent vertices are assigned different colours. The reconfiguration graph of the k-colourings, R k (G), is the graph whose vertices are the k-colourings of G and two colourings are joined by an edge in R k (G) if they differ in colour on exactly one vertex. For a k-colourable graph G, we investigate the connectivity and diameter of R k+1 (G). It is known that not all weakly chordal graphs have the property that R k+1 (G) is connected. On the other hand, R k+1 (G) is connected and of diameter O(n 2 ) for several subclasses of weakly chordal graphs such as chordal, chordal bipartite, and P 4 -free graphs. We introduce a new class of graphs called OAT graphs that extends the latter classes and in fact extends outside the class of weakly chordal graphs. OAT graphs are built from four simple operations, disjoint union, join, and the addition of a clique or comparable vertex. We prove that if G is a k-colourable OAT graph, then R k+1 (G) is connected with diameter O(n 2 ). Furthermore, we give polynomial time algorithms to recognize OAT graphs and to find a path between any two colourings in R k+1 (G). Feghali and Fiala defined a subclass of weakly chordal graphs, called compact graphs, and proved that for every k-colourable compact graph G, R k+1 (G) is connected with diameter O(n 2 ). We prove that the class of OAT graphs properly contains the class of compact graphs. Feghali and Fiala also asked if for a k-colourable (P 5, co-P 5, C 5 )-free graph G, R k+1 (G) is connected with diameter O(n 2 ). We answer this question in the positive for the subclass of P 4 -sparse graphs, which are the (P 5, co-P 5, C 5, P, co-P, fork, co-fork)-free graphs.

关键词： reconfiguration vertex colouring recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

CONTEXT-SENSITIVE PARSING

引用

COMMUNICATIONS OF THE ACM 1970年第7期13卷 437-&页

作者： WOODS, WA Harvard Univ. Cambridge MA

This paper presents a canonical form for context-sensitive derivations and a parsing algorithm which finds each context-sensitive analysis once and only once. The amount of memory required by the algorithm is essentially no more than that required to store a single complete derivation. In addition, a modified version of the basic algorithm is presented which blocks infinite analyses for grammars which contain loops. The algorithm is also compared with several previous parsers for context-sensitive grammars and general rewriting systems, and the difference between the two types of analyses is discussed. The algorithm appears to be complementary to an algorithm by S. Kuno in several respects, including the space-time trade-off and the degree of context dependence involved. [ABSTRACT FROM AUTHOR]

关键词： context-sensitive grammars context-sensitive parsing formal grammars formal language theory parsing parsing algorithms recognition algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：