Wyszukiwarka
Filtry
wszystkich: 798
-
Katalog
- Publikacje 439 wyników po odfiltrowaniu
- Czasopisma 33 wyników po odfiltrowaniu
- Konferencje 21 wyników po odfiltrowaniu
- Osoby 19 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Kursy Online 225 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 56 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: color vision deficiency
-
Mechatronics and Machine Vision in Practice
Konferencje -
Analogue CMOS ASICs in Image Processing Systems
PublikacjaIn this paper a survey of analog application specific integrated circuits (ASICs) for low-level image processing, called vision chips, is presented. Due to the specific requirements, the vision chips are designed using different architectures best suited to their functions. The main types of the vision chip architectures and their properties are presented and characterized on selected examples of prototype integrated circuits (ICs)...
-
Receiver-side fingerprinting method based on quaternion sandwich product
PublikacjaIn this paper a new receiver-side fingerprinting method for color images is proposed. The proposed method belongs to the group of Joint Fingerprinting and Decryption (JFD) methods. Each component of the color image is represented as a point in 3D space, which is formed by 3 color channels. Encryption and fingerprinting can be interpreted as rotation, scaling and translation of these points. Calculations are performed using quaternion...
-
IT Business Standards as an Ontology Domain
PublikacjaThe aim of this paper is to report a selection of Semantic Web aspects pertaining to ontology development activities in the domain of the IT business standard (TOGAF 9) such as formulating competency questions, conceptualization of the domain, resolution of the source knowledge deficiency and applying common design patterns in the OWL formalization. Authors also try to determine target groups that may benefit from such ontology...
-
Karol Zdzisław Zalewski mgr inż.
Osoby -
On the Hat Problem on the Cycle C7
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
-
Detection of illicit chemicals by portable Raman spectrometer
PublikacjaThe Raman spectrometers can be built as the portable devices and can be used in various places to detect illicit chemicals. This method has become popular due to deficiency of other fast methods that could be applied against terrorist attacks or could help police at their work. The conception of a portable Raman spectrometer has been presented. The description enclosures presentation of the prepared device and its possible applications...
-
Detection and segmentation of moving vehicles and trains using Gaussian mixtures, shadow detection and morphological processing
PublikacjaSolution presented in this paper combines background modelling, shadow detection and morphological and temporal processing into one system responsible for detection and segmentation of moving objects recorded with a static camera. Vehicles and trains are detected based on their pixellevel difference from the continually updated background model utilizing a Gaussian mixture calculated separately for every pixel. The shadow detection...
-
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
A modified hat problem
PublikacjaThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Dane BadawczeFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Advanced Concepts for Intelligent Vision Systems
Konferencje -
International Conference on Computer Vision Systems
Konferencje -
International Conference on Computer Vision and Graphics
Konferencje -
IEEE Workshop on Applications of Computer Vision
Konferencje -
IEEE International Conference on Computer Vision
Konferencje -
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
On the hat problem, its variations, and their applications
PublikacjaThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
Hat problem on the cycle C4
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
A more colorful hat problem
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Patryk Ziółkowski dr inż.
OsobyAdiunkt na Politechnice Gdańskiej. Brał udział w projektach międzynarodowych, w tym projektach dla Ministerstwa Transportu stanu Alabama (2015), jest także laureatem grantu Fundacji Kościuszkowskiej na prowadzanie badań w USA, który zrealizował w 2018 roku. Ekspert w dziedzinie sztucznej inteligencji. Jego główny obszar zainteresowań badawczych stanowi zastosowanie sztucznej inteligencji w Inżynierii Lądowej. Prowadzi projekty...
-
Tribological test for evaluation of Natural PEEK
Dane BadawczeTest of PEEK natural (beige color) samples with sliding speed up to 1,2 m/s and up to 8 MPa of nominal load
-
Equitable coloring of hypergraphs
PublikacjaA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Monitoring wizyjny w systemach zabezpieczenia transportu wodnego. Koncepcja implementacyjna
PublikacjaW artykule autorzy przedstawiają koncepcję zastosowania własnych badań nad pomiarem prędkości przepływu cieczy do zastosowań praktycznych w pomiarach przepływu wody w kanałach otwartych i rzekach. Jako narzędzie pomiarowe wykorzystują zestaw aparatów synchronicznych, które rejestrują indykatory przepływu znajdujące się na powierzchni analizowanej cieczy. Aparat matematyczny przedstawiony w rozwiązaniu sprowadza się do stosowania...
-
Inflammatory disease of uterus, unspecified - Female, 47 - Cell image [4140730008827851]
Dane BadawczeThis is the histopathological image of CERVIX UTERI cell sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Towards Universal Visualisation of Emotional States for Information Systems
PublikacjaThe paper concerns affective information systems that represent and visualize human emotional states. The goal of the study was to find typical representations of discrete and dimensional emotion models in terms of color, size, speed, shape, and animation type. A total of 419 participants were asked about their preferences for emotion visualization. We found that color, speed, and size correlated with selected discrete emotion...
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Visual Content Representation for Cognitive Systems: Towards Augmented Intelligence
PublikacjaCognitive Vision Systems have gained significant attention from academia and industry during the past few decades. One of the main reasons behind this interest is the potential of such technologies to revolutionize human life since they intend to work robustly under complex visual scenes (which environmental conditions may vary), adapting to a comprehensive range of unforeseen changes, and exhibiting prospective behavior. The combination...
-
Wireless multimodal localization sensor for industrial applications
PublikacjaThis paper presents the concept and design of a wireless multimodal localization sensor for hybrid localization systems combining vision-based, radio-based and inertial techniques in order to alleviate problems in harsh and complex industrial environments. It supports two radio technologies, 868 MHz UHF RFID and 2.4 GHz WSN, for positioning purposes and communications. The sensor includes LED light transmitters for vision-based...
-
Restoration and preservation of the reinforced concrete poles of fence at the former Auschwitz concentration and extermination camp
PublikacjaThe objective of this study was to assess the present state of the reinforced concrete poles of fence at the former Auschwitz I and Auschwitz II-Birkenau concentration and extermination camp. The poles were subjected to renovation about 10 years ago. After this time some deficiencies of applied renovation method were noticed. Cracks appeared between fresh and original part of concrete cover. Analysis of the reasons of these failures...
-
Restoration and preservation of the reinforced concrete poles of fence at the former Auschwitz concentration and extermination camp
PublikacjaThe objective of this study was to assess the present state of the reinforced concrete poles of fence at the former Auschwitz I and Auschwitz II-Birkenau concentration and extermination camp. The poles were subjected to renovation about 10 years ago. After this time some deficiencies of applied renovation method were noticed. Cracks appeared between fresh and original part of concrete cover. Analysis of the reasons of these failures...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Dane BadawczeFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
On the hardness of computing span of subcubic graphs
PublikacjaIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
International Machine Vision and Image Processing Conference
Konferencje -
IEEE Conference on Computer Vision and Pattern Recognition
Konferencje -
International Conference on Control, Automation, Robotics and Vision
Konferencje -
Soft Computing in Computer Graphics, Imaging, and Vision
Konferencje -
Tribological test for evaluation of CF30 Black PEEK
Dane BadawczeSample numner BL03 and BL04 made of PEEK CF30 (black color) tribologicaly tested with sliding speed up to 1,8 m/s and up to 14 MPa of nominal load under water lubrication.
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Insights into the Thermo-Mechanical Treatment of Brewers’ Spent Grain as a Potential Filler for Polymer Composites
PublikacjaThis paper investigated the impact of twin-screw extrusion parameters on the properties of brewers’ spent grain. The chemical structure, antioxidant activity, particle size, and color properties, as well as the emission of volatile organic compounds during extrusion, were investigated. The main compounds detected in the air during modifications were terpenes and terpenoids, such as α-pinene, camphene, 3-carene, limonene, or terpinene....
-
Wavelet filtering of signals without using model functions
PublikacjaThe effective wavelet filtering of real signals is impossible without determining their shape. The shape of a real signal is related to its wavelet spectrum. For shape analysis, a continuous color wavelet spectrogram of signal level is often used. The disadvantage of continuous wavelet spectrogram is the complexity of analyzing a blurry color image. A real signal with additive noise strongly distorts the spectrogram based on continuous...
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
Simple colorimetric copper(II) sensor – spectral characterization and possible applications
PublikacjaNew o-hydroxyazocompound L bearing pyrrole residue was obtained in the simple synthetic protocol. The structure of L was confirmed and analyzed by X-ray diffraction. It was found that new chemosensor can be successfully used as copper(II) selective spectrophotometric regent in solution and can be also applied for the preparation of sensing materials generating selective color signal upon interaction with copper(II). Selective colorimetric...
-
Changes in Nuclear Gene Expression Related to Mitochondrial Function Affect Extracellular Matrix, Collagens, and Focal Adhesion in Keratoconus
Publikacja -
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...