Fr. 69.00

The Maximum Consensus Problem - Recent Algorithmic Advances

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

Outlier-contaminated data is a fact of life in computer vision. For computer vision applications to perform reliably and accurately in practical settings, the processing of the input data must be conducted in a robust manner. In this context, the maximum consensus robust criterion plays a critical role by allowing the quantity of interest to be estimated from noisy and outlier-prone visual measurements. The maximum consensus problem refers to the problem of optimizing the quantity of interest according to the maximum consensus criterion. This book provides an overview of the algorithms for performing this optimization. The emphasis is on the basic operation or "inner workings" of the algorithms, and on their mathematical characteristics in terms of optimality and efficiency. The applicability of the techniques to common computer vision tasks is also highlighted. By collecting existing techniques in a single article, this book aims to trigger further developments in this theoretically interesting and practically important area.

List of contents

Preface.- Acknowledgments.- The Maximum Consensus Problem.- Approximate Algorithms.- Exact Algorithms.- Preprocessing for Maximum Consensus.- Appendix.- Bibliography.- Authors' Biographies.- Index .

About the author










Tat-Jun Chin was born and raised in Nibong Tebal, Penang. He received his B.Eng. in Electrical Engineering (Mechatronics) from Universiti Teknologi Malaysia (UTM) in 2003, and his Ph.D.in Computer Systems Engineering from Monash University in 2007 with a thesis titled "Kernel Subspace Methods in Computer Vision." His undergraduate studies were partly supported by an Agilent Technologies Scholarship, and his Ph.D. studies were mainly supported by an Endeavour Australia-Asia Award. He was a Research Fellow at the Institute for Infocomm Research (I2R) in Singapore from 2007-2008. Since 2008 he has been a Senior Research Associate (2008-2010), Lecturer (2010-2013), and Senior Lecturer (2014-2016) at The University of Adelaide. Since 2017 he was an Associate Professor at the same university. His research interests include robust estimation and geometric optimization. He won a CVPR award and DSTO award (both in 2015) for his research work.David Suter was born in Leeds, UK. He holds the following degrees: BSc (Applied Maths and Physics, The Flinders University of SA, 1977); Grad. Dip. Ed. (Secondary Teaching, The Flinders University of SA, 1978); Grad. Dip. Comp. (Royal Melbourne Institute of Technology, 1984); Ph.D. (Computer Vision, La Trobe University, 1991). He has held the following appointments: Lecturer at La Trobe University 1988-1992); Senior Lecturer, Associate Professor and Professor at Monash University (1992-2008), Professor at The University of Adelaide (2008-). He has served on the Australian Research Council College of Experts (2008-10) and the editorial boards of several journals: International Journal of Computer Vision (2004-2013), Journal of Mathematical Imaging and Vision (2008-2010), Machine Vision and Applications (2006-2008). He was general co-chair of two major conferences: ACCV2002 and ICIP2013 (both hosted in Melbourne Australia).

Product details

Authors Tat-Jun Chin, David Suter
Publisher Springer, Berlin
 
Original title The Maximum Consensus Problem
Languages English
Product format Paperback / Softback
Released 01.01.2017
 
EAN 9783031006906
ISBN 978-3-0-3100690-6
No. of pages 178
Dimensions 191 mm x 10 mm x 235 mm
Illustrations XV, 178 p.
Series Synthesis Lectures on Computer Vision
Subject Natural sciences, medicine, IT, technology > IT, data processing > Application software

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.