Filters








309,665 Hits in 5.7 sec

An enhanced Biometric-based Face Recognition System using Genetic and CRO Algorithms

Ola Surakhi, Mohammad Khanafseh, Yasser Jaffal
2018 Advances in Science, Technology and Engineering Systems  
In this paper, a new technique is proposed by using meta-heuristic algorithm.  ...  it and evaluate the weight value for each area in the face image areas.  ...  Figure 13 : 13 Relation between generation size and matching value for face recognition using CRO algorithm Figure 14 : 14 Comparative results of matching accuracy vs. number of iterations of both new  ... 
doi:10.25046/aj030316 fatcat:hrghlyrwmbcpfo7pmdc3fv25bi

A New Approach to Weighted Graph Matching

Kai-Jie ZHENG, Ji-Gen PENG, Shi-Hui YING
2009 IEICE transactions on information and systems  
In this paper, a new relaxation approach to weighted graph matching is proposed, by which a new matching algorithm, named alternate iteration algorithm, is designed.  ...  Weighted graph matching is computationally challenging due to the combinatorial nature of the set of permutations.  ...  After some preliminaries are introduced in Sect. 2, we propose a new relaxation approach to weighted graph matching and then derive a new matching algorithm, named alternate iteration algorithm, in Sect  ... 
doi:10.1587/transinf.e92.d.1580 fatcat:xho7udeg3fg4bdbksgehvpk5fe

Efficient aggregation via iterative block-based adapting support-weights

Leonardo De-Maeztu, Stefano Mattoccia, Arantxa Villanueva, Rafael Cabeza
2011 2011 International Conference on 3D Imaging (IC3D)  
Local stereo matching algorithms based on adapting-weights aggregation produce excellent results compared to other local methods.  ...  In this paper we propose a novel iterative approach for adaptingweights aggregation which produces better results and outperforms most previous adapting-weights methods.  ...  CONCLUSION In this work we have presented a new iterative costs aggregation algorithm for stereo matching that produces more ac-curate results than most state-of-the-art adapting-weights solutions.  ... 
doi:10.1109/ic3d.2011.6584379 dblp:conf/ic3d/De-MaeztuMVC11 fatcat:noijexqw7vgvvokkmnaiilsqrm

Incremental assignment problem

Ismail H. Toroslu, Göktürk Üçoluk
2007 Information Sciences  
We propose an O(|V | 2 ) algorithm for the problem.  ...  In this problem, a new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum weighted matching is already known, and the maximum weighted matching of the extended  ...  the first iteration of the algorithm: Weight Matrix Fig. 3 . 3 Situation after the first iteration of the algorithm: Weight Matrix The AlgorithmOur algorithm for the incremental assignment problem  ... 
doi:10.1016/j.ins.2006.05.004 fatcat:wibnbwooobdd7i3obnaekoifyy

Near Real-Time Stereo Matching Using Geodesic Diffusion

L. De-Maeztu, A. Villanueva, R. Cabeza
2012 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Adaptive-weight algorithms currently represent the state of the art in local stereo matching.  ...  The proposed aggregation algorithm produces results similar to adaptive-weight solutions while reducing the computational requirements.  ...  [11] of the original adaptive-weight algorithm have also proposed a similar solution. Here, we present a new local stereo matching algorithm inspired by anisotropic diffusion.  ... 
doi:10.1109/tpami.2011.192 pmid:21968916 fatcat:dezkgremxja2pewtm645iwaf7q

Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs [chapter]

Robert Preis
1999 Lecture Notes in Computer Science  
A new approximation algorithm for maximum weighted matching in general edge-weighted graphs is presented.  ...  This improves over the previously known 1 2 -approximation algorithms for maximum weighted matching which require O(jEj log(jV j)) steps, where jV j is the number of vertices.  ...  Therefore, any algorithm for maximal matching is an 1 2 -approximation algorithm for maximum cardinality matching.  ... 
doi:10.1007/3-540-49116-3_24 fatcat:gizqmz5s2fgf3drxbnurmc5xku

A Modified Decomposition Algorithm for Maximum Weight Bipartite Matching and Its Experimental Evaluation

Shibsankar Das, Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi - 221005, Uttar Pradesh, India
2020 Scientific Annals of Computer Science  
., for computing maximum weight bipartite matching.  ...  We apply it to design an efficient version of the decomposition algorithm to compute the weight of a maximum weight bipartite matching of G in O( |V |W /k(|V |, W /N ))-time by employing an algorithm designed  ...  Kalpesh Kapoor for his helpful comments and Rahul Kadyan for assisting me in the implementation of graph matching algorithms.  ... 
doi:10.7561/sacs.2020.1.39 fatcat:bgxli3pbljaqbcuq5huxt2x7fy

An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem [article]

