Optimal multiple-seams search for image resizing with smoothness and shape prior

22Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Content-aware image resizing is of increasing relevance to allow high-quality image and video to be displayed on devices with different resolution. We present a novel method to find multiple seams simultaneously with global optimality for image resizing, incorporating both region smoothness and seam shape prior using a 3-D graphtheoretic approach. The globally optimal seams can be simultaneously achieved by solving a maximum flow problem based on an arc-weighted graph representation. Representing the resizing problem in an arc-weighted graph, we can incorporate a wide spectrum of constraints into the formulation, thus improving resizing results. By removing or inserting those multiple seams, the goal of content-aware image resizing is achieved. Due to simultaneous detection of multiple seams, our algorithm exhibits several good features: the ability to handle both crossing and non-crossing-seam cases, the ability to incorporate various feasible geometry constraints, and the ability to incorporate the seams importance, region smoothness and shape prior information. The proposed method was implemented and experimented on a variety of image data and compared with the state of the art in image resizing. © Springer-Verlag 2010.

Cite

CITATION STYLE

APA

Han, D., Sonka, M., Bayouth, J., & Wu, X. (2010). Optimal multiple-seams search for image resizing with smoothness and shape prior. In Visual Computer (Vol. 26, pp. 749–759). https://doi.org/10.1007/s00371-010-0480-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free