On the application of convex transforms to metric search
- Submitting institution
-
University of St Andrews
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 269567619
- Type
- D - Journal article
- DOI
-
10.1016/j.patrec.2020.08.008
- Title of journal
- Pattern Recognition Letters
- Article number
- -
- First page
- 563
- Volume
- 138
- Issue
- -
- ISSN
- 0167-8655
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
B - Systems
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- While convex transforms have been used previously in the domain of metric search, this is the first rigorous study on the mathematical basis of their use; as such it sheds new light on the usual tradeoff of efficiency versus accuracy. In turn this allows a deeper understanding of when, and how, convex transforms can be best used. The paper resulted from a collaboration with Pavel Zezula of Masaryk University, generally regarded as one of the “grandfathers” of the discipline of Metric Search.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