Yuxuan Wang and Jinyao Xie and Jiongzhi Zheng and Kun He
2022 arXiv   pre-print
Hence, we optimize the redundant operations during the matching iterations, and propose an efficient algorithm called the MP_KM-M that greatly speeds up MP_LS.  ...  and the classical Min-Max Weighted Matching (MMWM) problem.  ...  Hence, we propose a new algorithm called MP KM-M , which reuses the matching results of the edges that their weights are not changed in the last iteration, and hence reduces the time complexity from O(  ... 
arXiv:2201.10049v1 fatcat:stnzceov7fbgtd5xaqq2jd7a6i

Multi-Hypothesis Scan Matching through Clustering [article]

Giorgio Iavicoli, Claudio Zito
2022 arXiv   pre-print
The results confirms that our approach has superior performance in terms of matching accuracy and runtime computation than the state-of-the-art iterative point-based scan matching algorithms.  ...  Graph-SLAM is a well-established algorithm for constructing a topological map of the environment while simultaneously attempting the localisation of the robot.  ...  Iterative Dual Correspondece (IDC) algorithm combines the ICP metric for translations with an Iterative Matching-Range Point (IMRP) for rotations.  ... 
arXiv:2201.03814v2 fatcat:5emvae45avd67f2g5gdhmb2n2i

An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs [article]

Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli
2019 arXiv   pre-print
In this paper, we present an O(n^3) time algorithm for finding a maximum weight b-matching of G, where |A|+|B|=O(n).  ...  Our algorithm improves the previous best time complexity of O(n^3 log n) for this problem.  ...  In this paper, we present an O(n 3 ) time algorithm for the maximum weight b-matching problem. Our algorithm is an interesting one for example in dense graphs.  ... 
arXiv:1410.3408v2 fatcat:sgjwdza7zrg23kbu2qt7h7gvha

Fast and Simple Algorithms for Weighted Perfect Matching

Mirjam Wattenhofer, Roger Wattenhofer
2004 Electronic Notes in Discrete Mathematics  
We present two fast and simple combinatorial approximation algorithms for constructing a minimum-weighted perfect matching on complete graphs whose cost functions satisfy the triangle inequality.  ...  In the second algorithm, the average time until a node is matched is O(n 2 ) and the approximation ratio is log 2 n.  ...  Perfect Matching Algorithm is at most the weight of the optimal forest F * : w(E C φ ) ≤ w(F * ). PROOF. We will argument about an arbitrary iteration φ.  ... 
doi:10.1016/j.endm.2004.03.052 fatcat:ann5lbm6srhxrpb32jgjlah2qi

A coarse-to-fine kernel matching approach for mean-shift based visual tracking

L. Liangfu, F. Zuren, C. Weidong, J. Ming
2009 Opto-Electronics Review  
This thesis presents a mean shift algorithm based on coarse-to-fine search for the best kernel matching. This paper researches for object tracking with large motion area based on mean shift.  ...  Experimental results show its good performance in accuracy and speed when compared with background-weighted histogram algorithm in the literature.  ...  This paper presents a new mean shift tracking algorithm based on a coarse−to−fine search for the best kernel match− ing (CFT). This work is aimed at object tracking with a large motion area.  ... 
doi:10.2478/s11772-008-0058-4 fatcat:suslwhakozcotpiaogf37qnd7m

Distributed algorithms for weighted problems in sparse graphs

A. Czygrinow, M. Hańćkowiak
2006 Journal of Discrete Algorithms  
For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching.  ...  We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs.  ...  Acknowledgement The authors thank referees for their comments and for pointing out a mistake in the previous version of the paper.  ... 
doi:10.1016/j.jda.2005.07.006 fatcat:53kqcca2jfhxbmwzl3jp2t5d6a

A Study on Efficiency in Continual Learning Inspired by Human Learning [article]

Philip J. Ball, Yingzhen Li, Angus Lamb, Cheng Zhang
2020 arXiv   pre-print
First, we identify that weight freezing, which is used in continual learning without biological justification, can result in over 2× as many weights being used for a given level of performance.  ...  Humans are efficient continual learning systems; we continually learn new skills from birth with finite cells and resources.  ...  PackNet uses one-shot pruning for network weight reduction; we extend this algorithm to use iterative pruning and present this in Algorithm 1. If N = 1, we retrieve the original PackNet algorithm.  ... 
arXiv:2010.15187v1 fatcat:by6lw5bnpjd7zmn4ouela6r6nm

Iterative Procrustes alignment with the EM algorithm

B. Luo, E.R. Hancock
2002 Image and Vision Computing  
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm.  ...  The method can be used to match unlabelled point-sets of different size. We illustrate the effectiveness of the method matching stereograms.  ...  Figs. 2 and 3 show the alignment error as a function of iteration number for the new matching method`IP'. The different curves are different initial rotations and scale-differences.  ... 
doi:10.1016/s0262-8856(02)00010-0 fatcat:gmyy2ca2ynaizkds54t227jehi
« Previous Showing results 1 — 15 out of 309,665 results