ON THE SMOOTHNESS CONSTRAINT IN THE INTENSITY-BASED ESTIMATION OF THE PARALLAX FIELD

被引:2
|
作者
DEVLEESCHAUWER, D
机构
[1] Communication Engineering Laboratory, University of Ghent, Gent, B-9000
关键词
COMPUTER VISION; OBTAINING THE DISTANCE OF OBJECTS; CODING OF STEREOSCOPIC IMAGES; ESTIMATING THE PARALLAX FIELD; INTENSITY-BASED ALGORITHM; SMOOTHNESS CONSTRAINT; ESTIMATION THEORY;
D O I
10.1007/BF00981567
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this contribution, the estimation of the parallax field is considered in a mathematical way. First, a mathematical model for the image formation is developed : This model describes how the parallax field influences the left and the right image. Then, we tackle the inverse problem : We calculate the parallax field given the left and the right image. In fact, the problem of estimating the parallax field is mathematically formulated as the maximum a posteriori probability (MAP) estimation of a Gaussian signal given two (noisy) measured signals, i.e. the left and the right image. Estimation problems like this are considered in [2]. We apply that theory to the problem at hand and prove that the MAP estimate for the parallax field minimizes a certain functional. This functional is compared to the functional of the traditional intensity-based method. Both functionals consist of a term associated with the displaced frame difference and a term associated with the smoothness of the parallax field. Our functional differs from the traditional one in the smoothness term. Next, we consider the searching for the minimum of this functional and develop a new iterative procedure to obtain the MAP estimate in a few iterations. Our procedure is quite different from the Gauss-Seidel or jacobi schemes [3] that are normally used for this purpose. Finally, some results are given to compare the performance of our smoothness constraint to the traditional one.
引用
收藏
页码:113 / 135
页数:23
相关论文
共 50 条
  • [1] Efficient intensity-based camera pose estimation in presence of depth
    El Choubassi, Maha
    Nestares, Oscar
    Wu, Yi
    Kozintsev, Igor
    Haussecker, Horst
    [J]. THREE-DIMENSIONAL IMAGE PROCESSING (3DIP) AND APPLICATIONS 2013, 2013, 8650
  • [2] Intensity-based estimation of extreme loss event probability and value at risk
    Hamidieh, Kamal
    Stoev, Stilian
    Michailidis, George
    [J]. APPLIED STOCHASTIC MODELS IN BUSINESS AND INDUSTRY, 2013, 29 (03) : 171 - 186
  • [3] Smoothness constraint for cortical dipolar sources estimation
    Korats, Gundars
    Ranta, Radu
    Le Cam, Steven
    Louis-Dorr, Valerie
    [J]. 2013 35TH ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY (EMBC), 2013, : 6796 - 6799
  • [4] Intensity-based modeling of default
    [J]. DEFAULT RISK IN BOND AND CREDIT DERIVATIVES MARKETS, 2004, 543 : 21 - 42
  • [5] CONTOUR MOTION ESTIMATION USING RELAXATION MATCHING WITH A SMOOTHNESS CONSTRAINT ON THE VELOCITY-FIELD
    STRICKLAND, RN
    MAO, ZH
    [J]. CVGIP-IMAGE UNDERSTANDING, 1994, 60 (02): : 157 - 167
  • [6] Replica-Mean-Field Limits for Intensity-Based Neural Networks
    Baccelli, Francois
    Taillefumier, Thibaud
    [J]. SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2019, 18 (04): : 1756 - 1797
  • [7] The estimation of spectral reflectances using the smoothness constraint condition
    Li, CJ
    Luo, MR
    [J]. NINTH COLOR IMAGING CONFERENCE: COLOR SCIENCE AND ENGINEERING SYSTEMS, TECHNOLOGIES, APPLICATIONS, 2001, : 62 - 67
  • [8] Laser intensity-based obstacle detection
    Hancock, J
    Hebert, M
    Thorpe, C
    [J]. 1998 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS - PROCEEDINGS, VOLS 1-3: INNOVATIONS IN THEORY, PRACTICE AND APPLICATIONS, 1998, : 1541 - 1546
  • [9] The Pair-Replica-Mean-Field Limit for Intensity-based Neural Networks
    Baccelli, Francois
    Taillefumier, Thibaud
    [J]. SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2021, 20 (01): : 165 - 207
  • [10] Intensity-based navigation with global guarantees
    Kamilah Taylor
    Steven M. LaValle
    [J]. Autonomous Robots, 2014, 36 : 349 - 364