siibra 1.0a14__py3-none-any.whl → 1.0.1a0__py3-none-any.whl

siibra/experimental/contour.py

@@ -13,22 +13,22 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-from ..locations import point, pointset, boundingbox
+from ..locations import point, pointcloud, boundingbox
 
 import numpy as np
 
 
-class Contour(pointset.PointSet):
+class Contour(pointcloud.PointCloud):
     """
-    A PointSet that represents a contour line.
+    A PointCloud that represents a contour line.
     The only difference is that the point order is relevant,
     and consecutive points are thought as being connected by an edge.
 
-    In fact, PointSet assumes order as well, but no connections between points.
+    In fact, PointCloud assumes order as well, but no connections between points.
     """
 
     def __init__(self, coordinates, space=None, sigma_mm=0, labels: list = None):
-        pointset.PointSet.__init__(self, coordinates, space, sigma_mm, labels)
+        pointcloud.PointCloud.__init__(self, coordinates, space, sigma_mm, labels)
 
     def crop(self, voi: boundingbox.BoundingBox):
         """
@@ -45,7 +45,7 @@ class Contour(pointset.PointSet):
         cropped = self.intersection(voi)
 
         if cropped is not None and not isinstance(cropped, point.Point):
-            assert isinstance(cropped, pointset.PointSet)
+            assert isinstance(cropped, pointcloud.PointCloud)
             # Identifiy contour splits are by discontinuouities ("jumps")
             # of their labels, which denote positions in the original contour
             jumps = np.diff([self.labels.index(lb) for lb in cropped.labels])

siibra/experimental/patch.py

@@ -14,7 +14,7 @@
 # limitations under the License.
 
 from ..volumes import volume
-from ..locations import pointset, boundingbox
+from ..locations import pointcloud, boundingbox
 from ..commons import translation_matrix, y_rotation_matrix
 
 import numpy as np
@@ -24,7 +24,7 @@ from nilearn import image
 
 class Patch:
 
-    def __init__(self, corners: pointset.PointSet):
+    def __init__(self, corners: pointcloud.PointCloud):
         """Construct a patch in physical coordinates.
         As of now, only patches aligned in the y plane of the physical space
         are supported."""

siibra/experimental/plane3d.py

@@ -15,7 +15,7 @@
 
 from . import contour
 from . import patch
-from ..locations import point, pointset
+from ..locations import point, pointcloud
 from ..volumes import volume
 
 import numpy as np
@@ -93,9 +93,9 @@ class Plane3D:
         and an Mx3 array "faces" of face definitions.
         Each row in the face array corresponds to the three indices of vertices making up the
         triangle.
-        The result is a list of contour segments, each represented as a PointSet
+        The result is a list of contour segments, each represented as a PointCloud
         holding the ordered list of contour points.
-        The point labels in each "contour" PointSet hold the index of the face in the
+        The point labels in each "contour" PointCloud hold the index of the face in the
         mesh which made up each contour point.
         """
 
@@ -185,17 +185,17 @@ class Plane3D:
 
         return result
 
-    def project_points(self, points: pointset.PointSet):
+    def project_points(self, points: pointcloud.PointCloud):
         """projects the given points onto the plane."""
         assert self.space == points.space
         XYZ = points.coordinates
         N = XYZ.shape[0]
         dists = np.dot(self._n, XYZ.T) - self._d
