Results 1 - 10
of
2,300
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
, 2010
"... This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of image domain transformations such that the matrix of transformed images can be decomposed as the sum of a sparse matrix of ..."
Abstract
-
Cited by 161 (6 self)
- Add to MetaCart
with guaranteed fast convergence. We verify the efficacy of the proposed robust alignment algorithm with extensive experiments with both controlled and uncontrolled real data, demonstrating higher accuracy and efficiency than existing methods over a wide range of realistic misalignments and corruptions.
Robust Alignment of Presentation Videos with Slides
"... Abstract. Many presentations consisting of video, audio and slides are being recorded for wider dissemination purposes. Video slide alignment is necessary for efficient review and hence has attracted much attention. However, the recorded video style varies greatly because of different capturing syst ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. Many presentations consisting of video, audio and slides are being recorded for wider dissemination purposes. Video slide alignment is necessary for efficient review and hence has attracted much attention. However, the recorded video style varies greatly because of different capturing
Multiple sequence alignment with the Clustal series of programs
- Nucleic Acids Res
, 2003
"... The Clustal series of programs are widely used in molecular biology for the multiple alignment of both nucleic acid and protein sequences and for preparing phylogenetic trees. The popularity of the programs depends on a number of factors, including not only the accuracy of the results, but also the ..."
Abstract
-
Cited by 747 (5 self)
- Add to MetaCart
The Clustal series of programs are widely used in molecular biology for the multiple alignment of both nucleic acid and protein sequences and for preparing phylogenetic trees. The popularity of the programs depends on a number of factors, including not only the accuracy of the results, but also
Approximately Global Optimization for Robust Alignment of Generalized Shapes
"... Abstract—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images ” to represent source shapes, and propose a novel two-component Gaussian Mixture (GM) distance map representation for target shapes. This asymmetric representation is a flexible image-bas ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
evaluated and compared with those of some state-of-the-art methods. Extensive experiments and comparison performed on generalized 2D and 3D shape data demonstrate the robustness and effectiveness of the method. Index Terms—Shape alignment, point registration, matching, distance transform, particle swarm
Robust Alignment of Transmission Electron Microscope Tilt Series
"... In this paper, we propose a novel method for auto-matic, feature-based alignment of transmission electron mi-croscope images that is needed for computing 3D recon-structions in electron tomography. The proposed method, termed as trifocal alignment, is more accurate than the pre-vious markerless meth ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
In this paper, we propose a novel method for auto-matic, feature-based alignment of transmission electron mi-croscope images that is needed for computing 3D recon-structions in electron tomography. The proposed method, termed as trifocal alignment, is more accurate than the pre-vious markerless
Articulated Shape Matching by Robust Alignment of Embedded Representations
"... In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented by 2-D or 3-D point clouds. The original pointsets are embedded in a spectral representation and the actual matching is ca ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
orthogonal transformation that aligns the two shape embeddings. Relying on the model based clustering formalism, we propose a probabilistic formulation which casts the matching into an EM algorithm. Outliers are properly handled by the algorithm and a simple strategy is adopted to initialize it. Experiments
Efficient and Robust Alignment of Unsynchronized Video Sequences
"... Abstract. This paper addresses the problem of aligning two unsynchronized video sequences. We present a novel approach that allows for temporal and spatial alignment of similar videos captured from independently moving cameras. The goal is to synchronize two videos of a scene such that changes betwe ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. This paper addresses the problem of aligning two unsynchronized video sequences. We present a novel approach that allows for temporal and spatial alignment of similar videos captured from independently moving cameras. The goal is to synchronize two videos of a scene such that changes
Twilight Zone of Protein Sequence Alignments
, 1999
"... l findings are applicable to automatic database searches. Keywords: alignment quality analysis/evolutionary conservation/ genome analysis/protein sequence alignment/sequence space hopping Introduction Protein sequence alignments in twilight zone Protein sequences fold into unique three-dimension ..."
Abstract
-
Cited by 397 (49 self)
- Add to MetaCart
l findings are applicable to automatic database searches. Keywords: alignment quality analysis/evolutionary conservation/ genome analysis/protein sequence alignment/sequence space hopping Introduction Protein sequence alignments in twilight zone Protein sequences fold into unique three
Lucas-Kanade 20 Years On: A Unifying Framework: Part 3
- International Journal of Computer Vision
, 2002
"... Since the Lucas-Kanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow, tracking, and layered motion, to mosaic construction, medical image registration, and face coding. Numerous algorithms hav ..."
Abstract
-
Cited by 706 (30 self)
- Add to MetaCart
Since the Lucas-Kanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow, tracking, and layered motion, to mosaic construction, medical image registration, and face coding. Numerous algorithms
A volumetric method for building complex models from range images,”
- in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. ACM,
, 1996
"... Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, ..."
Abstract
-
Cited by 1020 (17 self)
- Add to MetaCart
Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction
Results 1 - 10
of
2,300