Temat: online algorithm - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Large-scale hyperspectral image compression via sparse representations based on online learning
Autorzy:: Ülkü, İ.
Kizgut, E.
Powiązania:: https://bibliotekanauki.pl/articles/331241.pdf
Data publikacji:: 2018
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: hyperspectral imaging
compression algorithm
dictionary learning
sparse coding
obrazowanie wielospektralne
algorytm kompresji
nauczanie online
kodowanie rzadkie
Opis:: In this study, proximity based optimization algorithms are used for lossy compression of hyperspectral images that are inherently large scale. This is the first time that such proximity based optimization algorithms are implemented with an online dictionary learning method. Compression performances are compared with the one obtained by various sparse representation algorithms. As a result, proximity based optimization algorithms are listed among the three best ones in terms of compression performance values for all hyperspectral images. Additionally, the applicability of anomaly detection is tested on the reconstructed images.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 197-207
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
Autorzy:: Qureshi, M. B.
Alrashed, S.
Min-Allah, N.
Kołodziej, J.
Arabas, P.
Powiązania:: https://bibliotekanauki.pl/articles/330305.pdf
Data publikacji:: 2015
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: real time system
feasibility analysis
fixed priority scheduling
rate monotonic algorithm
online scheduling
system czasu rzeczywistego
analiza wykonalności
algorytm szeregowania
Opis:: When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 709-722
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "online algorithm" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język