Segmentation of Magnetic Resonance Brain Images Using Watershed Algorithm \n
Bibliographic record
Abstract
An important area of current research is obtaining more information about \nbrain structure and function. Brain tissue is particularly complex structure and \nits segmentation is an important step for studies intemporal change, detection \nof morphology as well as visualization in surgical planning, volume estimation \nof objects of interest, and more could benefit enormously from segmentation. \nMagnetic resonance imaging (MRI) is a noninvasive method for producing \ntomographic images of the human brain. Its Segmentation is problematic due to \nradio frequency inhomogeneity, caused by inaccuracies in the magnetic \nresonance scanner and by movement of the patient which produce intensity \nvariation over the image, and that makes every segmentation method fail. \nThe aim of this work is the development of a segmentation technique for \nefficient and accurate segmentation of MR brain images. The proposed \n \ntechnique based on the watershed algorithm, which is applied to the gradient \nmagnitude of the MRI data. The watershed segmentation algorithm is a very \npowerful segmentation tool, but it also has difficulty in segmenting MR images \ndue to noise and shading effect present. The known drawback of the watershed \nalgorithm, over-segmentation, is strongly reduced by making the system \ninteractive (semi-automatic), by placing markers manually in the region of \ninterest which is the brain as well as in the background. The background \nmarkers are needed to define the external contours of the brain. The final part \nof the segmentation takes place once the gradient magnitudes of the MRI data \nare calculated and markers have been obtained from each region. Catchment’s \nbasins originate from each of the markers, resulting in a common line of \nseparation between brain and surrounding. \nThe proposed segmentation technique is tested and evaluated on brain images \ntaken from brainweb. Brainweb is maintained by the Brain Imaging Center at \nthe Montreal Neurological Institute. The images had a combination of noise and \nintensity non-uniformity (INU). By making the system semi-automatic, a good \nsegmentation result was obtained under all the conditions (different noise \nlevels and intensity non uniformity). It is also proven that the placement of \ninternal and external markers into regions of interest (i.e. making the system \ninteractive) can easily cope with the over-segmentation problem of the \nwatershed.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.004 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".