This paper proposes a collaborative deep reinforcement learning model for automatic image cropping (called CDRL-IC). By modeling image cropping as a decision-making process of reinforcement learning, our model could generate optimal cropping result in a few moving and zooming steps. An image with good composition is a comprehensive result by considering the relative importance of objects and also the spatial organization of visual elements. Therefore, emotion attention information which indicates the relationship and importance between objects is applied together with contextual information of color image for image cropping. In order to sufficiently use the emotion attention map and the color image, they are processed by two collaborative agents. The two agents make their primary learning separately and then share information through an information interaction module for making joint action prediction. In order to efficiently evaluate the cropping quality in the reward function, weighted Intersection Over Union (WIoU) is designed by integrating emotion attention map in the traditional IoU. Our CDRL-IC model is tested on a variety of datasets for both image cropping and thumbnail generation. The experiments show that our CDRL-IC model outperforms state-of-the-art methods on these benchmark datasets.
24 July 2015 in Journal of Combinatorial Optimization
A spanning subgraph of a graph G is called a path-factor of G if its each component is a path. A path-factor is called a 𝒫≥k-factor of G if its each component admits at least k vertices, where k ≥ 2. (Zhang and Zhou, Discrete Math.309 (2009) 2067–2076) defined the concept of 𝒫≥k-factor covered graphs, i.e., G is called a 𝒫≥k-factor covered graph if it has a 𝒫≥k-factor covering e for any e∈ E(G). In this paper, we firstly obtain a minimum degree condition for a planar graph being a 𝒫≥2-factor and 𝒫≥3-factor covered graph, respectively. Secondly, we investigate the relationship between the maximum degree of any pairs of non-adjacent vertices and 𝒫≥k-factor covered graphs, and obtain a sufficient condition for the existence of 𝒫≥2-factor and 𝒫≥3-factor covered graphs, respectively.