-        return pointset.PointSet(
+        return pointcloud.PointCloud(
             XYZ - np.tile(self._n, (N, 1)) * dists[:, np.newaxis], space=self.space
         )
 
-    def get_enclosing_patch(self, points: pointset.PointSet, margin=[0.5, 0.5]):
+    def get_enclosing_patch(self, points: pointcloud.PointCloud, margin=[0.5, 0.5]):
         """
         Computes the enclosing patch in the given plane
         which contains the projections of the given points.
@@ -225,7 +225,7 @@ class Plane3D:
 
         m0, m1 = margin
         w = np.linalg.norm(p3 - p2)
-        corners = pointset.PointSet(
+        corners = pointcloud.PointCloud(
             [
                 p1 + (w / 2 + m1) * v2 + m0 * v1,
                 p0 + (w / 2 + m1) * v2 - m0 * v1,
@@ -249,7 +249,7 @@ class Plane3D:
         assert isinstance(image, volume.Volume)
         im_lowres = image.fetch(resolution_mm=1)
         plane_dims = np.where(np.argsort(im_lowres.shape) < 2)[0]
-        voxels = pointset.PointSet(
+        voxels = pointcloud.PointCloud(
             np.vstack(([0, 0, 0], np.identity(3)[plane_dims])), space=None
         )
         points = voxels.transform(im_lowres.affine, space=image.space)

siibra/explorer/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2023
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/explorer/url.py

@@ -1,3 +1,18 @@
+# Copyright 2018-2024
+# Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
+
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+
+#     http://www.apache.org/licenses/LICENSE-2.0
+
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
 from typing import Optional, TYPE_CHECKING
 from urllib.parse import quote_plus
 from numpy import int32

siibra/explorer/util.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2023
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/anchor.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2023
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -19,7 +19,7 @@ from ..commons import Species, logger
 from ..core.structure import BrainStructure
 from ..core.assignment import AnatomicalAssignment, Qualification
 from ..locations.location import Location
-from ..core.parcellation import Parcellation
+from ..core.parcellation import Parcellation, find_regions
 from ..core.region import Region
 from ..core.space import Space
 from ..exceptions import SpaceWarpingFailedError
@@ -126,13 +126,13 @@ class AnatomicalAnchor:
             # decode the region specification into a dict of region objects and assignment qualifications
             regions = {
                 region: Qualification.EXACT
-                for region in Parcellation.find_regions(self._regionspec)
+                for region in find_regions(self._regionspec, filter_children=True, find_topmost=False)
                 if region.species in self.species
             }
             # add more regions from possible aliases of the region spec
             for alt_species, aliases in self.region_aliases.items():
                 for alias_regionspec, qualificationspec in aliases.items():
-                    for r in Parcellation.find_regions(alias_regionspec):
+                    for r in find_regions(alias_regionspec, filter_children=True, find_topmost=False):
                         if r.species != alt_species:
                             continue
                         if r not in regions:
@@ -156,18 +156,17 @@ class AnatomicalAnchor:
         else:
             return region + separator + location
 
-    def assign(self, concept: BrainStructure, restrict_space: bool = False) -> AnatomicalAssignment:
+    def assign(self, concept: Union[BrainStructure, Space]) -> AnatomicalAssignment:
         """
         Match this anchor to a query concept. Assignments are cached at runtime,
         so repeated assignment with the same concept will be cheap.
         """
-        if (
-            restrict_space
-            and self.location is not None
-            and isinstance(concept, Location)
-            and not self.location.space.matches(concept.space)
-        ):
-            return []
+        if isinstance(concept, Space):
+            if self.location is not None and self.location.space.matches(concept):
+                return [AnatomicalAssignment(concept, self.location, Qualification.CONTAINED)]
+            else:
+                return []
+
         if concept not in self._assignments:
             assignments: List[AnatomicalAssignment] = []
             if self.location is not None:
@@ -184,8 +183,8 @@ class AnatomicalAnchor:
             else None
         return self._assignments[concept]
 
-    def matches(self, concept: BrainStructure, restrict_space: bool = False) -> bool:
-        return len(self.assign(concept, restrict_space)) > 0
+    def matches(self, concept: Union[BrainStructure, Space]) -> bool:
+        return len(self.assign(concept)) > 0
 
     def represented_parcellations(self) -> List[Parcellation]:
         """

siibra/features/connectivity/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/functional_connectivity.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/regional_connectivity.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -21,7 +21,7 @@ from .. import anchor as _anchor
 
 from ...commons import logger, QUIET, siibra_tqdm
 from ...core import region as _region
-from ...locations import pointset
+from ...locations import pointcloud
 from ...retrieval.repositories import RepositoryConnector
 from ...retrieval.requests import HttpRequest
 
@@ -58,7 +58,8 @@ class RegionalConnectivity(Feature, Compoundable):
         datasets: list = [],
         subject: str = "average",
         feature: str = None,
-        id: str = None
+        id: str = None,
+        prerelease: bool = False,
     ):
         """
         Construct a parcellation-averaged connectivity matrix.
@@ -92,7 +93,8 @@ class RegionalConnectivity(Feature, Compoundable):
             description=description,
             anchor=anchor,
             datasets=datasets,
-            id=id
+            id=id,
+            prerelease=prerelease
         )
         self.cohort = cohort.upper()
         if isinstance(connector, str) and connector:
@@ -438,7 +440,7 @@ class RegionalConnectivity(Feature, Compoundable):
                 found = [r for r in region if r.name in all_centroids]
             assert len(found) > 0
             result.append(
-                tuple(pointset.PointSet(
+                tuple(pointcloud.PointCloud(
                     [all_centroids[r.name] for r in found], space=space
                 ).centroid)
             )

siibra/features/connectivity/streamline_counts.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/streamline_lengths.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/tracing_connectivity.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/dataset/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/dataset/ebrains.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/feature.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2023
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -99,7 +99,8 @@ class Feature:
         description: str,
         anchor: _anchor.AnatomicalAnchor,
         datasets: List['TypeDataset'] = [],
-        id: str = None
+        id: str = None,
+        prerelease: bool = False,
     ):
         """
         Parameters
