LSD: A Fast Line Segment Detector with a False Detection Control
LSD: A Fast Line Segment Detector with a False Detection Control
By Rafael Grompone von Gioi, Jérémie Jakubowicz, Jean-Michel Morel, and Gregory Randall
IEEE Transactions on Pattern Analysis and Machine Intelligence (2010)
Abstract Paper

Rafael  Grompone von Gioi

ENS Cachan

France

Coder Page  

LSD is a linear-time Line Segment Detector giving subpixel accurate results. It is designed to work on any digital image without parameter tuning. It controls its own number of false detections: On average, one false alarms is allowed per image [1]. The method is based on Burns, Hanson, and Riseman's method [2], and uses an a contrario validation approach according to the Desolneux, Moisan, and Morel's theory [3,4]. The version described here includes some further improvement over the one described in [1].
Created
June 28, 2012
Software:
C Version C
Visits
280
Last update
October 08, 2012
Ranking
13
Runs
61
Code downloads
52
Abstract
We propose a linear-time line segment detector that gives accurate results, a controlled number of false detections, and requires no parameter tuning. This algorithm is tested and compared to state-of-the-art algorithms on a wide set of natural images.
Grompone von Gioi, R., J. Jakubowicz, J. Morel, and G. Randall, "LSD: A Fast Line Segment Detector with a False Detection Control", IEEE Transactions on Pattern Analysis and Machine Intelligence , 32, 722-732.
image
image
Waiting time

Please cite the publication as :

Grompone von Gioi, R., J. Jakubowicz, J. Morel, and G. Randall, "LSD: A Fast Line Segment Detector with a False Detection Control", IEEE Transactions on Pattern Analysis and Machine Intelligence , 32, 722-732.

Please cite the companion website as :

Grompone von Gioi, R., J. Jakubowicz, J. Morel, and G. Randall, "LSD: A Fast Line Segment Detector with a False Detection Control", RunMyCode companion website, http://www.execandshare.org/CompanionSite/Site132

