Search
Filters
total: 26882
-
Catalog
displaying 1000 best results Help
Search results for: PROXIMAL ALGORITHM WITH MEMORY PRIMAL–DUAL ALGORITHM BEST APPROXIMATION OF THE KUHN–TUCKER SET INCLUSIONS WITH MAXIMALLY MONOTONE OPERATORS ATTRACTION PROPERTY IMAGE RECONSTRUCTION
-
Proximal primal–dual best approximation algorithm with memory
PublicationWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublicationWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
The Usage of the BP-Layers Stereo Matching Algorithm with the EBCA Camera Set
PublicationThis paper is concerned with applying a stereo matching algorithm called BP-Layers to a set of many cameras. BP Layers is designed for obtaining disparity maps from stereo cameras. The algorithm takes advantage of convolutional natural networks. This paper presents using this algorithm with a set called Equal Baseline Camera Array. This set consists of up to five cameras with one central camera and other ones aground it. Such a...
-
an intelligent image processing sensor - the algorithm and the hardware implementation
PublicationW artykule przedstawiono algorytm przeznaczony do rozpoznawania obiektów ruchomych w obrazie do celu analizy ruchu pojazdów. Algorytm został zrealizowany w układzie FPGA.Ang.: This paper describes the idea and theimplementation of the robust algorithm dedicated toextraction of moving vehicles from real-time cameraimages for the evaluation of traffic parameters, suchas the number of vehicles, their direction of movementand their...
-
Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
PublicationThe convex set of quantum states of a composite K×K system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For K >3 or K=3 this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive....
-
An EIT reconstruction algorithm based on noisy data.
PublicationPraca przedstawia algorytm rekonstrukcji oparty o zmodyfikowany algorytm Gaussa - Newtona. Algorytm uwzględnia istnienie elektrod pomiarowych w tomografii elektroimpedancyjnej. Elektrody charakteryzują się rozmiarem i impedancją. Dodatkowo algorytm zakłada istnienie szumu w sygnale mierzonym. Zostało pokazane, że dobór optymalnego wzorca pobudzenia znacząco poprawia odporność algorytmu rekonstrukcyjnego na szum w danych. Dwie...
-
Using Long-Short term Memory networks with Genetic Algorithm to predict engine condition
PublicationPredictive maintenance (PdM) is a type of approach for maintenance processes, allowing maintenance actions to be managed depending on the machine's current condition. Maintenance is therefore carried out before failures occur. The approach doesn’t only help avoid abrupt failures but also helps lower maintenance cost and provides possibilities to manufacturers to manage maintenance budgets in a more efficient way. A new deep neural...
-
Text-mining Similarity Approximation Operators for Opinion Mining in BI tools
PublicationThe concept of the Text-mining Similarity Approximation Operators for Opinion Mining as extensions to Natural Language Interface Database is defined. The new operators: “keywords of” dimension; subsetting operator “about C is q”; aggregation operator “by similar C” are proposed. These operators are based on the Latent Semantic Analysis and Social Network Analysis
-
Asymptotic behaviour in the set of nonhomogeneous chains of stochastic operators
PublicationWe study different types of asymptotic behaviour in the set of (infinite dimensional) nonhomogeneous chains of stochastic operators acting on L1(μ) spaces. In order to examine its structure we consider different norm and strong operator topologies. To describe the nature of the set of nonhomogeneous chains of Markov operators with a particular limit behaviour we use the category theorem of Baire. We show that the geometric structure...
-
Reconstruction of 3D image of corona discharge streamer
PublicationIn this paper, the method of reconstruction of the 3D structure of streamers in DC positive corona discharge in nozzle-to-plate electrode configuration is presented. For reconstructing of 3D image of corona discharge streamer we propose a stereographical method, where streamers are observed from several directions simultaneously. The multi-directional observation enabled to obtain fine positional coordinates of streamers for a...
-
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publication -
An approximation algorithm for maximum P3-packing in subcubic graphs
PublicationW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
Prevalence Problem in the Set of Quadratic Stochastic Operators Acting on L1
PublicationThis paper is devoted to the study of the problem of prevalence in the class of quadratic stochastic operators acting on the L1 space for the uniform topology. We obtain that the set of norm quasi-mixing quadratic stochastic operators is a dense and open set in the topology induced by a very natural metric. This shows the typical long-term behaviour of iterates of quadratic stochastic operators.
-
Equivalence of equicontinuity concepts for Markov operators derived from a Schur-like property for spaces of measures
PublicationVarious equicontinuity properties for families of Markov operators have been – and still are – used in the study of existence and uniqueness of invariant probability for these operators, and of asymptotic stability. We prove a general result on equivalence of equicontinuity concepts. It allows comparing results in the literature and switching from one view on equicontinuity to another, which is technically convenient in proofs....
-
Genetic operators of evolutionary algorithm in problem of collision avoidance at sea
Publication...
-
Hardware implementation of digital image stabilization using optical flow algorithm and FPGA technology
PublicationW artykule przedstawiono efektywną procedurę uproszczenia algorytmu przepływu optycznego oraz jego realizację w układzie programowalnym FPGA. Zmodyfikowany algorytm wykorzystuję metodę blokowego dopasowania podobszarów oraz jednowymiarową reprezentację podobszarów. Dodatkowo, funkcja korelacji oparta jest o normę L1. W rezultacie uzyskano zmniejszenie zużytych zasobów kosztem nieznacznej utraty dokładności. Zarówno dokładność,...
-
Superresolution algorithm to video surveillance system
PublicationAn application of a multiframe SR (superresolution) algorithm applied to video monitoring is described. The video signal generated by various types of video cameras with different parameters and signal distortions which may be very problematic for superresolution algorithms. The paper focuses on disadvantages in video signal which occur in video surveillance systems. Especially motion estimation and its influence on superresolution...
-
An EIT reconstruction algorithm: comparison of one-step and iterative versions.
PublicationW pracy przeprowadzono dyskusję problemu rekonstrukcji jednokrokowej i iteracyjnej w tomografii elektroimpedancyjnej. Zbadano zależność błędu rekonstrukcji od parametrów zaburzenia dla wersji jednokrokowej algorytmu i porównano z wynikami rekonstrukcji iteracyjnej. W przeprowadzonych symulacjach wykorzystano algorytm Levenberga-Marquardta.
-
AN ALGORITHM FOR PORTAL HYPERTENSIVE GASTROPATHY RECOGNITION ON THE ENDOSCOPIC RECORDINGS
PublicationSymptoms recognition of portal hypertensive gastropathy (PHG) can be done by analysing endoscopic recordings, but manual analysis done by physician may take a long time. This increases probability of missing some symptoms and automated methods may be applied to prevent that. In this paper a novel hybrid algorithm for recognition of early stage of portal hypertensive gastropathy is proposed. First image preprocessing is described....
-
FPGA-Based Implementation of Real Time Optical Flow Algorithm and Its Applications for Digital Image Stabilization
PublicationAn efficient simplification procedure of the optical flow (OF) algorithm as well as its hardware implementation using the field programmable gate array (FPGA) technology is presented. The modified algorithm is based on block matching of subsets of successive frames, and exploits one-dimensional representation of subsets as well as the adaptive adjustments of their sizes. Also, an l1-norm-based correlation function requiring no...
-
Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation
PublicationIn the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.
-
Context Search Algorithm for Lexical Knowledge Acquisition
PublicationA Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...
-
Dimension of the solution set for differential inclusions
Publication -
Satellite Image Classification Using a Hierarchical Ensemble Learning and Correlation Coefficient-Based Gravitational Search Algorithm
PublicationSatellite image classification is widely used in various real-time applications, such as the military, geospatial surveys, surveillance and environmental monitoring. Therefore, the effective classification of satellite images is required to improve classification accuracy. In this paper, the combination of Hierarchical Framework and Ensemble Learning (HFEL) and optimal feature selection is proposed for the precise identification...
-
A Parallel Genetic Algorithm for Creating Virtual Portraits of Historical Figures
PublicationIn this paper we present a genetic algorithm (GA) for creating hypothetical virtual portraits of historical figures and other individuals whose facial appearance is unknown. Our algorithm uses existing portraits of random people from specific historical period and social background to evolve a set of face images potentially resembling the person whose image is to be found. We then use portraits of the person's relatives to judge...
-
Adversarial attack algorithm for traffic sign recognition
PublicationDeep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...
-
Optimizing the computation of a parallel 3D finite difference algorithm for graphics processing units
PublicationThis paper explores the possibilities of using a graphics processing unit for complex 3D finite difference computation via MUSTA‐FORCE and WENO algorithms. We propose a novel algorithm based on the new properties of CUDA surface memory optimized for 2D spatial locality and compare it with 3D stencil computations carried out via shared memory, which is currently considered to be the best approach. A case study was performed for...
-
Intracranial hemorrhage detection in 3D computed tomography images using a bi-directional long short-term memory network-based modified genetic algorithm
PublicationIntroduction: Intracranial hemorrhage detection in 3D Computed Tomography (CT) brain images has gained more attention in the research community. The major issue to deal with the 3D CT brain images is scarce and hard to obtain the labelled data with better recognition results. Methods: To overcome the aforementioned problem, a new model has been implemented in this research manuscript. After acquiring the images from the Radiological...
-
FPGA realization of an improved alpha max plus beta min algorithm
PublicationThe generalized improved version of the alpha max plus beta min square-rooting algorithm and its realization in the Field Programmable Gate Array (FPGA) are presented. The algorithm computes the square root to calculate the approximate magnitude of a complex sample. It is especially useful for pipelined calculations in the DSP. In case of four approximation regions it is possible to reduce the peak error form 3.95% to 0.33%. This...
-
Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
PublicationThe Clairvoyant algorithm proposed in “A novel MPI reduction algorithm resilient to imbalances in process arrival times” was analyzed, commented and improved. The comments concern handling certain edge cases in the original pseudocode and description, i.e., adding another state of a process, improved cache friendliness more precise complexity estimations and some other issues improving the robustness of the algorithm implementation....
-
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
PublicationThis paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial...
-
Performance Evaluation of the Parallel Codebook Algorithm for Background Subtraction in Video Stream
PublicationA background subtraction algorithm based on the codebook approach was implemented on a multi-core processor in a parallel form, using the OpenMP system. The aim of the experiments was to evaluate performance of the multithreaded algorithm in processing video streams recorded from monitoring cameras, depending on a number of computer cores used, method of task scheduling, image resolution and degree of image content variability....
-
Robust unsupervised georeferencing algorithm for aerial and satellite imagery
PublicationIn order to eliminate a human factor and fully automate the process of embedding the spatial localization information in a remote sensed image the integrated georeferencing method was proposed. The paper presents this unsupervised and robust approach which is comprised of pattern recognition, using SIFT-based detector, and RANSAC based outlier removal with matching algorithm.
-
Moving object tracking algorithm evaluation in autonomous surveillance system
PublicationResults of evaluation of video object tracking algorithm being a part of an autonomous surveillance system are presented. The algorithm was investigated employing a set of benchmarks recorded locally. The precision of object detection, evaluated with such metrics as fragmentation, object area recall and object precision, is in focus. The experiments aimed at examining the detection quality using various object detection algorithm...
-
On residualities in the set of Markov operators on C1
PublicationDowodzi się, że zbiór operatorów Markowa na klasie Schattena 1, które są mieszające w normie, jest normowo gęsty, otwarty. Natomiast w topologii mocno operatorowej operatory Markowa mocno mieszające są zbiorem I kategorii.
-
Improved magnitude estimation of complex numbers using alpha max and beta min algorithm
PublicationThe paper presents an improved algorithm for calculating the magnitude of complex numbers. This problem, which is a special case of square rooting, occurs for example, in FFT processors and complex FIR filters. The proposed method of magnitude calculation makes use of the modified alpha max and beta min algorithm. The improved version of the algorithm allows to control the maximum magnitude approximation error by using an adequate...
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
Interactive Information Retrieval Algorithm for Wikipedia Articels
PublicationThe article presents an algorithm for retrieving textual information in documents collection. The algorithm employs a category system that organizers the repository and using interaction with user improves search precision. The algorithm was implemented for simple English Wikipedia and the first evaluation results indicates the proposed method can help to retrieve information from large document repositories.
-
New Indoor Positioning Algorithm for Distance Measurements
PublicationIn the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublicationPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces
PublicationA deterministic technique for fast surrogate-assisted multi-objective design optimization of antennas in highly-dimensional parameters spaces has been discussed. In this two-stage approach, the initial approximation of the Pareto set representing the best compromise between conflicting objectives is obtained using a bisection algorithm which finds new Pareto-optimal designs by dividing the line segments interconnecting previously...
-
An optimized system for sensor ontology meta-matching using swarm intelligent algorithm
PublicationIt is beneficial to annotate sensor data with distinct sensor ontologies in order to facilitate interoperability among different sensor systems. However, for this interoperability to be possible, comparable sensor ontologies are required since it is essential to make meaningful links between relevant sensor data. Swarm Intelligent Algorithms (SIAs), namely the Beetle Swarm Optimisation Algorithm (BSO), present a possible answer...
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublicationA simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...
-
Using River Formation Dynamics Algorithm in Mobile Robot Navigation
PublicationRiver Formation Dynamics is a heuristic optimization algorithm based on the manner, in which drops of water form the river bed. The idea is to imitate the movement of drops on the edges between given nodes thus performing a search based on their height, which is modified through the mechanism of soil erosion and sediment deposition. In this way decreasing gradients are constructed, and these are followed by subsequent drops to...
-
Termination functions for evolutionary path planning algorithm
PublicationIn this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Five...
-
Adaptive Algorithm for Interactive Question-based Search
PublicationPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...