Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "linear transformation" wg kryterium: Wszystkie pola


Wyświetlanie 1-4 z 4
Tytuł:
Time performance of RGB to HSI colour space transformation methods
Autorzy:
Ziemba, A.
Fornalik-Wajs, E.
Powiązania:
https://bibliotekanauki.pl/articles/240294.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
digital image processing
optical measurement method
RGB to HSI colour space transformation
linear transformation
time performance
relative computational time
przetwarzanie
obraz cyfrowy
przekształcenia liniowe
czas
wydajność
Opis:
Present paper is a continuation of works on evaluation of red, green, blue (RGB) to hue, saturation, intensity (HSI) colour space transformation in regard to digital image processing application in optical measurements methods. HSI colour space seems to be the most suitable domain for engineering applications due to its immunity to non-uniform lightning. Previous stages referred to the analysis of various RGB to HSI colour space transformations equivalence and programming platform configuration influence on the algorithms execution. The main purpose of this step is to understand the influence of computer processor architecture on the computing time, since analysis of images requires considerable computer resources. The technical development of computer components is very fast and selection of particular processor architecture can be an advantage for fastening the image analysis and then the measurements results. In this paper the colour space transformation algorithms, their complexity and execution time are discussed. The most common algorithms were compared with the authors own one. Computing time was considered as the main criterion taking into account a technical advancement of two computer processor architectures. It was shown that proposed algorithm was characterized by shorter execution time than in reported previously results.
Źródło:
Archives of Thermodynamics; 2018, 39, 1; 111-128
1231-0956
2083-6023
Pojawia się w:
Archives of Thermodynamics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On transformation of STRIPS planning to linear programming
Autorzy:
Galuszka, A.
Powiązania:
https://bibliotekanauki.pl/articles/229963.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
planning
problem solving
block world
uncertainty
linear programming
computational complexity
Opis:
STRIPS language is a convenient representation for artificial intelligence planning problems. Planning is a task of coming up with a sequence of actions that will achieve a goal. In this work a heuristic of polynomial transformation of STRIPS planning problem to linear programming problem (LP) is presented. This is done because planning problems are hard computational problems (PSPACE- complete in general case) and LP problems are known to be computational easy. Representation of STRIPS planning as a set of equalities and inequalities based on the transformation is also proposed. The exemplary simulation shows the computational efficiency of solving planning problem with proposed transformation.
Źródło:
Archives of Control Sciences; 2011, 21, 3; 243-267
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On transformation of conditional, conformant and parallel planning to linear programming
Autorzy:
Galuszka, Adam
Probierz, Eryka
Powiązania:
https://bibliotekanauki.pl/articles/1409385.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
planning
conformant planning
conditional planning
parallel planning
uncertainty
linear programming
computational complexity
Opis:
Classical planning in Artificial Intelligence is a computationally expensive problem of finding a sequence of actions that transforms a given initial state of the problem to a desired goal situation. Lack of information about the initial state leads to conditional and conformant planning that is more difficult than classical one. A parallel plan is the plan in which some actions can be executed in parallel, usually leading to decrease of the plan execution time but increase of the difficulty of finding the plan. This paper is focused on three planning problems which are computationally difficult: conditional, conformant and parallel conformant. To avoid these difficulties a set of transformations to Linear Programming Problem (LPP), illustrated by examples, is proposed. The results show that solving LPP corresponding to the planning problem can be computationally easier than solving the planning problem by exploring the problem state space. The cost is that not always the LPP solution can be interpreted directly as a plan.
Źródło:
Archives of Control Sciences; 2021, 31, 2; 375-399
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new closed-form formula for calculating a weakly singular static potential integral with linear current source distribution on a triangle
Autorzy:
Grytsko, Anna
Słobodzian, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/2204516.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
static vector potential integral
linear current source distribution
analytic integration
isoparametric transformation
integration over a triangular domain
weakly singular integral
statyczna wektorowa całka potencjalna
liniowy rozkład źródła prądu
integracja analityczna
słabo osobliwe całki
transformacja izoparametryczna
integracja w domenie trójkątnej
Opis:
The article presents a closed-form formula for solving a weakly singular surface integral with a linear current source distribution associated with the SIE-MoM formulation used for solving electromagnetic (EM) problems. The analytical formula was obtained by transforming the surface integral over a triangular domain into a double integral, and then directly determining formulas for the inner and outer integrals. The solution obtained is marked by high computational efficiency, high accuracy, and very simple implementation. The derived formula, in contrast to the currently available formulas, consists of quantities that have a clear and simple geometric interpretation, related to the geometry of the computational domain.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 1; art. no. e143645
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies