Multiple comparisons problem

维基百科

多重比较谬误(Multiple Comparisons
Fallacy),是一种概率谬误,系指广泛比较二个不同群体的所有差异,从中找出具有差异的特征,然后宣称它就是造成二个群体不同的原因。

知乎

著作权归作者所有。
商业转载请联系作者获得授权,非商业转载请注明出处。
作者:stevenliuyi
链接:https://www.zhihu.com/question/21232840/answer/17951143
假设有某甲在猜硬币玩,连猜五次后我们发现他次次都猜中。于是我们认为他在做假,因为如果他没做假的话,连续猜对五次的概率只有1/32=0.03125,小于我们预先定义的小概率(比如说0.05)。(如果知道什么是p值的话,这里我们定义的零假设H0为某甲没有做假,p=0.03125表示我们拒绝H0只有约3%的犯错几率。如果不知道什么是p值的话也没关系,在这里并不重要)上面这个判断没有问题,但如果涉及到多重比较(multiple comparison)的话就不一样了。前面的例子只用了一枚硬币,而这次我们改用100枚不同颜色的硬币(这就是所谓的多重比较),有红色硬币、黄色硬币、绿色硬币、粉色硬币、紫色硬币等等。实验中,我们让某甲每枚硬币各猜五次,然后我们发现,在猜其他颜色的硬币时某甲都有猜错,但在猜绿色硬币时他连猜五次都猜对了。那么,我们是不是能像前面一样,认为他虽然在猜其他硬币时没做假,但在猜绿色硬币时做假了呢?简单计算一下就可以发现,当我们用100枚硬币做实验时,出现一枚或以上硬币五次都猜对的概率为1-(1-1/32)^100 = 0.958。显然,这时我们就不能再说某甲在猜绿色硬币时做假了,即便单就那一枚绿色硬币来说,连续猜对五次的概率还是只有0.03125。避免此问题的方法包括控制 FWER(Familywise error rate)、FDR(False discovery rate)等。最简单的控制FWER的方法是Bonferroni校正,是指p值应该除以比较的次数,在上面的例子中为100。其他的方法这里我就不赘述了,有兴感的可以去参考相应的维基百科条目。

