opensportslib 0.0.1.dev2__py3-none-any.whl

opensportslib/models/utils/impl/gtad.py

@@ -0,0 +1,347 @@
+"""
+Copyright 2022 James Hong, Haotian Zhang, Matthew Fisher, Michael Gharbi,
+Kayvon Fatahalian
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+this list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors
+may be used to endorse or promote products derived from this software without
+specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+"""
+# Adapted from: https://github.com/frostinassiky/gtad
+# Original license for GTAD
+"""
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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.
+"""
+
+import math
+import numpy as np
+import torch
+import torch.nn as nn
+
+
+# dynamic graph from knn
+def knn(x, y=None, k=10):
+    """
+    :param x: BxCxN
+    :param y: BxCxM
+    :param k: scalar
+    :return: BxMxk
+    """
+    if y is None:
+        y = x
+    # logging.info('Size in KNN: {} - {}'.format(x.size(), y.size()))
+    inner = -2 * torch.matmul(y.transpose(2, 1), x)
+    xx = torch.sum(x ** 2, dim=1, keepdim=True)
+    yy = torch.sum(y ** 2, dim=1, keepdim=True)
+    pairwise_distance = -xx - inner - yy.transpose(2, 1)
+    _, idx = pairwise_distance.topk(k=k, dim=-1)  # (batch_size, num_points, k)
+    return idx
+
+
+# get graph feature
+def get_graph_feature(x, prev_x=None, k=20, idx_knn=None, r=-1, style=0):
+    """
+    :param x:
+    :param prev_x:
+    :param k:
+    :param idx:
+    :param r: output downsampling factor (-1 for no downsampling)
+    :param style: method to get graph feature
+    :return:
+    """
+    batch_size = x.size(0)
+    num_points = x.size(2)  # if prev_x is None else prev_x.size(2)
+    x = x.view(batch_size, -1, num_points)
+    if idx_knn is None:
+        idx_knn = knn(x=x, y=prev_x, k=k)  # (batch_size, num_points, k)
+    else:
+        k = idx_knn.shape[-1]
+    # print(idx_knn.shape)
+    device = x.device  # torch.device('cuda')
+    idx_base = torch.arange(0, batch_size, device=device).view(-1, 1, 1) * num_points
+    idx = idx_knn + idx_base
+    idx = idx.view(-1)
+    _, num_dims, _ = x.size()
+    x = x.transpose(2, 1).contiguous()  # (batch_size, num_points, num_dims)  -> (batch_size*num_points, num_dims)
+    feature = x.view(batch_size * num_points, -1)[idx, :]
+    feature = feature.view(batch_size, num_points, k, num_dims)
+    x = x.view(batch_size, num_points, 1, num_dims).repeat(1, 1, k, 1)
+    if style == 0:  # use offset as feature
+        feature = torch.cat((feature - x, x), dim=3).permute(0, 3, 1, 2)
+    elif style == 1:  # use feature as feature
+        feature = torch.cat((feature, x), dim=3).permute(0, 3, 1, 2)
+    else: # style == 2:
+        feature = feature.permute(0,3,1,2)
+    # downsample if needed
+    if r != -1:
+        select_idx = torch.from_numpy(np.random.choice(feature.size(2), feature.size(2) // r,
+                                                       replace=False)).to(device=device)
+        feature = feature[:, :, select_idx, :]
+    return feature, idx_knn
+
+
+# basic block
+class GCNeXt(nn.Module):
+    def __init__(self, channel_in, channel_out, k=3, norm_layer=None,
+                 groups=32, width_group=4, idx=None):
+        super(GCNeXt, self).__init__()
+        self.k = k
+        self.groups = groups
+
+        if norm_layer is None:
+            norm_layer = nn.BatchNorm1d
+        width = width_group * groups
+        self.tconvs = nn.Sequential(
+            nn.Conv1d(channel_in, width, kernel_size=1), nn.ReLU(True),
+            nn.Conv1d(width, width, kernel_size=3, groups=groups, padding=1), nn.ReLU(True),
+            nn.Conv1d(width, channel_out, kernel_size=1),
+        ) # temporal graph
+
+        self.sconvs = nn.Sequential(
+            nn.Conv2d(channel_in * 2, width, kernel_size=1), nn.ReLU(True),
+            nn.Conv2d(width, width, kernel_size=1, groups=groups), nn.ReLU(True),
+            nn.Conv2d(width, channel_out, kernel_size=1),
+        ) # semantic graph
+
+        self.relu = nn.ReLU(True)
+        self.idx_list = idx
+
+    def forward(self, x):
+        identity = x  # residual
+        tout = self.tconvs(x)  # conv on temporal graph
+
+
+        if self.k < 1:
+            k = math.ceil(x.shape[-1] * self.k)
+        else:
+            k = self.k
+
+        x_f, idx = get_graph_feature(x, k=k, style=1)  # (bs,ch,100) -> (bs, 2ch, 100, k)
+
+        sout = self.sconvs(x_f)  # conv on semantic graph
+        sout = sout.max(dim=-1, keepdim=False)[0]  # (bs, ch, 100, k) -> (bs, ch, 100)
+
+        out = tout + identity + sout  # fusion
+        if not self.idx_list is None:
+            self.idx_list.append(idx)
+        return self.relu(out)

