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

Shaun Dowler

dblp:98/8844 · DBLP profile ↗
← Back
3ranked-venue papers
3as 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 · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.1
2011 On the Convergence of N-FINDR and Related Algorithms: To Iterate or Not to Iterate?
abstract
A popular algorithm for unmixing hyperspectral data, namely, Winter's N-FINDR algorithm, is frequently used to benchmark other algorithms or as the basis for new algorithms. The interpretations of this algorithm within the literature are not consistent, and some of these differences have significant impact on the convergence of the algorithm. Despite this, the differences in implementation have not been explicitly acknowledged within the literature, which means that many studies are now ambiguous or incomparable. An examination of various implementations of the N-FINDR algorithm highlights that not all interpretations possess the properties asserted by Winter and that interpretations that consider each pixel multiple times generate much larger simplexes. Regardless of which implementation researchers choose to use, if they are explicit in their choice, this would allow for unambiguous comparisons.
Shaun Dowler, Mark Andrews
IEEE Geosci. Remote. Sens. Lett.1
2010 Abundance guided endmember selection: An algorithm for unmixing hyperspectral data
abstract
Linear unmixing is a blind source separation problem that decomposes a hyperspectral image into the spectra of the material constituents of the scene and the abundance maps of those materials across that scene. A novel method for determining the material spectra from within the scene, AGES, is proposed based on the positional information contained within abundances generated by additivity-constrained inversion. This new approach is compared on both simulated and real data sets to the well established N-FINDR algorithm, comparing favorably in terms of computational complexity with the existing algorithm without significantly sacrificing accuracy. In addition, the algorithm has some desirable properties inherent in such an approach.
Shaun Dowler, Mark Andrews
ICIP1