Fast Multi-Operator Image Resizing and Evaluation

Current multi operator image resizing methods succeed in generating impressive results by using image similarity measure to guide the resizing process.An optimal operation path is found in the resizing space.However,their slow resizing speed caused by inefficient computation strategy of the bidirectional patch matching becomes a drawback in practical use.In this paper,we present a novel method to address this problem.By combining seam carving with scaling and cropping,our method can realize content-aware image resizing very fast.We define cost functions combing image energy and dominant color descriptor for all the operators to evaluate the damage to both local image content and global visual effect.Therefore our algorithm can automatically find an optimal sequence of operations to resize the image by using dynamic programming or greedy algorithm.We also extend our algorithm to indirect image resizing which can protect the aspect ratio of the dominant object in an image.