Shape Fragments

• URL: http://arxiv.org/abs/2112.11796v1
• Date: Wed, 22 Dec 2021 11:01:50 GMT
• Title: Shape Fragments
• Authors: Thomas Delva, Anastasia Dimou, Maxime Jakubowski, Jan Van den Bussche
• Abstract summary: In constraint languages for RDF graphs, such as ShEx and SHACL, constraints on nodes and their properties are known as "shapes" We propose in this paper a novel use of shapes, by which a set of shapes is used to extract a subgraph from an RDF graph, the so-called shape fragment.
• Score: 2.5922360296344396
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In constraint languages for RDF graphs, such as ShEx and SHACL, constraints on nodes and their properties in RDF graphs are known as "shapes". Schemas in these languages list the various shapes that certain targeted nodes must satisfy for the graph to conform to the schema. Using SHACL, we propose in this paper a novel use of shapes, by which a set of shapes is used to extract a subgraph from an RDF graph, the so-called shape fragment. Our proposed mechanism fits in the framework of Linked Data Fragments. In this paper, (i) we define our extraction mechanism formally, building on recently proposed SHACL formalizations; (ii) we establish correctness properties, which relate shape fragments to notions of provenance for database queries; (iii) we compare shape fragments with SPARQL queries; (iv) we discuss implementation options; and (v) we present initial experiments demonstrating that shape fragments are a feasible new idea.

Related papers

• GenAnalysis: Joint Shape Analysis by Learning Man-Made Shape Generators with Deformation Regularizations [21.923143529947886]
  GenAnalysis is an implicit shape generation framework that allows joint analysis of man-made shapes. We show how to extract shape variations by recovering piecewise affine vector fields in the tangent space of each shape. We then derive shape correspondences by iteratively propagating AAAP deformations across a sequence of intermediate shapes.
  arXiv  Detail & Related papers  (2025-03-02T09:17:08Z)
• Level-Set Parameters: Novel Representation for 3D Shape Analysis [70.23417107911567]
  Recent development of neural fields brings in level-set parameters from signed distance functions as a novel, continuous, and numerical representation of 3D shapes. We establish correlations across different shapes by formulating them as a pseudo-normal distribution, and learn the distribution prior to the respective dataset. We demonstrate the promise of the novel representations through applications in shape classification, retrieval, and 6D object pose estimation.
  arXiv  Detail & Related papers  (2024-12-18T04:50:19Z)
• RDFGraphGen: A Synthetic RDF Graph Generator based on SHACL Constraints [0.0]
  This paper introduces RDFGraphGen, a domain-independent generator of synthetic RDF graphs based on SHACL constraints. The purpose of RDFGraphGen is the generation of small, medium or large RDF knowledge graphs for the purpose of benchmarking, testing, quality control, training and other similar purposes.
  arXiv  Detail & Related papers  (2024-07-25T10:58:50Z)
• Learning SO(3)-Invariant Semantic Correspondence via Local Shape Transform [62.27337227010514]
  We introduce a novel self-supervised Rotation-Invariant 3D correspondence learner with Local Shape Transform, dubbed RIST. RIST learns to establish dense correspondences between shapes even under challenging intra-class variations and arbitrary orientations. RIST demonstrates state-of-the-art performances on 3D part label transfer and semantic keypoint transfer given arbitrarily rotated point cloud pairs.
  arXiv  Detail & Related papers  (2024-04-17T08:09:25Z)
• KP-RED: Exploiting Semantic Keypoints for Joint 3D Shape Retrieval and Deformation [87.23575166061413]
  KP-RED is a unified KeyPoint-driven REtrieval and Deformation framework. It takes object scans as input and jointly retrieves and deforms the most geometrically similar CAD models.
  arXiv  Detail & Related papers  (2024-03-15T08:44:56Z)
• Few-shot Shape Recognition by Learning Deep Shape-aware Features [39.66613852292122]
  We propose a fewshot shape descriptor (FSSD) to recognize object shapes given only one or a few samples. We employ an embedding module for FSSD to extract transformation-invariant shape features. Thirdly, we propose a decoding module to include the supervision of shape masks and edges and align the original and reconstructed shape features.
  arXiv  Detail & Related papers  (2023-12-03T08:12:23Z)
• G-MSM: Unsupervised Multi-Shape Matching with Graph-based Affinity Priors [52.646396621449]
  G-MSM is a novel unsupervised learning approach for non-rigid shape correspondence. We construct an affinity graph on a given set of training shapes in a self-supervised manner. We demonstrate state-of-the-art performance on several recent shape correspondence benchmarks.
  arXiv  Detail & Related papers  (2022-12-06T12:09:24Z)
• ISS: Image as Stetting Stone for Text-Guided 3D Shape Generation [91.37036638939622]
  This paper presents a new framework called Image as Stepping Stone (ISS) for the task by introducing 2D image as a stepping stone to connect the two modalities. Our key contribution is a two-stage feature-space-alignment approach that maps CLIP features to shapes. We formulate a text-guided shape stylization module to dress up the output shapes with novel textures.
  arXiv  Detail & Related papers  (2022-09-09T06:54:21Z)
• PatchRD: Detail-Preserving Shape Completion by Learning Patch Retrieval and Deformation [59.70430570779819]
  We introduce a data-driven shape completion approach that focuses on completing geometric details of missing regions of 3D shapes. Our key insight is to copy and deform patches from the partial input to complete missing regions. We leverage repeating patterns by retrieving patches from the partial input, and learn global structural priors by using a neural network to guide the retrieval and deformation steps.
  arXiv  Detail & Related papers  (2022-07-24T18:59:09Z)
• ANISE: Assembly-based Neural Implicit Surface rEconstruction [12.745433575962842]
  We present ANISE, a method that reconstructs a 3Dshape from partial observations (images or sparse point clouds) The shape is formulated as an assembly of neural implicit functions, each representing a different part instance. We demonstrate that, when performing reconstruction by decoding part representations into implicit functions, our method achieves state-of-the-art part-aware reconstruction results from both images and sparse point clouds.
  arXiv  Detail & Related papers  (2022-05-27T00:01:40Z)
• Frame Averaging for Equivariant Shape Space Learning [85.42901997467754]
  A natural way to incorporate symmetries in shape space learning is to ask that the mapping to the shape space (encoder) and mapping from the shape space (decoder) are equivariant to the relevant symmetries. We present a framework for incorporating equivariance in encoders and decoders by introducing two contributions.
  arXiv  Detail & Related papers  (2021-12-03T06:41:19Z)
• Hierarchical clustering: visualization, feature importance and model selection [4.017760528208122]
  We propose methods for the analysis of hierarchical clustering that fully use the multi-resolution structure provided by a dendrogram. The key insight behind the proposed methods is to view a dendrogram as a phylogeny. Real and simulated datasets provide evidence that our proposed framework has desirable outcomes.
  arXiv  Detail & Related papers  (2021-11-30T20:38:17Z)
• Shape Modeling with Spline Partitions [3.222802562733787]
  We propose a novel parallelized Bayesian nonparametric approach to partition a domain with curves, enabling complex data-shapes to be acquired. We apply our method to HIV-1-infected human macrophage image dataset, and also simulated datasets sets to illustrate our approach.
  arXiv  Detail & Related papers  (2021-08-05T10:33:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.