Código QR (código de barras bidimensional)

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...

תיאור מלא

שמור ב:
Principais autores: YAO Xiao-Tao, WANG Zheng-Yong, SHI Wei, QING Lin-Bo, HE Xiao-Hai
פורמט: Artigo
שפה:Inglês
יצא לאור: Editorial Department of Journal of Sichuan University (Natural Science Edition) 2021-01-01
סדרה:四川大学学报. 自然科学版
נושאים:
SIFT feature
Image stitching
Perceptual HASH
Feature matching
Best seams
גישה מקוונת:http://science.scu.edu.cn/thesisDetails#10.19907/j.0490-6756.2021.033002
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים