Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

The maximum consensus problem : (Record no. 562250)

000 -LEADER
fixed length control field 05578nam a2200637 i 4500
001 - CONTROL NUMBER
control field 7873535
003 - CONTROL NUMBER IDENTIFIER
control field IEEE
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200413152923.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m eo d
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr cn |||m|||a
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 170321s2017 caua foab 001 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781627052863
Qualifying information ebook
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9781627052924
Qualifying information print
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.2200/S00757ED1V01Y201702COV011
Source of number or code doi
035 ## - SYSTEM CONTROL NUMBER
System control number (CaBNVSL)swl00407234
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)978253071
040 ## - CATALOGING SOURCE
Original cataloging agency CaBNVSL
Language of cataloging eng
Description conventions rda
Transcribing agency CaBNVSL
Modifying agency CaBNVSL
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number TA1634
Item number .C455 2017
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 006.37
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Chin, Tat-Jun,
Relator term author.
245 14 - TITLE STATEMENT
Title The maximum consensus problem :
Remainder of title recent algorithmic advances /
Statement of responsibility, etc. Tat-Jun Chin and David Suter.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture [San Rafael, California] :
Name of producer, publisher, distributor, manufacturer Morgan & Claypool,
Date of production, publication, distribution, manufacture, or copyright notice 2017.
300 ## - PHYSICAL DESCRIPTION
Extent 1 PDF (xiii, 178 pages) :
Other physical details illustrations.
336 ## - CONTENT TYPE
Content type term text
Source rdacontent
337 ## - MEDIA TYPE
Media type term electronic
Source isbdmedia
338 ## - CARRIER TYPE
Carrier type term online resource
Source rdacarrier
490 1# - SERIES STATEMENT
Series statement Synthesis lectures on computer vision,
International Standard Serial Number 2153-1064 ;
Volume/sequential designation # 11
538 ## - SYSTEM DETAILS NOTE
System details note Mode of access: World Wide Web.
538 ## - SYSTEM DETAILS NOTE
System details note System requirements: Adobe Acrobat Reader.
500 ## - GENERAL NOTE
General note Part of: Synthesis digital library of engineering and computer science.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references (pages 163-173) and index.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Appendix -- Bibliography -- Authors' biographies -- Index.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 4. Preprocessing for maximum consensus -- 4.1 Introduction -- 4.1.1 Guaranteed outlier removal -- 4.2 Geometrically inspired approaches -- 4.2.1 2D rigid transformation -- 4.2.2 3D rotational alignment -- 4.3 Integer linear programming approach -- 4.3.1 An integer linear program formulation for GORE -- 4.3.2 Generalised fractional models -- 4.4 Bibliographical remarks --
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 3. Exact algorithms -- 3.1 Introduction -- 3.2 Optimal line fitting -- 3.2.1 Characterization of the solution -- 3.2.2 Plane sweep method -- 3.3 Integer linear programming method -- 3.3.1 Numerical accuracy and performance -- 3.3.2 Generalized fractional models -- 3.4 Robust point set registration -- 3.4.1 Rotational alignment -- 3.4.2 Euclidean registration -- 3.5 Tractable algorithms with subset search -- 3.5.1 Characterization of the solution -- 3.5.2 Subset enumeration -- 3.6 Tree search -- 3.6.1 Existence of tree structure -- 3.6.2 Breadth first search -- 3.6.3 A* search -- 3.7 Bibliographical remarks --
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 2. Approximate algorithms -- 2.1 Introduction -- 2.2 Random sample consensus -- 2.2.1 Extensions and improvements -- 2.2.2 Data span and quasidegeneracy -- 2.3 L1 minimization -- 2.3.1 Generalized fractional models -- 2.4 Chebyshev approximation -- 2.4.1 Characterization of the Chebyshev estimate -- 2.4.2 Outlier removal with L[infinity] minimization -- 2.4.3 Generalised fractional programming -- 2.5 LP-type problems -- 2.5.1 Definition and properties -- 2.5.2 Solving LP-type problems -- 2.5.3 Outlier removal for LP-type problems -- 2.6 The K-slack method -- 2.6.1 A relaxed minimax formulation -- 2.6.2 Outlier removal with the K-slack method -- 2.7 Exact penalty method -- 2.7.1 Penalized formulation -- 2.7.2 Deterministic local refinement algorithm -- 2.8 Evaluation -- 2.9 Bibliographical remarks --
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 1. The maximum consensus problem -- 1.1 Introduction -- 1.1.1 Problem definition -- 1.1.2 What is this book about? -- 1.1.3 Road map -- 1.2 Relation to other robust fitting methods -- 1.2.1 Hough transform -- 1.2.2 M-estimator -- 1.2.3 Least median squares -- 1.3 Problem difficulty -- 1.3.1 Exact vs. approximate solutions -- 1.3.2 Computational hardness -- 1.4 Bibliographical remarks --
506 ## - RESTRICTIONS ON ACCESS NOTE
Terms governing access Abstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0# - CITATION/REFERENCES NOTE
Name of source Google scholar
510 0# - CITATION/REFERENCES NOTE
Name of source Google book search
510 0# - CITATION/REFERENCES NOTE
Name of source INSPEC
510 0# - CITATION/REFERENCES NOTE
Name of source Compendex
520 3# - SUMMARY, ETC.
Summary, etc. 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.
530 ## - ADDITIONAL PHYSICAL FORM AVAILABLE NOTE
Additional physical form available note Also available in print.
588 ## - SOURCE OF DESCRIPTION NOTE
Source of description note Title from PDF title page (viewed on March 21, 2017).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Robust optimization.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer vision
General subdivision Mathematical models.
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term optimization
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term algorithms
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term maximum consensus
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term robust fitting
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Suter, David,
Relator term author.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
International Standard Book Number 9781627052924
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Synthesis lectures on computer vision ;
Volume/sequential designation # 11.
International Standard Serial Number 2153-1064
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Synthesis digital library of engineering and computer science.
856 42 - ELECTRONIC LOCATION AND ACCESS
Materials specified Abstract with links to resource
Uniform Resource Identifier http://ieeexplore.ieee.org/servlet/opac?bknumber=7873535
Holdings
Withdrawn status Lost status Damaged status Not for loan Permanent Location Current Location Date acquired Barcode Date last seen Price effective from Koha item type
        PK Kelkar Library, IIT Kanpur PK Kelkar Library, IIT Kanpur 2020-04-13 EBKE750 2020-04-13 2020-04-13 E books

Powered by Koha