Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"patch matching, Markov random field"”.

  1. Face recognition under varying illumination, pose and contiguous occlusion

    … a very simple algorithm, called Nearest-Subspace Patch Matching, which combines a local translational model for deformation due to pose with a linear subspace model for lighting variations. This algorithm gives surprisingly competitive performance for moderate variations in both pose and …

    uiuc Repository record for Face recognition under varying illumination, pose and contiguous occlusion (opens in a new tab)