Graphical models for graph matching: Approximate models and optimal algorithms

Caelli, Terry and Caetano, Tiberio 2005, Graphical models for graph matching: Approximate models and optimal algorithms, Pattern Recognition Letters, vol. 26, no. 3, pp. 339-346, doi: 10.1016/j.patrec.2004.10.022.

Attached Files
Name Description MIMEType Size Downloads

Title Graphical models for graph matching: Approximate models and optimal algorithms
Author(s) Caelli, TerryORCID iD for Caelli, Terry orcid.org/0000-0001-9281-2556
Caetano, Tiberio
Journal name Pattern Recognition Letters
Volume number 26
Issue number 3
Start page 339
End page 346
Total pages 8
Publisher ELSEVIER SCIENCE BV
Publication date 2005-02-01
ISSN 0167-8655
Keyword(s) Science & Technology
Technology
Computer Science, Artificial Intelligence
Computer Science
attributed graph matching
hidden Markov random fields
relaxation labeling
Junction Tree algorithms
SEGMENTATION
RECOGNITION
Language eng
DOI 10.1016/j.patrec.2004.10.022
Indigenous content off
Field of Research 0801 Artificial Intelligence and Image Processing
0906 Electrical and Electronic Engineering
1702 Cognitive Sciences
HERDC Research category C1 Refereed article in a scholarly journal
Persistent URL http://hdl.handle.net/10536/DRO/DU:30138415

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 17 times in TR Web of Science
Scopus Citation Count Cited 25 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 28 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Mon, 08 Jun 2020, 14:48:17 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.