Segmentation and classification of hippocampal subregions using multi-task generative adversarial networks.
The 6 matches
- [1] § Methodology › Benchmark dataset ↔ mtugan/dataset.py, lines 9–105 · score 0.73 · horizontal flipping, brightness, elastic, nearest, resized, augmentation
- [2] § Methodology › Model architecture › Loss functions › Generator loss ↔ mtugan/losses.py, lines 25–30 · score 0.69 · focal loss, segmentation loss, Dice loss, generator loss, weighted, class
- [3] § Methodology › Model architecture › Loss functions › Discriminator loss ↔ mtugan/losses.py, lines 32–38 · score 0.66 · gradient penalty, discriminator loss, Dice loss, fake
- [4] § Methodology › Evaluation metrics ↔ main.py, lines 30–98 · score 0.56 · class metrics, F1 score, hippocampal subregions, Precision, Recall, CA1
- [5] § Methodology › Model architecture › The generator ↔ mtugan/gan.py, lines 7–66 · score 0.56 · LeakyReLU, padding, Max, stride, blocks, bottleneck
- [6] § Methodology › Training protocol ↔ mtugan/train.py, lines 34–119 · score 0.51 · Adam, warm, phase, optimizers, trained, discriminator
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 39 lines · 1.9 KB · MIT · 2 matches
- import torch
- import torch.nn as nn
- import torch.nn.functional as F
- from mtugan.utils import gradient_penalty
- # Loss Functions
- def dice_loss(y_true, y_pred, epsilon=1e-8):
- numerator = 2 * torch.sum(y_true * y_pred, dim=(1, 2, 3))
- denominator = torch.sum(y_true + y_pred, dim=(1, 2, 3)) + epsilon
- return 1 - (numerator / denominator).mean()
- def focal_loss(y_pred, y_true, gamma=2.0, alpha=None, reduction='mean'):
- log_pt = F.log_softmax(y_pred, dim=1)
- pt = torch.exp(log_pt)
- y_true_onehot = F.one_hot(y_true, num_classes=3).float()
- if alpha is not None:
- focal_weight = alpha[y_true] * (1 - pt[range(len(y_true)), y_true]) ** gamma
- else:
- focal_weight = (1 - pt[range(len(y_true)), y_true]) ** gamma
- loss = -focal_weight * log_pt[range(len(y_true)), y_true]
- return loss.mean() if reduction == 'mean' else loss.sum()
- def generator_loss(y_true_seg, y_pred_seg, fake_output, y_true_cls, y_pred_cls, class_weights,
- lambda_dice=2.0, lambda_adv=0.1, lambda_cls=0.3): # Adjusted to prioritize segmentation
- seg_loss = dice_loss(y_true_seg, y_pred_seg)
- adv_loss = nn.BCELoss()(fake_output, torch.ones_like(fake_output))
- cls_loss = focal_loss(y_pred_cls, y_true_cls, alpha=class_weights)
- return lambda_dice * seg_loss + lambda_adv * adv_loss + lambda_cls * cls_loss
- def discriminator_loss(discriminator, real_output, fake_output, ground_truth, lambda_dice=0.5, lambda_bce=0.5, lambda_gp=1.0, device='cuda'):
- dice_real = dice_loss(ground_truth, real_output)
- bce_real = nn.BCELoss()(real_output, torch.ones_like(real_output))
- dice_fake = dice_loss(ground_truth, fake_output)
- bce_fake = nn.BCELoss()(fake_output, torch.zeros_like(fake_output))
- gp = gradient_penalty(discriminator, ground_truth, fake_output.detach(), device)
- return lambda_dice * (dice_real + dice_fake) / 2 + lambda_bce * (bce_real + bce_fake) / 2 + lambda_gp * gp
losses.py at commit bc6784d, under MIT · at the source
Overview
- Center for Computational and Integrative Biology, Rutgers University,Camden, NJ 08103 USA
- Department of Biology, Rutgers University,Camden, NJ 08103 USA
- Department of Computer Science, Rutgers University,Camden, NJ 08103 USA
- Rutgers Cancer Institute, Rutgers University,New Brunswick, NJ 08901 USA
Abstract
The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.
Repository
Its files are read in the Code ↔ Paper reader above, with 6 matches between paragraphs and lines of code.
MLBC-lab/MT-UGAN
bc6784dc81deabf722a4a2416c3decd040511e82, 3 October 2025Availability: 1 check, the latest on 28 September 2026: the link answers
- 28 September 2026: the link answers
10 files
- main.py, Python, 99 lines, 1 match
- mtugan/
__init__.py , Python, 5 lines - mtugan/
config.py , Python, 42 lines - mtugan/
dataset.py , Python, 112 lines, 1 match - mtugan/
gan.py , Python, 108 lines, 1 match - mtugan/
losses.py , Python, 39 lines, 2 matches - mtugan/
train.py , Python, 119 lines, 1 match - mtugan/
utils.py , Python, 165 lines - LICENSE, License, 21 lines
- README.md, Text, 12 lines
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 8 scripts, each with its path and the digest of its content;
- 6 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Code and data availability statement
The paper has a code and data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:
- no repository, dataset or request procedure was recognized in it
Read it in the paper: doi.org/10.1038/s41598-026-50475-5.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 28 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 4 authors, 6 keywords, 8 MeSH terms, 1 funder, 25 references.
Cite
This paper
Azim, S. M., Kumar, R., Corbett, B., & Dehzangi, I. (2026). Segmentation and classification of hippocampal subregions using multi-task generative adversarial networks. Scientific reports, 16(1), 24430. https://
BibTeX
@article{azim2026segment
author = {Azim, Sayed Mehedi and Kumar, Renuka and Corbett, Brian and Dehzangi, Iman},
title = {{Segmentation and classification of hippocampal subregions using multi-task generative adversarial networks}},
journal = {Scientific reports},
year = {2026},
month = may,
volume = {16},
number = {1},
pages = {24430},
publisher = {Nature Publishing Group},
issn = {2045-2322},
doi = {10.1038/
url = {https://
pmid = {42209557},
pmcid = {PMC13448715}
}
RIS
TY - JOUR
AU - Azim, Sayed Mehedi
AU - Kumar, Renuka
AU - Corbett, Brian
AU - Dehzangi, Iman
TI - Segmentation and classification of hippocampal subregions using multi-task generative adversarial networks
T2 - Scientific reports
J2 - Sci Rep
PY - 2026
DA - 2026/
VL - 16
IS - 1
SP - 24430
SN - 2045-2322
PB - Nature Publishing Group
DO - 10.1038/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1038/
"type": "article-journal",
"title": "Segmentation and classification of hippocampal subregions using multi-task generative adversarial networks",
"container-title": "Scientific reports",
"author": [
{
"family": "Azim",
"given": "Sayed Mehedi"
},
{
"family": "Kumar",
"given": "Renuka"
},
{
"family": "Corbett",
"given": "Brian"
},
{
"family": "Dehzangi",
"given": "Iman"
}
],
"container-title-short":
"volume": "16",
"issue": "1",
"page": "24430",
"DOI": "10.1038/
"PMID": "42209557",
"PMCID": "PMC13448715",
"ISSN": "2045-2322",
"publisher": "Nature Publishing Group",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
28
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1038/s41598-026-57519-w [code]
- Automated segmentation of neurons and spinal cord structures in immunofluorescence images using SpineDL.Journal: Scientific reportsIn common: OpenCV, Pillow, PyTorch, 4 other tools, histology / microscopy, methods / tools, mouse, 1 reference
- [2] doi:10.1007/s00429-026-03166-w [code]
- Autoencoders for unsupervised analysis of rat myeloarchitecture.Journal: Brain structure & functionIn common: OpenCV, Pillow, PyTorch, 4 other tools, histology / microscopy, 1 reference
- [3] doi:10.1038/s41598-026-43798-w [code]
- A Machine learning pipeline to investigate tissue ingrowth in cerebral aneurysms using preclinical animal models.Journal: Scientific reportsIn common: OpenCV, Pillow, PyTorch, 2 other tools, histology / microscopy, methods / tools, mouse, 1 reference
- [4] doi:10.1016/j.patter.2026.101538 [code]
- A multi-modal foundation model for brain disease diagnosis and medical imaging.Journal: Patterns (New York, N.Y.)In common: OpenCV, Pillow, PyTorch, 4 other tools, 1 reference
- [5] doi:10.1371/journal.pcbi.1013499 [code]
- VesiclePy: A machine learning vesicle analysis toolbox for volume electron microscopy.Journal: PLoS computational biologyIn common: OpenCV, Pillow, PyTorch, 4 other tools, histology / microscopy, methods / tools
- [6] doi:10.1016/j.isci.2026.116355 [code]
- Tera-MIND: Tera-scale mouse brain simulation via spatial mRNA-guided diffusion.Journal: iScienceIn common: OpenCV, Pillow, PyTorch, 3 other tools, mouse, 1 reference
- [7] doi:10.1038/s41467-026-76045-x [code]
- A manufacturability-inform
ed topology framework for AI-guided design of fibrous network materials. Journal: Nature communicationsIn common: OpenCV, Pillow, PyTorch, 4 other tools, 1 reference - [8] doi:10.1162/imag.a.1207 [code]
- Investigating the temporal dynamics and modeling of mid-level feature representations in humans.Journal: Imaging neuroscience (Cambridge, Mass.)In common: OpenCV, Pillow, PyTorch, 4 other tools, 1 reference
- [9] doi:10.1038/s41593-026-02388-9 [code]
- Hippocampal CA3 connectomics reveals a gradient of mossy fiber inputs and selective feedforward inhibition onto pyramidal cells.Journal: Nature neuroscienceIn common: OpenCV, Pillow, PyTorch, 4 other tools, histology / microscopy, mouse
- [10] doi:10.1038/s41598-026-55136-1 [code]
- CAHA-Net: A novel MR image classification model based on DenseNet incorporating coordinate attention and hybrid augmentation.Journal: Scientific reportsIn common: OpenCV, Pillow, PyTorch, 4 other tools, 1 reference
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 8 scripts, and 6 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:3a77d7ebb5137270…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
