Difference between revisions of "Publications/geraud.01.ai"
From LRDE
| Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
| + | | published = true |
||
| date = 2001-02-01 |
| date = 2001-02-01 |
||
| authors = Thierry Géraud, Yoann Fabre, Alexandre Duret-Lutz |
| authors = Thierry Géraud, Yoann Fabre, Alexandre Duret-Lutz |
||
Revision as of 15:51, 14 November 2013
- Authors
- Thierry Géraud, Yoann Fabre, Alexandre Duret-Lutz
- Where
- Proceedings of the IASTED International Conference on Applied Informatics (AI)---Symposium on Advances in Computer Applications
- Place
- Innsbruck, Austria
- Type
- inproceedings
- Publisher
- ACTA Press
- Projects
- Olena
- Date
- 2001-02-01
Abstract
This paper presents the evolution of algorithms implementation in image processing libraries and discusses the limits of these implementations in terms of reusability. In particular, we show that in C++, an algorithm can have a general implementation; said differently, an implementation can be generic, i.e.independent of both the input aggregate type and the type of the data contained in the input aggregate. A total reusability of algorithms can therefore be obtained; moreover, a generic implementation is more natural and does not introduce a meaningful additional cost in execution time as compared to an implementation dedicated to a particular input type.
Documents
Bibtex (lrde.bib)
@InProceedings{ geraud.01.ai,
author = {Thierry G\'eraud and Yoann Fabre and Alexandre Duret-Lutz},
title = {Applying generic programming to image processing},
booktitle = {Proceedings of the IASTED International Conference on
Applied Informatics (AI)---Symposium on Advances in
Computer Applications},
year = 2001,
publisher = {ACTA Press},
editor = {M.H.~Hamsa},
address = {Innsbruck, Austria},
pages = {577--581},
month = feb,
project = {Olena},
abstract = {This paper presents the evolution of algorithms
implementation in image processing libraries and discusses
the limits of these implementations in terms of
reusability. In particular, we show that in C++, an
algorithm can have a general implementation; said
differently, an implementation can be generic, i.e.,
independent of both the input aggregate type and the type
of the data contained in the input aggregate. A total
reusability of algorithms can therefore be obtained;
moreover, a generic implementation is more natural and does
not introduce a meaningful additional cost in execution
time as compared to an implementation dedicated to a
particular input type.}
}