Fast Stitching Algorithm Based on Perceptual HASH and Scale Invariant Feature Transformation
The k-d tree registration algorithm has the disadvantages of too much computation for high-dimensional features, less use of SIFT feature information and a lot of errors in the registration results, due to the complexity of scale invariant feature transformation (SIFT). Therefore, a fast stitching a...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Editorial Department of Journal of Sichuan University (Natural Science Edition)
2021-01-01
|
| Col·lecció: | 四川大学学报. 自然科学版 |
| Matèries: | |
| Accés en línia: | http://science.scu.edu.cn/thesisDetails#10.19907/j.0490-6756.2021.033002 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|