A VARIATIONAL ALGORITHM FOR THE DETECTION OF LINE SEGMENTS

被引:6
|
作者
Beretta, Elena [1 ]
Grasmair, Markus [2 ]
Muszkieta, Monika [3 ]
Scherzer, Otmar [4 ,5 ]
机构
[1] Politecn Milan, Dipartimento Matemat Francesco Brioschi, I-20133 Milan, Italy
[2] Norwegian Univ Sci & Technol, N-7491 Trondheim, Norway
[3] Wroclaw Univ Technol, Inst Math & Comp Sci, PL-50370 Wroclaw, Poland
[4] Univ Vienna, Computat Sci Ctr, A-1090 Vienna, Austria
[5] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math RICAM, A-4040 Linz, Austria
基金
奥地利科学基金会;
关键词
Line segment detection; topological minimization; image segmentation; RESPECT;
D O I
10.3934/ipi.2014.8.389
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we propose an algorithm for the detection of edges in images that is based on topological asymptotic analysis. Motivated from the Mumford-Shah functional, we consider a variational functional that penalizes oscillations outside some approximate edge set, which we represent as the union of a finite number of thin strips, the width of which is an order of magnitude smaller than their length. In order to find a near optimal placement of these strips, we compute an asymptotic expansion of the functional with respect to the strip size. This expansion is then employed for defining a (topological) gradient descent like minimization method. As opposed to a recently proposed method by some of the authors, which uses coverings with balls, the usage of strips includes some directional information into the method, which can be used for obtaining finer edges and can also result in a reduction of computation times.
引用
收藏
页码:389 / 408
页数:20
相关论文
共 50 条
  • [1] DETECTION OF LINE SEGMENTS
    BACON, JP
    KINGSMITH, PE
    [J]. PERCEPTION, 1977, 6 (02) : 125 - 131
  • [2] Lane Boundaries Detection Algorithm based on Retinex with Line Segments Angles Computation
    Win, Shwe Yee
    Lwin, Htar Htar
    [J]. 2018 18TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES (ISCIT), 2018, : 160 - 164
  • [3] A scan-line algorithm for clustering line segments
    Kostas, KV
    Ginnis, AI
    Kaklis, PD
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, 2004, : 379 - 382
  • [4] Junction Detection based on Line Segments
    Tu, Zhefu
    Chen, Xuejin
    [J]. PROCEEDINGS OF THE 2014 9TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2014, : 1231 - 1234
  • [5] AN OPTIMAL ALGORITHM FOR INTERSECTING LINE SEGMENTS IN THE PLANE
    CHAZELLE, B
    EDELSBRUNNER, H
    [J]. JOURNAL OF THE ACM, 1992, 39 (01) : 1 - 54
  • [6] Line Segments Matching Algorithm for BIM Applications
    Scavello, Giovanni
    Fedele, Giuseppe
    Aiello, Andrea
    [J]. PROCEEDINGS OF 2022 IEEE INTERNATIONAL WORKSHOP ON METROLOGY FOR LIVING ENVIRONMENT (IEEE METROLIVEN 2022), 2022, : 280 - 285
  • [7] A Line Segments Approximation Algorithm of Grating Lines
    Niu Lianqiang
    Feng HaiWen
    [J]. 2009 INTERNATIONAL FORUM ON COMPUTER SCIENCE-TECHNOLOGY AND APPLICATIONS, VOL 2, PROCEEDINGS, 2009, : 34 - 37
  • [8] A maximum likelihood algorithm for detecting line segments
    Sun, Qi
    Yang, Minghao
    [J]. ICACTE 2010 - 2010 3rd International Conference on Advanced Computer Theory and Engineering, Proceedings, 2010, 3
  • [9] Optimal algorithm for intersecting line segments in the plane
    [J]. Chazelle, Bernard, 1600, (39):
  • [10] Weakly supervised power line detection algorithm using a recursive noisy label update with refined broken line segments
    Choi, Hyeyeon
    Koo, Gyogwon
    Kim, Bum Jun
    Kim, Sang Woo
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165