• DocumentCode
    1291217
  • Title

    Information-Theoretic Analysis of Input Strokes in Visual Object Cutout

  • Author

    Mu, Yadong ; Zhou, Bingfeng ; Yan, Shuicheng

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore, Singapore
  • Volume
    12
  • Issue
    8
  • fYear
    2010
  • Firstpage
    843
  • Lastpage
    852
  • Abstract
    Semantic object cutout serves as a basic unit in various image editing systems. In a typical scenario, users are required to provide several strokes which indicate part of the pixels as image background or objects. However, most existing approaches are passive in the sense of accepting input strokes without checking the consistence with user\´s intention. Here we argue that an active strategy may potentially reduce the interaction burden. Before any real calculation for segmentation, the program can roughly estimate the uncertainty for each image element and actively provide useful suggestions to users. Such a pre-processing is particularly useful for beginners unaware of feeding the underlying cutout algorithms with optimal strokes. We develop such an active object cutout algorithm, named ActiveCut, which makes it possible to automatically detect ambiguity given current user-supplied strokes, and synthesize "suggestive strokes" as feedbacks. Generally, suggestive strokes come from the ambiguous image parts and have the maximal potentials to reduce label uncertainty. Users can continuously refine their inputs following these suggestive strokes. In this way, the number of user-program interaction iterations can thus be greatly reduced. Specifically, the uncertainty is modeled by mutual information between user strokes and unlabeled image regions. To ensure that ActiveCut works at a user-interactive rate, we adopt superpixel lattice based image representation, whose computation depends on scene complexity rather than original image resolution. Moreover, it retains the 2-D-lattice topology and is thus more suitable for parallel computing. While for the most time-consuming calculation of probabilistic entropy, variational approximation is utilized for acceleration. Finally, based on submodular function theory, we provide a theoretic analysis for the performance lower bound of the proposed greedy algorithm. Various user studies are conducted on the MSRC image dataset to - - validate the effectiveness of our proposed algorithm.
  • Keywords
    entropy; greedy algorithms; image representation; image resolution; image segmentation; variational techniques; 2D-lattice topology; ActiveCut; MSRC image dataset; active object cutout algorithm; active strategy; current user-supplied strokes; greedy algorithm; image background; image editing systems; image resolution; image segmentation; information-theoretic analysis; label uncertainty reduction; parallel computing; probabilistic entropy; semantic object cutout; superpixel lattice based image representation; unlabeled image regions; user-program interaction iterations; variational approximation; visual object cutout; Algorithm design and analysis; Approximation algorithms; Electronic mail; Entropy; Feedback; Image representation; Image segmentation; Information analysis; Lattices; Layout; Mutual information; Object detection; Pixel; Uncertainty; Visualization; Image analysis; information entropy; object segmentation;
  • fLanguage
    English
  • Journal_Title
    Multimedia, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1520-9210
  • Type

    jour

  • DOI
    10.1109/TMM.2010.2064759
  • Filename
    5545444