Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohammed Al-Shahri

dblp:153/3902 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
3D vision · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › feature matching
line matching
0.212014
Line Matching in Wide-Baseline Stereo: A Top-Down Approach · IEEE Trans. Image Process. 2014
Computer vision › 3D vision
stereo vision
0.212014
Line Matching in Wide-Baseline Stereo: A Top-Down Approach · IEEE Trans. Image Process. 2014
Computer vision › 3D vision › feature matching › line matching
wide-baseline line matching
0.212014
Line Matching in Wide-Baseline Stereo: A Top-Down Approach · IEEE Trans. Image Process. 2014

Methods — techniques the papers use, named apart from their topics

local homography · 0.2epipolar geometry · 0.2coplanarity constraint · 0.2affinity matrix · 0.2
YearPublicationVenuePosition
2014 Line Matching in Wide-Baseline Stereo: A Top-Down Approach
abstract
This paper introduces a new algorithm for matching lines across images that exploit the epipolar geometry and the coplanarity constraints between pairs of lines. In contrast to common treatment in matching of interest points, we use the epipolar geometry to constrain coplanarity conditions between line-pairs. This treatment eliminates the potential matching problems due to the incomplete line observations with nonmatching endpoints. This observation is used to detect a set of candidate line-pair correspondences. These matching pairs are then verified via local homography transforms derived from the neighboring interest point correspondences. This step results in a line affinity matrix which is processed to obtain matching lines. During this process, we do not use appearance models and show that the proposed treatment performs better than the state-ofthe- art appearance and geometry based methods especially for images with wide-baseline.
Mohammed Al-Shahri, Alper Yilmaz 0001
IEEE Trans. Image Process.1