Search
Filters
total: 3420
-
Catalog
displaying 1000 best results Help
Search results for: RANSAC ALGORITHM
-
Corrupted speech intelligibility improvement using adaptive filter based algorithm
PublicationA technique for improving the quality of speech signals recorded in strong noise is presented. The proposed algorithmemploying adaptive filtration is described and additional possibilities of speech intelligibility improvement arediscussed. Results of the tests are presented.
-
Smart Virtual Bass Synthesis Algorithm Based on Music Genre Classification
PublicationThe aim of this paper is to present a novel approach to the Virtual Bass Synthesis (VBS) algorithms applied to portable computers. The proposed algorithm employed automatic music genre recognition to determine the optimum parameters for the synthesis of additional frequencies. The synthesis was carried out using the non-linear device (NLD) and phase vocoder (PV) methods depending on the music excerpt genre. Classification of musical...
-
Arc-length Algorithm Efficiency in the Analysis of Thermally Loaded Multilayered Shells
PublicationThis paper concerns the efficiency study of the arc-length algorithm in the geometrically non-linear analysis of thermally loaded multilayered shells. The thermal loading is considered as the one-way thermo-mechanical coupling effect. Two implementations of the arc-length method are examined: the path-following technique available in NX-Nastran and the RiksWempner-Ramm algorithm adopted in the authors’ computer code SHLTH. It is...
-
Method of selecting the LS-SVM algorithm parameters in gas detection process
PublicationIn this paper we showed the method of resistive gas sensors data processing. The UV irradiation and temperature modulation was applied to improve gas sensors’ selectivity and sensitivity. Noise voltage across the sensor’s terminals (proportional to its resistance fluctuations) was recorded to estimate power spectral density. This function was an input data vector for LS-SVM (least squares – support vector machine) algorithm, which...
-
Hybrid DUMBRA: an efficient QoS routing algorithm for networks with DiffServ architecture
PublicationDynamic routing is very important issue of current packet networks. It may support the QoS and help utilize available network resources. Unfortunately current routing mechanisms are not sufficient to fully support QoS. Although many research has been done in this area no generic QoS routing algorithm has been proposed that could be used across all network structures. Existing QoS routing algorithms are either dedicated to limited...
-
Pareto Task Assignments by an Adaptive Quantum-based Evolutionary Algorithm AQMEA
PublicationW pracy scharakteryzowano state_of_the_art w zakresie kwantowych algorytmów ewolucyjnych. Scharakteryzowano zasady efektywnego projektowania tej klasy algorytmów genetycznych. Podano wyniki uzyskane za pomocą kwantowego algorytmu ewolucyjnego AQMEA w zakresie wyznaczanie przydziałów zadań optymalnych w sensie Pareto.
-
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....
-
A telemedical and an outpatient thoracic impedance measurements - a validation algorithm of the electrodes placement
PublicationThis paper presents the algorithm for validation of electrodes locations for the thoracic impedance measurements. In particular the presented algorithm was designed to perform the telemetric sleep apnea monitoring. One of the problems, during the clinical tests of a developed device, was to preserve the repeatability of measurements. It strongly depended on the appropriate electrodes placement on the examined person’s thorax. It...
-
FPGA computation of magnitude of complex numbers using modified CORDIC algorithm
PublicationIn this work we present computation of the magnitude of complex numbers using a modified version of the CORDIC algorithm that uses only five iterations. The relationship between the computation error and the number of CORDIC iterations are presented for floating-point and integer arithmetics. The proposed modification of CORDIC for integer arithmetic relies upon the introduction of correction once basic computations are performed...
-
Efficient Complex Root Finding Algorithm for Microwave and Optical Propagation Problems
PublicationArticle relates to the use of innovative root finding algorithm (on a complex plane) to study propagation properties of microwave and optical waveguides. Problems of this type occur not only in the analysis of lossy structures, but also in the study of complex and leaky modes (radiation phenomena). The proposed algorithm is simple to implement and can be applied for functions with singularities and branch cuts in the complex plane...
-
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...
-
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...
-
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...
-
An Optimal Power Point Tracking Algorithm in a Solar PV Generation System
PublicationThe non-linearity in I-V characteristics of a PV panel requires to be operated at knee point to extract maximum power. In order to operate the panel at optimal point, maximum power point tracking (MPPT) algorithm is employed in the control structure. The main objective of MPP tracking is to keep the operation at knee point of I-V characteristics under varying condition of temperature and solar insolation. Under non uniform solar...
-
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....
-
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:...
-
Updating the Coupling Algorithm between HYDRUS and MODFLOW in the HYDRUS Package for MODFLOW
PublicationThe HYDRUS-based flow package for MODFLOW (the HPM or the HYDRUS package) is an existing unsaturated zone flow package for MODFLOW. In MODFLOW with the HPM, the groundwater modeling domain is discretized into regular grids that can be combined into multiple zones based on similarities in soil hydrology, topographical characteristics, and the depth to the groundwater. Each of these zones is assigned one unsaturated soil profile...
-
Things You Might Not Know about the k-Nearest Neighbors Algorithm
PublicationRecommender Systems aim at suggesting potentially interesting items to a user. The most common kind of Recommender Systems is Collaborative Filtering which follows an intuition that users who liked the same things in the past, are more likely to be interested in the same things in the future. One of Collaborative Filtering methods is the k Nearest Neighbors algorithm which finds k users who are the most similar to an active user...
-
Selection of energy storage units by genetic algorithm for mitigating voltage deviations
PublicationIn recent years, energy storage units have become very popular. They are applied both for economic and technical purposes. Unfortunately, the cost of such devices is still high and selecting their proper location and rated power have to be performed precisely. In this paper, a Genetic-Algorithm-based optimization method for selecting the best configuration of energy storage units in the power network is proposed. The presented...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublicationAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
Distributed measurement system with data transmission secured using XXTEA algorithm
PublicationThe paper deals with wireless data transmission security in the distributed measurement and control system. An overview of cryptographic algorithms was presented paying special attention to the algorithm dedicated to units with low processing power, which is important due to minimization of energy consumption. Measurement modules equipped with simple microcontrollers send data wirelessly to the central unit. The transmission was...
-
A multirate approach to DDS algorithm versus Taylor-series expansion technique.
PublicationPokazano, że cyfrowy generator syntezy bezpośredniej (DDS) można traktować jako algorytm wieloszybkościowy. Rozważono i porównano dwa sposoby wykorzystania pamięci. W pierwszym z nich zastosowano filtr ułamkowo-opóźniający o strukturze Farrowa. Drugie podejście oparto na rotacji fazy na podstawie rozwinięcia w szereg Taylora. Eksperymenty pokazują, że za pomocą obu tych sposobów, dla sinusoidy zespolonej generowanej w kwadraturowym...
-
Estimation of musical sound separation algorithm effectiveness employing neural networks.
PublicationŚlepa separacja dźwięków sygnałów muzycznych zawartych w zmiksowanym materiale jest trudnym zadaniem. Jest to spowodowane tym, że dźwięki znajdujące się w relacjach harmonicznych mogą zawierać kolidujące składowe sinusoidalne (składowe harmoniczne). Ewaluacja wyników separacji jest również problematyczna, gdyż analiza błędu energetycznego często nie odzwierciedla subiektywnej jakości odseparowanych sygnałów. W tej publikacji zostały...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
Jarosław Sadowski dr hab. inż.
People -
Algorithmic Human Resources Management
PublicationThe rapid evolution of Digital Human Resources Management has introduced a transformative era where algorithms play a pivotal role in reshaping the landscape of workforce management. This transformation is encapsulated in the concepts of algorithmic management and algorithmic Human Resource Management (HRM). The integration of advanced analytics, predictive and prescriptive analytics and the power of Artificial Intelligence (AI)...
-
Journal of Mathematical Modelling and Algorithms in Operations Research
Journals -
Algorithms for query processing in a distributed knowledge integration system
Publication -
Parallelisation of genetic algorithms for solving university timetabling problems
PublicationAlgorytmy genetyczne stanowią ważną metodę rozwiązywania problemów optymalizacyjnych. W artykule skupiono się na projekcie równoległego algorytmu genetycznego pozwalającego uzyskiwać uniwersyteckie rozkłady zajęć, spełniające zarówno twarde jak i miękkie ograniczenia. Czytelnika wprowadzono w niektóre znane sposoby zrównoleglenia, przedstawiono również podejście autorów, ykorzystujące MPI. Przyjęto strukturę zarządzania opartą...
-
Adaptive selection of control parameters in differential evolution algorithms
PublicationW pracy przedstawiono metodę adaptacyjnej selekcji parametrów kontrolnych w różnicowych algorytmach ewolucyjnych. Wartości parametrów takich jak: stopień krzyżowania i współczynnik różnicowej mutacji są odpowiednio zmieniane. Funkcje testowe użyte do testowania proponowanej metody były zaczerpnięte z literatury. Rezultaty uzyskane przy użyciu opisanej metody zostały porównane z innymi metodami selekcji różnicowej. Wyniki te, uzyskane...
-
Algorithms of fast service restoration in survivable multilayer networks
PublicationGłównym celem rozprawy jest zaproponowanie nowych modeli/algorytmów doboru tras zapewniających przeżywalność usług w sieciach IP-MPLS/WDM poprzez zastosowanie wyznaczonych zawczasu ścieżek zabezpieczających. Zakres pracy obejmuje: dokonanie przeglądu mechanizmów transmisji informacji w warstwowych sieciach teleinformatycznych IP-MPLS/WDM; szczegółowy opis sposobów zapewniania przeżywalności usług; zaproponowanie nowych metod doboru...
-
Algorithms for passive detection of moving vessels in marine environment
Publication -
PERFORMANCE COMPARISON OF MACHINE LEARNING ALGORITHMS FOR PREDICTIVE MAINTENANCE
Publication -
Heuristic scheduling algorithms for uniform load of computer system
PublicationW pracy zaprezentowano opracowany heurystyczny algorytm szeregowania zadań UNILO (ang. UNIform LOad - jednakowe obciążenie), umożliwiający redukcję całkowitego zapotrzebowania na moc obliczeniową systemu komputerowego bez pogarszania jego wydajności. Algorytm ten realizuje takie przydzielenie zadań obliczeniowych do poszczególnych jednostek (procesorów), aby zapewnić ich jednakowe obciążenie. Opracowany algorytm został zweryfikowany...
-
Comparative analysis of switched reluctance motor control algorithms
PublicationПредмет исследования. Развитие микропроцессорной техники и силовой электроники позволило создавать недорогие и эффективные системы управления различными электромеханическими объектами, которые ранее широко не использовались из-за сложности управления. К таким устройствам можно отнести вентильно-индукторные электрические машины. Данные машины широко применяются в различных практических разработках, например, в тяговом электроприводе,...
-
Robust and Efficient Machine Learning Algorithms for Visual Recognition
PublicationIn visual recognition, the task is to identify and localize all objects of interest in the input image. With the ubiquitous presence of visual data in modern days, the role of object recognition algorithms is becoming more significant than ever and ranges from autonomous driving to computer-aided diagnosis in medicine. Current models for visual recognition are dominated by models based on Convolutional Neural Networks (CNNs), which...
-
Scheduling algorithms for multimedia services in hiperlan/2 networks
PublicationW artykule zaprezentowano tradycyjne wykorzystanie oraz nowe metody przydziału pasma użytkownikom lokalnych sieci bezprzewodowych. W szczególności analizowano przydatność dwóch propozycji - algorytmów obsługi strumieni ruchu o zróżnicowanych priorytetach. Propozycje te uwzględniają rezerwację zasobów. Przeprowadzone badanie symulacyjne potwierdziły przydatność obu algorytmów do obsługi ruchu multimedialnego.
-
Algorithms for query processing in a distributed knowledge integration system
PublicationGłównym celem artykułu jest wprowadzenie modelu systemu integracji wiedzy. Przedstawiony model jest oparty na modelu Calvanese i rozszerza go o wielowarstwowy model integracji. W artykule pokazano również użycie Kartograficznej Reprezentacji Wiedzy do przechowywania i przetwarzania ontologii w źródłach wiedzy oraz do budowania odwzorowań pomiędzy ontologiami. Odwzorowania pomiędzy ontologiami budowane w oparciu o odwzorowywanie...
-
Greedy algorithms for backbone graph coloring in KOALA library
Publication -
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Algorithms and Tools for Intelligent Control of Critical Infrastructure Systems
PublicationCritical Infrastructure Systems (CIS) are spatially distributed and of a network structure. The dynamics are nonlinear, uncertain and with several time scales. There is a variety of different objectives to be reliably met under a wide range of operational conditions. The operational conditions are influenced by the disturbance inputs, operating ranges of the CIS, faults in the sensors and actuators and abnormalities occurring in...
-
Efficiency comparison of selected endoscopic video analysis algorithms
PublicationIn the paper, selected image analysis algorithms were examined and compared in the task of identifying informative frames, blurry frames, colorectal cancer and healthy tissue on endoscopic videos. In order to standardize the tests, the algorithms were modified by removing from them parts responsible for the classification, and replacing them with Support Vector Machines and Artificial Neural Networks. The tests were performed in...
-
Metaheuristic algorithms for optimization of resilient overlay computing systems
PublicationThe idea of distributed computing systems has been gaining much interest in recent years owing to the growing amount of data to be processed for both industrial and academic purposes. However, similar to other systems, also distributed computing systems are vulnerable to failures. Due to strict QoS requirements, survivability guarantees are necessary for provisioning of uninterrupted service. In this article, we focus on reliability...
-
Algorithms for Ship Movement Prediction for Location Data Compression
PublicationDue to safety reasons, the movement of ships on the sea, especially near the coast should be tracked, recorded and stored. However, the amount of vessels which trajectories should be tracked by authorized institutions, often in real time, is usually huge. What is more, many sources of vessels position data (radars, AIS) produces thousands of records describing route of each tracked object, but lots of that records are correlated...
-
Parameters optimization in medicine supporting image recognition algorithms
PublicationIn this paper, a procedure of automatic set up of image recognition algorithms' parameters is proposed, for the purpose of reducing the time needed for algorithms' development. The procedure is presented on two medicine supporting algorithms, performing bleeding detection in endoscopic images. Since the algorithms contain multiple parameters which must be specified, empirical testing is usually required to optimise the algorithm's...
-
Signature Partitioning Using Selected Population-Based Algorithms
PublicationDynamic signature is a biometric attribute which is commonly used for identity verification. Artificial intelligence methods, especially population-based algorithms (PBAs), can be very useful in the dynamic signature verification process. They are able to, among others, support selection of the most characteristic descriptors of the signature or perform signature partitioning. In this paper, we focus on creating the most characteristic...
-
Face detection algorithms evaluation for the bank client verification
PublicationResults of investigation of face detection algorithms in the video sequences are presented in the paper. The recordings were made with a miniature industrial USB camera in real conditions met in three bank operating rooms. The aim of the experiments was to check the practical usability of the face detection method in the biometric bank client verification system. The main assumption was to provide as much as possible user interaction...
-
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...
-
On root finding algorithms for complex functions with branch cuts
PublicationA simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain. For any complex function defined by a finite number of Riemann sheets, a pointwise product of all the surfaces can be obtained. Such single-valued function is free of discontinuity caused by branch cuts and branch points. The roots of the new function are the same as the...