更详细见英文维基百科
https://en.wikipedia.org/wiki/Multiple_comparisons_problem#Methods

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
高清非扫描,是文档类的PDF版本,下面附上书的目录 作者: Richard Hartley / Andrew Zisserman 出版社: Cambridge University Press 出版年: 2004-4-19 页数: 670 定价: USD 139.00 1 Introduction – a Tour of Multiple View Geometry 1 1.1 Introduction – the ubiquitous projective geometry 1 1.2 Camera projections 6 1.3 Reconstruction from more than one view 10 1.4 Three-view geometry 12 1.5 Four view geometry and n-view reconstruction 13 1.6 Transfer 14 1.7 Euclidean reconstruction 16 1.8 Auto-calibration 17 1.9 The reward I : 3D graphical models 18 1.10 The reward II: video augmentation 19 PART 0: The Background: Projective Geometry, Transformations and Estimation 23 Outline 24 2 Projective Geometry and Transformations of 2D 25 2.1 Planar geometry 25 2.2 The 2D projective plane 26 2.3 Projective transformations 32 2.4 A hierarchy of transformations 37 2.5 The projective geometry of 1D 44 2.6 Topology of the projective plane 46 2.7 Recovery of affine and metric properties from images 47 2.8 More properties of conics 58 2.9 Fixed points and lines 61 2.10 Closure 62 3 Projective Geometry and Transformations of 3D 65 3.1 Points and projective transformations 65 3.2 Representing and transforming planes, lines and quadrics 66 v vi Contents 3.3 Twisted cubics 75 3.4 The hierarchy of transformations 77 3.5 The plane at infinity 79 3.6 The absolute conic 81 3.7 The absolute dual quadric 83 3.8 Closure 85 4 Estimation – 2D Projective Transformations 87 4.1 The Direct Linear Transformation (DLT) algorithm 88 4.2 Different cost functions 93 4.3 Statistical cost functions and Maximum Likelihood estimation 102 4.4 Transformation invariance and normalization 104 4.5 Iterative minimization methods 110 4.6 Experimental comparison of the algorithms 115 4.7 Robust estimation 116 4.8 Automatic computation of a homography 123 4.9 Closure 127 5 Algorithm Evaluation and Error Analysis 132 5.1 Bounds on performance 132 5.2 Covariance of the estimated transformation 138 5.3 Monte Carlo estimation of covariance 149 5.4 Closure 150 PART I: Camera Geometry and Single View Geometry 151 Outline 152 6 Camera Models 153 6.1 Finite cameras 153 6.2 The projective camera 158 6.3 Cameras at infinity 166 6.4 Other camera models 174 6.5 Closure 176 7 Computation of the Camera Matrix P 178 7.1 Basic equations 178 7.2 Geometric error 180 7.3 Restricted camera estimation 184 7.4 Radial distortion 189 7.5 Closure 193 8 More Single View Geometry 195 8.1 Action of a projective camera on planes, lines, and conics 195 8.2 Images of smooth surfaces 200 8.3 Action of a projective camera on quadrics 201 8.4 The importance of the camera centre 202 8.5 Camera ca Contents vii 8.6 Vanishing points and vanishing lines 213 8.7 Affine 3D measurements and reconstruction 220 8.8 Determining camera calibration K from a single view 223 8.9 Single view reconstruction 229 8.10 The calibrating conic 231 8.11 Closure 233 PART II: Two-View Geometry 237 Outline 238 9 Epipolar Geometry and the Fundamental Matrix 239 9.1 Epipolar geometry 239 9.2 The fundamental matrix F 241 9.3 Fundamental matrices arising from special motions 247 9.4 Geometric representation of the fundamental matrix 250 9.5 Retrieving the camera matrices 253 9.6 The essential matrix 257 9.7 Closure 259 10 3D Reconstruction of Cameras and Structure 262 10.1 Outline of reconstruction method 262 10.2 Reconstruction ambiguity 264 10.3 The projective reconstruction theorem 266 10.4 Stratified reconstruction 267 10.5 Direct reconstruction – using ground truth 275 10.6 Closure 276 11 Computation of the Fundamental Matrix F 279 11.1 Basic equations 279 11.2 The normalized 8-point algorithm 281 11.3 The algebraic minimization algorithm 282 11.4 Geometric distance 284 11.5 Experimental evaluation of the algorithms 288 11.6 Automatic computation of F 290 11.7 Special cases of F-computation 293 11.8 Correspondence of other entities 294 11.9 Degeneracies 295 11.10 A geometric interpretation of F-computation 297 11.11 The envelope of epipolar lines 298 11.12 Image rectification 302 11.13 Closure 308 12 Structure Computation 310 12.1 Problem statement 310 12.2 Linear triangulation methods 312 12.3 Geometric error cost function 313 12.4 Sampson approximation (first-order geometric correction) 314 viii Contents 12.5 An optimal solution 315 12.6 Probability distribution of the estimated 3D point 321 12.7 Line reconstruction 321 12.8 Closure 323 13 Scene planes and homographies 325 13.1 Homographies given the plane and vice versa 326 13.2 Plane induced homographies given F and image correspondences 329 13.3 Computing F given the homography induced by a plane 334 13.4 The infinite homography H∞ 338 13.5 Closure 340 14 Affine Epipolar Geometry 344 14.1 Affine epipolar geometry 344 14.2 The affine fundamental matrix 345 14.3 Estimating FA from image point correspondences 347 14.4 Triangulation 353 14.5 Affine reconstruction 353 14.6 Necker reversal and the bas-relief ambiguity 355 14.7 Computing the motion 357 14.8 Closure 360 PART III: Three-View Geometry 363 Outline 364 15 The Trifocal Tensor 365 15.1 The geometric basis for the trifocal tensor 365 15.2 The trifoc Contents ix 17.3 Quadrilinear relations 418 17.4 Intersections of four planes 421 17.5 Counting arguments 422 17.6 Number of independent equations 428 17.7 Choosing equations 431 17.8 Closure 432 18 N-View Computational Methods 434 18.1 Projective reconstruction – bundle adjustment 434 18.2 Affine reconstruction – the factorization algorithm 436 18.3 Non-rigid factorization 440 18.4 Projective factorization 444 18.5 Projective reconstruction using planes 447 18.6 Reconstruction from sequences 452 18.7 Closure 456 19 Auto-Calibration 458 19.1 Introduction 458 19.2 Algebraic framework and problem statement 459 19.3 Calibration using the absolute dual quadric 462 19.4 The Kruppa equations 469 19.5 A stratified solution 473 19.6 Calibration from rotating cameras 481 19.7 Auto-calibration from planes 485 19.8 Planar motion 486 19.9 Single axis rotation – turntable motion 490 19.10 Auto-calibration of a stereo rig 493 19.11 Closure 497 20 Duality 502 20.1 Carlsson–Weinshall duality 502 20.2 Reduced reconstruction 508 20.3 Closure 513 21 Cheirality 515 21.1 Quasi-affine transformations 515 21.2 Front and back of a camera 518 21.3 Three-dimensional point sets 519 21.4 Obtaining a quasi-affine reconstruction 520 21.5 Effect of transformations on cheirality 521 21.6 Orientation 523 21.7 The cheiral inequalities 525 21.8 Which points are visible in a third view 528 21.9 Which points are in front of which 530 21.10 Closure 531 x Contents 22 Degenerate Configurations 533 22.1 Camera resectioning 533 22.2 Degeneracies in two views 539 22.3 Carlsson–Weinshall duality 546 22.4 Three-view critical configurations 553 22.5 Closure 558

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值