Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.
DOI: 10.1109/cvpr.2004.1315099
|View full text |Cite
|
Sign up to set email alerts
|

High resolution video mosaicing with global alignment

Abstract: Image composition (or mosaicing) has attracted a growing attention in recent years as one of the main elements in video analysis and representation. In this paper we deal with the problem of global alignment and super-resolution. We also propose to evaluate the quality of the resulting mosaic by measuring the amount of blurring. Global registration is achieved by combining a graph-based technique - that exploits the topological structure of the sequence induced by the spatial overlap - with a bundle adjustment… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
62
0

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 65 publications
(62 citation statements)
references
References 14 publications
0
62
0
Order By: Relevance
“…For the global transformation estimation, a method which can consider the imaging geometry characteristics based on a graph method is applied. The graph method is divided into maximum spanning tree (MST) generation and reference plane determination phase (Marzotto et al, 2004;Kim and Kim, 2017). In MST generation, the proposed method applies TAR as weight to consider bias of tiepoint distribution.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…For the global transformation estimation, a method which can consider the imaging geometry characteristics based on a graph method is applied. The graph method is divided into maximum spanning tree (MST) generation and reference plane determination phase (Marzotto et al, 2004;Kim and Kim, 2017). In MST generation, the proposed method applies TAR as weight to consider bias of tiepoint distribution.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…If we associate a weight (given by the measure of overlap) to each edge of an arbitrary graph (not necessarily a tree), then, among all possible trees that span the vertices of the graph, any one that collects the largest weights is called a maximum spanning tree (Marzotto et al, 2004). More than one may exist, for example when all the weights are equal; but the Kruskal's algorithm given in the subsection ''Kruskal's Algorithm'' under Appendix is sure to find one (Kruskal, 1956).…”
Section: Global Registration Strategymentioning
confidence: 99%
“…Photogrammetric approaches are now mature (Triggs et al, 1999). They posit that salient features can be identified in the tiles; then, the tiles are warped according to some deformation model (often a homography, sometimes combined with a lens-distortion model) to enforce that the coordinates of matched features do coincide (Kang et al, 2000;Marzotto et al, 2004). One challenging aspect is to determine which salient features do match which; another is to choose a measure of coincidence that is robust in the presence of mismatched features.…”
Section: Introductionmentioning
confidence: 99%
“…Graph relationships on image sequences are frequently encountered in image mosaicking applications, e.g., [33], [34], [35]. However, in such cases, adjacent images can be assumed to have connecting edges, since they are closely-sampled frames of a smooth camera motion.…”
Section: Notation and Terminologymentioning
confidence: 99%