PDF version of this entire document

Planning for Final Stages

In the following brief, action items are listed for the near future, explaining how we finish the face recognition project successfully.

The steps to explore next are as follows:

The code for caching is an adaptation of the predominantly C-based implementation of FMM, with hooks that use as interface a caching query (written in C++), all wrapped together in MATLAB for calls from the outside. Based on a quick run through some debugging code, backporting the changes to a 2009 GMDS implementation should be doable. The code is very much separated from GMDS-specific functions that are sufficiently modular.

The past fortnight was mostly spent waiting for the caching work. t was not done in a matter of days as had been wrongly assumed, so we have begun implementing a multi-scale approach where slicing of regions gets done at one level of granularity. The edges of the triangles are very clear to see in Figure [*] because of the small number (1000) of triangles for the face region as a whole. It should then be possible to increase the resolution and work on regions in a piece-wise fashion. GMDS would scale better. The tricky part then becomes the accurate annulment of triangles outside the geodesic circle of choice. That's why the piece-wise approach is likely to lack accuracy, but the imminent results will provide some insight.

Figure: A look at slicing at geodesic boundaries around the nose tip, with coarse resolution on the left and improved resolution that isolates regions on the right
Image cut-through-coarse-mesh-degree-of-coincidence



Subsections
Roy Schestowitz 2012-01-08