We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Multi-instance multi-label learning (MIML) refers to the
learning problems where each example is represented by a
bag/collection of instances and is labeled by multiple labels.
...
Rong Jin (Michigan State University), Shijun Wang...
Human activity recognition is a challenging task, especially
when its background is unknown or changing,
and when scale or illumination differs in each video.
Approaches utilizi...
Image matching is an essential task in many computer vision applications. It is obvious that thorough utilization of all available information is critical for the success of match...