Online robust image alignment via iterative convex optimization
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank decomposition [16], we treat the newly arrived image, after alignment, as being linearly and sparsely reconstructed by the well-aligned ones. The task is accomplished by a sequence of convex optimization that minimizes the l\-norm. After that, online basis updating is pursued in two different ways: (1) a two-stage incremental alignment for joint registration of a large image dataset which is known a prior, and (2) a greedy online alignment of dynamically increasing image sequences, such as in the tracking scenario. In (1), we first sequentially collect basis images that are easily aligned by checking their reconstruction residuals, followed by the second stage where all images are re-aligned one-by-one using the collected basis set. In (2), during the tracking process, we dynamically enrich the image basis set by the new target if it significantly distinguishes itself from existing basis images. While inheriting the benefits of sparsity, our method enjoys the great time efficiency and therefore be capable of dealing with large image set and real time tasks such as visual tracking. The efficacy of the proposed online robust alignment algorithm is verified with extensive experiments on image set alignment and visual tracking, in reference with state-of-the-art methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Incremental Learning for Robust Visual Tracking
Ross, D. A., Lim, J., Lin, R.-S., & Yang, M.-H. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0075-7 · Cited by 3,061 · cited 4×
“Our ORIA tracker is compared with five latest stateof-the-art trackers named Incremental Visual Tracking (IVT) [17], Multiple Instance Learning (MIL) [1], Visual Tracking Decomposition (VTD) [9], Incremental Covariance Tensor Learning (ICTL) [21], and Online AdaBoost (OAB) [6].”
BackgroundMethodInfluentialReal-Time Tracking via On-line Boosting
Grabner, H., Grabner, M., & Bischof, H. (2006) · Procedings of the British Machine Vision Conference 2006 · doi:10.5244/c.20.6 · Cited by 1,198
Cited by
High-Speed Tracking with Kernelized Correlation Filters
Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2345390 · Cited by 5,753
Online Object Tracking: A Benchmark
Wu, Y., Lim, J., & Yang, M.-H. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.312 · Cited by 4,138
Self-citationWu, Y., Lim, J., & Yang, M.-H. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2388226 · Cited by 3,371
Self-citationReal-time part-based visual tracking via adaptive correlation filters
Liu, T., Wang, G., & Yang, Q. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299124 · Cited by 402
The Visual Object Tracking VOT2013 Challenge Results
Kristan, M., Pflugfelder, R., Leonardis, A., Matas, J., Porikli, F., Cehovin, L., Nebehay, G., Fernandez, G., Vojir, T., Gatt, A., et al. (2013) · 2013 IEEE International Conference on Computer Vision Workshops · doi:10.1109/iccvw.2013.20 · Cited by 308
Metadata
- Authors
- Wu, Y., Shen, B., & Ling, H.
- Venue
- 2012 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 1808-1814
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1988689205
- Cited by
- 129
- References
- 2
- FWCI
- 23.06
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.