oru.sePublikationer
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Scene Representation, Registration and ObjectDetection in a Truncated Signed Distance FunctionRepresentation of 3D Space
Örebro University, School of Science and Technology, Örebro University, Sweden.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This thesis presents a study of the signed distance function as a three-dimensional

implicit surface representation and provides a detailed overview of its

different properties. A method for generating such a representation using the

depth-image output from a Kinect camera is reviewed in detail. In order to improve

the quality of the implicit function that can be obtained, registration of

multiple sensor views is proposed and formulated as a camera pose-estimation

problem.

To solve this problem, we first propose to minimize an objective function,

based on the signed distance function itself. We then linearise this objective

and reformulate the pose-estimation problem as a sequence of convex optimization

problems. This allows us to combine multiple depth measurements

into a single distance function and perform tracking using the resulting surface

representation.

Having these components well defined and implemented in a multi-threaded

fashion, we tackle the problem of object detection. This is done by applying the

same pose-estimation procedure to a 3D object template, at several locations,

in an environment reconstructed using the aforementioned surface representation.

We then present results for localization, mapping and object detection.

Experiments on a well-known benchmark indicate that our method for localization

performs very well, and is comparable both in terms of speed and

error to similar algorithms that are widely used today. The quality of our surface

reconstruction is close to the state of the art. Furthermore, we show an

experimental set-up, in which the location of a known object is successfully

determined within an environment, by means of registration.

i

Place, publisher, year, edition, pages
2012. , 60 p.
Series
Studies from the School of Science and Technology at Örebro University
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:oru:diva-25594ISRN: ORU-NAT/DAT-AS-2012/0004--SEOAI: oai:DiVA.org:oru-25594DiVA: diva2:548296
Subject / course
Computer Engineering
Uppsok
Technology
Supervisors
Examiners
Available from: 2012-11-12 Created: 2012-08-30 Last updated: 2012-11-12Bibliographically approved

Open Access in DiVA

fulltext(8341 kB)1666 downloads
File information
File name FULLTEXT01.pdfFile size 8341 kBChecksum SHA-512
3de1b361d9c8eb73ced945cf6c33ad96f18b642502fbcf6b0791fc027ecb2d3d4b6dd4c4d608c6867d4d5ae1140de0c165200284b55cc342afed129f081a92a0
Type fulltextMimetype application/pdf

By organisation
School of Science and Technology, Örebro University, Sweden
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 1668 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2581 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf