Mean shift algorithm for robust rigid registration between gaussian mixture models

Claudia Arellano, Rozenn Dahyot

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We present a Mean shift (MS) algorithm for solving the rigid point set transformation estimation [1]. Our registration algorithm minimises exactly the Euclidean distance between Gaussian Mixture Models (GMMs). We show experimentally that our algorithm is more robust than previous implementations [1], thanks to both using an annealing framework (to avoid local extrema) and using variable bandwidths in our density estimates. Our approach is applied to 3D real data sets captured with a Lidar scanner and Kinect sensor.

Original languageEnglish
Title of host publicationProceedings of the 20th European Signal Processing Conference, EUSIPCO 2012
Pages1154-1158
Number of pages5
StatePublished - 2012
Externally publishedYes
Event20th European Signal Processing Conference, EUSIPCO 2012 - Bucharest, Romania
Duration: 27 Aug 201231 Aug 2012

Publication series

NameEuropean Signal Processing Conference
ISSN (Print)2219-5491

Conference

Conference20th European Signal Processing Conference, EUSIPCO 2012
Country/TerritoryRomania
CityBucharest
Period27/08/1231/08/12

Keywords

  • Gaussian Mixture Models
  • Mean Shift
  • Registration
  • Rigid Transformation

Fingerprint

Dive into the research topics of 'Mean shift algorithm for robust rigid registration between gaussian mixture models'. Together they form a unique fingerprint.

Cite this