Incremental method for multiple line detection problem -- iterative reweighted approach

DOI10.1016/J.MATCOM.2020.07.013MaRDI QIDQ1998212zbMATH OpenOpenAlexFDO

Authors Kristian Sabo, Danijel Grahovac, Rudolf Scitovski

Publication date 6 March 2021

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.matcom.2020.07.013

zbMATH Keywords

incremental algorithmDBSCANmodified \(k\)-meansmost appropriate partitionmultiple line detection problem

Mathematics Subject Classification ID

Linear inference, regression (62Jxx) Multivariate analysis (62Hxx) Mathematical programming (90Cxx)

Recommendations

• A fast and efficient method for solving the multiple line detection problem
• scientific article; zbMATH DE number 1746659
• A variational algorithm for the detection of line segments
• A line detection algorithm based on error propagation
• Detection of Lines by Combinatorial Optimization

Cites work

• scientific article; zbMATH DE number 3852234 (Why is no real title available?)
• scientific article; zbMATH DE number 3915531 (Why is no real title available?)
• scientific article; zbMATH DE number 1368828 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• A fast and efficient method for solving the multiple line detection problem
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• A new curve detection method: Randomized Hough transform (RHT)
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
• An approach to cluster separability in a partition
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
• Density-ratio based clustering for discovering clusters with varying densities
• Encyclopedia of optimization. In 6 vols.
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Global optimization. Theory, algorithms, and applications
• Introduction to clustering large and high-dimensional data.
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• Lipschitzian optimization without the Lipschitz constant
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
• One-dimensional center-based l 1-clustering method
• Real-time line detection through an improved Hough transform voting scheme
• The best least absolute deviations line -- properties and two efficient methods for its derivation
• The element-wise weighted total least-squares problem
• Total Least Squares: State-of-the-Art Regression in Numerical Analysis

Cited in

(2)

• A fast and efficient method for solving the multiple line detection problem
• A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets

Describes a project that uses

Uses Software

• SIGOA
• SymDIRECT

This page was built for publication: Incremental method for multiple line detection problem -- iterative reweighted approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998212)