Editing Hough transform (section)

===Kernel-based Hough transform (KHT) ===
Fernandes and Oliveira <ref>{{cite journal | last1 = Fernandes | first1 = L.A.F. | last2 = Oliveira | first2 = M.M. | year = 2008 | title = Real-time line detection through an improved Hough transform voting scheme | doi = 10.1016/j.patcog.2007.04.003 | journal = Pattern Recognition | volume = 41 | issue = 1| pages = 299–314 | bibcode = 2008PatRe..41..299F | s2cid = 5996185 }}</ref> suggested an improved voting scheme for the Hough transform that allows a software implementation to achieve real-time performance even on relatively large images (e.g., 1280×960). The Kernel-based Hough transform uses the same <math>(r,\theta)</math> parameterization proposed by Duda and Hart but operates on clusters of approximately collinear pixels. For each cluster, votes are cast using an oriented elliptical-Gaussian kernel that models the uncertainty associated with the best-fitting line with respect to the corresponding cluster. The approach not only significantly improves the performance of the voting scheme, but also produces a much cleaner accumulator and makes the transform more robust to the detection of spurious lines.