@@ -117,6 +118,7 @@ class Feature:
         self._anchor_cached = anchor
         self.datasets = datasets
         self._id = id
+        self._prerelease = prerelease
 
     @property
     def modality(self):
@@ -170,12 +172,19 @@ class Feature:
 
     @property
     def LICENSE(self) -> str:
-        licenses = {ds.LICENSE for ds in self.datasets if ds.LICENSE}
-        if not licenses:
-            return "No license information is found."
-        if len(licenses) == 1:
-            return next(iter(licenses))
-        logger.info("Found multiple licenses corresponding to datasets.")
+        licenses = []
+        for ds in self.datasets:
+            if ds.LICENSE is None or ds.LICENSE == "No license information is found.":
+                continue
+            if isinstance(ds.LICENSE, str):
+                licenses.append(ds.LICENSE)
+            if isinstance(ds.LICENSE, list):
+                licenses.extend(ds.LICENSE)
+        if len(licenses) == 0:
+            logger.warning("No license information is found.")
+            return ""
+        if len(licenses) > 1:
+            logger.info("Found multiple licenses corresponding to datasets.")
         return '\n'.join(licenses)
 
     @property
@@ -199,7 +208,8 @@ class Feature:
     def name(self):
         """Returns a short human-readable name of this feature."""
         readable_class_name = sub("([a-z])([A-Z])", r"\g<1> \g<2>", self.__class__.__name__)
-        return sub("([b,B]ig [b,B]rain)", "BigBrain", readable_class_name)
+        name_ = sub("([b,B]ig [b,B]rain)", "BigBrain", readable_class_name)
+        return name_ if not self._prerelease else f"[PRERELEASE] {name_}"
 
     @classmethod
     def _get_instances(cls, **kwargs) -> List['Feature']:
@@ -241,13 +251,16 @@ class Feature:
         """ Removes all instantiated object instances"""
         cls._preconfigured_instances = None
 
-    def matches(self, concept: structure.BrainStructure, restrict_space: bool = False) -> bool:
+    def matches(
+        self,
+        concept: Union[structure.BrainStructure, space.Space],
+    ) -> bool:
         """
         Match the features anatomical anchor agains the given query concept.
         Record the most recently matched concept for inspection by the caller.
         """
         # TODO: storing the last matched concept. It is not ideal, might cause problems in multithreading
-        if self.anchor and self.anchor.matches(concept, restrict_space):
+        if self.anchor and self.anchor.matches(concept):
             self.anchor._last_matched_concept = concept
             return True
         self.anchor._last_matched_concept = None
@@ -268,13 +281,18 @@ class Feature:
         if self._id:
             return self._id
 
