351 research outputs found
Multidimensional Scaling on Multiple Input Distance Matrices
Multidimensional Scaling (MDS) is a classic technique that seeks vectorial
representations for data points, given the pairwise distances between them.
However, in recent years, data are usually collected from diverse sources or
have multiple heterogeneous representations. How to do multidimensional scaling
on multiple input distance matrices is still unsolved to our best knowledge. In
this paper, we first define this new task formally. Then, we propose a new
algorithm called Multi-View Multidimensional Scaling (MVMDS) by considering
each input distance matrix as one view. Our algorithm is able to learn the
weights of views (i.e., distance matrices) automatically by exploring the
consensus information and complementary nature of views. Experimental results
on synthetic as well as real datasets demonstrate the effectiveness of MVMDS.
We hope that our work encourages a wider consideration in many domains where
MDS is needed
On making nD images well-composed by a self-dual local interpolation
International audienceNatural and synthetic discrete images are generally not well-composed, leading to many topological issues: connectivities in binary images are not equivalent, the Jordan Separation theorem is not true anymore, and so on. Conversely, making images well-composed solves those problems and then gives access to many powerful tools already known in mathematical morphology as the Tree of Shapes which is of our principal interest. In this paper, we present two main results: a characterization of 3D well-composed gray-valued images; and a counter-example showing that no local self-dual interpolation satisfying a classical set of properties makes well-composed images with one subdivision in 3D, as soon as we choose the mean operator to interpolate in 1D. Then, we briefly discuss various constraints that could be interesting to change to make the problem solvable in nD
- …