Fast and robust binary descriptor using intensity rank binning

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 544
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorPark, Cko
dc.contributor.authorKim, Jko
dc.contributor.authorKweon, In-Soko
dc.date.accessioned2017-04-17T07:29:17Z-
dc.date.available2017-04-17T07:29:17Z-
dc.date.created2017-04-10-
dc.date.created2017-04-10-
dc.date.issued2017-02-
dc.identifier.citationELECTRONICS LETTERS, v.53, no.2, pp.79 - 80-
dc.identifier.issn0013-5194-
dc.identifier.urihttp://hdl.handle.net/10203/223288-
dc.description.abstractBinary descriptors have been shown to be computationally efficient while their recognition rate is poorer than that of floating-point descriptors. A method of improving both the recognition rate and the speed of computation for thresholded intensity rank descriptor, one of the binary descriptors is proposed. In experiments, our descriptor shows better performance than other binary descriptors in terms of both the recognition rate and the speed of computation.-
dc.languageEnglish-
dc.publisherINST ENGINEERING TECHNOLOGY-IET-
dc.subjectFEATURES-
dc.titleFast and robust binary descriptor using intensity rank binning-
dc.typeArticle-
dc.identifier.wosid000394436200013-
dc.identifier.scopusid2-s2.0-85010046879-
dc.type.rimsART-
dc.citation.volume53-
dc.citation.issue2-
dc.citation.beginningpage79-
dc.citation.endingpage80-
dc.citation.publicationnameELECTRONICS LETTERS-
dc.identifier.doi10.1049/el.2016.0863-
dc.contributor.localauthorKweon, In-So-
dc.contributor.nonIdAuthorPark, C-
dc.contributor.nonIdAuthorKim, J-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordPlusFEATURES-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0