paper-with-me

홈 › Papers

Learning Contour-Fragment-based Shape Model with And-Or Tree Representation

2015-02-03 · Liang Lin, Xiaolong Wang, Wei Yang, Jian-Huang Lai

This paper proposes a simple yet effective method to learn the hierarchical object shape model consisting of local contour fragments, which represents a category of shapes in the form of an And-Or tree. This model extends the traditional hierarchical tree structures by introducing the "switch" variables (i.e. the or-nodes) that explicitly specify production rules to capture shape variations. We thus define the model with three layers: the leaf-nodes for detecting local contour fragments, the or-nodes specifying selection of leaf-nodes, and the root-node encoding the holistic distortion. In the training stage, for optimization of the And-Or tree learning, we extend the concave-convex procedure (CCCP) by embedding the structural clustering during the iterative learning steps. The inference of shape detection is consistent with the model optimization, which integrates the local testings via the leaf-nodes and or-nodes with the global verification via the root-node. The advantages of our approach are validated on the challenging shape databases (i.e., ETHZ and INRIA Horse) and summarized as follows. (1) The proposed method is able to accurately localize shape contours against unreliable edge detection and edge tracing. (2) The And-Or tree model enables us to well capture the intraclass variance.

📄 PDF Abstract BibTeX arXiv:1502.00723

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringEdge DetectionModel Optimization

Similar Papers 제목 키워드 기반

Shape Recognition by Bag of Skeleton-associated Contour Parts

2016-05-20 · Wei Shen, Yuan Jiang, Wenjing Gao, Dan Zeng 외

Contour and skeleton are two complementary representations for shape recognition. However combining them in a principal way is nontrivial, as they are generally abstracted by different structures (closed string vs graph)…

PairingNet: A Learning-based Pair-searching and -matching Network for Image Fragments

2023-12-14 · Rixin Zhou, Ding Xia, Yi Zhang, Honglin Pang 외

In this paper, we propose a learning-based image fragment pair-searching and -matching approach to solve the challenging restoration problem. Existing works use rule-based methods to match similar contour shapes or textu…

Transparent Fragments Contour Estimation via Visual-Tactile Fusion for Autonomous Reassembly

2026-03-18 · Qihao Lin, Borui Chen, Yuping Zhou, Jianing Wu 외 arxiv

The contour estimation of transparent fragments is very important for autonomous reassembly, especially in the fields of precision optical instrument repair, cultural relic restoration, and identification of other precio…

Synthetic Data Generation

Contour Completion using Deep Structural Priors

2023-02-09 · Ali Shiraee, Morteza Rezanejad, Mohammad Khodadad, Dirk B. Walther 외

Humans can easily perceive illusory contours and complete missing forms in fragmented shapes. This work investigates whether such capability can arise in convolutional neural networks (CNNs) using deep structural priors …

Algorithm for recognizing the contour of a honeycomb block

2021-12-27 · Maksim Viktorovich Kubrikov, Mikhail Vladimirovich Saramud, Ivan Alekseevich Paulin, Evgeniy Petrovich Talay

The article discusses an algorithm for recognizing the contour of fragments of a honeycomb block. The inapplicability of ready-made functions of the OpenCV library is shown. Two proposed algorithms are considered. The di…