File size: 13,357 Bytes
afd4e09
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
141dea1
 
 
 
 
 
 
 
 
 
afd4e09
 
141dea1
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
afd4e09
 
 
 
141dea1
 
 
 
 
afd4e09
 
 
141dea1
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
afd4e09
 
 
 
 
141dea1
 
 
 
 
 
 
afd4e09
141dea1
afd4e09
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
"""
Skeleton graph representation for topology-agnostic motion processing.

Each skeleton is represented as a directed tree graph with:
- Joint features: rest offset, bone length, depth, degree, parent type, side tag
- Edge features: parent-child relations, geodesic distances
- Joint name embeddings: CLIP-encoded semantic features

This is the foundation for the TopoSlots slot assignment module.
"""

import numpy as np
from dataclasses import dataclass, field
from typing import Optional


@dataclass
class SkeletonGraph:
    """Unified skeleton graph representation for arbitrary topologies."""

    # Basic structure
    joint_names: list[str]  # [J] joint names
    parent_indices: list[int]  # [J] parent index (-1 for root)
    rest_offsets: np.ndarray  # [J, 3] rest-pose offsets from parent

    # Derived features (computed in __post_init__)
    num_joints: int = 0
    bone_lengths: np.ndarray = field(default_factory=lambda: np.array([]))  # [J]
    depths: np.ndarray = field(default_factory=lambda: np.array([]))  # [J] tree depth
    degrees: np.ndarray = field(default_factory=lambda: np.array([]))  # [J] num children
    adjacency: np.ndarray = field(default_factory=lambda: np.array([]))  # [J, J] binary
    geodesic_dist: np.ndarray = field(default_factory=lambda: np.array([]))  # [J, J]
    side_tags: list[str] = field(default_factory=list)  # [J] 'left'/'right'/'center'
    symmetry_pairs: list[tuple[int, int]] = field(default_factory=list)

    # Semantic features (filled by encode_joint_names)
    name_embeddings: Optional[np.ndarray] = None  # [J, D_clip]

    def __post_init__(self):
        self.num_joints = len(self.joint_names)
        J = self.num_joints

        if J == 0:
            return

        # Bone lengths
        self.bone_lengths = np.linalg.norm(self.rest_offsets, axis=-1)  # [J]

        # Tree depth via BFS from root
        self.depths = np.zeros(J, dtype=np.int32)
        for j in range(J):
            d = 0
            p = self.parent_indices[j]
            while p >= 0:
                d += 1
                p = self.parent_indices[p]
            self.depths[j] = d

        # Degree (number of children)
        self.degrees = np.zeros(J, dtype=np.int32)
        for j in range(J):
            p = self.parent_indices[j]
            if p >= 0:
                self.degrees[p] += 1

        # Adjacency matrix (undirected)
        self.adjacency = np.zeros((J, J), dtype=np.float32)
        for j in range(J):
            p = self.parent_indices[j]
            if p >= 0:
                self.adjacency[j, p] = 1.0
                self.adjacency[p, j] = 1.0

        # Geodesic distances via BFS
        self.geodesic_dist = self._compute_geodesic_distances()

        # Side tags from joint names
        self.side_tags = self._infer_side_tags()

        # Symmetry pairs
        self.symmetry_pairs = self._find_symmetry_pairs()

    def _compute_geodesic_distances(self) -> np.ndarray:
        """BFS-based geodesic distance on skeleton tree."""
        J = self.num_joints
        dist = np.full((J, J), fill_value=J + 1, dtype=np.int32)
        np.fill_diagonal(dist, 0)

        for i in range(J):
            # BFS from joint i
            queue = [i]
            visited = {i}
            while queue:
                curr = queue.pop(0)
                for j in range(J):
                    if self.adjacency[curr, j] > 0 and j not in visited:
                        dist[i, j] = dist[i, curr] + 1
                        visited.add(j)
                        queue.append(j)

        return dist.astype(np.float32)

    def _infer_side_tags(self) -> list[str]:
        """Infer left/right/center from joint names.

        Handles diverse naming conventions:
          - 'left'/'right' anywhere: LeftArm, left_hip, RightFoot
          - '_L'/'_R' suffix: Shoulder_L, UpperArm_R
          - '_l_'/'_r_' infix: Bip01_L_Thigh, BN_Tai_R_01
          - 'L'/'R' prefix before uppercase: LHipJoint, RThumb
          - '_L'/'_R' suffix before numbers: Leg_L_30_
        """
        import re
        tags = []
        for name in self.joint_names:
            n = name  # preserve case for regex
            nl = name.lower()

            side = 'center'
            # Priority 1: explicit 'left'/'right'
            if 'left' in nl or 'lft' in nl:
                side = 'left'
            elif 'right' in nl or 'rgt' in nl:
                side = 'right'
            # Priority 2: _L / _R suffix (with optional trailing digits/underscores)
            elif re.search(r'[_]L(?:[_\d]|$)', n):
                side = 'left'
            elif re.search(r'[_]R(?:[_\d]|$)', n):
                side = 'right'
            # Priority 3: _l_ / _r_ infix
            elif '_l_' in nl or nl.startswith('l_'):
                side = 'left'
            elif '_r_' in nl or nl.startswith('r_'):
                side = 'right'
            # Priority 4: L/R prefix before uppercase (LHipJoint, RThumb)
            elif re.match(r'^L[A-Z]', n):
                side = 'left'
            elif re.match(r'^R[A-Z]', n):
                side = 'right'
            # Priority 5: prefix_L / prefix_R patterns
            # NPC_LLeg1, NPC_RArm1, BN_LWing01, BN_RWing01, ArmL, ArmR, LegR, etc.
            elif re.search(r'(?:NPC|BN|Bn)_L[A-Z]', n):
                side = 'left'
            elif re.search(r'(?:NPC|BN|Bn)_R[A-Z]', n):
                side = 'right'
            # Priority 6: {Word}L{Upper} or {Word}R{Upper} pattern
            # Catches: ArmLClaw, ElkLFemur, ElkRScapula, LegR_01_, etc.
            elif re.search(r'[a-z0-9]L[A-Z_]', n) or re.search(r'[a-z0-9]L$', n):
                side = 'left'
            elif re.search(r'[a-z0-9]R[A-Z_]', n) or re.search(r'[a-z0-9]R$', n):
                side = 'right'

            tags.append(side)

        return tags

    def _find_symmetry_pairs(self) -> list[tuple[int, int]]:
        """Find symmetric joint pairs based on naming conventions.

        Handles: Left↔Right, _L↔_R, _l_↔_r_, L-prefix↔R-prefix.
        """
        import re
        pairs = []
        used = set()

        # Build replacement rules: (pattern, left_repl, right_repl)
        swap_rules = [
            # Full words
            (r'(?i)left', 'left', 'right'),
            (r'(?i)right', 'right', 'left'),
            # _L / _R suffix (preserving case/context)
            (r'_L(?=[_\d]|$)', '_L', '_R'),
            (r'_R(?=[_\d]|$)', '_R', '_L'),
            # _l_ / _r_ infix
            (r'_l_', '_l_', '_r_'),
            (r'_r_', '_r_', '_l_'),
            # L/R prefix before uppercase
            (r'^L(?=[A-Z])', 'L', 'R'),
            (r'^R(?=[A-Z])', 'R', 'L'),
            # BN_L/BN_R prefix (BN_LWing01 ↔ BN_RWing01)
            (r'BN_L(?=[A-Z])', 'BN_L', 'BN_R'),
            (r'BN_R(?=[A-Z])', 'BN_R', 'BN_L'),
            (r'Bn_L(?=[A-Z])', 'Bn_L', 'Bn_R'),
            (r'Bn_R(?=[A-Z])', 'Bn_R', 'Bn_L'),
            # NPC_L/NPC_R prefix (NPC_LLeg1 ↔ NPC_RLeg1)
            (r'NPC_L(?=[A-Z_])', 'NPC_L', 'NPC_R'),
            (r'NPC_R(?=[A-Z_])', 'NPC_R', 'NPC_L'),
            # {word}L{Upper} ↔ {word}R{Upper} (ElkLFemur↔ElkRFemur, ArmL↔ArmR)
            (r'(?<=[a-z0-9])L(?=[A-Z_]|$)', 'L', 'R'),
            (r'(?<=[a-z0-9])R(?=[A-Z_]|$)', 'R', 'L'),
        ]

        for i, name_i in enumerate(self.joint_names):
            if i in used:
                continue

            mirror_name = None
            for pattern, from_str, to_str in swap_rules:
                if re.search(pattern, name_i):
                    mirror_name = re.sub(pattern, to_str, name_i, count=1)
                    break

            if mirror_name and mirror_name != name_i:
                mirror_lower = mirror_name.lower()
                for j, name_j in enumerate(self.joint_names):
                    if j != i and j not in used and name_j.lower() == mirror_lower:
                        pairs.append((i, j))
                        used.add(i)
                        used.add(j)
                        break

        return pairs

    def get_edge_list(self) -> list[tuple[int, int]]:
        """Return parent-child edge list."""
        edges = []
        for j in range(self.num_joints):
            p = self.parent_indices[j]
            if p >= 0:
                edges.append((p, j))
        return edges

    def get_joint_features(self) -> np.ndarray:
        """
        Compute per-joint feature vector for skeleton encoder input.
        Returns: [J, D] where D = 3 (offset) + 1 (bone_len) + 1 (depth) + 1 (degree) + 3 (side one-hot)
        """
        J = self.num_joints

        # Side tags as one-hot: [left, right, center]
        side_onehot = np.zeros((J, 3), dtype=np.float32)
        for j, tag in enumerate(self.side_tags):
            if tag == 'left':
                side_onehot[j, 0] = 1.0
            elif tag == 'right':
                side_onehot[j, 1] = 1.0
            else:
                side_onehot[j, 2] = 1.0

        # Normalize rest offsets
        max_offset = np.max(np.abs(self.rest_offsets)) + 1e-8
        norm_offsets = self.rest_offsets / max_offset

        # Normalize bone lengths
        max_bone = np.max(self.bone_lengths) + 1e-8
        norm_bones = (self.bone_lengths / max_bone).reshape(-1, 1)

        # Normalize depth/degree
        max_depth = max(self.depths.max(), 1)
        norm_depths = (self.depths / max_depth).reshape(-1, 1).astype(np.float32)
        max_degree = max(self.degrees.max(), 1)
        norm_degrees = (self.degrees / max_degree).reshape(-1, 1).astype(np.float32)

        features = np.concatenate([
            norm_offsets,     # [J, 3]
            norm_bones,       # [J, 1]
            norm_depths,      # [J, 1]
            norm_degrees,     # [J, 1]
            side_onehot,      # [J, 3]
        ], axis=-1)  # [J, 9]

        return features

    def to_dict(self) -> dict:
        """Serialize to dict for saving."""
        return {
            'joint_names': self.joint_names,
            'parent_indices': self.parent_indices,
            'rest_offsets': self.rest_offsets,
            'bone_lengths': self.bone_lengths,
            'depths': self.depths,
            'degrees': self.degrees,
            'adjacency': self.adjacency,
            'geodesic_dist': self.geodesic_dist,
            'side_tags': self.side_tags,
            'symmetry_pairs': self.symmetry_pairs,
            'name_embeddings': self.name_embeddings,
        }

    @classmethod
    def from_dict(cls, d: dict) -> 'SkeletonGraph':
        """Deserialize from dict."""
        sg = cls(
            joint_names=d['joint_names'],
            parent_indices=d['parent_indices'],
            rest_offsets=d['rest_offsets'],
        )
        if d.get('name_embeddings') is not None:
            sg.name_embeddings = d['name_embeddings']
        return sg


