DefED-Net: Deformable Encoder-Decoder Network for Liver and Liver Tumor Segmentation
Bibliographic record
Abstract
Deep convolutional neural networks have been widely used for medical image segmentation due to their superiority in feature learning. Although these networks are successful for simple object segmentation tasks, they suffer from two problems for liver and liver tumor segmentation in CT images. One is that convolutional kernels of fixed geometrical structure are unmatched with livers and liver tumors of irregular shapes. The other is that pooling and strided convolutional operations easily lead to the loss of spatial contextual information of images. To address these issues, we propose a deformable encoder-decoder network (DefED-Net) for liver and liver tumor segmentation. The proposed network makes two contributions. The first is that the deformable convolution is used to enhance the feature representation capability of DefED-Net, which can help the network to learn convolution kernels with adaptive spatial structuring information. The second is that we design a Ladder-atrous-spatial-pyramid-pooling module using multi-scale dilation rate (Ladder-ASPP) and apply the module to learn better context information than the atrous spatial pyramid pooling (ASPP) for CT image segmentation. The proposed DefED-Net is evaluated on two public benchmark datasets, the LiTS and the 3DIRCADb. Experiments demonstrate that the DefED-Net has better capability of feature representation as well as provides higher accuracy on liver and liver tumor segmentation than stateof-the art networks. The available code of DefED-Net we propose can be found from https://github.com/SUST-reynole/DefED-Net.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".