Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Generic line scan camera's ground to image iteration is very inefficient #30

Closed
jessemapel opened this issue Mar 5, 2018 · 5 comments
Closed
Assignees

Comments

@jessemapel
Copy link
Contributor

The generic line scan camera uses Newton's method to calculate sample and line. Looking at some of the literature on this problem, that looks like a possibly poor method.

See:
https://www.asprs.org/wp-content/uploads/pers/1993journal/may/1993_may_655-661.pdf
https://www.asprs.org/wp-content/uploads/pers/2001journal/april/2001_apr_449-452.pdf
https://www.asprs.org/wp-content/uploads/pers/2009journal/september/2009_sep_1059-1067.pdf

We should at the very least switch to solving for line (down-track) and then sample (across-track). ISIS uses a bisecting window search method, that we should consider implementing.

@jessemapel
Copy link
Contributor Author

Another good reference about pushbrooms in general
http://users.rsise.anu.edu.au/hartley/public_html/Papers/pushbroom/pushbroom.pdf

@jessemapel
Copy link
Contributor Author

@jessemapel
Copy link
Contributor Author

CCPS search is probably not going to work because it requires consistent integration times and viewing angles.

@jessemapel
Copy link
Contributor Author

jessemapel commented Mar 6, 2018

We should start with the bisecting window search.

From Wang et al:

The first step of this method is to choose an image interval between the first and the last scanline as the initial search window. Then, it iteratively halves the search window by comparing the three pairs of image point coordinates calculated through colinearity equations, respectively, by employing the EO parameters of the first, the middle, and the last scanline of the search window. Finally, a sequential search is carried out in the final bisecting window within a threshold size

This is basically what ISIS3 does

@jessemapel
Copy link
Contributor Author

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant