Sciweavers

1871 search results - page 72 / 375
» The Ephemeral Pairing Problem
Sort
View
BMVC
2002
15 years 1 months ago
Robust Wide Baseline Stereo from Maximally Stable Extremal Regions
The wide-baseline stereo problem, i.e. the problem of establishing correspondences between a pair of images taken from different viewpoints is studied. A new set of image elements...
Jiri Matas, Ondrej Chum, Martin Urban, Tomá...
CORR
2008
Springer
72views Education» more  CORR 2008»
14 years 11 months ago
Inferring Company Structure from Limited Available Information
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
Mugurel Ionut Andreica, Angela Andreica, Romulus A...
ICIP
2009
IEEE
16 years 7 days ago
Designing Color Filter Arrays For The Joint Capture Of Visible And Near-infrared Images
Digital camera sensors are inherently sensitive to the nearinfrared (NIR) part of the light spectrum. In this paper, we propose a general design for color filter arrays that allow...
SOFSEM
2007
Springer
15 years 5 months ago
Constraints for Argument Filterings
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Harald Zankl, Nao Hirokawa, Aart Middeldorp
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 16 days ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...