AES E-Library

K. Pollack, P. Majdak, and H. Furtado, "Evaluation of Pinna Point Cloud Alignment by Means of Non-Rigid Registration Algorithms," Paper 10475, (2021 May.). doi: K. Pollack, P. Majdak, and H. Furtado, "Evaluation of Pinna Point Cloud Alignment by Means of Non-Rigid Registration Algorithms," Paper 10475, (2021 May.). doi:
Abstract: Recently, there have been advances towards providing personalised binaural audio by means of numerical cal-culations based on a 3D head mesh. Nevertheless, 3D head meshes obtained by non-contact methods such as photogrammetric reconstruction have difficulties in accurately representing the complex biological structure of the pinna. The problems manifest in noisy meshes with holes, confounding the quality of the calculations. These problems can be tackled by applying a template mesh that is deformed to the personalised but noisy target mesh. In this contribution, we review two state-of-the-art non-rigid registration algorithms applied to the deformation of two high-resolution, high-accuracy pinna point clouds. We evaluate the algorithms by discussing their geometric errors, duration of the alignment task, and their robustness to spatial down-sampling.

@article{pollack2021evaluation,
author={pollack, katharina and majdak, piotr and furtado, hugo},
journal={journal of the audio engineering society},
title={evaluation of pinna point cloud alignment by means of non-rigid registration algorithms},
year={2021},
volume={},
number={},
pages={},
doi={},
month={may},} @article{pollack2021evaluation,
author={pollack, katharina and majdak, piotr and furtado, hugo},
journal={journal of the audio engineering society},
title={evaluation of pinna point cloud alignment by means of non-rigid registration algorithms},
year={2021},
volume={},
number={},
pages={},
doi={},
month={may},
abstract={recently, there have been advances towards providing personalised binaural audio by means of numerical cal-culations based on a 3d head mesh. nevertheless, 3d head meshes obtained by non-contact methods such as photogrammetric reconstruction have difficulties in accurately representing the complex biological structure of the pinna. the problems manifest in noisy meshes with holes, confounding the quality of the calculations. these problems can be tackled by applying a template mesh that is deformed to the personalised but noisy target mesh. in this contribution, we review two state-of-the-art non-rigid registration algorithms applied to the deformation of two high-resolution, high-accuracy pinna point clouds. we evaluate the algorithms by discussing their geometric errors, duration of the alignment task, and their robustness to spatial down-sampling.},}

TY - paper
TI - Evaluation of Pinna Point Cloud Alignment by Means of Non-Rigid Registration Algorithms
SP - EP -
AU - Pollack, Katharina
AU - Majdak, Piotr
AU - Furtado, Hugo
PY - 2021
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - May 2021 TY - paper
TI - Evaluation of Pinna Point Cloud Alignment by Means of Non-Rigid Registration Algorithms
SP - EP -
AU - Pollack, Katharina
AU - Majdak, Piotr
AU - Furtado, Hugo
PY - 2021
JO - Journal of the Audio Engineering Society
IS -
VO -
VL -
Y1 - May 2021
AB - Recently, there have been advances towards providing personalised binaural audio by means of numerical cal-culations based on a 3D head mesh. Nevertheless, 3D head meshes obtained by non-contact methods such as photogrammetric reconstruction have difficulties in accurately representing the complex biological structure of the pinna. The problems manifest in noisy meshes with holes, confounding the quality of the calculations. These problems can be tackled by applying a template mesh that is deformed to the personalised but noisy target mesh. In this contribution, we review two state-of-the-art non-rigid registration algorithms applied to the deformation of two high-resolution, high-accuracy pinna point clouds. We evaluate the algorithms by discussing their geometric errors, duration of the alignment task, and their robustness to spatial down-sampling.