| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Design of an Embedded Position Sensor with Sub-mm Accuracy : magistrsko delo
Matej Nogić, 2019, magistrsko delo

Opis: This master’s thesis presents the development of a machine-vision based localization unit developed at Robert Bosch GmbH, Corporate Sector Research and Advance Engineering in Renningen, Germany. The localization unit was developed primarily for position detection purposes with three degrees of freedom in highly versatile manufacturing systems but has an immense potential to be used anywhere where a precise, low-cost localization method on a two-dimensional surface is required. The complete product development cycle was carried out, from the components selection, schematic and optical system design, to the development of machine vision algorithms, four-layer Printed Circuit Board design and evaluation using an industrial robot. Thanks to the use of a patented two-dimensional code pattern, the localization unit can cover a surface area of 49 km2. The size and speed optimized, self-developed machine-vision algorithms running on a Cortex-M7 microcontroller allow achieving an accuracy of 100 µm and 60 Hz refresh rate.
Ključne besede: localization, machine-vision, code pattern, image sensor, embedded system
Objavljeno v DKUM: 14.01.2020; Ogledov: 1340; Prenosov: 56
.pdf Celotno besedilo (18,20 MB)

2.
An efficient chain code with Huffman coding
Yong Kui Liu, Borut Žalik, 2005, izvirni znanstveni članek

Opis: This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes differ importantly. Therefore, the Huffman coding was applied. The proposed chain code requires 1.97 bits/code, its chainlength is small, it allows representation of non-closed patterns and is rotationally independent.
Ključne besede: computer science, pattern recognition, chain code, Huffman code, object representations, chain code compression
Objavljeno v DKUM: 01.06.2012; Ogledov: 2051; Prenosov: 111
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici