Graph signal processing has recently received considerable attention. Several concepts, tools, and applications in such as filtering, transforming, sampling have been extended to graph processing. One extension is the optimal filtering problem. The minimum mean-squared error estimate of an original can be obtained from its distorted noisy version. However, best separation noise, thus least erro...

A d-dimensional framework is a graph and a map from its vertices to E d. Such a framework is globally rigid if it is the only framework in E d with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a generic framework globally rigid? We answer this question by proving a conjecture by Connelly, that his sufficient condition is also necessary. The condition come...

A d-dimensional framework is a graph and a map from its vertices to E d. Such a framework is globally rigid if it is the only framework in E d with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a generic framework globally rigid? We answer this question by proving a conjecture by Connelly, that his sufficient condition is also necessary. The condition come...

Most existing person re-identification (Re-ID) methods are based on supervised learning of a discriminative distance metric. They thus require a large amount of labelled training image pairs which severely limits their scalability. In this work, we propose a novel unsupervised Re-ID approach which requires no labelled training data yet is able to capture discriminative information for cross-vie...

The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in d-dimensional Euclidean space for a constant d so that for each edge the distance between their corresponding endpoints is as close to the weight of the edge as possible. If the given graph is complete, that is, if distance constraints are given as a full matrix, then multi-dimensional ...

This paper presents a localization system that fuses inertial, magnetic field strength (MAG), RF time of flight (ToF), and received signal strength (RSS) measurements to track a pedestrian moving indoors in real time. Our method uses a pose graph to model a pedestrian’s trajectory as a sequence of discrete positions. Rather than using range predictions directly in the pose graph, our approach d...

A focused information criterion is developed to estimate undirected graphical models where for each node in the graph a generalized linear model is put forward conditioned upon the other nodes in the graph. The proposed method selects a graph with a small estimated mean squared error for a user-specified focus, which is a function of the parameters in the generalized linear models, by selecting...