Prostate segmentation algorithm using dyadic wavelet transform and discrete dynamic contour
Bibliographic record
Abstract
Knowing the location and the volume of the prostate is important for ultrasound-guided prostate brachytherapy, a commonly used prostate cancer treatment method. The prostate boundary must be segmented before a dose plan can be obtained. However, manual segmentation is arduous and time consuming. This paper introduces a semi-automatic segmentation algorithm based on the dyadic wavelet transform (DWT) and the discrete dynamic contour (DDC). A spline interpolation method is used to determine the initial contour based on four user-defined initial points. The DDC model then refines the initial contour based on the approximate coefficients and the wavelet coefficients generated using the DWT. The DDC model is executed under two settings. The coefficients used in these two settings are derived using smoothing functions with different sizes. A selection rule is used to choose the best contour based on the contours produced in these two settings. The accuracy of the final contour produced by the proposed algorithm is evaluated by comparing it with the manual contour outlined by an expert observer. A total of 114 2D TRUS images taken for six different patients scheduled for brachytherapy were segmented using the proposed algorithm. The average difference between the contour segmented using the proposed algorithm and the manually outlined contour is less than 3 pixels.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| 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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".