Sammanfattning
A general framework explaining the extraction of maximal path-points (related to the set of centres of maximal balls) for path-based distances is presented. The traditional weigthed distance and distance based on neighbourhood sequences are considered and compared with the recently developed weighted distance based on neighbouhood sequences
Publicerad i
Utgivare: IEEE Computer Society,Los Alamitos, CA, USA
Konferens
5th International Symposium on Image and Signal Processing and Analysis
UKÄ forskningsämne
Datorgrafik och datorseende
Publikationens identifierare
- DOI: https://doi.org/10.1109/ISPA.2007.4383726
- ISBN: 978-953-184-116-0
Permanent länk till denna sida (URI)
https://res.slu.se/id/publ/17135