+        if self._prerelease:
+            name_ = self.name.replace("[PRERELEASE] ", "")
+        else:
+            name_ = self.name
+
         prefix = ''
         for ds in self.datasets:
             if hasattr(ds, "id"):
                 prefix = ds.id + '--'
                 break
         return prefix + md5(
-            f"{self.name} - {self.anchor}".encode("utf-8")
+            f"{name_} - {self.anchor}".encode("utf-8")
         ).hexdigest()
 
     def _to_zip(self, fh: ZipFile):
@@ -468,7 +486,10 @@ class Feature:
                 f"objects linked to {str(concept)}{argstr}"
             )
             q = QueryType(**kwargs)
-            features = q.query(concept)
+            if isinstance(concept, space.Space):
+                features = q.query(concept.get_template())
+            else:
+                features = q.query(concept)
             live_instances.extend(
                 Feature._wrap_livequery_feature(f, Feature._serialize_query_context(f, concept))
                 for f in features
@@ -479,9 +500,8 @@ class Feature:
     @classmethod
     def _match(
         cls,
-        concept: structure.BrainStructure,
+        concept: Union[structure.BrainStructure, space.Space],
         feature_type: Union[str, Type['Feature'], list],
-        restrict_space: bool = False,
         **kwargs
     ) -> List['Feature']:
         """
@@ -500,10 +520,6 @@ class Feature:
             An anatomical concept, typically a brain region or parcellation.
         feature_type: subclass of Feature, str
             specififies the type of features ("modality")
-        restrict_space: bool: default: False
-            If true, will skip features anchored at spatial locations of
-            different spaces than the concept. Requires concept to be a
-            Location.
         """
         if isinstance(feature_type, list):
             # a list of feature types is given, collect match results on those
@@ -513,7 +529,7 @@ class Feature:
             )
             return list(dict.fromkeys(
                 sum((
-                    cls._match(concept, t, restrict_space, **kwargs) for t in feature_type
+                    cls._match(concept, t, **kwargs) for t in feature_type
                 ), [])
             ))
 
@@ -530,15 +546,15 @@ class Feature:
                 f"'{feature_type}' decoded as feature type/s: "
                 f"{[c.__name__ for c in ftype_candidates]}."
             )
-            return cls._match(concept, ftype_candidates, restrict_space, **kwargs)
+            return cls._match(concept, ftype_candidates, **kwargs)
 
         assert issubclass(feature_type, Feature)
 
         # At this stage, no recursion is needed.
         # We expect a specific supported feature type is to be matched now.
-        if not isinstance(concept, structure.BrainStructure):
+        if not isinstance(concept, (structure.BrainStructure, space.Space)):
             raise ValueError(
-                f"{concept.__class__.__name__} cannot be used for feature queries as it is not a BrainStructure type."
+                f"{concept.__class__.__name__} cannot be used for feature queries as it is not a `BrainStructure` or a `Space` type."
             )
 
         # Collect any preconfigured instances of the requested feature type
@@ -556,7 +572,7 @@ class Feature:
                 total=len(instances),
                 disable=(not instances)
             )
-            if f.matches(concept, restrict_space)
+            if f.matches(concept)
         ]
 
         # Then run any registered live queries for the requested feature type
