__init__.py 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511
  1. """
  2. Python Library to Read and Write Surface Files in Freesurfer's TriangularSurface Format
  3. compatible with Freesurfer's MRISwriteTriangularSurface()
  4. https://github.com/freesurfer/freesurfer/blob/release_6_0_0/include/mrisurf.h#L1281
  5. https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/mrisurf.c
  6. https://raw.githubusercontent.com/freesurfer/freesurfer/release_6_0_0/utils/mrisurf.c
  7. Freesurfer
  8. https://surfer.nmr.mgh.harvard.edu/
  9. Edit Surface File
  10. >>> from freesurfer_surface import Surface, Vertex, Triangle
  11. >>>
  12. >>> surface = Surface.read_triangular('bert/surf/lh.pial'))
  13. >>>
  14. >>> vertex_a = surface.add_vertex(Vertex(0.0, 0.0, 0.0))
  15. >>> vertex_b = surface.add_vertex(Vertex(1.0, 1.0, 1.0))
  16. >>> vertex_c = surface.add_vertex(Vertex(2.0, 2.0, 2.0))
  17. >>> surface.triangles.append(Triangle((vertex_a, vertex_b, vertex_c)))
  18. >>>
  19. >>> surface.write_triangular('somewhere/else/lh.pial')
  20. List Labels in Annotation File
  21. >>> from freesurfer_surface import Annotation
  22. >>>
  23. >>> annotation = Annotation.read('bert/label/lh.aparc.annot')
  24. >>> for label in annotation.labels.values():
  25. >>> print(label.index, label.hex_color_code, label.name)
  26. Find Border of Labelled Region
  27. >>> surface = Surface.read_triangular('bert/surf/lh.pial'))
  28. >>> surface.load_annotation_file('bert/label/lh.aparc.annot')
  29. >>> region, = filter(lambda l: l.name == 'precentral',
  30. >>> annotation.labels.values())
  31. >>> print(surface.find_label_border_polygonal_chains(region))
  32. """
  33. import collections
  34. import contextlib
  35. import datetime
  36. import itertools
  37. import locale
  38. import re
  39. import struct
  40. import typing
  41. import numpy
  42. from freesurfer_surface.version import __version__
  43. class UnsupportedLocaleSettingError(locale.Error):
  44. pass
  45. @contextlib.contextmanager
  46. def setlocale(temporary_locale):
  47. primary_locale = locale.setlocale(locale.LC_ALL)
  48. try:
  49. yield locale.setlocale(locale.LC_ALL, temporary_locale)
  50. except locale.Error as exc:
  51. if str(exc) == 'unsupported locale setting':
  52. raise UnsupportedLocaleSettingError(temporary_locale)
  53. raise exc # pragma: no cover
  54. finally:
  55. locale.setlocale(locale.LC_ALL, primary_locale)
  56. class Vertex(numpy.ndarray):
  57. def __new__(cls, right: float, anterior: float, superior: float):
  58. return numpy.array((right, anterior, superior),
  59. dtype=float).view(cls)
  60. @property
  61. def right(self) -> float:
  62. return self[0]
  63. @property
  64. def anterior(self) -> float:
  65. return self[1]
  66. @property
  67. def superior(self) -> float:
  68. return self[2]
  69. @property
  70. def __dict__(self) -> typing.Dict[str, float]:
  71. return {'right': self.right,
  72. 'anterior': self.anterior,
  73. 'superior': self.superior}
  74. def __format_coords(self) -> str:
  75. return ', '.join('{}={}'.format(name, getattr(self, name))
  76. for name in ['right', 'anterior', 'superior'])
  77. def __repr__(self) -> str:
  78. return '{}({})'.format(type(self).__name__, self.__format_coords())
  79. def distance_mm(self, others: typing.Union['Vertex',
  80. typing.Iterable['Vertex'],
  81. numpy.ndarray],
  82. ) -> numpy.ndarray:
  83. if isinstance(others, Vertex):
  84. others = others.reshape((1, 3))
  85. return numpy.linalg.norm(self - others, axis=1)
  86. class PolygonalCircuit:
  87. _VERTEX_INDICES_TYPE = typing.Tuple[int]
  88. def __init__(self, vertex_indices: _VERTEX_INDICES_TYPE):
  89. self._vertex_indices = tuple(vertex_indices)
  90. @property
  91. def vertex_indices(self):
  92. return self._vertex_indices
  93. def _normalize(self) -> 'PolygonalCircuit':
  94. min_vertex_index_index = self.vertex_indices.index(
  95. min(self.vertex_indices))
  96. previous_index = self.vertex_indices[min_vertex_index_index - 1]
  97. next_index = self.vertex_indices[(min_vertex_index_index+1)
  98. % len(self.vertex_indices)]
  99. if previous_index < next_index:
  100. vertex_indices = self.vertex_indices[:min_vertex_index_index+1][::-1] \
  101. + self.vertex_indices[min_vertex_index_index+1:][::-1]
  102. else:
  103. vertex_indices = self.vertex_indices[min_vertex_index_index:] \
  104. + self.vertex_indices[:min_vertex_index_index]
  105. return type(self)(vertex_indices)
  106. def __eq__(self, other: 'PolygonalCircuit') -> bool:
  107. # pylint: disable=protected-access
  108. return self._normalize().vertex_indices == other._normalize().vertex_indices
  109. def __hash__(self) -> int:
  110. # pylint: disable=protected-access
  111. return hash(self._normalize()._vertex_indices)
  112. def adjacent_vertex_indices(self, vertices_num: int = 2
  113. ) -> typing.Iterable[typing.Tuple[int]]:
  114. vertex_indices_cycle = list(itertools.islice(
  115. itertools.cycle(self.vertex_indices),
  116. 0,
  117. len(self.vertex_indices) + vertices_num - 1,
  118. ))
  119. return zip(*(itertools.islice(vertex_indices_cycle,
  120. offset,
  121. len(self.vertex_indices) + offset)
  122. for offset in range(vertices_num)))
  123. class LineSegment(PolygonalCircuit):
  124. def __init__(self, indices: PolygonalCircuit._VERTEX_INDICES_TYPE):
  125. super().__init__(indices)
  126. assert len(self.vertex_indices) == 2
  127. def __repr__(self) -> str:
  128. return 'LineSegment(vertex_indices={})'.format(self.vertex_indices)
  129. class Triangle(PolygonalCircuit):
  130. def __init__(self, indices: PolygonalCircuit._VERTEX_INDICES_TYPE):
  131. super().__init__(indices)
  132. assert len(self.vertex_indices) == 3
  133. def __repr__(self) -> str:
  134. return 'Triangle(vertex_indices={})'.format(self.vertex_indices)
  135. class PolygonalChainsNotOverlapingError(ValueError):
  136. pass
  137. class PolygonalChain:
  138. def __init__(self, vertex_indices: typing.Iterable[int]):
  139. self.vertex_indices = collections.deque(vertex_indices) # type: Deque[int]
  140. def __eq__(self, other: 'PolygonalChain') -> bool:
  141. return self.vertex_indices == other.vertex_indices
  142. def __repr__(self) -> str:
  143. return 'PolygonalChain(vertex_indices={})'.format(tuple(self.vertex_indices))
  144. def connect(self, other: 'PolygonalChain') -> None:
  145. if self.vertex_indices[-1] == other.vertex_indices[0]:
  146. self.vertex_indices.pop()
  147. self.vertex_indices.extend(other.vertex_indices)
  148. elif self.vertex_indices[-1] == other.vertex_indices[-1]:
  149. self.vertex_indices.pop()
  150. self.vertex_indices.extend(reversed(other.vertex_indices))
  151. elif self.vertex_indices[0] == other.vertex_indices[0]:
  152. self.vertex_indices.popleft()
  153. self.vertex_indices.extendleft(other.vertex_indices)
  154. elif self.vertex_indices[0] == other.vertex_indices[-1]:
  155. self.vertex_indices.popleft()
  156. self.vertex_indices.extendleft(reversed(other.vertex_indices))
  157. else:
  158. raise PolygonalChainsNotOverlapingError()
  159. def adjacent_vertex_indices(self, vertices_num: int = 2
  160. ) -> typing.Iterable[typing.Tuple[int]]:
  161. return zip(*(itertools.islice(self.vertex_indices,
  162. offset,
  163. len(self.vertex_indices))
  164. for offset in range(vertices_num)))
  165. def segments(self) -> typing.Iterable[LineSegment]:
  166. return map(LineSegment, self.adjacent_vertex_indices(2))
  167. class Label:
  168. # pylint: disable=too-many-arguments
  169. def __init__(self, index: int, name: str, red: int,
  170. green: int, blue: int, transparency: int):
  171. self.index = index # type: int
  172. self.name = name # type: str
  173. self.red = red # type: int
  174. self.green = green # type: int
  175. self.blue = blue # type: int
  176. self.transparency = transparency # type: int
  177. @property
  178. def color_code(self) -> int:
  179. if self.index == 0: # unknown
  180. return 0
  181. return int.from_bytes((self.red, self.green, self.blue, self.transparency),
  182. byteorder='little', signed=False)
  183. @property
  184. def hex_color_code(self) -> str:
  185. return '#{:02x}{:02x}{:02x}'.format(self.red, self.green, self.blue)
  186. def __str__(self) -> str:
  187. return 'Label(name={}, index={}, color={})'.format(
  188. self.name, self.index, self.hex_color_code)
  189. def __repr__(self) -> str:
  190. return str(self)
  191. class Annotation:
  192. # pylint: disable=too-few-public-methods
  193. _TAG_OLD_COLORTABLE = b'\0\0\0\x01'
  194. def __init__(self):
  195. self.vertex_label_index = {} # type: Dict[int, int]
  196. self.colortable_path = None # type: Optional[bytes]
  197. self.labels = {} # type: Dict[int, Label]
  198. @staticmethod
  199. def _read_label(stream: typing.BinaryIO) -> Label:
  200. index, name_length = struct.unpack('>II', stream.read(4 * 2))
  201. name = stream.read(name_length - 1).decode()
  202. assert stream.read(1) == b'\0'
  203. red, green, blue, transparency \
  204. = struct.unpack('>IIII', stream.read(4 * 4))
  205. return Label(index=index, name=name, red=red, green=green,
  206. blue=blue, transparency=transparency)
  207. def _read(self, stream: typing.BinaryIO) -> None:
  208. # https://surfer.nmr.mgh.harvard.edu/fswiki/LabelsClutsAnnotationFiles
  209. annotations_num, = struct.unpack('>I', stream.read(4))
  210. annotations = [struct.unpack('>II', stream.read(4 * 2))
  211. for _ in range(annotations_num)]
  212. assert stream.read(4) == self._TAG_OLD_COLORTABLE
  213. colortable_version, _, filename_length \
  214. = struct.unpack('>III', stream.read(4 * 3))
  215. assert colortable_version > 0 # new version
  216. self.colortable_path = stream.read(filename_length - 1)
  217. assert stream.read(1) == b'\0'
  218. labels_num, = struct.unpack('>I', stream.read(4))
  219. self.labels = {label.index: label for label
  220. in (self._read_label(stream) for _ in range(labels_num))}
  221. label_index_by_color_code = {label.color_code: label.index
  222. for label in self.labels.values()}
  223. self.vertex_label_index = {vertex_index: label_index_by_color_code[color_code]
  224. for vertex_index, color_code in annotations}
  225. assert not stream.read(1)
  226. @classmethod
  227. def read(cls, annotation_file_path: str) -> 'Annotation':
  228. annotation = cls()
  229. with open(annotation_file_path, 'rb') as annotation_file:
  230. # pylint: disable=protected-access
  231. annotation._read(annotation_file)
  232. return annotation
  233. class Surface:
  234. # pylint: disable=too-many-instance-attributes
  235. _MAGIC_NUMBER = b'\xff\xff\xfe'
  236. _TAG_CMDLINE = b'\x00\x00\x00\x03'
  237. _TAG_OLD_SURF_GEOM = b'\x00\x00\x00\x14'
  238. _TAG_OLD_USEREALRAS = b'\x00\x00\x00\x02'
  239. _DATETIME_FORMAT = '%a %b %d %H:%M:%S %Y'
  240. def __init__(self):
  241. self.creator = None # type: Optional[bytes]
  242. self.creation_datetime = None # type: Optional[datetime.datetime]
  243. self.vertices = [] # type: List[Vertex]
  244. self.triangles = [] # type: List[Triangle]
  245. self.using_old_real_ras = False # type: bool
  246. self.volume_geometry_info = None # type: Optional[Tuple[bytes]]
  247. self.command_lines = [] # type: List[bytes]
  248. self.annotation = None # type: Optional[Annotation]
  249. @classmethod
  250. def _read_cmdlines(cls, stream: typing.BinaryIO) -> typing.Iterator[str]:
  251. while True:
  252. tag = stream.read(4)
  253. if not tag:
  254. return
  255. assert tag == cls._TAG_CMDLINE # might be TAG_GROUP_AVG_SURFACE_AREA
  256. # TAGwrite
  257. # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/tags.c#L94
  258. str_length, = struct.unpack('>Q', stream.read(8))
  259. yield stream.read(str_length - 1)
  260. assert stream.read(1) == b'\x00'
  261. def _read_triangular(self, stream: typing.BinaryIO):
  262. assert stream.read(3) == self._MAGIC_NUMBER
  263. self.creator, creation_dt_str = re.match(rb'^created by (\w+) on (.* \d{4})\n',
  264. stream.readline()).groups()
  265. with setlocale('C'):
  266. self.creation_datetime = datetime.datetime.strptime(creation_dt_str.decode(),
  267. self._DATETIME_FORMAT)
  268. assert stream.read(1) == b'\n'
  269. # fwriteInt
  270. # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/fio.c#L290
  271. vertices_num, triangles_num = struct.unpack('>II', stream.read(4 * 2))
  272. self.vertices = [Vertex(*struct.unpack('>fff', stream.read(4 * 3)))
  273. for _ in range(vertices_num)]
  274. self.triangles = [Triangle(struct.unpack('>III', stream.read(4 * 3)))
  275. for _ in range(triangles_num)]
  276. assert all(vertex_idx < vertices_num
  277. for triangle in self.triangles
  278. for vertex_idx in triangle.vertex_indices)
  279. assert stream.read(4) == self._TAG_OLD_USEREALRAS
  280. using_old_real_ras, = struct.unpack('>I', stream.read(4))
  281. assert using_old_real_ras in [0, 1], using_old_real_ras
  282. self.using_old_real_ras = bool(using_old_real_ras)
  283. assert stream.read(4) == self._TAG_OLD_SURF_GEOM
  284. # writeVolGeom
  285. # https://github.com/freesurfer/freesurfer/blob/release_6_0_0/utils/transform.c#L368
  286. self.volume_geometry_info = tuple(stream.readline() for _ in range(8))
  287. self.command_lines = list(self._read_cmdlines(stream))
  288. @classmethod
  289. def read_triangular(cls, surface_file_path: str) -> 'Surface':
  290. surface = cls()
  291. with open(surface_file_path, 'rb') as surface_file:
  292. # pylint: disable=protected-access
  293. surface._read_triangular(surface_file)
  294. return surface
  295. @classmethod
  296. def _triangular_strftime(cls, creation_datetime: datetime.datetime) -> bytes:
  297. padded_day = '{:>2}'.format(creation_datetime.day)
  298. fmt = cls._DATETIME_FORMAT.replace('%d', padded_day)
  299. with setlocale('C'):
  300. return creation_datetime.strftime(fmt).encode()
  301. def write_triangular(self, surface_file_path: str,
  302. creation_datetime: typing.Optional[datetime.datetime] = None):
  303. if creation_datetime is None:
  304. creation_datetime = datetime.datetime.now()
  305. with open(surface_file_path, 'wb') as surface_file:
  306. surface_file.write(
  307. self._MAGIC_NUMBER
  308. + b'created by ' + self.creator
  309. + b' on ' + self._triangular_strftime(creation_datetime)
  310. + b'\n\n'
  311. + struct.pack('>II', len(self.vertices), len(self.triangles))
  312. )
  313. for vertex in self.vertices:
  314. surface_file.write(struct.pack('>fff', *vertex))
  315. for triangle in self.triangles:
  316. assert all(vertex_index < len(self.vertices)
  317. for vertex_index in triangle.vertex_indices)
  318. surface_file.write(struct.pack('>III',
  319. *triangle.vertex_indices))
  320. surface_file.write(self._TAG_OLD_USEREALRAS
  321. + struct.pack('>I', 1 if self.using_old_real_ras else 0))
  322. surface_file.write(self._TAG_OLD_SURF_GEOM
  323. + b''.join(self.volume_geometry_info))
  324. for command_line in self.command_lines:
  325. surface_file.write(self._TAG_CMDLINE + struct.pack('>Q', len(command_line) + 1)
  326. + command_line + b'\0')
  327. def load_annotation_file(self, annotation_file_path: str) -> None:
  328. annotation = Annotation.read(annotation_file_path)
  329. assert len(annotation.vertex_label_index) <= len(self.vertices)
  330. assert max(annotation.vertex_label_index.keys()) < len(self.vertices)
  331. self.annotation = annotation
  332. def add_vertex(self, vertex: Vertex) -> int:
  333. self.vertices.append(vertex)
  334. return len(self.vertices) - 1
  335. def add_rectangle(self, vertex_indices: typing.Iterable[int]) -> typing.Iterable[int]:
  336. vertex_indices = list(vertex_indices)
  337. if len(vertex_indices) == 3:
  338. vertex_indices.append(self.add_vertex(
  339. self.vertices[vertex_indices[0]]
  340. + self.vertices[vertex_indices[2]]
  341. - self.vertices[vertex_indices[1]]
  342. ))
  343. assert len(vertex_indices) == 4
  344. self.triangles.append(Triangle(vertex_indices[:3]))
  345. self.triangles.append(Triangle(vertex_indices[2:]
  346. + vertex_indices[:1]))
  347. def _triangle_count_by_adjacent_vertex_indices(self) \
  348. -> typing.Dict[int, typing.Dict[int, int]]:
  349. counts = {vertex_index: collections.defaultdict(lambda: 0)
  350. for vertex_index in range(len(self.vertices))}
  351. for triangle in self.triangles:
  352. for vertex_index_pair in triangle.adjacent_vertex_indices(2):
  353. counts[vertex_index_pair[0]][vertex_index_pair[1]] += 1
  354. counts[vertex_index_pair[1]][vertex_index_pair[0]] += 1
  355. return counts
  356. def find_borders(self) -> typing.Iterator[PolygonalCircuit]:
  357. border_neighbours = {}
  358. for vertex_index, neighbour_counts \
  359. in self._triangle_count_by_adjacent_vertex_indices().items():
  360. if not neighbour_counts:
  361. yield PolygonalCircuit((vertex_index,))
  362. else:
  363. neighbours = [neighbour_index for neighbour_index, counts
  364. in neighbour_counts.items()
  365. if counts != 2]
  366. if neighbours:
  367. assert len(neighbours) == 2, (vertex_index, neighbours)
  368. border_neighbours[vertex_index] = neighbours
  369. while border_neighbours:
  370. vertex_index, neighbour_indices = border_neighbours.popitem()
  371. cycle_indices = [vertex_index]
  372. vertex_index = neighbour_indices[0]
  373. while vertex_index != cycle_indices[0]:
  374. neighbour_indices = border_neighbours.pop(vertex_index)
  375. neighbour_indices.remove(cycle_indices[-1])
  376. cycle_indices.append(vertex_index)
  377. vertex_index, = neighbour_indices
  378. yield PolygonalCircuit(cycle_indices)
  379. def _get_vertex_label_index(self, vertex_index: int) -> typing.Optional[int]:
  380. return self.annotation.vertex_label_index.get(vertex_index, None)
  381. def _find_label_border_segments(self, label: Label) -> typing.Iterator[LineSegment]:
  382. for triangle in self.triangles:
  383. border_vertex_indices = tuple(filter(
  384. lambda i: self._get_vertex_label_index(i) == label.index,
  385. triangle.vertex_indices,
  386. ))
  387. if len(border_vertex_indices) == 2:
  388. yield LineSegment(border_vertex_indices)
  389. def find_label_border_polygonal_chains(self, label: Label) -> typing.Iterator[PolygonalChain]:
  390. segments = set(self._find_label_border_segments(label))
  391. available_chains = collections.deque(PolygonalChain(segment.vertex_indices)
  392. for segment in segments)
  393. # irrespective of its poor performance,
  394. # we keep this approach since it's easy to read and fast enough
  395. while available_chains:
  396. chain = available_chains.pop()
  397. last_chains_len = None
  398. while last_chains_len != len(available_chains):
  399. last_chains_len = len(available_chains)
  400. checked_chains = collections.deque()
  401. while available_chains:
  402. potential_neighbour = available_chains.pop()
  403. try:
  404. chain.connect(potential_neighbour)
  405. except PolygonalChainsNotOverlapingError:
  406. checked_chains.append(potential_neighbour)
  407. available_chains = checked_chains
  408. assert all((segment in segments) for segment in chain.segments())
  409. yield chain
  410. def _unused_vertices(self) -> typing.Set[int]:
  411. vertex_indices = set(range(len(self.vertices)))
  412. for triangle in self.triangles:
  413. for vertex_index in triangle.vertex_indices:
  414. vertex_indices.discard(vertex_index)
  415. return vertex_indices
  416. def remove_unused_vertices(self) -> None:
  417. vertex_index_conversion = [0] * len(self.vertices)
  418. for vertex_index in sorted(self._unused_vertices(), reverse=True):
  419. del self.vertices[vertex_index]
  420. vertex_index_conversion[vertex_index] -= 1
  421. vertex_index_conversion = numpy.cumsum(vertex_index_conversion)
  422. for triangle_index in range(len(self.triangles)):
  423. self.triangles[triangle_index] \
  424. = Triangle(map(lambda i: i + vertex_index_conversion[i],
  425. self.triangles[triangle_index].vertex_indices))