Guest Editorial: Best of CVPR 2015

The papers in this special section were presented at the CVPR 2015 conference that was held in Boston, MA.

[1]  Anders P. Eriksson,et al.  An Adversarial Optimization Approach to Efficient Outlier Removal , 2011, Journal of Mathematical Imaging and Vision.

[2]  J. Matoušek,et al.  On geometric optimization with few violated constraints , 1994, SCG '94.

[3]  Takeo Kanade,et al.  Quasiconvex Optimization for Robust Geometric Reconstruction , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Thomas M. Breuel,et al.  Fast recognition using adaptive subdivisions of transformation space , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[5]  Marc Pollefeys,et al.  Globally Optimal Inlier Set Maximization with Unknown Rotation and Focal Length , 2014, ECCV.

[6]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[7]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[8]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[9]  Richard I. Hartley,et al.  Multiple-View Geometry Under the {$L_\infty$}-Norm , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Tat-Jun Chin,et al.  Fast Rotation Search with Stereographic Projections for 3D Registration , 2014, CVPR.

[11]  Masatoshi Okutomi,et al.  Deterministically maximizing feasible subsystem for robust model fitting with unit norm constraint , 2011, CVPR 2011.

[12]  Franco P. Preparata,et al.  The Densest Hemisphere Problem , 1978, Theor. Comput. Sci..

[13]  E. Cheney.  Introduction to approximation theory , 1966 .

[14]  Shai Ben-David,et al.  The Computational Complexity of Densest Region Detection , 2002, J. Comput. Syst. Sci..

[15]  David Avis,et al.  Algorithms for high dimensional stabbing problems , 1990, Discret. Appl. Math..

[16]  Richard I. Hartley,et al.  Removing Outliers Using The L\infty Norm , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[17]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[18]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[19]  Fredrik Kahl,et al.  Robust Fitting for Multiple View Geometry , 2012, ECCV.

[20]  Jiaolong Yang,et al.  Optimal Essential Matrix Estimation via Inlier-Set Maximization , 2014, ECCV.

[21]  Fredrik Kahl,et al.  Tractable Algorithms for Robust Model Estimation , 2014, International Journal of Computer Vision.

[22]  Hongdong Li,et al.  Consensus set maximization with guaranteed global optimality for robust geometry estimation , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[23]  Shai Ben-David,et al.  On the difficulty of approximately maximizing agreements , 2000, J. Comput. Syst. Sci..

[24]  David Eppstein,et al.  Optimal point placement for mesh smoothing , 1997, SODA '97.

[25]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[26]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[27]  Arnold J. Stromberg,et al.  Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression , 1993, SIAM J. Sci. Comput..

[28]  V. Rosta,et al.  Data Depth and Maximum Feasible Subsystems , 2005 .