Differentiable Mathematical Programming for Object-Centric Representation Learning
원문 초록
We propose topology-aware feature partitioning into $k$ disjoint partitions for given scene features as a method for object-centric representation learning. To this end, we propose to use minimum $s$-$t$ graph cuts as a partitioning method which is represented as a linear program. The method is topologically aware since it explicitly encodes neighborhood relationships in the image graph. To solve the graph cuts our solution relies on an efficient, scalable, and differentiable quadratic programming approximation. Optimizations specific to cut problems allow us to solve the quadratic programs and compute their gradients significantly more efficiently compared with the general quadratic programming approach. Our results show that our approach is scalable and outperforms existing methods on object discovery tasks with textured scenes and objects.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
When Does Pruning Benefit Vision Representations?
Multiple Object Stitching for Unsupervised Representation Learning
Feature-Based Lie Group Transformer for Real-World Applications
FORLA:Federated Object-centric Representation Learning with Slot Attention
Universal Fine-grained Visual Categorization by Concept Guided Learning
ERNet: Efficient and Reliable Human-Object Interaction Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.