Hrvatska znanstvena bibliografija (CROSBI)



Pregled bibliografske jedinice broj: 398128

Zbornik radova

Autori: Filko, Damir; Antonić, Davor
Naslov: Optimizing Image Processing in C#
( Optimizing Image Processing in C# )
Izvornik: Proceedings Vol. III. CTS & CIS / Bogunović, Nikola ; Ribarić, Slobodan (ur.). - Opatija : MIPRO , 2009. 30-34 (ISBN: 978-953-233-045-8).
Skup: 32nd International Convention on Information and Communication Technology, Electronics and Microelectronics
Mjesto i datum: Opatija, Hrvatska, 25-29.05.2009.
Ključne riječi: image processing; memory management; parallel processing; C#
( image processing; memory management; parallel processing; C# )
Sažetak:
In modern world image analysis takes important role in all aspects of technical sciences, from product analysis on production lines to robotic vision and medical applications. Algorithm implementation in C# programming language is characterized by rapid development, resulting in highly managed and safe code. Price paid is low efficiency, which is especially significant in algorithms processing large volumes of data such as image processing algorithms. In this paper two complementary methods of increasing execution speed of such algorithms are implemented. Primary source of poor C# code performance results from the way image data is accessed from memory. Array bound checking embedded in managed code and accessing data through image objects imposes large amount of overhead. Utilizing low-level functions and procedures for accessing data could increase performance for an order of magnitude. Another way to increase execution speed is to utilize parallelism generally existing in majority of image processing algorithms. Executing parallel code on multi-core or the multiprocessor system further increases execution speed.
Vrsta sudjelovanja: Predavanje
Vrsta prezentacije u zborniku: Cjeloviti rad (više od 1500 riječi)
Vrsta recenzije: Međunarodna recenzija
Izvorni jezik: eng
Kategorija: Znanstveni
Upisao u CROSBI: dfilko@etfos.hr (dfilko@etfos.hr), 2. Lip. 2009. u 09:47 sati