A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Falling snow has the visual property that it is simultaneously a set of discrete moving particles as well as a dynamic texture. To capture the dynamic texture properties of fallin...
Michael S. Langer, Linqiao Zhang, Allison W. Klein...