A practical fast method for medical imaging transmission based on the DICOM protocol
Bibliographic record
Abstract
The standard format for medical imaging storage and transmission is Digital Imaging and Communications in Medicine (DICOM). Nowadays, and specifically with large amounts of medical images acquired by modern modalities, the need for fast data transmission between DICOM application entities is evident. In some applications, particularly those aiming to provide real-time services, this demand is critical. This paper introduces a method which provides a fast and simple way of image transmission by utilizing the DICOM protocol. The current implementations of DICOM protocol usually care more about connecting DICOM application entities. In the process of connecting two DICOM application entities, the format of the transmission (Transfer Syntax) is agreed upon. In this crucial step, the two entities choose an encoding that is supported by both and if one entity does not support compression the other one cannot use that option. In the proposed method, we use a pair of interfaces to deal with this issue and provide a fast method for medical data transmission between any two DICOM application entities. These interfaces use both compression and multi-threading techniques to transfer the images. The interfaces can be used without any change to the current DICOM application entities. In fact, the interfaces listen to the incoming messages from the DICOM application entities, intercept the messages, and carry out the data transmission. The experimental results show about 22% speed-up in Local Area Networks (LANs) and about 13-14 times speed-up in Wide Area Networks (WANs).
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".