Probabilistic correspondence matching using random walk with restart

Research output: Contribution to conferencePaper

7 Citations (Scopus)

Abstract

This paper presents a probabilistic method for correspondence matching with a framework of the random walk with restart (RWR). The matching cost is reformulated as a corresponding probability, which enables the RWR to be utilized for matching the correspondences. There are mainly two advantages in our method. First, the proposed method guarantees the non-trivial steady-state solution of a given initial matching probability due to the restarting term in the RWR. It means the number of iteration, a crucial parameter which influences the performance of algorithm, is not needed in contrast to the conventional methods. This gives the consistent results regardless of the evolution time. Second, only an adjacent neighborhood is considered when the matching probabilities are inferred, which lowers the computational complexity while not sacrificing performance. Experimental results show that the performance of the proposed method is competitive to that of state-of-the-art methods both qualitatively and quantitatively.

Original languageEnglish
DOIs
Publication statusPublished - 2012 Jan 1
Event2012 23rd British Machine Vision Conference, BMVC 2012 - Guildford, Surrey, United Kingdom
Duration: 2012 Sep 32012 Sep 7

Other

Other2012 23rd British Machine Vision Conference, BMVC 2012
CountryUnited Kingdom
CityGuildford, Surrey
Period12/9/312/9/7

Fingerprint

Computational complexity
Costs

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this

Oh, C., Ham, B., & Sohn, K. (2012). Probabilistic correspondence matching using random walk with restart. Paper presented at 2012 23rd British Machine Vision Conference, BMVC 2012, Guildford, Surrey, United Kingdom. https://doi.org/10.5244/C.26.37
Oh, Changjae ; Ham, Bumsub ; Sohn, Kwanghoon. / Probabilistic correspondence matching using random walk with restart. Paper presented at 2012 23rd British Machine Vision Conference, BMVC 2012, Guildford, Surrey, United Kingdom.
@conference{ad5fdaa21750467b8e182a4d27c48f69,
title = "Probabilistic correspondence matching using random walk with restart",
abstract = "This paper presents a probabilistic method for correspondence matching with a framework of the random walk with restart (RWR). The matching cost is reformulated as a corresponding probability, which enables the RWR to be utilized for matching the correspondences. There are mainly two advantages in our method. First, the proposed method guarantees the non-trivial steady-state solution of a given initial matching probability due to the restarting term in the RWR. It means the number of iteration, a crucial parameter which influences the performance of algorithm, is not needed in contrast to the conventional methods. This gives the consistent results regardless of the evolution time. Second, only an adjacent neighborhood is considered when the matching probabilities are inferred, which lowers the computational complexity while not sacrificing performance. Experimental results show that the performance of the proposed method is competitive to that of state-of-the-art methods both qualitatively and quantitatively.",
author = "Changjae Oh and Bumsub Ham and Kwanghoon Sohn",
year = "2012",
month = "1",
day = "1",
doi = "10.5244/C.26.37",
language = "English",
note = "2012 23rd British Machine Vision Conference, BMVC 2012 ; Conference date: 03-09-2012 Through 07-09-2012",

}

Oh, C, Ham, B & Sohn, K 2012, 'Probabilistic correspondence matching using random walk with restart' Paper presented at 2012 23rd British Machine Vision Conference, BMVC 2012, Guildford, Surrey, United Kingdom, 12/9/3 - 12/9/7, . https://doi.org/10.5244/C.26.37

Probabilistic correspondence matching using random walk with restart. / Oh, Changjae; Ham, Bumsub; Sohn, Kwanghoon.

2012. Paper presented at 2012 23rd British Machine Vision Conference, BMVC 2012, Guildford, Surrey, United Kingdom.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Probabilistic correspondence matching using random walk with restart

AU - Oh, Changjae

AU - Ham, Bumsub

AU - Sohn, Kwanghoon

PY - 2012/1/1

Y1 - 2012/1/1

N2 - This paper presents a probabilistic method for correspondence matching with a framework of the random walk with restart (RWR). The matching cost is reformulated as a corresponding probability, which enables the RWR to be utilized for matching the correspondences. There are mainly two advantages in our method. First, the proposed method guarantees the non-trivial steady-state solution of a given initial matching probability due to the restarting term in the RWR. It means the number of iteration, a crucial parameter which influences the performance of algorithm, is not needed in contrast to the conventional methods. This gives the consistent results regardless of the evolution time. Second, only an adjacent neighborhood is considered when the matching probabilities are inferred, which lowers the computational complexity while not sacrificing performance. Experimental results show that the performance of the proposed method is competitive to that of state-of-the-art methods both qualitatively and quantitatively.

AB - This paper presents a probabilistic method for correspondence matching with a framework of the random walk with restart (RWR). The matching cost is reformulated as a corresponding probability, which enables the RWR to be utilized for matching the correspondences. There are mainly two advantages in our method. First, the proposed method guarantees the non-trivial steady-state solution of a given initial matching probability due to the restarting term in the RWR. It means the number of iteration, a crucial parameter which influences the performance of algorithm, is not needed in contrast to the conventional methods. This gives the consistent results regardless of the evolution time. Second, only an adjacent neighborhood is considered when the matching probabilities are inferred, which lowers the computational complexity while not sacrificing performance. Experimental results show that the performance of the proposed method is competitive to that of state-of-the-art methods both qualitatively and quantitatively.

UR - http://www.scopus.com/inward/record.url?scp=84898406082&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84898406082&partnerID=8YFLogxK

U2 - 10.5244/C.26.37

DO - 10.5244/C.26.37

M3 - Paper

ER -

Oh C, Ham B, Sohn K. Probabilistic correspondence matching using random walk with restart. 2012. Paper presented at 2012 23rd British Machine Vision Conference, BMVC 2012, Guildford, Surrey, United Kingdom. https://doi.org/10.5244/C.26.37