Person re-identification is an open and challenging problem in computer vision. Majority of the efforts have been spent either to design the best feature representation or to learn the optimal matching metric. Most approaches have neglected the problem of adapting the selected features or the learned model over time. To address such a problem, we propose a temporal model adaptation scheme with ...

Educational Data Mining (EDM) methods can expand the reach of microgenetic research. This paper presents an example of our pilot work using microgenetic analysis in the context of fraction game data, where we characterize student activity based on clustered sequences of actions. We cluster sequences by the similarity between them, calculated using optimal matching techniques.

Business process model matching is concerned with the detection of similarities in business process models. To support the progress of process model matching techniques, efficient evaluation strategies are required. State-of-the-art evaluation techniques provide a grading of the evaluated matching techniques. However, they only offer limited information about strength and weaknesses of the indi...

We propose an implementation of a model-based free-viewpoint TV (FTV) system using only three uncalibrated cameras. FTV is next-generation media that enables us to see a scene from any viewpoint. A modelbased approach for realizing FTV requires real-time 3D object capture using multiple cameras. Here, we propose a system for reconstructing 3D object surfaces using the so-called 2D continuous dy...

The existence of von Neumann–Morgenstern solutions (stable sets) for assignment games has been an unsolved question since Shapley and Shubik [11]. For each optimal matching between buyers and sellers, Shubik [12] proposed considering the union of the core of the game and the core of the subgames that are compatible with this matching. We prove in the present paper that this set is the unique st...

We deal with an optimal matching problem, that is, we want to transport two measures to a given place, where they will match, minimizing the total transport cost that in our case is given by the sum of the Euclidean distance that each measure is transported. We show that such a problem has a solution. Furthermore we perform a method to approximate the solution of the problem taking limit as p→∞...

2014 We show that the replica symmetric solution of the matching problem (bipartite or not) with independent random distances is stable. We compute the fluctuations and get the O (1/N) corrections to the length of the optimal matching in a generic sample. J. Physique 48 (1987) 1451-1459 SEPTEMBRE 1987, Classification Physics Abstracts 02.10+W 64.40 Cn 75.10 Nr

We present an asymptotically optimal algorithm to locate all the axes of mirror symmetry of a planar i t The algorithm was derived by reducing the 2-D symmetry problem to linear pattern-matching. Opt gorithms for finding rotational symmetries and deciding whether a point symmetry exists are also prese

Existence of von Neumann–Morgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party payments and form a lattice with respect to the same partial order usually defined on the core.

We propose an efficient representation for studying shapes of closed curves in R. This paper combines the strengths of two important ideas elastic shape metric and path-straightening methods and results in a very fast algorithm for finding geodesics in shape spaces. The elastic metric allows for optimal matching of features between the two curves while path-straightening ensures that the algori...