Recognition of the Objects on the Conveyor Belt Using Graph Matching Algorithms

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62156489%3A43110%2F14%3A00228883" target="_blank" >RIV/62156489:43110/14:00228883 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1109/MECHATRONIKA.2014.7018350" target="_blank" >http://dx.doi.org/10.1109/MECHATRONIKA.2014.7018350</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/MECHATRONIKA.2014.7018350" target="_blank" >10.1109/MECHATRONIKA.2014.7018350</a>

Result language

angličtina

Original language name

Recognition of the Objects on the Conveyor Belt Using Graph Matching Algorithms

Original language description

The issue of detecting machine parts on the conveyor belt is solved in this contribution. The graph matching algorithm that calculates the smallest distance between two graphs was selected to solve the given problem. Especially finding the best combination of selecting feature points from the image, creating graph structure from these points and looking for optimal parameters of the graph matching algorithm, is under discussion in this article. Accuracy of the object recognition together with the time consumption of the used methods is considered.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JP - Industrial processes and processing

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

16th Mechatronika 2014

ISBN

978-80-214-4817-9

ISSN

—

e-ISSN

—

Number of pages

749

Pages from-to

715-720

Publisher name

Brno University of technology

Place of publication

Brno

Event location

Brno

Event date

Jan 1, 2014

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—