Reset data > >
Preview data > >
Load demo data > >
Variable/Parameters Description, constraint Comments
image
    Image description
    Variable/Parameters Description Visualisation
    image Chairs description
    LSD: A Fast Line Segment Detector with a False Detection Control
    R. Grompone von Gioi (2012)
    Computing Date Status Actions
    Coder:

    Rafael Grompone von Gioi also created these companion sites

    Other Companion Sites on same paper

    LSD: A Fast Line Segment Detector with a False Detection Control

    Other Companion Sites relative to similar papers

    A Unified Software Framework for Empirical Gramians
    Abstract
    A common approach in model reduction is balanced truncation, which is based on gramian matrices classifiying certain attributes of states or parameters of a given dynamic system. Initially restricted to linear systems, the empirical gramians not only extended this concept to nonlinear systems, but also provide a uniform computational method. This work introduces a unified software framework supplying routines for six types of empirical gramians. The gramian types will be discussed and applied in a model reduction framework for multiple-input-multiple-output (MIMO) systems.
    Himpe, C., "A Unified Software Framework for Empirical Gramians", Institute for Computational and Applied Mathematics at the University of Muenster.
    Authors: Himpe
    Ohlberger
    Coders: Himpe
    Last update
    02/05/2013
    Ranking
    9999
    Runs
    N.A.
    Visits
    N.A.
    Cross-Gramian Based Combined State and Parameter Reduction
    Abstract
    An accepted model reduction technique is balanced truncation, by which negligible states of a linear system of ODEs are determined by balancing the systems controllability and observability gramian matrices. To be applicable for nonlinear system this method was enhanced through the empirical gramians, while the cross gramian conjoined both gramians into one gramian matrix. This work introduces the empirical cross gramian for square Multiple-Input-Multiple-Output systems as well as the (empirical) joint gramian. Based on the cross gramian, the joint gramian determines, in addition to the Hankel singular values, the parameter identifiability allowing a combined model reduction, concurrently reducing state and parameter spaces. Furthermore, a controllability and an observability based combined reduction method are presented and the usage of empirical gramians is extended to parameter reduction in (Bayesian) inverse problems. All methods presented are evaluated by numerical experiments.
    Himpe, C., "Cross-Gramian Based Combined State and Parameter Reduction", WWU Muenster.
    Authors: Himpe
    Ohlberger
    Coders: Himpe
    Last update
    02/05/2013
    Ranking
    9999
    Runs
    N.A.
    Visits
    N.A.
    A Unified Software Framework for Empirical Gramians
    Abstract
    A common approach in model reduction is balanced truncation, which is based on gramian matrices classifiying certain attributes of states or parameters of a given dynamic system. Initially restricted to linear systems, the empirical gramians not only extended this concept to nonlinear systems, but also provide a uniform computational method. This work introduces a unified software framework supplying routines for six types of empirical gramians. The gramian types will be discussed and applied in a model reduction framework for multiple-input-multiple-output (MIMO) systems.
    Himpe, C., "A Unified Software Framework for Empirical Gramians", Institute for Computational and Applied Mathematics at the University of Muenster.
    Authors: Himpe
    Ohlberger
    Coders: Himpe
    Last update
    02/20/2013
    Ranking
    9999
    Runs
    N.A.
    Visits
    N.A.
    Rudin-Osher-Fatemi Total Variation Denoising using Split Bregman
    Abstract
    Denoising is the problem of removing noise from an image. The most commonly studied case is with additive white Gaussian noise (AWGN), where the observed noisy image f is related to the underlying true image u by f = u + η, and η is at each point in space independently and identically distributed as a zero-mean Gaussian random variable. Total variation (TV) regularization is a technique that was originally developed for AWGN image denoising by Rudin, Osher, and Fatemi. The TV regularization technique has since been applied to a multitude of other imaging problems, see for example Chan and Shen's book. We focus here on the split Bregman algorithm of Goldstein and Osher for TV-regularized denoising.
    Getreuer, P., "Rudin-Osher-Fatemi Total Variation Denoising using Split Bregman", Image Processing On Line, 2012.
    Authors: Getreuer
    Coders: Getreuer
    Last update
    10/08/2012
    Ranking
    12
    Runs
    9
    Visits
    99
    Optimal Stability Polynomials for Numerical Integration of Initial Value Problems
    Abstract
    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in the case that the order of approximation is one and in the case that the spectrum encloses a starlike region. Examples demonstrate the effectiveness of the proposed algorithm even when these conditions are not satisfied.
    Ketcheson, D., and A. J. Ahmadia, "Optimal Stability Polynomials for Numerical Integration of Initial Value Problems", arXiv.org.
    Authors: Ketcheson
    Ahmadia
    Coders: Ketcheson
    Ahmadia
    Last update
    12/01/2012
    Ranking
    43
    Runs
    N.A.
    Visits
    47
    Deterministic Matrices Matching the Compressed Sensing Phase Transitions of Gaussian Random Matrices
    Abstract
    In compressed sensing, one takes n < N samples of an N -dimensional vector x0 using an n × N matrix A, obtaining un-dersampled measurements y = Ax0 . For random matrices with Gaussian i.i.d entries, it is known that, when x0 is k-sparse, there is a precisely determined phase transition: for a certain region in the (k/n, n/N )-phase diagram, convex optimization min ||x||_1 subject to y = Ax, x ∈ X^N typically finds the sparsest solution, while outside that region, it typically fails. It has been shown empirically that the same property – with the same phase transition location – holds for a wide range of non-Gaussian random matrix ensembles. We consider specific deterministic matrices including Spikes and Sines, Spikes and Noiselets, Paley Frames, Delsarte-Goethals Frames, Chirp Sensing Matrices, and Grassmannian Frames. Extensive experiments show that for a typical k-sparse object, convex optimization is successful over a region of the phase diagram that coincides with the region known for Gaussian matrices. In our experiments, we considered coefficients constrained to X^N for four different sets X ∈ {[0, 1], R_+ , R, C}. We establish this finding for each of the associated four phase transitions.
    Monajemi, H., D. Donoho, "Deterministic Matrices Matching the Compressed Sensing Phase Transitions of Gaussian Random Matrices", Stanford University.
    Authors: Monajemi
    Jafarpour
    Gavish
    Donoho
    Coders: Monajemi
    Donoho
    Last update
    01/04/2013
    Ranking
    9999
    Runs
    13
    Visits
    86
    Sparks and Deterministic Constructions of Binary Measurement Matrices from Finite Geometry
    Abstract
    This codes and data generates the figures in the paper "Sparks and Deterministic Constructions of Binary Measurement Matrices from Finite Geometry" by Shu-Tao Xia, Xin-Ji Liu, Yong Jiang, Hai-Tao Zheng.
    Liu, X., "Sparks and Deterministic Constructions of Binary Measurement Matrices from Finite Geometry", Ideas.
    Authors: Liu
    Coders: Liu
    Last update
    09/21/2013
    Ranking
    9999
    Runs
    N.A.
    Visits
    N.A.
    logo

    Didn't find your answer ?

    captcha refresh

    Frequently Asked Questions