@@ -721,7 +737,7 @@ class CompoundFeature(Feature):
     def __init__(
         self,
         elements: List['Feature'],
-        queryconcept: Union[region.Region, parcellation.Parcellation, space.Space]
+        queryconcept: Union[region.Region, parcellation.Parcellation, space.Space],
     ):
         """
         A compound of several features of the same type with an anchor created
@@ -754,7 +770,8 @@ class CompoundFeature(Feature):
             modality=modality,
             description="\n".join({f.description for f in elements}),
             anchor=self._feature_type._merge_anchors([f.anchor for f in elements]),
-            datasets=list(dict.fromkeys([ds for f in elements for ds in f.datasets]))
+            datasets=list(dict.fromkeys([ds for f in elements for ds in f.datasets])),
+            prerelease=all(f._prerelease for f in elements),
         )
         self._queryconcept = queryconcept
         self._merged_feature_cached = None
@@ -830,16 +847,21 @@ class CompoundFeature(Feature):
             for k, v in self._compounding_attributes.items()
             if k != 'modality'
         ])
-        return f"{len(self)} {readable_feature_type} features{f' {groupby}' if groupby else ''}"
+        cf_name = f"{len(self)} {readable_feature_type} features{f' {groupby}' if groupby else ''}"
+        return cf_name if not self._prerelease else f"[PRERELEASE] {cf_name}"
 
     @property
     def id(self) -> str:
+        if self._prerelease:
+            name_ = self.name.replace("[PRERELEASE] ", "")
+        else:
+            name_ = self.name
         return "::".join((
             "cf0",
             f"{self._feature_type.__name__}",
             self._encode_concept(self._queryconcept),
             self.datasets[0].id if self.datasets else "nodsid",
-            md5(self.name.encode("utf-8")).hexdigest()
+            md5(name_.encode("utf-8")).hexdigest()
         ))
 
     def __iter__(self) -> Iterator['Feature']:

siibra/features/image/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/image/image.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -20,19 +20,19 @@ from .. import feature
 from .. import anchor as _anchor
 
 from ...volumes import volume as _volume
-from ...volumes.providers import provider
 
-from typing import List
+from typing import List, TYPE_CHECKING
+
+if TYPE_CHECKING:
+    from ...locations.boundingbox import BoundingBox
+    from ...volumes.providers import provider
 
 
 class ImageAnchor(_anchor.AnatomicalAnchor):
 
     def __init__(self, volume: _volume.Volume, region: str = None):
         _anchor.AnatomicalAnchor.__init__(
-            self,
-            species=volume.space.species,
-            location=None,
-            region=region
+            self, species=volume.space.species, location=None, region=region
         )
         self.volume = volume
 
@@ -42,7 +42,9 @@ class ImageAnchor(_anchor.AnatomicalAnchor):
         Loads the bounding box only if required, since it demands image data access.
         """
         if self._location_cached is None:
-            self._location_cached = self.volume.get_boundingbox(clip=False)  # use unclipped to preseve exisiting behaviour
+            self._location_cached = self.volume.get_boundingbox(
+                clip=False
+            )  # use unclipped to preseve exisiting behaviour
         return self._location_cached
 
     @property
@@ -60,10 +62,12 @@ class Image(feature.Feature, _volume.Volume):
         name: str,
         modality: str,
         space_spec: dict,
-        providers: List[provider.VolumeProvider],
+        providers: List["provider.VolumeProvider"],
         region: str = None,
         datasets: List = [],
-        id: str = None
+        bbox: "BoundingBox" = None,
+        id: str = None,
+        prerelease: bool = False,
     ):
         feature.Feature.__init__(
             self,
@@ -71,7 +75,8 @@ class Image(feature.Feature, _volume.Volume):
             description=None,  # lazy implementation below!
             anchor=None,  # lazy implementation below!
             datasets=datasets,
-            id=id
+            id=id,
+            prerelease=prerelease,
         )
 
         _volume.Volume.__init__(
@@ -80,6 +85,7 @@ class Image(feature.Feature, _volume.Volume):
             providers=providers,
             name=name,
             datasets=datasets,
+            bbox=bbox,
         )
 
         self._anchor_cached = ImageAnchor(self, region=region)
@@ -104,7 +110,6 @@ class Image(feature.Feature, _volume.Volume):
     def description(self):
         if self._description_cached is None:
             self._description_cached = (
-                f"Image feature with modality {self.modality} "
-                f"at {self.anchor}"
+                f"Image feature with modality {self.modality} " f"at {self.anchor}"
             )
         return self._description_cached

siibra/features/image/sections.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/image/volume_of_interest.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/tabular/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/tabular/bigbrain_intensity_profile.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2021
+# Copyright 2018-2024
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -65,7 +65,7 @@ class BigBrainIntensityProfile(
 
     @classmethod
     def _merge_anchors(cls, anchors: List['AnatomicalAnchor']):
-        from ...locations.pointset import from_points
+        from ...locations.pointcloud import from_points
         from ...features.anchor import AnatomicalAnchor
 
         location = from_points([anchor.location for anchor in anchors])