opensportslib/models/utils/impl/tsm.py

@@ -0,0 +1,123 @@
+"""
+Copyright 2022 James Hong, Haotian Zhang, Matthew Fisher, Michael Gharbi,
+Kayvon Fatahalian
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+this list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors
+may be used to endorse or promote products derived from this software without
+specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+"""
+# TSM code adapted from: https://github.com/mit-han-lab/temporal-shift-module/blob/master/ops/temporal_shift.py
+# Original license for TSM
+"""
+MIT License
+
+Copyright (c) 2021 MIT HAN Lab
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+"""
+
+import torch
+import torch.nn as nn
+
+
+class TemporalShift(nn.Module):
+    def __init__(self, net, n_segment, n_div, inplace=True):
+        super(TemporalShift, self).__init__()
+        self.net = net
+        self.n_segment = n_segment
+        self.fold_div = n_div
+        self.inplace = inplace
+        if inplace:
+            print('=> Using TSM, in-place shift...')
+        print('=> Using TSM, fold div: {}'.format(self.fold_div))
+
+    def forward(self, x):
+        x = self.shift(x, self.n_segment, fold_div=self.fold_div,
+                       inplace=self.inplace)
+        return self.net(x)
+
+    @staticmethod
+    def shift(x, n_segment, fold_div=3, inplace=False):
+        nt, c, h, w = x.size()
+        n_batch = nt // n_segment
+        x = x.view(n_batch, n_segment, c, h, w)
+
+        fold = c // fold_div
+        if inplace:
+            # Due to some out of order error when performing parallel computing.
+            # May need to write a CUDA kernel.
+            out = InplaceShift.apply(x, fold)
+        else:
+            out = torch.zeros_like(x)
+            out[:, :-1, :fold] = x[:, 1:, :fold]  # shift left
+            out[:, 1:, fold: 2 * fold] = x[:, :-1, fold: 2 * fold]  # shift right
+            out[:, :, 2 * fold:] = x[:, :, 2 * fold:]  # not shift
+
+        return out.view(nt, c, h, w)
+
+
+class InplaceShift(torch.autograd.Function):
+    # Special thanks to @raoyongming for the help to this function
+    @staticmethod
+    def forward(ctx, input, fold):
+        # not support higher order gradient
+        # input = input.detach_()
+        ctx.fold_ = fold
+        n, t, c, h, w = input.size()
+        buffer = input.data.new(n, t, fold, h, w).zero_()
+        buffer[:, :-1] = input.data[:, 1:, :fold]
+        input.data[:, :, :fold] = buffer
+        buffer.zero_()
+        buffer[:, 1:] = input.data[:, :-1, fold: 2 * fold]
+        input.data[:, :, fold: 2 * fold] = buffer
+        return input
+
+    @staticmethod
+    def backward(ctx, grad_output):
+        # grad_output = grad_output.detach_()
+        fold = ctx.fold_
+        n, t, c, h, w = grad_output.size()
+        buffer = grad_output.data.new(n, t, fold, h, w).zero_()
+        buffer[:, 1:] = grad_output.data[:, :-1, :fold]
+        grad_output.data[:, :, :fold] = buffer
+        buffer.zero_()
+        buffer[:, :-1] = grad_output.data[:, 1:, fold: 2 * fold]
+        grad_output.data[:, :, fold: 2 * fold] = buffer
+        return grad_output, None

opensportslib/models/utils/litebase.py

