This paper introduces an integrated two-steps segmentation algorithm in the framework of Mumford-Shah functional. Note that the efficiency and convergence speed of the active contour-based segmentation algorithms are strongly dependent of selections of initial curves. Therefore a preprocessing step is introduced and integrated to construct an initial level set which is very closer to the boundaries of objects. As a result, a fast convergence speed is achieved. Furthermore the algorithm has better flexibility on segmentation of different kinds of images when some preprocessing techniques like denoising, edges enhance are used. In addition, the local minimal problem in the classical algorithm also can be eliminated or improved by choosing better diffusion approaches. The resulting algorithm has also been demonstrated by several cases.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Two-Step Segmentation for Speedup of Convergence via Preprocessing


    Beteiligte:
    Zhang, Yingjie (Autor:in) / Ge, Liling (Autor:in)


    Erscheinungsdatum :

    2008-05-01


    Format / Umfang :

    1191773 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    New Challenge for Speedup

    Uchida, M. | British Library Online Contents | 2002


    Speedup of Narrow Gauge Railway

    Wako, K. | British Library Online Contents | 1992


    Quantum Speedup for Aeroscience and Engineering

    Givi, Peyman / Daley, Andrew J. / Mavriplis, Dimitri et al. | AIAA | 2020


    Scalable problems and memory-bounded speedup

    Sun, Xian-He / Ni, Lionel M. | TIBKAT | 1992


    A two-step method for preprocessing volume data

    Bing, C. / Ying, W. / Nanning, Z. et al. | British Library Online Contents | 2004