# ============================================================
# Joint name normalization (alias table)
# ============================================================

JOINT_NAME_ALIASES = {
    # Mixamo naming
    'mixamorig:hips': 'pelvis',
    'mixamorig:spine': 'spine',
    'mixamorig:spine1': 'spine1',
    'mixamorig:spine2': 'chest',
    'mixamorig:neck': 'neck',
    'mixamorig:head': 'head',
    'mixamorig:leftshoulder': 'left shoulder',
    'mixamorig:leftarm': 'left upper arm',
    'mixamorig:leftforearm': 'left forearm',
    'mixamorig:lefthand': 'left hand',
    'mixamorig:rightshoulder': 'right shoulder',
    'mixamorig:rightarm': 'right upper arm',
    'mixamorig:rightforearm': 'right forearm',
    'mixamorig:righthand': 'right hand',
    'mixamorig:leftupleg': 'left upper leg',
    'mixamorig:leftleg': 'left lower leg',
    'mixamorig:leftfoot': 'left foot',
    'mixamorig:lefttoebase': 'left toe',
    'mixamorig:rightupleg': 'right upper leg',
    'mixamorig:rightleg': 'right lower leg',
    'mixamorig:rightfoot': 'right foot',
    'mixamorig:righttoebase': 'right toe',
    # SMPL naming
    'pelvis': 'pelvis',
    'l_hip': 'left hip',
    'r_hip': 'right hip',
    'spine1': 'lower spine',
    'l_knee': 'left knee',
    'r_knee': 'right knee',
    'spine2': 'upper spine',
    'l_ankle': 'left ankle',
    'r_ankle': 'right ankle',
    'spine3': 'chest',
    'l_foot': 'left foot',
    'r_foot': 'right foot',
    'neck': 'neck',
    'l_collar': 'left collar',
    'r_collar': 'right collar',
    'head': 'head',
    'l_shoulder': 'left shoulder',
    'r_shoulder': 'right shoulder',
    'l_elbow': 'left elbow',
    'r_elbow': 'right elbow',
    'l_wrist': 'left wrist',
    'r_wrist': 'right wrist',
    # Common animal naming
    'hips': 'pelvis',
    'spine': 'spine',
    'chest': 'chest',
    'leftforeleg': 'left fore leg',
    'rightforeleg': 'right fore leg',
    'lefthindleg': 'left hind leg',
    'righthindleg': 'right hind leg',
    'tail': 'tail',
    'tail1': 'tail base',
    'tail2': 'tail mid',
    'tail3': 'tail tip',
}


def normalize_joint_name(name: str) -> str:
    """Normalize joint name to a canonical human-readable form."""
    key = name.lower().strip().replace(' ', '')
    if key in JOINT_NAME_ALIASES:
        return JOINT_NAME_ALIASES[key]

    # Fallback: split camelCase and add spaces
    import re
    result = re.sub(r'([a-z])([A-Z])', r'\1 \2', name)
    result = re.sub(r'[_:]', ' ', result)
    return result.lower().strip()