Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Reymond Takashima

dblp:130/1015 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 77% Mathematical optimization · 23%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › hyperspectral image analysis › spectral unmixing
endmember extraction
0.212013
Reducing the Complexity of the N-FINDR Algorithm for Hyperspectral Image Analysis · IEEE Trans. Image Process. 2013
Image and video processing
hyperspectral image analysis
0.212013
Reducing the Complexity of the N-FINDR Algorithm for Hyperspectral Image Analysis · IEEE Trans. Image Process. 2013
Mathematical optimization › continuous optimization
convex optimization
0.012013
Reducing the Complexity of the N-FINDR Algorithm for Hyperspectral Image Analysis · IEEE Trans. Image Process. 2013

Methods — techniques the papers use, named apart from their topics

N-FINDR algorithm · 0.3
YearPublicationVenuePosition
2013 Reducing the Complexity of the N-FINDR Algorithm for Hyperspectral Image Analysis
Shaun Dowler, Reymond Takashima, Mark Andrews
IEEE Trans. Image Process.2