| http://dbpedia.org/ontology/abstract
|
Features from Accelerated Segment Test (FA … Features from Accelerated Segment Test (FAST), que l'on peut traduire par caractéristiques issues de tests accélérés de segments, est un algorithme de détection de caractéristique et un descripteur, présenté par des chercheurs de l'université de Cambridge pour la première fois en 2006. Il est utilisé dans le domaine de vision par ordinateur, pour des tâches de détection d'objet ou de . L'algorithme fonctionne en deux étapes : dans la première étape, un test de segment basé sur les luminosités relatives est appliqué à chaque pixel de l'image traitée ; la deuxième étape permet d'affiner et de limiter les résultats par la méthode dite de non-maximum suppression.a méthode dite de non-maximum suppression.
, Features from accelerated segment test (FA … Features from accelerated segment test (FAST) is a corner detection method, which could be used to extract feature points and later used to track and map objects in many computer vision tasks. The FAST corner detector was originally developed by Edward Rosten and Tom Drummond, and was published in 2006. The most promising advantage of the FAST corner detector is its computational efficiency. Referring to its name, it is indeed faster than many other well-known feature extraction methods, such as difference of Gaussians (DoG) used by the SIFT, SUSAN and Harris detectors. Moreover, when machine learning techniques are applied, superior performance in terms of computation time and resources can be realised. The FAST corner detector is very suitable for real-time video processing application because of this high-speed performance.on because of this high-speed performance.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/FAST_Corner_Detector.jpg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://edwardrosten.com/work/rosten_2006_machine.pdf +
, http://www.inf.ed.ac.uk/teaching/courses/av/index.html +
, http://edwardrosten.com/work/rosten_2005_tracking.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
35254883
|
| http://dbpedia.org/ontology/wikiPageLength
|
12546
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1121443700
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Entropy_%28information_theory%29 +
, http://dbpedia.org/resource/Decision_tree +
, http://dbpedia.org/resource/Computer_vision +
, http://dbpedia.org/resource/DoG +
, http://dbpedia.org/resource/Pentium_4 +
, http://dbpedia.org/resource/Corner_detection +
, http://dbpedia.org/resource/Information_gain +
, http://dbpedia.org/resource/Difference_of_Gaussians +
, http://dbpedia.org/resource/Simulated_annealing +
, http://dbpedia.org/resource/Profile-guided_optimization +
, http://dbpedia.org/resource/Midpoint_circle_algorithm +
, http://dbpedia.org/resource/Harris%E2%80%93Laplace_detector +
, http://dbpedia.org/resource/Harris_affine_region_detector +
, http://dbpedia.org/resource/Feature_%28computer_vision%29 +
, http://dbpedia.org/resource/C_%28programming_language%29 +
, http://dbpedia.org/resource/Shi-Tomasi +
, http://dbpedia.org/resource/File:FAST_Corner_Detector.jpg +
, http://dbpedia.org/resource/Non-maximum_suppression +
, http://dbpedia.org/resource/Category:Feature_detection_%28computer_vision%29 +
, http://dbpedia.org/resource/Binary_search_algorithm +
, http://dbpedia.org/resource/ID3_algorithm +
, http://dbpedia.org/resource/Monochrome +
, http://dbpedia.org/resource/Decision_tree_model +
, http://dbpedia.org/resource/C%2B%2B +
, http://dbpedia.org/resource/Pentium_D +
, http://dbpedia.org/resource/Metaheuristic +
, http://dbpedia.org/resource/Scale-invariant_feature_transform +
, http://dbpedia.org/resource/Machine_learning +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Cite_book +
, http://dbpedia.org/resource/Template:Cite_journal +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Feature_detection_%28computer_vision%29 +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Method +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Features_from_accelerated_segment_test?oldid=1121443700&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/FAST_Corner_Detector.jpg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Features_from_accelerated_segment_test +
|
| owl:sameAs |
http://dbpedia.org/resource/Features_from_accelerated_segment_test +
, https://global.dbpedia.org/id/2qmQz +
, http://www.wikidata.org/entity/Q3067837 +
, http://rdf.freebase.com/ns/m.0j7m8pm +
, http://uk.dbpedia.org/resource/%D0%9E%D0%B7%D0%BD%D0%B0%D0%BA%D0%B8_%D0%B7_%D0%BF%D1%80%D0%B8%D1%81%D0%BA%D0%BE%D1%80%D0%B5%D0%BD%D0%BE%D1%97_%D1%81%D0%B5%D0%B3%D0%BC%D0%B5%D0%BD%D1%82%D0%BD%D0%BE%D1%97_%D0%BF%D0%B5%D1%80%D0%B5%D0%B2%D1%96%D1%80%D0%BA%D0%B8 +
, http://fr.dbpedia.org/resource/Features_from_Accelerated_Segment_Test +
|
| rdf:type |
http://dbpedia.org/ontology/Software +
|
| rdfs:comment |
Features from accelerated segment test (FA … Features from accelerated segment test (FAST) is a corner detection method, which could be used to extract feature points and later used to track and map objects in many computer vision tasks. The FAST corner detector was originally developed by Edward Rosten and Tom Drummond, and was published in 2006. The most promising advantage of the FAST corner detector is its computational efficiency. Referring to its name, it is indeed faster than many other well-known feature extraction methods, such as difference of Gaussians (DoG) used by the SIFT, SUSAN and Harris detectors. Moreover, when machine learning techniques are applied, superior performance in terms of computation time and resources can be realised. The FAST corner detector is very suitable for real-time video processing application br real-time video processing application b
, Features from Accelerated Segment Test (FA … Features from Accelerated Segment Test (FAST), que l'on peut traduire par caractéristiques issues de tests accélérés de segments, est un algorithme de détection de caractéristique et un descripteur, présenté par des chercheurs de l'université de Cambridge pour la première fois en 2006. Il est utilisé dans le domaine de vision par ordinateur, pour des tâches de détection d'objet ou de .ur des tâches de détection d'objet ou de .
|
| rdfs:label |
Features from accelerated segment test
, Ознаки з прискореної сегментної перевірки
, Features from Accelerated Segment Test
|
