46,597 research outputs found
Robust Non-Rigid Registration with Reweighted Position and Transformation Sparsity
Non-rigid registration is challenging because it is ill-posed with high
degrees of freedom and is thus sensitive to noise and outliers. We propose a
robust non-rigid registration method using reweighted sparsities on position
and transformation to estimate the deformations between 3-D shapes. We
formulate the energy function with position and transformation sparsity on both
the data term and the smoothness term, and define the smoothness constraint
using local rigidity. The double sparsity based non-rigid registration model is
enhanced with a reweighting scheme, and solved by transferring the model into
four alternately-optimized subproblems which have exact solutions and
guaranteed convergence. Experimental results on both public datasets and real
scanned datasets show that our method outperforms the state-of-the-art methods
and is more robust to noise and outliers than conventional non-rigid
registration methods.Comment: IEEE Transactions on Visualization and Computer Graphic
Fine-To-Coarse Global Registration of RGB-D Scans
RGB-D scanning of indoor environments is important for many applications,
including real estate, interior design, and virtual reality. However, it is
still challenging to register RGB-D images from a hand-held camera over a long
video sequence into a globally consistent 3D model. Current methods often can
lose tracking or drift and thus fail to reconstruct salient structures in large
environments (e.g., parallel walls in different rooms). To address this
problem, we propose a "fine-to-coarse" global registration algorithm that
leverages robust registrations at finer scales to seed detection and
enforcement of new correspondence and structural constraints at coarser scales.
To test global registration algorithms, we provide a benchmark with 10,401
manually-clicked point correspondences in 25 scenes from the SUN3D dataset.
During experiments with this benchmark, we find that our fine-to-coarse
algorithm registers long RGB-D sequences better than previous methods
On affine rigidity
We define the notion of affine rigidity of a hypergraph and prove a variety
of fundamental results for this notion. First, we show that affine rigidity can
be determined by the rank of a specific matrix which implies that affine
rigidity is a generic property of the hypergraph.Then we prove that if a graph
is is -vertex-connected, then it must be "generically neighborhood
affinely rigid" in -dimensional space. This implies that if a graph is
-vertex-connected then any generic framework of its squared graph must
be universally rigid.
Our results, and affine rigidity more generally, have natural applications in
point registration and localization, as well as connections to manifold
learning.Comment: Updated abstrac
Large-Scale Sensor Network Localization via Rigid Subnetwork Registration
In this paper, we describe an algorithm for sensor network localization (SNL)
that proceeds by dividing the whole network into smaller subnetworks, then
localizes them in parallel using some fast and accurate algorithm, and finally
registers the localized subnetworks in a global coordinate system. We
demonstrate that this divide-and-conquer algorithm can be used to leverage
existing high-precision SNL algorithms to large-scale networks, which could
otherwise only be applied to small-to-medium sized networks. The main
contribution of this paper concerns the final registration phase. In
particular, we consider a least-squares formulation of the registration problem
(both with and without anchor constraints) and demonstrate how this otherwise
non-convex problem can be relaxed into a tractable convex program. We provide
some preliminary simulation results for large-scale SNL demonstrating that the
proposed registration algorithm (together with an accurate localization scheme)
offers a good tradeoff between run time and accuracy.Comment: 5 pages, 8 figures, 1 table. To appear in Proc. IEEE International
Conference on Acoustics, Speech, and Signal Processing, April 19-24, 201
Better Feature Tracking Through Subspace Constraints
Feature tracking in video is a crucial task in computer vision. Usually, the
tracking problem is handled one feature at a time, using a single-feature
tracker like the Kanade-Lucas-Tomasi algorithm, or one of its derivatives.
While this approach works quite well when dealing with high-quality video and
"strong" features, it often falters when faced with dark and noisy video
containing low-quality features. We present a framework for jointly tracking a
set of features, which enables sharing information between the different
features in the scene. We show that our method can be employed to track
features for both rigid and nonrigid motions (possibly of few moving bodies)
even when some features are occluded. Furthermore, it can be used to
significantly improve tracking results in poorly-lit scenes (where there is a
mix of good and bad features). Our approach does not require direct modeling of
the structure or the motion of the scene, and runs in real time on a single CPU
core.Comment: 8 pages, 2 figures. CVPR 201
- …