Feature Matching Improvement through Merging Features for Remote Sensing Imagery
Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We...
Ausführliche Beschreibung
Autor*in: |
Karim, Shahid [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2018 |
---|
Schlagwörter: |
---|
Anmerkung: |
© 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
---|
Übergeordnetes Werk: |
Enthalten in: 3D Research - Berlin : Springer, 2010, 9(2018), 4 vom: 17. Okt. |
---|---|
Übergeordnetes Werk: |
volume:9 ; year:2018 ; number:4 ; day:17 ; month:10 |
Links: |
---|
DOI / URN: |
10.1007/s13319-018-0203-x |
---|
Katalog-ID: |
SPR031330479 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | SPR031330479 | ||
003 | DE-627 | ||
005 | 20230331071640.0 | ||
007 | cr uuu---uuuuu | ||
008 | 201007s2018 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1007/s13319-018-0203-x |2 doi | |
035 | |a (DE-627)SPR031330479 | ||
035 | |a (SPR)s13319-018-0203-x-e | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 1 | |a Karim, Shahid |e verfasserin |4 aut | |
245 | 1 | 0 | |a Feature Matching Improvement through Merging Features for Remote Sensing Imagery |
264 | 1 | |c 2018 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
500 | |a © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 | ||
520 | |a Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. | ||
650 | 4 | |a Feature matching |7 (dpeaa)DE-He213 | |
650 | 4 | |a SURF |7 (dpeaa)DE-He213 | |
650 | 4 | |a FAST |7 (dpeaa)DE-He213 | |
650 | 4 | |a BRISK |7 (dpeaa)DE-He213 | |
650 | 4 | |a RANSAC |7 (dpeaa)DE-He213 | |
700 | 1 | |a Zhang, Ye |4 aut | |
700 | 1 | |a Brohi, Ali Anwar |4 aut | |
700 | 1 | |a Asif, Muhammad Rizwan |4 aut | |
773 | 0 | 8 | |i Enthalten in |t 3D Research |d Berlin : Springer, 2010 |g 9(2018), 4 vom: 17. Okt. |w (DE-627)624823733 |w (DE-600)2550008-9 |x 2092-6731 |7 nnns |
773 | 1 | 8 | |g volume:9 |g year:2018 |g number:4 |g day:17 |g month:10 |
856 | 4 | 0 | |u https://dx.doi.org/10.1007/s13319-018-0203-x |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_SPRINGER | ||
912 | |a GBV_ILN_120 | ||
912 | |a GBV_ILN_266 | ||
912 | |a GBV_ILN_281 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2031 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2037 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2039 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2065 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2070 | ||
912 | |a GBV_ILN_2086 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2108 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2113 | ||
912 | |a GBV_ILN_2116 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2119 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2144 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2188 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4246 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
951 | |a AR | ||
952 | |d 9 |j 2018 |e 4 |b 17 |c 10 |
author_variant |
s k sk y z yz a a b aa aab m r a mr mra |
---|---|
matchkey_str |
article:20926731:2018----::etrmthnipoeethogmrigetrso |
hierarchy_sort_str |
2018 |
publishDate |
2018 |
allfields |
10.1007/s13319-018-0203-x doi (DE-627)SPR031330479 (SPR)s13319-018-0203-x-e DE-627 ger DE-627 rakwb eng Karim, Shahid verfasserin aut Feature Matching Improvement through Merging Features for Remote Sensing Imagery 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. Feature matching (dpeaa)DE-He213 SURF (dpeaa)DE-He213 FAST (dpeaa)DE-He213 BRISK (dpeaa)DE-He213 RANSAC (dpeaa)DE-He213 Zhang, Ye aut Brohi, Ali Anwar aut Asif, Muhammad Rizwan aut Enthalten in 3D Research Berlin : Springer, 2010 9(2018), 4 vom: 17. Okt. (DE-627)624823733 (DE-600)2550008-9 2092-6731 nnns volume:9 year:2018 number:4 day:17 month:10 https://dx.doi.org/10.1007/s13319-018-0203-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_120 GBV_ILN_266 GBV_ILN_281 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2055 GBV_ILN_2059 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 AR 9 2018 4 17 10 |
spelling |
10.1007/s13319-018-0203-x doi (DE-627)SPR031330479 (SPR)s13319-018-0203-x-e DE-627 ger DE-627 rakwb eng Karim, Shahid verfasserin aut Feature Matching Improvement through Merging Features for Remote Sensing Imagery 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. Feature matching (dpeaa)DE-He213 SURF (dpeaa)DE-He213 FAST (dpeaa)DE-He213 BRISK (dpeaa)DE-He213 RANSAC (dpeaa)DE-He213 Zhang, Ye aut Brohi, Ali Anwar aut Asif, Muhammad Rizwan aut Enthalten in 3D Research Berlin : Springer, 2010 9(2018), 4 vom: 17. Okt. (DE-627)624823733 (DE-600)2550008-9 2092-6731 nnns volume:9 year:2018 number:4 day:17 month:10 https://dx.doi.org/10.1007/s13319-018-0203-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_120 GBV_ILN_266 GBV_ILN_281 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2055 GBV_ILN_2059 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 AR 9 2018 4 17 10 |
allfields_unstemmed |
10.1007/s13319-018-0203-x doi (DE-627)SPR031330479 (SPR)s13319-018-0203-x-e DE-627 ger DE-627 rakwb eng Karim, Shahid verfasserin aut Feature Matching Improvement through Merging Features for Remote Sensing Imagery 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. Feature matching (dpeaa)DE-He213 SURF (dpeaa)DE-He213 FAST (dpeaa)DE-He213 BRISK (dpeaa)DE-He213 RANSAC (dpeaa)DE-He213 Zhang, Ye aut Brohi, Ali Anwar aut Asif, Muhammad Rizwan aut Enthalten in 3D Research Berlin : Springer, 2010 9(2018), 4 vom: 17. Okt. (DE-627)624823733 (DE-600)2550008-9 2092-6731 nnns volume:9 year:2018 number:4 day:17 month:10 https://dx.doi.org/10.1007/s13319-018-0203-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_120 GBV_ILN_266 GBV_ILN_281 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2055 GBV_ILN_2059 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 AR 9 2018 4 17 10 |
allfieldsGer |
10.1007/s13319-018-0203-x doi (DE-627)SPR031330479 (SPR)s13319-018-0203-x-e DE-627 ger DE-627 rakwb eng Karim, Shahid verfasserin aut Feature Matching Improvement through Merging Features for Remote Sensing Imagery 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. Feature matching (dpeaa)DE-He213 SURF (dpeaa)DE-He213 FAST (dpeaa)DE-He213 BRISK (dpeaa)DE-He213 RANSAC (dpeaa)DE-He213 Zhang, Ye aut Brohi, Ali Anwar aut Asif, Muhammad Rizwan aut Enthalten in 3D Research Berlin : Springer, 2010 9(2018), 4 vom: 17. Okt. (DE-627)624823733 (DE-600)2550008-9 2092-6731 nnns volume:9 year:2018 number:4 day:17 month:10 https://dx.doi.org/10.1007/s13319-018-0203-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_120 GBV_ILN_266 GBV_ILN_281 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2055 GBV_ILN_2059 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 AR 9 2018 4 17 10 |
allfieldsSound |
10.1007/s13319-018-0203-x doi (DE-627)SPR031330479 (SPR)s13319-018-0203-x-e DE-627 ger DE-627 rakwb eng Karim, Shahid verfasserin aut Feature Matching Improvement through Merging Features for Remote Sensing Imagery 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. Feature matching (dpeaa)DE-He213 SURF (dpeaa)DE-He213 FAST (dpeaa)DE-He213 BRISK (dpeaa)DE-He213 RANSAC (dpeaa)DE-He213 Zhang, Ye aut Brohi, Ali Anwar aut Asif, Muhammad Rizwan aut Enthalten in 3D Research Berlin : Springer, 2010 9(2018), 4 vom: 17. Okt. (DE-627)624823733 (DE-600)2550008-9 2092-6731 nnns volume:9 year:2018 number:4 day:17 month:10 https://dx.doi.org/10.1007/s13319-018-0203-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_120 GBV_ILN_266 GBV_ILN_281 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2055 GBV_ILN_2059 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 AR 9 2018 4 17 10 |
language |
English |
source |
Enthalten in 3D Research 9(2018), 4 vom: 17. Okt. volume:9 year:2018 number:4 day:17 month:10 |
sourceStr |
Enthalten in 3D Research 9(2018), 4 vom: 17. Okt. volume:9 year:2018 number:4 day:17 month:10 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Feature matching SURF FAST BRISK RANSAC |
isfreeaccess_bool |
false |
container_title |
3D Research |
authorswithroles_txt_mv |
Karim, Shahid @@aut@@ Zhang, Ye @@aut@@ Brohi, Ali Anwar @@aut@@ Asif, Muhammad Rizwan @@aut@@ |
publishDateDaySort_date |
2018-10-17T00:00:00Z |
hierarchy_top_id |
624823733 |
id |
SPR031330479 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR031330479</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331071640.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s13319-018-0203-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR031330479</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s13319-018-0203-x-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karim, Shahid</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Feature Matching Improvement through Merging Features for Remote Sensing Imagery</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feature matching</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SURF</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">FAST</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">BRISK</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RANSAC</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Ye</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brohi, Ali Anwar</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Asif, Muhammad Rizwan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">3D Research</subfield><subfield code="d">Berlin : Springer, 2010</subfield><subfield code="g">9(2018), 4 vom: 17. Okt.</subfield><subfield code="w">(DE-627)624823733</subfield><subfield code="w">(DE-600)2550008-9</subfield><subfield code="x">2092-6731</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:4</subfield><subfield code="g">day:17</subfield><subfield code="g">month:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s13319-018-0203-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2070</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2086</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">2018</subfield><subfield code="e">4</subfield><subfield code="b">17</subfield><subfield code="c">10</subfield></datafield></record></collection>
|
author |
Karim, Shahid |
spellingShingle |
Karim, Shahid misc Feature matching misc SURF misc FAST misc BRISK misc RANSAC Feature Matching Improvement through Merging Features for Remote Sensing Imagery |
authorStr |
Karim, Shahid |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)624823733 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
springer |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
2092-6731 |
topic_title |
Feature Matching Improvement through Merging Features for Remote Sensing Imagery Feature matching (dpeaa)DE-He213 SURF (dpeaa)DE-He213 FAST (dpeaa)DE-He213 BRISK (dpeaa)DE-He213 RANSAC (dpeaa)DE-He213 |
topic |
misc Feature matching misc SURF misc FAST misc BRISK misc RANSAC |
topic_unstemmed |
misc Feature matching misc SURF misc FAST misc BRISK misc RANSAC |
topic_browse |
misc Feature matching misc SURF misc FAST misc BRISK misc RANSAC |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
3D Research |
hierarchy_parent_id |
624823733 |
hierarchy_top_title |
3D Research |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)624823733 (DE-600)2550008-9 |
title |
Feature Matching Improvement through Merging Features for Remote Sensing Imagery |
ctrlnum |
(DE-627)SPR031330479 (SPR)s13319-018-0203-x-e |
title_full |
Feature Matching Improvement through Merging Features for Remote Sensing Imagery |
author_sort |
Karim, Shahid |
journal |
3D Research |
journalStr |
3D Research |
lang_code |
eng |
isOA_bool |
false |
recordtype |
marc |
publishDateSort |
2018 |
contenttype_str_mv |
txt |
author_browse |
Karim, Shahid Zhang, Ye Brohi, Ali Anwar Asif, Muhammad Rizwan |
container_volume |
9 |
format_se |
Elektronische Aufsätze |
author-letter |
Karim, Shahid |
doi_str_mv |
10.1007/s13319-018-0203-x |
title_sort |
feature matching improvement through merging features for remote sensing imagery |
title_auth |
Feature Matching Improvement through Merging Features for Remote Sensing Imagery |
abstract |
Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
abstractGer |
Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
abstract_unstemmed |
Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time. © 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_120 GBV_ILN_266 GBV_ILN_281 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2055 GBV_ILN_2059 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2070 GBV_ILN_2086 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2116 GBV_ILN_2118 GBV_ILN_2119 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 |
container_issue |
4 |
title_short |
Feature Matching Improvement through Merging Features for Remote Sensing Imagery |
url |
https://dx.doi.org/10.1007/s13319-018-0203-x |
remote_bool |
true |
author2 |
Zhang, Ye Brohi, Ali Anwar Asif, Muhammad Rizwan |
author2Str |
Zhang, Ye Brohi, Ali Anwar Asif, Muhammad Rizwan |
ppnlink |
624823733 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s13319-018-0203-x |
up_date |
2024-07-03T23:13:09.560Z |
_version_ |
1803601460134412288 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR031330479</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331071640.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s13319-018-0203-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR031330479</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s13319-018-0203-x-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karim, Shahid</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Feature Matching Improvement through Merging Features for Remote Sensing Imagery</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© 3D Research Center, Kwangwoon University and Springer-Verlag GmbH Germany, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Feature matching is the core stage for object recognition, tracking and several applications of computer vision. Low resolution images have various limitations with respect to spatial, spectral, pixel and temporal information which reduces the performance of image processing approaches. We have combined SURF features with FAST and BRISK features individually in order to provide an optimal solution for feature matching. Furthermore, feature matching has exploited through combined features and compared the performance with state-of-the-art methods. Lastly, RANSAC and MSAC were utilized to eliminate the wrong matches to get optimal feature matches. The experimental results show that the combination of FAST–SURF and BRISK–SURF perform feature matching optimally according to the number of feature matches and estimated time.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feature matching</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SURF</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">FAST</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">BRISK</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RANSAC</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Ye</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brohi, Ali Anwar</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Asif, Muhammad Rizwan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">3D Research</subfield><subfield code="d">Berlin : Springer, 2010</subfield><subfield code="g">9(2018), 4 vom: 17. Okt.</subfield><subfield code="w">(DE-627)624823733</subfield><subfield code="w">(DE-600)2550008-9</subfield><subfield code="x">2092-6731</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:4</subfield><subfield code="g">day:17</subfield><subfield code="g">month:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s13319-018-0203-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2070</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2086</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">2018</subfield><subfield code="e">4</subfield><subfield code="b">17</subfield><subfield code="c">10</subfield></datafield></record></collection>
|
score |
7.3988 |