@@ -0,0 +1,59 @@
+import logging
+import pytorch_lightning as pl
+
+import time
+from SoccerNet.Evaluation.utils import AverageMeter
+
+from oslactionspotting.core.loss.builder import build_criterion
+from oslactionspotting.core.scheduler.builder import build_scheduler
+from oslactionspotting.core.optimizer.builder import build_optimizer
+
+
+class LiteBaseModel(pl.LightningModule):
+    """Parent class for lightning module.
+    Args:
+        cfg_train (dict): Dict of config.
+    """
+
+    def __init__(self, cfg_train):
+
+        super().__init__()
+
+        if cfg_train:
+            logging.info('Build criterion')
+            self.criterion = build_criterion(cfg_train.criterion)
+            logging.info(self.criterion)
+            self.cfg_train = cfg_train
+
+            self.best_loss = 9e99
+
+    def forward(self, inputs):
+        return self.model(inputs)
+
+    def on_train_epoch_start(self):
+        self.batch_time, self.data_time, self.losses, self.end = self.pre_loop()
+
+    def on_validation_epoch_start(self):
+        self.batch_time, self.data_time, self.losses, self.end = self.pre_loop()
+
+    def on_train_epoch_end(self):
+        print("")
+        self.losses_avg = self.losses.avg
+
+    def on_fit_end(self) -> None:
+        return self.best_state
+
+    def configure_optimizers(self):
+        logging.info('Build optimizer')
+        self.optimizer = build_optimizer(self.parameters(), self.cfg_train.optimizer)
+        logging.info(self.optimizer)
+        logging.info('Build Scheduler')
+        self.scheduler = build_scheduler(self.optimizer, self.cfg_train.scheduler)
+        return self.optimizer
+
+    def pre_loop(self):
+        batch_time = AverageMeter()
+        data_time = AverageMeter()
+        losses = AverageMeter()
+        end = time.time()
+        return batch_time, data_time, losses, end

opensportslib/models/utils/modules.py

@@ -0,0 +1,120 @@
+"""
+Copyright 2022 James Hong, Haotian Zhang, Matthew Fisher, Michael Gharbi,
+Kayvon Fatahalian
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+this list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors
+may be used to endorse or promote products derived from this software without
+specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+"""
+import math
+import torch
+import torch.nn as nn
+import torch.nn.functional as F
+
+from opensportslib.models.utils.common import SingleStageTCN
+from .impl.asformer import MyTransformer
+
+
+class FCPrediction(nn.Module):
+
+    def __init__(self, feat_dim, num_classes):
+        super().__init__()
+        self._fc_out = nn.Linear(feat_dim, num_classes)
+
+    def forward(self, x):
+        batch_size, clip_len, _ = x.shape
+        return self._fc_out(x.reshape(batch_size * clip_len, -1)).view(
+            batch_size, clip_len, -1
+        )
+
+
+class GRUPrediction(nn.Module):
+
+    def __init__(self, feat_dim, num_classes, hidden_dim, num_layers=1):
+        super().__init__()
+        self._gru = nn.GRU(
+            feat_dim,
+            hidden_dim,
+            num_layers=num_layers,
+            batch_first=True,
+            bidirectional=True,
+        )
+        self._fc_out = FCPrediction(2 * hidden_dim, num_classes)
+        self._dropout = nn.Dropout()
+
+    def forward(self, x):
+        y, _ = self._gru(x)
+        return self._fc_out(self._dropout(y))
+
+
+class TCNPrediction(nn.Module):
+
+    def __init__(self, feat_dim, num_classes, num_stages=1, num_layers=5):
+        super().__init__()
+
+        self._tcn = SingleStageTCN(feat_dim, 256, num_classes, num_layers, True)
+        self._stages = None
+        if num_stages > 1:
+            self._stages = nn.ModuleList(
+                [
+                    SingleStageTCN(num_classes, 256, num_classes, num_layers, True)
+                    for _ in range(num_stages - 1)
+                ]
+            )
+
+    def forward(self, x):
+        x = self._tcn(x)
+        if self._stages is None:
+            return x
+        else:
+            outputs = [x]
+            for stage in self._stages:
+                x = stage(F.softmax(x, dim=2))
+                outputs.append(x)
+            return torch.stack(outputs, dim=0)
+
+
+class ASFormerPrediction(nn.Module):
+
+    def __init__(self, feat_dim, num_classes, num_decoders=3, num_layers=5):
+        super().__init__()
+
+        r1, r2 = 2, 2
+        num_f_maps = 64
+        self._net = MyTransformer(
+            num_decoders,
+            num_layers,
+            r1,
+            r2,
+            num_f_maps,
+            feat_dim,
+            num_classes,
+            channel_masking_rate=0.3,
+        )
+
+    def forward(self, x):
+        B, T, D = x.shape
+        return self._net(
+            x.permute(0, 2, 1), torch.ones((B, 1, T), device=x.device)
+        ).permute(0, 1, 3, 2)