Abstract
Graph matching problem has been widely used in many fields. Due to the discrete property of graph matching problem, the continuous relaxation will result in a bad influence on the solution. Thus, we propose a hypergraph matching model with an entropy barrier function considering the discrete property of the assignment matrix. The model is solved by a nonmonotone active set projected Newton method whose nonmonotone line search technique has a good ability to accept the projected Newton stepsize. We evaluate our method through several experiments, which indicates that our method has better matching results than others.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
