Scale-sets image analysis

被引:151
作者
Guigues, Laurent
Cocquerez, Jean Pierre
Le Men, Herve
机构
[1] Inst Geog Natl, MATIS Lab, F-94165 St Mande, France
[2] Univ Technol Compiegne, UMR CNRS 6599, HEUDIASYC Lab, F-60206 Compiegne, France
关键词
image segmentation; multi-scale modelling; energy minimization; hierarchy;
D O I
10.1007/s11263-005-6299-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper introduces a multi-scale theory of piecewise image modelling, called the scale-sets theory, and which can be regarded as a region-oriented scale-space theory. The first part of the paper studies the general structure of a geometrically unbiased region-oriented multi-scale image description and introduces the scale-sets representation, a representation which allows to handle such a description exactly. The second part of the paper deals with the way scale-sets image analyses can be built according to an energy minimization principle. We consider a rather general formulation of the partitioning problem which involves minimizing a two-term-based energy, of the form lambda C + D, where D is a goodness-of-fit term and C is a regularization term. We describe the way such energies arise from basic principles of approximate modelling and we relate them to operational rate/distorsion problems involved in lossy compression problems. We then show that an important subset of these energies constitutes a class of multi-scale energies in that the minimal cut of a hierarchy gets coarser and coarser as parameter a, increases. This allows us to devise a fast dynamic-programming procedure to find the complete scale-sets representation of this family of minimal cuts. Considering then the construction of the hierarchy from which the minimal cuts are extracted, we end up with an exact and parameter-free algorithm to build scale-sets image descriptions whose sections constitute a monotone sequence of upward global minima of a multi-scale energy, which is called the "scale climbing" algorithm. This algorithm can be viewed as a continuation method along the scale dimension or as a minimum pursuit along the operational rate/distorsion curve. Furthermore, the solution verifies a linear scale invariance property which allows to completely postpone the tuning of the scale parameter to a subsequent stage. For computational reasons, the scale climbing algorithm is approximated by a pair-wise region merging scheme: however the principal properties of the solutions are kept. Some results obtained with Mumford-Shah's piece-wise constant model and a variant are provided and different applications of the proposed multi-scale analyses are finally sketched.
引用
收藏
页码:289 / 317
页数:29
相关论文
共 55 条
  • [1] AXIOMS AND FUNDAMENTAL EQUATIONS OF IMAGE-PROCESSING
    ALVAREZ, L
    GUICHARD, F
    LIONS, PL
    MOREL, JM
    [J]. ARCHIVE FOR RATIONAL MECHANICS AND ANALYSIS, 1993, 123 (03) : 199 - 257
  • [2] Badaud J., 1986, IEEE T PATTERN ANAL, V8, P26
  • [3] BALLESTER C, 1994, P 9 RFIA PAR, P379
  • [4] Beucher S., 2018, Mathematical morphology in image processing, P433, DOI DOI 10.1201/9781482277234-12
  • [5] Beucher S., 1979, INT WORKSHOP IMAGE P
  • [6] Blake A., 1987, Visual Reconstruction
  • [7] BOSWORTH JH, 2003, DIGITAL SIGNAL PROCE, V13
  • [8] Boykov Y., 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision, P377, DOI 10.1109/ICCV.1999.791245
  • [9] CHEHATA N, 2003, DICTA 03, V2, P889
  • [10] USING CANNY CRITERIA TO DERIVE A RECURSIVELY IMPLEMENTED OPTIMAL EDGE DETECTOR
    DERICHE, R
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 1987, 1 (02) : 167 - 187