Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, rele...
Face detection has advanced dramatically over the past three decades. Algorithms can now quite reliably detect faces in clutter in or near real time. However, much still needs to ...
The idea of representing images using a bag of visual words is currently popular in object category recognition. Since this representation is typically constructed using unsupervi...
The Middlebury Multi-View Stereo evaluation [18] clearly shows that the quality and speed of most multi-view stereo algorithms depends significantly on the number and selection of...