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

DOI10.1016/J.MATCOM.2020.07.013OpenAlexW3043629855MaRDI QIDQ1998212FDOQ1998212

Authors: Kristian Sabo, Danijel Grahovac, Rudolf Scitovski 

Publication date: 6 March 2021

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

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

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

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)

Cites Work

• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• Total Least Squares: State-of-the-Art Regression in Numerical Analysis
• Lipschitzian optimization without the Lipschitz constant
• Introduction to clustering large and high-dimensional data.
• A new curve detection method: Randomized Hough transform (RHT)
• Title not available (Why is that?)
• Global optimization. Theory, algorithms, and applications
• Title not available (Why is that?)
• The best least absolute deviations line -- properties and two efficient methods for its derivation
• Encyclopedia of optimization. In 6 vols.
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• The element-wise weighted total least-squares problem
• One-dimensional center-based l 1-clustering method
• Title not available (Why is that?)
• Real-time line detection through an improved Hough transform voting scheme
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
• An approach to cluster separability in a partition
• Density-ratio based clustering for discovering clusters with varying densities
• 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
• 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
• Title not available (Why is that?)
• A fast and efficient method for solving the multiple line detection problem

Cited In (2)

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

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)