2012
DOI: 10.5194/isprsarchives-xxxix-b5-303-2012
|View full text |Cite
|
Sign up to set email alerts
|

Fully Automated Image Orientation in the Absence of Targets

Abstract: ABSTRACT:Automated close-range photogrammetric network orientation has traditionally been associated with the use of coded targets in the object space to allow for an initial relative orientation (RO) and subsequent spatial resection of the images. Over the past decade, automated orientation via feature-based matching (FBM) techniques has attracted renewed research attention in both the photogrammetry and computer vision (CV) communities. This is largely due to advances made towards the goal of automated relat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…and r + j,i represents the imaging beam of the conjugate point in each image. When three images are available, the scale-invariant feature transform (SIFT) descriptor [28] is adopted to extract image features, and a cross-search strategy [29] along with a quasi-random sample consensus (RANSAC) [30] is applied to determine corresponding point triplets in the images. In cases that the number of triple correspondences is lower than a predefined threshold, the new image is ignored, and matching proceeds for the next newly collected image.…”
Section: Positioning In a Pipelinementioning
confidence: 99%
“…and r + j,i represents the imaging beam of the conjugate point in each image. When three images are available, the scale-invariant feature transform (SIFT) descriptor [28] is adopted to extract image features, and a cross-search strategy [29] along with a quasi-random sample consensus (RANSAC) [30] is applied to determine corresponding point triplets in the images. In cases that the number of triple correspondences is lower than a predefined threshold, the new image is ignored, and matching proceeds for the next newly collected image.…”
Section: Positioning In a Pipelinementioning
confidence: 99%
“…Finally, all remaining points are considered as correct point matches. More details can be found in (Stamatopoulos et al, 2012).…”
Section: Extracting and Matching Pointsmentioning
confidence: 99%
“…These mismatches need to be eliminated because, firstly, they will result in erroneous 3D points and in the absence of additional imaging rays they will not be detectable as blunders in later network orientations. Secondly, the complexity of subsequent procedures is reduced when erroneous matches are eliminated (Stamatopoulos et al, 2012). Within the developed filtering/refinement procedure, the feature points of an image are clustered using a theoretical grid.…”
Section: Epipolar Mismatch Filteringmentioning
confidence: 99%
“…The kd-tree is a highly scalable algorithm and the availability of each extra CPU core can halve the search time. Alternatively, a NN search running on the GPU can be used, as proposed by Stamatopoulos et al (2012).…”
Section: Initial Point Correspondence Determinationmentioning
confidence: 99%