Search
Search results for: CANNY EDGE DETECTOR
-
Scene Segmentation Basing on Color and Depth Images for Kinect Sensor
PublicationIn this paper we propose a method for segmenting single images from Kinect sensor by considering both color and depth information. The algorithm is based on a series of edge detection procedures designed for particular features of the scene objects. RGB and HSV color planes are separately analyzed in the first step with Canny edge detector, resulting in overall color edges mask. In depth images both clear boundaries and smooth...
-
Tool Wear Monitoring Using Improved Dragonfly Optimization Algorithm and Deep Belief Network
PublicationIn recent decades, tool wear monitoring has played a crucial role in the improvement of industrial production quality and efficiency. In the machining process, it is important to predict both tool cost and life, and to reduce the equipment downtime. The conventional methods need enormous quantities of human resources and expert skills to achieve precise tool wear information. To automatically identify the tool wear types, deep...
-
Contour Analysis of Bleeding Regions in Endoscopic Images
PublicationThis paper investigates the problem of detecting bleeding regions in images acquired from endoscopic examinations of gastrointestinal tract. The purpose is to identify the characteristic features of bleeding areas' contours in order to develop an accurate method for discriminating between true bleeding regions and missed detections, which could lead to a significant reduction of the false alarm rate of existing blood-detection...
-
XPS data of deuterium and hydrogen grown boron-doped diamond
Open Research DataThe high-resolution C1s X-ray absorption spectra of BDD@H and BDD@D samples were measured using the facilities of the HE-SGM beamline (HE-SGM) at the BESSY II synchrotron radiation source of Helmholtz–Zentrum Berlin (HZB).[90] The measurements were carried out under ultra-high vacuum conditions: P ≈ 2×10−9 Torr at T = 300 K. The NEXAFS spectra were...
-
ARTIFICIAL MODEL IN THE ASSESSMENT OF THE ALGORITHM OF OBJECTS RECORDED BY LASER SCANNING SHAPE DETECTION (ALS/TLS)
PublicationBrief description of the study and used methods. Brief description of the study and used As part of the preparatory work aimed to create the application solution allowing for the automation of searching objects in data, obtained in the scanning process using ALS (Airborne Laser Scanning) or TLS (Terrestrial Laser Scanning), the authors prepared a artificial (synthetic, theoretical) model of space, used for the verification of operation...
-
Leading Edge
Journals -
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Vehicle detector training with minimal supervision
PublicationRecently many efficient object detectors based on convolutional neural networks (CNN) have been developed and they achieved impressive performance on many computer vision tasks. However, in order to achieve practical results, CNNs require really large annotated datasets for training. While many such databases are available, many of them can only be used for research purposes. Also some problems exist where such datasets are not...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Comparison of edge detection algorithms for electric wire recognition
PublicationEdge detection is the preliminary step in image processing for object detection and recognition procedure. It allows to remove useless information and reduce amount of data before further analysis. The paper contains the comparison of edge detection algorithms optimized for detection of horizontal edges. For comparison purposes the algorithms were implemented in the developed application dedicated to detection of electric line...
-
Badanie jakości transmisji w podsystemie EDGE.
PublicationPrzedstawiono wyniki badań symulacyjnych jakości transmisji w podsystemie EDGE, będącego rozwinięciem systemu GSM w kierunku systemu trzeciej generacji. Uzyskane wyniki odnoszą się do szybkiej transmisji danych, realizowanej w oparciu o komutację kanałów ECSD oraz komutację pakietów EGPRS dla wybranych środowisk propagacyjnych.
-
Influence of image transformations and quality degradations on SURF detector efficiency
PublicationA method for task-oriented examination of SURF keypoint detector accuracy is presented in the paper. It consists of generating test images, based on a given exemplar, processed by affine transformations: random rotation and scaling, and varying degree of degradations: darkening, blurring, noising, and compression. Details of applied degradation procedure are presented, followed by essentials of SURF-based images matching. A distance...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Big Data and the Internet of Things in Edge Computing for Smart City
PublicationRequests expressing collective human expectations and outcomes from city service tasks can be partially satisfied by processing Big Data provided to a city cloud via the Internet of Things. To improve the efficiency of the city clouds an edge computing has been introduced regarding Big Data mining. This intelligent and efficient distributed system can be developed for citizens that are supposed to be informed and educated by the...
-
On the approximation of the UWB dipole elliptical arms with stepped-edge polygon
PublicationA simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....
-
A Method and Device for 3D Recognition of Cutting Edge Micro Geometry
PublicationA very useful method was successfully applied in the investigation of tools for machining wood and wood based composites. It allows scanning of the cutting edge micro geometry in three dimensions and reproducing it in a virtual space as a 3D surface. The application of the method opens new possibilities of studying tool wear by scanning, including the calculation of volume loss and other analysis of tool wedge geometry along and...
-
Edge-Computing based Secure E-learning Platforms
PublicationImplementation of Information and Communication Technologies (ICT) in E-Learning environments have brought up dramatic changes in the current educational sector. Distance learning, online learning, and networked learning are few examples that promote educational interaction between students, lecturers and learning communities. Although being an efficient form of real learning resource, online electronic resources are subject to...
-
Vehicle detector training with labels derived from background subtraction algorithms in video surveillance
PublicationVehicle detection in video from a miniature station- ary closed-circuit television (CCTV) camera is discussed in the paper. The camera provides one of components of the intelligent road sign developed in the project concerning the traffic control with the use of autonomous devices being developed. Modern Convolutional Neural Network (CNN) based detectors need big data input, usually demanding their manual labeling. In the presented...
-
Radioisotope measurement of selected parameters of liquid-gas flow using single detector system
PublicationTo determine the parameters of two-phase flows using radioisotopes, usually two detectors are used. Knowing the distance between them, the velocity of the dispersed phase is calculated based on time delay estimation. Such a measurement system requires the use of two gamma-ray sealed sources. But in some situations it is also possible to determine velocity of dispersed phase using only one scintillation probe and one gamma-ray source....
-
Edge-Guided Mode Performance and Applications in Nonreciprocal Millimeter-Wave Gyroelectric Components
PublicationThe analogies between the behavior of gyromagnetic and gyroelectric nonreciprocal structures, the use of the simple transfer matrix approach, and the edge-guided (EG) wave property, supported in a parallel plate model for integrated magnetized semiconductor waveguide, are investigated in those frequency regions, where the effective permittivity is negative or positive. As with their ferrite counterparts, the leakage of the EG waves...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
The edge of the [dis]order
Publication -
Some Artificial Intelligence Driven Algorithms For Mobile Edge Computing in Smart City
PublicationSmart mobile devices can share computing workload with the computer cloud that is important when artificial intelligence tools support computer systems in a smart city. This concept brings computing on the edge of the cloud, closer to citizens and it can shorten latency. Edge computing removes a crucial drawback of the smart city computing because city services are usually far away from citizens, physically. Besides, we introduced...
-
A detector of sleep disorders for using at home
PublicationObstructive sleep apnea usually requires all-ni ght examination in a specialized clinic, under the supervision of a medical staff. Because of those requirements it is an expensive and a non-widely utilized test. Moving the examination procedure to patients’ home with automatic analysis algorithms involved will decrease the costs and make it available for larger group of patients. The developed device allows all-night recordings...
-
A robust detector for distorted music staves
Publication.
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Zastosowanie detektora fotojonizacyjnego (PID) w analizie środowiskowej. Application of photoionization detector in environmental analysis
PublicationNa podstawie studium literaturowego przedstawiono zastosowania detektora fotojonizacyjnego (photoionization detector - PID) w analizie środowiskowej. Omówiono zarówno kierunki wykorzystania w bezpośrednich metodach analitycznych jako czujnika, jak i w oznaczeniach chromatograficznych. Przedstawiono budowę i zasadę działania detektora oraz różne warianty instalowania detektora w układzie chromatograficznym, a także sposoby łączenia...
-
Feature Reduction Using Similarity Measure in Object Detector Learning with Haar-like Features
PublicationThis paper presents two methods of training complexity reduction by additional selection of features to check in object detector training task by AdaBoost training algorithm. In the first method, the features with weak performance at first weak classifier building process are reduced based on a list of features sorted by minimum weighted error. In the second method the feature similarity measures are used to throw away that features...
-
POLDER AND CITY: SUSTAINING WATER LANDSCAPES ON AN URBAN EDGE
PublicationThe question investigated in this paper is how to maintain the environmental quality of the polder landscape encompassing the city in the condition of urban pressure on this landscape. On the basis of theoretical approaches, historical surveys and introductory study models new ideas are tested on the case study of Gdansk, a city located in the Vistula River delta in northern Poland. Research shows that the city was created as a...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Interval Edge-Coloring of Graphs
Publication -
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Interval edge-coloring of graphs.
PublicationRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Novel Analytic-Numerical Model of Free Convection: with Leading Edge Considered
PublicationA novel solution of the free convection boundary problem is represented in analytical form for velocity and temperature for an isothermal vertical plate, as an example. These fields are built as a Taylor Series in the x coordinate with coefficients as functions of the vertical coordinate (y). We restrict ourselves by cubic approximation for both functions. The basic Navier-Stokes and Fourier-Kirchhoff equations and boundary conditions...
-
MCORD: MPD cosmic ray detector for NICA
Publication -
A multisensor detector of a sleep apnea for using at home
PublicationDiagnosis of obstructive sleep apnea usually involves polysomnographic analysis, which unfortunately requires overnight stay in a specialized clinic and is very uncomfortable for a patient. This paper describes the method and apparatus for recording a set of signals to detect sleep apnea. The device records the following signals simultaneously: three-channel ECG, respiratory functions, signals from the accelerometer, and snoring...
-
A double-talk detector using audio watermarking
Publicationa novel approach to double-talk detection in the acoustic echo canceler is proposed. a hidden signature is embedded into the arriving signal, using the echo-hiding method. next detection of the presence of this signature in the microphone signal is performed. the results of the signature detection may be used by the acoustic echo canceler to stop or restart the adaptation process.
-
Interactions using passive optical proximity detector
PublicationIn this paper we evaluated the possible application of a passive, optical sensor as an interface for human-smart glasses interactions. The designed proximity sensor is composed of set of photodiodes and the appropriate hardware and software components. First, experiments were performed for the estimations of such parameters as distance to an object, its width and velocity. Achieved results were satisfactory. Therefore, next, a...
-
Big Data from Sensor Network via Internet of Things to Edge Deep Learning for Smart City
PublicationData from a physical world is sampled by sensor networks, and then streams of Big Data are sent to cloud hosts to support decision making by deep learning software. In a smart city, some tasks may be assigned to smart devices of the Internet of Things for performing edge computing. Besides, a part of workload of calculations can be transferred to the cloud hosts. This paper proposes benchmarks for division tasks between an edge...
-
Entrepreneurship nests in a polish edge city
PublicationThe last two decades in Poland have been a period of both a dynamic development of the small and medium-sized enterprise sector and a transformation of the city surrounding territories. This development began during the economy transformation after 1989. Population migration and movement of economic entities away from central cities resulted in development of territorial structures within some Polish suburban areas, defined as...
-
Edge ranking and searching in partial orders
PublicationArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...