메뉴 건너뛰기




Volumn 22, Issue 5, 2009, Pages 443-453

Faster graphical models for point-pattern matching

Author keywords

Graphical models; Isometric matching; Point pattern matching

Indexed keywords

BELIEF PROPAGATION; ERROR RATE; GRAPHICAL MODEL; GRAPHICAL MODELS; ISOMETRIC MATCHING; ITERATIVE ALGORITHM; ITERATIVE SOLUTIONS; MATCHING PROBLEMS; MAXIMAL CLIQUE; ORDER OF MAGNITUDE; POINT-PATTERN MATCHING; POLYNOMIAL-TIME; RUNNING TIME;

EID: 70349586092     PISSN: 01691015     EISSN: 15685683     Source Type: Journal    
DOI: 10.1163/156856809789476083     Document Type: Article
Times cited : (6)

References (13)
  • 1
    • 2942696007 scopus 로고    scopus 로고
    • Recent advances in the solution of quadratic assignment problems
    • Anstreicher, K. (2003). Recent advances in the solution of quadratic assignment problems, Mathematical Programming 97, 27-42.
    • (2003) Mathematical Programming , vol.97 , pp. 27-42
    • Anstreicher, K.1
  • 5
    • 12344265781 scopus 로고    scopus 로고
    • Graphical models for graph matching: Approximate models and optimal algorithms
    • Caelli, T. and Caetano, T. S. (2005). Graphical models for graph matching: approximate models and optimal algorithms, Pattern Recognition Letters 26, 339-346.
    • (2005) Pattern Recognition Letters , vol.26 , pp. 339-346
    • Caelli, T.1    Caetano, T.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.