We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate tha...

Two-sided matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market where n advertisers compete for the assignment of one of k sponsored search results, also known as “slots”, for certain keywords they are interested in. Here, as in other markets of that kind, market equilibria correspond to stable matchings. In this paper, we sho...

motion analysis and quality assessment of human sperm cell is of great importance for clinical applications of male infertility. sperm tracking is quite complex due to cell collision, occlusion and missed detection. the goal of this study is simultaneous tracking of multiple human sperm cells. in the first step in this research the frame difference algorithm is used for background subtraction. ...

This article presents the results of the research aimed at developing an accent assignment system for Hungarian. Two methods are compared. The shallow method targets local and short-distance factors that determine accent; the deep (syntactic) method targets long-distance influences (such as focus). Neither of the methods alone results in absolutely satisfactory output; frequently, however, mist...

In this paper we have proposed a semi-heuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/service facilities. Our proposed algorithm marries the well-known CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, MASS can be potentially more efficient in terms of CPU...

We consider the problem of multi-robot task-allocation when robots have to deal with uncertain utility estimates. Typically an allocation is performed to maximize expected utility; we consider a means for measuring the robustness of a given optimal allocation when robots have some measure of the uncertainty (e.g., a probability distribution, or moments of such distributions). We introduce the I...

Problem statement: To design, implement, and test an algorithm for solving the square jigsaw puzzle problem, which has many applications in image processing, pattern recognition, and computer vision such as restoration of archeological artifacts and image descrambling. Approach: The algorithm used the gray level profiles of border pixels for local matching of the puzzle pieces, which was perfor...

This paper considers a particular form of incremental assignment problem that can be used to achieve efficient topological morphing in a network of robots. The assignment problem arises from a task-allocation formulation in which destination locations for newly deployed robots are added as tasks to an existing allocation. We adapt the bipartite matching variant of the Hungarian algorithm—origin...