Abstract
Attributed relational graphs (ARGs) have shown superior qualities when used for image representation and analysis in computer vision systems. A new, efficient approach for calculating a global distance measure between attributed relational graphs is proposed, and its applications in computer vision are discussed. The distance measure is calculated by a global optimization algorithm that is shown to be very efficient for this problem. The approach shows good results for practical size ARGs. The technique is also suitable for parallel processing implementation.
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics
Disclaimer: 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.
