Siegel E L, Reiner B I
Department of Diagnostic Radiology, University of Maryland School of Medicine, Baltimore, USA.
J Digit Imaging. 1998 May;11(2):94-9. doi: 10.1007/BF03168731.
Picture archiving and communications systems (PACS) utilize short- and long-term storage to provide both rapid retrieval and large storage capacity. Owing to the practical limitations imposed on the size of the much faster short-term storage, it is important to use an effective algorithm in the retrieval of comparison images from long to short-term storage. A strategy must be used to maximize the likelihood that the relevant historic images have been previously retrieved into short-term memory. Data were collected with a database consisting of 754 consecutive examinations and 7,723 associated historic studies. The most frequent number of previous examinations was zero (11% of patients). In 45% of cases, no previous matching examinations had been performed. Two basic strategies of image retrieval were evaluated. The first algorithm retrieved the last n studies in chronological order. The second strategy tested was retrieval based on a defined interval of time. This strategy was found to be less efficient. By using the former strategy, a 91% success rate (defined as successful retrieval of the previous matching exam) was achieved with retrieval of only 30% of the prior exams. The second approach required retrieval of 70% of the prior exams to achieve a 90% success rate for the previous matching exam. However, the data from this latter strategy suggest that examinations are often ordered in clusters. Thus, there was found to be a 72% likelihood that a previous matching exam, if present, would available on a PACS after only 1 week of operation, and an 80% chance after only 1 month of operation. The data therefore suggest that digitization of film in a new PACS environment might not be necessary owing to the relatively short period of time required to populate the database with historical studies.
图像存档与通信系统(PACS)利用短期和长期存储来实现快速检索和大容量存储。由于更快的短期存储在大小上存在实际限制,因此在从长期存储到短期存储中检索对比图像时使用有效的算法非常重要。必须采用一种策略来最大化相关历史图像先前已被检索到短期内存中的可能性。我们使用一个包含754次连续检查和7723项相关历史研究的数据库收集了数据。先前检查次数最多的情况是零次(占患者的11%)。在45%的病例中,之前没有进行过匹配检查。我们评估了两种基本的图像检索策略。第一种算法按时间顺序检索最后n项研究。测试的第二种策略是基于定义的时间间隔进行检索。结果发现这种策略效率较低。通过使用前一种策略,仅检索30%的先前检查就能实现91%的成功率(定义为成功检索到先前匹配的检查)。第二种方法需要检索70%的先前检查才能使先前匹配检查的成功率达到90%。然而,后一种策略的数据表明检查通常是成组进行排序的。因此,发现如果存在先前匹配的检查,在PACS运行仅1周后有72%的可能性可以获取,运行仅1个月后有80%的可能性。因此,数据表明在新的PACS环境中胶片数字化可能没有必要,因为用历史研究填充数据库所需的时间相对较短。