@inproceedings{8afc210bedd64f62954e07ec07b4c964,

title = "An efficient PAC algorithm for reconstructing a mixture of lines",

abstract = "In this paper we study the learnability of a mixture of lines model which is of great importance in machine vision, computer graphics, and computer aided design applications. The mixture of lines is a partially-probabilistic model for an image composed of line-segments. Observations are generated by choosing one of the lines at random and picking a point at random from the chosen line. Each point is contaminated with some noise whose distribution is unknown, but which is bounded in magnitude. Our goal is to discover efficiently and rather accurately the line-segments that generated the noisy observations. We describe and analyze an efficient probably approximately correct (PAC) algorithm for solving the problem. Our algorithm combines techniques from planar geometry with simple large deviation tools and is simple to implement.",

author = "Sanjoy Dasgupta and Elan Pavlov and Yoram Singer",

year = "2002",

month = jan,

day = "1",

language = "English (US)",

isbn = "3540001700",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "351--364",

editor = "Nicol{\`o} Cesa-Bianchi and Masayuki Numao and R{\"u}diger Reischuk",

booktitle = "Algorithmic Learning Theory - 13th International Conference, ALT 2002, Proceedings",

address = "Germany",

note = "13th International Conference on Algorithmic Learning Theory, ALT 2002 ; Conference date: 24-11-2002 Through 26-11-2002",

}