Qingyao Wu, Yiwen Cao, Yukun Su, Fengyun Rao, Jingliang Deng
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A large amount of User Generated Content (UGC) is uploaded to the Internet daily and displayed to people worldwidely through the client side (e.g., mobile and PC). This requires the cropping algorithms to produce the aesthetic thumbnail within a specific aspect ratio on different devices. However, existing image cropping works mainly focus on landmark or landscape images, which fail to model the relations among the multi-objects with the complex background in UGC. Besides, previous methods merely consider the aesthetics of the cropped images while ignoring the content integrity, which is crucial for UGC cropping. In this paper, we propose a Spatial-Semantic Collaborative cropping network (S 2 CNet) for arbitrary user generated content accompanied by a new cropping benchmark. Specifically, we first mine the visual genes of the potential objects. Then, the suggested adaptive attention graph recasts this task as a procedure of information association over visual nodes. The underlying spatial and semantic relations are ultimately centralized to the crop candidate through differentiable message passing, which helps our network efficiently to preserve both the aesthetics and the content integrity. Extensive experiments on the proposed UGCrop5K and other public datasets demonstrate the superiority of our approach over state-of-the-art counterparts.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2401.08086")
get_code_for_paper("2401.08086")
have("2401.08086")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2401.08086.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2401.08086)
Connect an agent — have() is free.