Quasi-maximum feasible subsystem for geometric computer vision problems

Chanki Yu, Da Young Ju, Sang Wook Lee

Research output: Contribution to journalArticle


A robust fitting algorithm for geometric computer vision problems under the L∞-norm optimisation framework is presented. It is essentially based on the maximum feasible subsystem (MaxFS) but it overcomes the computational limitation of the MaxFS for large data by finding only a quasi-maximum feasible subset. Experimental results demonstrate that the algorithm removes outliers more effectively than the other parameter estimation methods recently developed when the outlier-to-inlier ratio in a data set is high.

Original languageEnglish
Pages (from-to)1071-1073
Number of pages3
JournalElectronics Letters
Issue number14
Publication statusPublished - 2015 Jul 9

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Quasi-maximum feasible subsystem for geometric computer vision problems'. Together they form a unique fingerprint.

  • Cite this