| Address: |
Brian Amberg University of Basel Computer Science Department Bernoullistrasse 16 CH - 4056 Basel, Switzerland | |
| eMail: | brian.amberg@unibas.ch | |
| Phone: | ++41 61 267 0552 | |
| Fax: | ++41 61 267 0559 |
I should put up some of my older talks
I am currently developing 3D-3D registration methods based on mesh representations of the data. These are a family of nonrigid ICP algorithms, which differ in the regularisation employed (deformation gradient, deformation laplacian, statistic based). For many regularisations the ICP step is convex, leading to a natural iterative algorithm.
I have implemented a stereo fitting system, which is quite invariant against light changes. This is a straightforward application of the morphable model.
I am currently working on efficient 2D and 3D AAM fitting methods in the monocular case. The results got their own website on compositional fitting.
A simple 3D-3D fitting method shows how important good data modelling is. Following are some applications of 3D-MM based on 3D data.
The advent of cheap face scanning systems makes biometrie with these sensors feasible. I find it very interesting that it is possible to achieve extremely high recognition rates with shape-only methods, even though humans are able to recognize people even from shape-reduced comic style depictions. Practically, fitting the morphable model to 3D data is more robust and faster than fitting to images, which makes these methods suitable for large-scale applications.
In this project we investigate expression-identity seperating models. It turns out, that even with a simple linear model we achieve good expression invariant face recognition rates.
My Slides on Expression Invariant Face Recognition with a Morphable Model
are here.
A comfortable latex poster template makes it easier to go from paper to poster, as elements of the paper can be directly reused. No more need for these ugly "I printed my powerpoint presentation on 24 pages and pinned it to the wall" posters.
Matlabs interp2 method is very slow when interpolating images, especially multi-plane images. Here is an efficient mex implementation for nearest neighbour, bi-linear, and bi-cubic interpolation.
ba_interp3 is a fast interpolation routine for 3D volumes. It can be used as a drop in replacement for matlabs interp3 function. It supports nearest neighbour, tri-linear, and tri-cubic interpolation.
Restrictions: The only restriction is, that the data has to be on a regularly spaced grid (i.e. coming from meshgrid.
Enhancements: The first advantage of ba_interp3 is that it is a lot faster:
Additionally, it can interpolate layered data. If you interpolate a
matrix of size MxNxO x L1xL2x...xLk then each
of the L1*L2*...*Lk layers is interpolated
simultaneously. Think of this as in RGB images, where there would be a
single additional dimension of size three.
An volume of 3x3 Matrices (i.e. the volume derivative) would have two
additional dimensions of size three.
The code is available at ba_interp3 Interpolation Code
A pet project of mine is this huge database of automatically generated and rated chord-charts for many stringed instruments in different tunings.
A Ruby Course for people who know a bit of programming. This course was given at the sommercampus 2005 of the university of freiburg. It was a 4 * 4 hours course, of which the slides cover approximately 3 * 4 + 1 hours. For the last day I propose to use the ruby quizzes. The slides are published under the GFDL. Feel free to use the slides under these conditions, but I'd like if you'd drop me a note such that I see if they have been useful.