Search

In this study, we present a new image completion method based on image entropy reduction. We complete the missing region with semantically matching images, which maximizes the reduction in the combined entropy of all regions in the image. We use labeled regions (high confidence regions) to complete the uncertain regions. By contrast, existing image completion methods focus on simple filling and ignore creative and semantic matching completion. Entropy reduction can yield higher accuracy of semantic image matching than existing image completion methods. We use Poisson blending and blending optimization (color handling) to complete the missing region with higher-quality results. The superiority of our method to existing image completion algorithms is validated. Experiments using an image database show that our method significantly improves the completion results. [ABSTRACT FROM AUTHOR]

In this paper, we present a new object recognition model with few instances based on semantic distance. Learning objects with many instances have been studied in computer vision for many years. However, in many cases, not enough positive instances occur, especially for some special categories. We must take full advantage of all instances, including those that do not belong to the category. The main insight is that, given a few positive instances from one category, we can define some other candidate instances as positive instances based on semantic distance to learn this model. Our model responds more strongly to instances with closer semantic distance to positive instances than to instances with farther semantic distance to positive instances. We use a regularized kernel machine algorithm to train the images from the database. The superiority of our method to existing object recognition methods is demonstrated. Experiments using an image database show that our method not only reduces the number of learning instances but also keeps the accurate rate of recognition. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new image completion method based on high-accuracy semantic matching. Existing image completion approaches mainly focus on simple filling, ignoring creativity and accuracy in semantic matching. Our method can complete missing regions with more creative and semantically matching images as well as create a more seamless and consistent completed image. We use global and local features to search matching images for the target image. We then complete the missing region using Poisson blending and blending optimization. Results of experiments on challenging image databases show that the images are greatly improved. Thus, these results demonstrate the superiority of the proposed algorithm over existing image completion approaches. [ABSTRACT FROM AUTHOR]

Low-resolution face recognition (LR FR) aims to recognize faces from small size or poor quality images with varying pose, illumination, expression, etc. It has received much attention with increasing demands for long distance surveillance applications, and extensive efforts have been made on LR FR research in recent years. However, many issues in LR FR are still unsolved, such as super-resolution (SR) for face recognition, resolution-robust features, unified feature spaces, and face detection at a distance, although many methods have been developed for that. This paper provides a comprehensive survey on these methods and discusses many related issues. First, it gives an overview on LR FR, including concept description, system architecture, and method categorization. Second, many representative methods are broadly reviewed and discussed. They are classified into two different categories, super-resolution for LR FR and resolution-robust feature representation for LR FR. Their strategies and advantages/disadvantages are elaborated. Some relevant issues such as databases and evaluations for LR FR are also presented. By generalizing their performances and limitations, promising trends and crucial issues for future research are finally discussed. [ABSTRACT FROM AUTHOR]

Image composition is a very important technique in computer generated imagery. Besides some factors such as contrast, texture and noise that affect the quality of the composition, color harmony between fore- and background is also an important factor that would affect the quality of the composition. However, in the previous image composition techniques, color harmony between fore- and background is seldom considered. In this paper, an optimization method is proposed to deal with the color harmonization problem that used in image composition. A cost function is derived from the local smoothness of the hue values, and the image is harmonized by minimizing the cost function. A new matching cost function is proposed to select the best matching harmonic schemes. Our approach overcomes several shortcomings of the existing color harmonization methods. We validate the performance of our method and demonstrate its effectiveness with a variety of experiments. [ABSTRACT FROM AUTHOR]