Filters
total: 768
Search results for: COLOR VISION DEFICIENCY
-
Patryk Ziółkowski dr inż.
PeopleAssistant Professor at Gdansk Tech. He participated in international projects, including projects for the Ministry of Transportation of the State of Alabama (2015), he is also the winner of a grant from the Kosciuszko Foundation for conducting research in the USA, which he completed in 2018. An expert in the field of artificial intelligence. His main area of research interest is the application of artificial intelligence in Civil...
-
On the Hat Problem on the Cycle C7
PublicationThe 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
PublicationThe 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...
-
Karol Zdzisław Zalewski mgr inż.
People -
Detection and segmentation of moving vehicles and trains using Gaussian mixtures, shadow detection and morphological processing
PublicationSolution 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
PublicationThe 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
PublicationThe 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)
Open Research DataFor 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
Conferences -
International Conference on Computer Vision Systems
Conferences -
International Conference on Computer Vision and Graphics
Conferences -
IEEE Workshop on Applications of Computer Vision
Conferences -
IEEE International Conference on Computer Vision
Conferences -
The hat problem on a union of disjoint graphs
PublicationThe 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
PublicationThe 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
PublicationThe 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
PublicationThe 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
PublicationThe 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...
-
Equitable coloring of hypergraphs
PublicationA 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...
-
Tribological test for evaluation of Natural PEEK
Open Research DataTest of PEEK natural (beige color) samples with sliding speed up to 1,2 m/s and up to 8 MPa of nominal load
-
Monitoring wizyjny w systemach zabezpieczenia transportu wodnego. Koncepcja implementacyjna
PublicationW 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...
-
Restoration and preservation of the reinforced concrete poles of fence at the former Auschwitz concentration and extermination camp
PublicationThe 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
PublicationThe 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...
-
Inflammatory disease of uterus, unspecified - Female, 47 - Cell image [4140730008827851]
Open Research DataThis 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.
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven 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...
-
Towards Universal Visualisation of Emotional States for Information Systems
PublicationThe 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...
-
Wireless multimodal localization sensor for industrial applications
PublicationThis 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...
-
Visual Content Representation for Cognitive Systems: Towards Augmented Intelligence
PublicationCognitive 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...
-
On the hardness of computing span of subcubic graphs
PublicationIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor 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)
Open Research DataFor 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)
Open Research DataFor 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)...
-
International Machine Vision and Image Processing Conference
Conferences -
IEEE Conference on Computer Vision and Pattern Recognition
Conferences -
International Conference on Control, Automation, Robotics and Vision
Conferences -
Soft Computing in Computer Graphics, Imaging, and Vision
Conferences -
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn 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:...
-
Tribological test for evaluation of CF30 Black PEEK
Open Research DataSample 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)
Open Research DataFor 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)
Open Research DataFor 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)...
-
Hat problem on a graph
PublicationThe 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...
-
Wavelet filtering of signals without using model functions
PublicationThe 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...
-
Insights into the Thermo-Mechanical Treatment of Brewers’ Spent Grain as a Potential Filler for Polymer Composites
PublicationThis 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....
-
Simple colorimetric copper(II) sensor – spectral characterization and possible applications
PublicationNew 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...
-
Influence of lightweight structures used in swimming pools and water parks objects on their functionality, building form and spatial-visual effects indoors.
PublicationSpeaking about architecture of swimming facilities and water parks we have in mind their form, function , design and detail, texture and color. A particularly important element of the architecture of these buildings was and still is the structure.
-
Changes in Nuclear Gene Expression Related to Mitochondrial Function Affect Extracellular Matrix, Collagens, and Focal Adhesion in Keratoconus
Publication -
Performance evaluation of the parallel object tracking algorithm employing the particle filter
PublicationAn algorithm based on particle filters is employed to track moving objects in video streams from fixed and non-fixed cameras. Particle weighting is based on color histograms computed in the iHLS color space. Particle computations are parallelized with CUDA framework. The algorithm was tested on various GPU devices: a desktop GPU card, a mobile chipset and two embedded GPU platforms. The processing speed depending on the number...
-
On-line P-coloring of graphs
PublicationFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Open Research DataFor 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)...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...