123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513 |
- """
- Python Library to Read and Write Surface Files in Freesurfer's TriangularSurface Format
- compatible with Freesurfer's MRISwriteTriangularSurface()
- https://github.com/freesurfer/freesurfer/blob/release_6_0_0/include/mrisurf.h#L1281
- https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/mrisurf.c
- https://raw.githubusercontent.com/freesurfer/freesurfer/release_6_0_0/utils/mrisurf.c
- Freesurfer
- https://surfer.nmr.mgh.harvard.edu/
- Edit Surface File
- >>> from freesurfer_surface import Surface, Vertex, Triangle
- >>>
- >>> surface = Surface.read_triangular('bert/surf/lh.pial'))
- >>>
- >>> vertex_a = surface.add_vertex(Vertex(0.0, 0.0, 0.0))
- >>> vertex_b = surface.add_vertex(Vertex(1.0, 1.0, 1.0))
- >>> vertex_c = surface.add_vertex(Vertex(2.0, 2.0, 2.0))
- >>> surface.triangles.append(Triangle((vertex_a, vertex_b, vertex_c)))
- >>>
- >>> surface.write_triangular('somewhere/else/lh.pial')
- List Labels in Annotation File
- >>> from freesurfer_surface import Annotation
- >>>
- >>> annotation = Annotation.read('bert/label/lh.aparc.annot')
- >>> for label in annotation.labels.values():
- >>> print(label.index, label.hex_color_code, label.name)
- Find Border of Labelled Region
- >>> surface = Surface.read_triangular('bert/surf/lh.pial'))
- >>> surface.load_annotation_file('bert/label/lh.aparc.annot')
- >>> region, = filter(lambda l: l.name == 'precentral',
- >>> annotation.labels.values())
- >>> print(surface.find_label_border_polygonal_chains(region))
- """
- import collections
- import contextlib
- import datetime
- import itertools
- import locale
- import re
- import struct
- import typing
- import numpy
- from freesurfer_surface.version import __version__
- class UnsupportedLocaleSettingError(locale.Error):
- pass
- @contextlib.contextmanager
- def setlocale(temporary_locale):
- primary_locale = locale.setlocale(locale.LC_ALL)
- try:
- yield locale.setlocale(locale.LC_ALL, temporary_locale)
- except locale.Error as exc:
- if str(exc) == 'unsupported locale setting':
- raise UnsupportedLocaleSettingError(temporary_locale)
- raise exc # pragma: no cover
- finally:
- locale.setlocale(locale.LC_ALL, primary_locale)
- class Vertex(numpy.ndarray):
- def __new__(cls, right: float, anterior: float, superior: float):
- return numpy.array((right, anterior, superior),
- dtype=float).view(cls)
- @property
- def right(self) -> float:
- return self[0]
- @property
- def anterior(self) -> float:
- return self[1]
- @property
- def superior(self) -> float:
- return self[2]
- @property
- def __dict__(self) -> typing.Dict[str, float]:
- return {'right': self.right,
- 'anterior': self.anterior,
- 'superior': self.superior}
- def __format_coords(self) -> str:
- return ', '.join('{}={}'.format(name, getattr(self, name))
- for name in ['right', 'anterior', 'superior'])
- def __repr__(self) -> str:
- return '{}({})'.format(type(self).__name__, self.__format_coords())
- def distance_mm(self, others: typing.Union['Vertex',
- typing.Iterable['Vertex'],
- numpy.ndarray],
- ) -> numpy.ndarray:
- if isinstance(others, Vertex):
- others = others.reshape((1, 3))
- return numpy.linalg.norm(self - others, axis=1)
- class PolygonalCircuit:
- _VERTEX_INDICES_TYPE = typing.Tuple[int]
- def __init__(self, vertex_indices: _VERTEX_INDICES_TYPE):
- self._vertex_indices = tuple(vertex_indices)
- assert all(isinstance(idx, int) for idx in self._vertex_indices)
- @property
- def vertex_indices(self):
- return self._vertex_indices
- def _normalize(self) -> 'PolygonalCircuit':
- vertex_indices = collections.deque(self.vertex_indices)
- vertex_indices.rotate(-numpy.argmin(self.vertex_indices))
- if len(vertex_indices) > 2 and vertex_indices[-1] < vertex_indices[1]:
- vertex_indices.reverse()
- vertex_indices.rotate(1)
- return type(self)(vertex_indices)
- def __eq__(self, other: 'PolygonalCircuit') -> bool:
- # pylint: disable=protected-access
- return self._normalize().vertex_indices == other._normalize().vertex_indices
- def __hash__(self) -> int:
- # pylint: disable=protected-access
- return hash(self._normalize()._vertex_indices)
- def adjacent_vertex_indices(self, vertices_num: int = 2
- ) -> typing.Iterable[typing.Tuple[int]]:
- vertex_indices_cycle = list(itertools.islice(
- itertools.cycle(self.vertex_indices),
- 0,
- len(self.vertex_indices) + vertices_num - 1,
- ))
- return zip(*(itertools.islice(vertex_indices_cycle,
- offset,
- len(self.vertex_indices) + offset)
- for offset in range(vertices_num)))
- class LineSegment(PolygonalCircuit):
- def __init__(self, indices: PolygonalCircuit._VERTEX_INDICES_TYPE):
- super().__init__(indices)
- assert len(self.vertex_indices) == 2
- def __repr__(self) -> str:
- return 'LineSegment(vertex_indices={})'.format(self.vertex_indices)
- class Triangle(PolygonalCircuit):
- def __init__(self, indices: PolygonalCircuit._VERTEX_INDICES_TYPE):
- super().__init__(indices)
- assert len(self.vertex_indices) == 3
- def __repr__(self) -> str:
- return 'Triangle(vertex_indices={})'.format(self.vertex_indices)
- class PolygonalChainsNotOverlapingError(ValueError):
- pass
- class PolygonalChain:
- def __init__(self, vertex_indices: typing.Iterable[int]):
- self.vertex_indices \
- = collections.deque(vertex_indices) # type: Deque[int]
- def __eq__(self, other: 'PolygonalChain') -> bool:
- return self.vertex_indices == other.vertex_indices
- def __repr__(self) -> str:
- return 'PolygonalChain(vertex_indices={})'.format(tuple(self.vertex_indices))
- def connect(self, other: 'PolygonalChain') -> None:
- if self.vertex_indices[-1] == other.vertex_indices[0]:
- self.vertex_indices.pop()
- self.vertex_indices.extend(other.vertex_indices)
- elif self.vertex_indices[-1] == other.vertex_indices[-1]:
- self.vertex_indices.pop()
- self.vertex_indices.extend(reversed(other.vertex_indices))
- elif self.vertex_indices[0] == other.vertex_indices[0]:
- self.vertex_indices.popleft()
- self.vertex_indices.extendleft(other.vertex_indices)
- elif self.vertex_indices[0] == other.vertex_indices[-1]:
- self.vertex_indices.popleft()
- self.vertex_indices.extendleft(reversed(other.vertex_indices))
- else:
- raise PolygonalChainsNotOverlapingError()
- def adjacent_vertex_indices(self, vertices_num: int = 2
- ) -> typing.Iterable[typing.Tuple[int]]:
- return zip(*(itertools.islice(self.vertex_indices,
- offset,
- len(self.vertex_indices))
- for offset in range(vertices_num)))
- def segments(self) -> typing.Iterable[LineSegment]:
- return map(LineSegment, self.adjacent_vertex_indices(2))
- class Label:
- # pylint: disable=too-many-arguments
- def __init__(self, index: int, name: str, red: int,
- green: int, blue: int, transparency: int):
- self.index = index # type: int
- self.name = name # type: str
- self.red = red # type: int
- self.green = green # type: int
- self.blue = blue # type: int
- self.transparency = transparency # type: int
- @property
- def color_code(self) -> int:
- if self.index == 0: # unknown
- return 0
- return int.from_bytes((self.red, self.green, self.blue, self.transparency),
- byteorder='little', signed=False)
- @property
- def hex_color_code(self) -> str:
- return '#{:02x}{:02x}{:02x}'.format(self.red, self.green, self.blue)
- def __str__(self) -> str:
- return 'Label(name={}, index={}, color={})'.format(
- self.name, self.index, self.hex_color_code)
- def __repr__(self) -> str:
- return str(self)
- class Annotation:
- # pylint: disable=too-few-public-methods
- _TAG_OLD_COLORTABLE = b'\0\0\0\x01'
- def __init__(self):
- self.vertex_label_index = {} # type: Dict[int, int]
- self.colortable_path = None # type: Optional[bytes]
- self.labels = {} # type: Dict[int, Label]
- @staticmethod
- def _read_label(stream: typing.BinaryIO) -> Label:
- index, name_length = struct.unpack('>II', stream.read(4 * 2))
- name = stream.read(name_length - 1).decode()
- assert stream.read(1) == b'\0'
- red, green, blue, transparency \
- = struct.unpack('>IIII', stream.read(4 * 4))
- return Label(index=index, name=name, red=red, green=green,
- blue=blue, transparency=transparency)
- def _read(self, stream: typing.BinaryIO) -> None:
- # https://surfer.nmr.mgh.harvard.edu/fswiki/LabelsClutsAnnotationFiles
- annotations_num, = struct.unpack('>I', stream.read(4))
- annotations = [struct.unpack('>II', stream.read(4 * 2))
- for _ in range(annotations_num)]
- assert stream.read(4) == self._TAG_OLD_COLORTABLE
- colortable_version, _, filename_length \
- = struct.unpack('>III', stream.read(4 * 3))
- assert colortable_version > 0 # new version
- self.colortable_path = stream.read(filename_length - 1)
- assert stream.read(1) == b'\0'
- labels_num, = struct.unpack('>I', stream.read(4))
- self.labels = {label.index: label for label
- in (self._read_label(stream) for _ in range(labels_num))}
- label_index_by_color_code = {label.color_code: label.index
- for label in self.labels.values()}
- self.vertex_label_index = {vertex_index: label_index_by_color_code[color_code]
- for vertex_index, color_code in annotations}
- assert not stream.read(1)
- @classmethod
- def read(cls, annotation_file_path: str) -> 'Annotation':
- annotation = cls()
- with open(annotation_file_path, 'rb') as annotation_file:
- # pylint: disable=protected-access
- annotation._read(annotation_file)
- return annotation
- class Surface:
- # pylint: disable=too-many-instance-attributes
- _MAGIC_NUMBER = b'\xff\xff\xfe'
- _TAG_CMDLINE = b'\x00\x00\x00\x03'
- _TAG_OLD_SURF_GEOM = b'\x00\x00\x00\x14'
- _TAG_OLD_USEREALRAS = b'\x00\x00\x00\x02'
- _DATETIME_FORMAT = '%a %b %d %H:%M:%S %Y'
- def __init__(self):
- self.creator = None # type: Optional[bytes]
- self.creation_datetime = None # type: Optional[datetime.datetime]
- self.vertices = [] # type: List[Vertex]
- self.triangles = [] # type: List[Triangle]
- self.using_old_real_ras = False # type: bool
- self.volume_geometry_info = None # type: Optional[Tuple[bytes]]
- self.command_lines = [] # type: List[bytes]
- self.annotation = None # type: Optional[Annotation]
- @classmethod
- def _read_cmdlines(cls, stream: typing.BinaryIO) -> typing.Iterator[str]:
- while True:
- tag = stream.read(4)
- if not tag:
- return
- assert tag == cls._TAG_CMDLINE # might be TAG_GROUP_AVG_SURFACE_AREA
- # TAGwrite
- # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/tags.c#L94
- str_length, = struct.unpack('>Q', stream.read(8))
- yield stream.read(str_length - 1)
- assert stream.read(1) == b'\x00'
- def _read_triangular(self, stream: typing.BinaryIO):
- assert stream.read(3) == self._MAGIC_NUMBER
- self.creator, creation_dt_str = re.match(rb'^created by (\w+) on (.* \d{4})\n',
- stream.readline()).groups()
- with setlocale('C'):
- self.creation_datetime = datetime.datetime.strptime(creation_dt_str.decode(),
- self._DATETIME_FORMAT)
- assert stream.read(1) == b'\n'
- # fwriteInt
- # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/fio.c#L290
- vertices_num, triangles_num = struct.unpack('>II', stream.read(4 * 2))
- self.vertices = [Vertex(*struct.unpack('>fff', stream.read(4 * 3)))
- for _ in range(vertices_num)]
- self.triangles = [Triangle(struct.unpack('>III', stream.read(4 * 3)))
- for _ in range(triangles_num)]
- assert all(vertex_idx < vertices_num
- for triangle in self.triangles
- for vertex_idx in triangle.vertex_indices)
- assert stream.read(4) == self._TAG_OLD_USEREALRAS
- using_old_real_ras, = struct.unpack('>I', stream.read(4))
- assert using_old_real_ras in [0, 1], using_old_real_ras
- self.using_old_real_ras = bool(using_old_real_ras)
- assert stream.read(4) == self._TAG_OLD_SURF_GEOM
- # writeVolGeom
- # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/transform.c#L368
- self.volume_geometry_info = tuple(stream.readline() for _ in range(8))
- self.command_lines = list(self._read_cmdlines(stream))
- @classmethod
- def read_triangular(cls, surface_file_path: str) -> 'Surface':
- surface = cls()
- with open(surface_file_path, 'rb') as surface_file:
- # pylint: disable=protected-access
- surface._read_triangular(surface_file)
- return surface
- @classmethod
- def _triangular_strftime(cls, creation_datetime: datetime.datetime) -> bytes:
- padded_day = '{:>2}'.format(creation_datetime.day)
- fmt = cls._DATETIME_FORMAT.replace('%d', padded_day)
- with setlocale('C'):
- return creation_datetime.strftime(fmt).encode()
- def write_triangular(self, surface_file_path: str,
- creation_datetime: typing.Optional[datetime.datetime] = None):
- if creation_datetime is None:
- creation_datetime = datetime.datetime.now()
- with open(surface_file_path, 'wb') as surface_file:
- surface_file.write(
- self._MAGIC_NUMBER
- + b'created by ' + self.creator
- + b' on ' + self._triangular_strftime(creation_datetime)
- + b'\n\n'
- + struct.pack('>II', len(self.vertices), len(self.triangles))
- )
- for vertex in self.vertices:
- surface_file.write(struct.pack('>fff', *vertex))
- for triangle in self.triangles:
- assert all(vertex_index < len(self.vertices)
- for vertex_index in triangle.vertex_indices)
- surface_file.write(struct.pack('>III',
- *triangle.vertex_indices))
- surface_file.write(self._TAG_OLD_USEREALRAS
- + struct.pack('>I', 1 if self.using_old_real_ras else 0))
- surface_file.write(self._TAG_OLD_SURF_GEOM
- + b''.join(self.volume_geometry_info))
- for command_line in self.command_lines:
- surface_file.write(self._TAG_CMDLINE + struct.pack('>Q', len(command_line) + 1)
- + command_line + b'\0')
- def load_annotation_file(self, annotation_file_path: str) -> None:
- annotation = Annotation.read(annotation_file_path)
- assert len(annotation.vertex_label_index) <= len(self.vertices)
- assert max(annotation.vertex_label_index.keys()) < len(self.vertices)
- self.annotation = annotation
- def add_vertex(self, vertex: Vertex) -> int:
- self.vertices.append(vertex)
- return len(self.vertices) - 1
- def add_rectangle(self, vertex_indices: typing.Iterable[int]) -> typing.Iterable[int]:
- vertex_indices = list(vertex_indices)
- if len(vertex_indices) == 3:
- vertex_indices.append(self.add_vertex(
- self.vertices[vertex_indices[0]]
- + self.vertices[vertex_indices[2]]
- - self.vertices[vertex_indices[1]]
- ))
- assert len(vertex_indices) == 4
- self.triangles.append(Triangle(vertex_indices[:3]))
- self.triangles.append(Triangle(vertex_indices[2:]
- + vertex_indices[:1]))
- def _triangle_count_by_adjacent_vertex_indices(self) \
- -> typing.Dict[int, typing.Dict[int, int]]:
- counts = {vertex_index: collections.defaultdict(lambda: 0)
- for vertex_index in range(len(self.vertices))}
- for triangle in self.triangles:
- for vertex_index_pair in triangle.adjacent_vertex_indices(2):
- counts[vertex_index_pair[0]][vertex_index_pair[1]] += 1
- counts[vertex_index_pair[1]][vertex_index_pair[0]] += 1
- return counts
- def find_borders(self) -> typing.Iterator[PolygonalCircuit]:
- border_neighbours = {}
- for vertex_index, neighbour_counts \
- in self._triangle_count_by_adjacent_vertex_indices().items():
- if not neighbour_counts:
- yield PolygonalCircuit((vertex_index,))
- else:
- neighbours = [neighbour_index for neighbour_index, counts
- in neighbour_counts.items()
- if counts != 2]
- if neighbours:
- assert len(neighbours) == 2, (vertex_index, neighbours)
- border_neighbours[vertex_index] = neighbours
- while border_neighbours:
- vertex_index, neighbour_indices = border_neighbours.popitem()
- cycle_indices = [vertex_index]
- vertex_index = neighbour_indices[0]
- while vertex_index != cycle_indices[0]:
- neighbour_indices = border_neighbours.pop(vertex_index)
- neighbour_indices.remove(cycle_indices[-1])
- cycle_indices.append(vertex_index)
- vertex_index, = neighbour_indices
- yield PolygonalCircuit(cycle_indices)
- def _get_vertex_label_index(self, vertex_index: int) -> typing.Optional[int]:
- return self.annotation.vertex_label_index.get(vertex_index, None)
- def _find_label_border_segments(self, label: Label) -> typing.Iterator[LineSegment]:
- for triangle in self.triangles:
- border_vertex_indices = tuple(filter(
- lambda i: self._get_vertex_label_index(i) == label.index,
- triangle.vertex_indices,
- ))
- if len(border_vertex_indices) == 2:
- yield LineSegment(border_vertex_indices)
- def find_label_border_polygonal_chains(self, label: Label) -> typing.Iterator[PolygonalChain]:
- segments = set(self._find_label_border_segments(label))
- available_chains = collections.deque(PolygonalChain(segment.vertex_indices)
- for segment in segments)
- # irrespective of its poor performance,
- # we keep this approach since it's easy to read and fast enough
- while available_chains:
- chain = available_chains.pop()
- last_chains_len = None
- while last_chains_len != len(available_chains):
- last_chains_len = len(available_chains)
- checked_chains = collections.deque()
- while available_chains:
- potential_neighbour = available_chains.pop()
- try:
- chain.connect(potential_neighbour)
- except PolygonalChainsNotOverlapingError:
- checked_chains.append(potential_neighbour)
- available_chains = checked_chains
- assert all((segment in segments) for segment in chain.segments())
- yield chain
- def _unused_vertices(self) -> typing.Set[int]:
- vertex_indices = set(range(len(self.vertices)))
- for triangle in self.triangles:
- for vertex_index in triangle.vertex_indices:
- vertex_indices.discard(vertex_index)
- return vertex_indices
- def remove_unused_vertices(self) -> None:
- vertex_index_conversion = [0] * len(self.vertices)
- for vertex_index in sorted(self._unused_vertices(), reverse=True):
- del self.vertices[vertex_index]
- vertex_index_conversion[vertex_index] -= 1
- vertex_index_conversion = numpy.cumsum(vertex_index_conversion)
- for triangle_index in range(len(self.triangles)):
- self.triangles[triangle_index] \
- = Triangle(map(lambda i: i + int(vertex_index_conversion[i]),
- self.triangles[triangle_index].vertex_indices))
- def select_vertices(self, vertex_indices: typing.Iterable[int]) \
- -> numpy.ndarray:
- if not hasattr(vertex_indices, '__getitem__'):
- vertex_indices = list(vertex_indices)
- return numpy.take(self.vertices, indices=vertex_indices, axis=0)
|