Image retargeting aims to resize an image to one with a prescribed aspect ratio. Simple scaling inevitably introduces unnatural geometric distortions on the important content of the image. In this paper, we propose a simple and yet effective method to resize an image, which preserves the geometry of the important content, using the Beltrami representation. Our algorithm allows users to interactively label content regions as well as line structures. Image resizing can then be achieved by warping the image by an orientation-preserving bijective warping map with controlled distortion. The warping map is represented by its Beltrami representation, which captures the local geometric distortion of the map. By carefully prescribing the values of the Beltrami representation, images with different complexity can be effectively resized. Our method does not require solving any optimization problems and tuning parameters throughout the process. This results in a simple and efficient algorithm to solve the image retargeting problem. Extensive experiments have been carried out, which demonstrate the efficacy of our proposed method.
With the advancement in the digital camera technology, the use of high resolution images and videos has been widespread in the modern society. In particular, image and video frame registration is frequently applied in computer graphics and film production. However, the conventional registration approaches usually require long computational time for high quality images and video frames. This hinders the applications of the registration approaches in the modern industries. In this work, we propose a novel approach called {\em TRIM} to accelerate the computations of the registration by triangulating the images. More specifically, given a high resolution image or video frame, we compute an optimal coarse triangulation which captures the important features of the image. Then, the computation of the registration can be simplified with the aid of the coarse triangulation. Experimental results suggest that the computational time of the registration is significantly reduced using our triangulation-based approach, meanwhile the accuracy of the registration is well retained when compared with the conventional grid-based approach.