Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465440
G. Myklebust, J. G. Solheim, E. Steen
We present the results of parallel implementations of Kohonen's self-organizing maps using data partitioning. Two algorithms are implemented, a pure data partitioning algorithm and a combined data- and network-partitioning algorithm. The performance of the algorithms is far better for small neural networks than the performance of our previous SOM implementations. The SOM model can be used for visualization of MR images, an application with a small number of neurons. Using one of the proposed algorithms, the performance of this application is increased by over 200%. The convergence rate of the proposed algorithm and the original algorithm is shown to be similar when the frequency of the weight update is properly selected.<>
{"title":"Speeding up small sized self-organizing maps for use in visualization of multispectral medical images","authors":"G. Myklebust, J. G. Solheim, E. Steen","doi":"10.1109/CBMS.1995.465440","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465440","url":null,"abstract":"We present the results of parallel implementations of Kohonen's self-organizing maps using data partitioning. Two algorithms are implemented, a pure data partitioning algorithm and a combined data- and network-partitioning algorithm. The performance of the algorithms is far better for small neural networks than the performance of our previous SOM implementations. The SOM model can be used for visualization of MR images, an application with a small number of neurons. Using one of the proposed algorithms, the performance of this application is increased by over 200%. The convergence rate of the proposed algorithm and the original algorithm is shown to be similar when the frequency of the weight update is properly selected.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"12 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130491899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465412
M. Tasier, J. Lethor, Y. Granjon
Presents a system that allows the acquisition of 2D echographical images that can later be used for the reconstruction of a 3D representation of the human heart. The acquisition process is automatic, so that no interaction by the operator is necessary. The system is based on the so-called 'rotational method' and is conceived such that it can be used with virtually any existing echograph. The 2D images are provided in a digitized form and can be used instantly for further processing.<>
{"title":"An automatic data acquisition system for 3D reconstruction in echocardiography","authors":"M. Tasier, J. Lethor, Y. Granjon","doi":"10.1109/CBMS.1995.465412","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465412","url":null,"abstract":"Presents a system that allows the acquisition of 2D echographical images that can later be used for the reconstruction of a 3D representation of the human heart. The acquisition process is automatic, so that no interaction by the operator is necessary. The system is based on the so-called 'rotational method' and is conceived such that it can be used with virtually any existing echograph. The 2D images are provided in a digitized form and can be used instantly for further processing.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123220043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465431
S. Rovetta, R. Zunino, L. Buffrini, G. Rovetta
In this paper, the application of neural network algorithms to the study of Lyme borreliosis is addressed. Three different methods are studied: self organizing maps, neural gas networks and a new approach currently under development called circular backpropagation. The aim of the work is to compare the three methods in view of their use as analysis tools, to explore the inherent structure of the input data. The same procedure has been previously applied to feedforward neural models; the present work focuses on a particular form of knowledge representation, based on a set of prototypal examples rather than if-then rules. The Lyme data has been chosen as a case study and represents a common ground to allow the comparison of the different methods.<>
{"title":"Prototyping neural networks learn Lyme borreliosis","authors":"S. Rovetta, R. Zunino, L. Buffrini, G. Rovetta","doi":"10.1109/CBMS.1995.465431","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465431","url":null,"abstract":"In this paper, the application of neural network algorithms to the study of Lyme borreliosis is addressed. Three different methods are studied: self organizing maps, neural gas networks and a new approach currently under development called circular backpropagation. The aim of the work is to compare the three methods in view of their use as analysis tools, to explore the inherent structure of the input data. The same procedure has been previously applied to feedforward neural models; the present work focuses on a particular form of knowledge representation, based on a set of prototypal examples rather than if-then rules. The Lyme data has been chosen as a case study and represents a common ground to allow the comparison of the different methods.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124080534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465411
Z. Mou-Yan, R. Unbehauen
The aperiodic matrix deconvolution model has been shown to have a better condition number than the popularly used circulant matrix model. In this paper, we illustrate that the restoration algorithms in a weighted space using the block circulant matrices can be modified into the aperiodic model based algorithms and we have more possibilities to reduce the computational cost for the modified algorithms. Examples are used to show the modified algorithm. We address that more interesting is the use of the model to develop some new algorithms, for example, for the unknown blur case.<>
{"title":"A weighted space restoration algorithm using the aperiodic model of deconvolution","authors":"Z. Mou-Yan, R. Unbehauen","doi":"10.1109/CBMS.1995.465411","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465411","url":null,"abstract":"The aperiodic matrix deconvolution model has been shown to have a better condition number than the popularly used circulant matrix model. In this paper, we illustrate that the restoration algorithms in a weighted space using the block circulant matrices can be modified into the aperiodic model based algorithms and we have more possibilities to reduce the computational cost for the modified algorithms. Examples are used to show the modified algorithm. We address that more interesting is the use of the model to develop some new algorithms, for example, for the unknown blur case.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131791215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465418
B. Williamson
During the past two decades, new imaging modalities have significantly changed the practice of diagnostic radiology. Although new imaging modalities will probably continue to be introduced the major change in diagnostic radiology in the next decade is likely to involve changes in service delivery by electronic image management systems. This paper reviews some of the factors favoring the expansion of electronic image management systems, the capabilities of such systems, and some of the issues that must be resolved before these systems can reach their full potential.<>
{"title":"Electronic image management in radiology","authors":"B. Williamson","doi":"10.1109/CBMS.1995.465418","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465418","url":null,"abstract":"During the past two decades, new imaging modalities have significantly changed the practice of diagnostic radiology. Although new imaging modalities will probably continue to be introduced the major change in diagnostic radiology in the next decade is likely to involve changes in service delivery by electronic image management systems. This paper reviews some of the factors favoring the expansion of electronic image management systems, the capabilities of such systems, and some of the issues that must be resolved before these systems can reach their full potential.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"38 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113939270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465425
Y. Shieh, G. H. Roberson, S. Mitra
An essential component that enables the progressive transition from the traditional film-based radiology to a filmless operation is the film digitizer. There are two kinds of film digitizers available on the market-laser scanners and CCD film digitizers. Their performances are compared in this paper. The operational characteristic, and thereby the performance, of a CCD digitizer is determined by a number of parameters. Adaptive calibration of these parameters is possible in order to fine-tune the CCD digitizer to better serve the application at hand.<>
{"title":"Enhancement of CCD film digitizer by adaptive calibration","authors":"Y. Shieh, G. H. Roberson, S. Mitra","doi":"10.1109/CBMS.1995.465425","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465425","url":null,"abstract":"An essential component that enables the progressive transition from the traditional film-based radiology to a filmless operation is the film digitizer. There are two kinds of film digitizers available on the market-laser scanners and CCD film digitizers. Their performances are compared in this paper. The operational characteristic, and thereby the performance, of a CCD digitizer is determined by a number of parameters. Adaptive calibration of these parameters is possible in order to fine-tune the CCD digitizer to better serve the application at hand.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124077187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465453
L. Estevez, N. Kehtarnavaz
The presence of microcalcifications in mammograms provides an early indication of possible breast cancer. Because of the difficulty associated with visual identification of microcalcifications and the large volume of mammograms read per day, the radiologist stands a good chance of missing some small microcalcification clusters. Although several computer-assisted programs have been developed for the automatic detection of microcalcifications in mammograms, they often generate too many false positives. This paper presents a computer-assisted enhancement technique which is capable of coping with false positive samples. More specifically, a general-purpose clustering algorithm, called Issac (Interactive Selective and Adaptive Clustering), has been developed which achieves a compromise between sensitivity and generalization attributes of existing clustering algorithms. Issac comprises two parts: (i) selective clustering and (ii) interactive adaptation. The first part reduces the number of false positives by identifying sensitive sample domains in the feature space. The second part allows the radiologist to improve results by interactively identifying additional false positive or true negative samples. The clinical evaluation of the results has indicated that the developed enhancement technique has the potential of being an effective mechanism to bring microcalcification areas to the attention of the radiologist during a routine reading session of mammograms. Further clinical evaluation is being carried out for the purpose of full-scale clinical deployment.<>
{"title":"Computer assisted enhancement of mammograms for detection of microcalcifications","authors":"L. Estevez, N. Kehtarnavaz","doi":"10.1109/CBMS.1995.465453","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465453","url":null,"abstract":"The presence of microcalcifications in mammograms provides an early indication of possible breast cancer. Because of the difficulty associated with visual identification of microcalcifications and the large volume of mammograms read per day, the radiologist stands a good chance of missing some small microcalcification clusters. Although several computer-assisted programs have been developed for the automatic detection of microcalcifications in mammograms, they often generate too many false positives. This paper presents a computer-assisted enhancement technique which is capable of coping with false positive samples. More specifically, a general-purpose clustering algorithm, called Issac (Interactive Selective and Adaptive Clustering), has been developed which achieves a compromise between sensitivity and generalization attributes of existing clustering algorithms. Issac comprises two parts: (i) selective clustering and (ii) interactive adaptation. The first part reduces the number of false positives by identifying sensitive sample domains in the feature space. The second part allows the radiologist to improve results by interactively identifying additional false positive or true negative samples. The clinical evaluation of the results has indicated that the developed enhancement technique has the potential of being an effective mechanism to bring microcalcification areas to the attention of the radiologist during a routine reading session of mammograms. Further clinical evaluation is being carried out for the purpose of full-scale clinical deployment.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133691405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465429
C. Martin, L. Schovanec
A muscular control model is examined in order to determine possible fatigue effects on the monosynaptic reflex. The muscle dynamics and neural spindle receptors are represented in standard fashion as 4-element viscoelastic models. A theoretical derivation of the afferent spindle output is given. This afferent information from the muscle-spindle and delay effects are incorporated into the feedback loop. Fatigue effects upon system performance and stability are illustrated by means of numerical simulations.<>
{"title":"Fatigue effects in muscular control","authors":"C. Martin, L. Schovanec","doi":"10.1109/CBMS.1995.465429","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465429","url":null,"abstract":"A muscular control model is examined in order to determine possible fatigue effects on the monosynaptic reflex. The muscle dynamics and neural spindle receptors are represented in standard fashion as 4-element viscoelastic models. A theoretical derivation of the afferent spindle output is given. This afferent information from the muscle-spindle and delay effects are incorporated into the feedback loop. Fatigue effects upon system performance and stability are illustrated by means of numerical simulations.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131694879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465432
G. Lakhani, V. Ayyagari
Deals with the Huffman encoding phase of two well-known compression encoders, one that of the baseline algorithm proposed by JPEG for the compression of still images, and the other that of the H.261 based video encoder. We identify two types of minor redundancies in the input to the encoding phase, and present alternative Huffman code tables. Simulation results on still picture compressions indicate that the proposed redundancy reduction leads to an improvement of the order of 3.35% in the size of the image compressed at 75% quality level, and 5.3% when compressed at the 50% quality level, on the average.<>
{"title":"Improved Huffmann code tables for still and video image encoders","authors":"G. Lakhani, V. Ayyagari","doi":"10.1109/CBMS.1995.465432","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465432","url":null,"abstract":"Deals with the Huffman encoding phase of two well-known compression encoders, one that of the baseline algorithm proposed by JPEG for the compression of still images, and the other that of the H.261 based video encoder. We identify two types of minor redundancies in the input to the encoding phase, and present alternative Huffman code tables. Simulation results on still picture compressions indicate that the proposed redundancy reduction leads to an improvement of the order of 3.35% in the size of the image compressed at 75% quality level, and 5.3% when compressed at the 50% quality level, on the average.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120840346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1995-06-09DOI: 10.1109/CBMS.1995.465448
Margaret G. E. Peterson
There are occasions when an implanted product which is on the market starts to show an unacceptable failure rate or mode of failure. Inevitable questions arise about the number and frequency of failures in this population of patients. This paper discusses the methods available statistically to examine the problem when the rate of failure is low but unacceptable. The estimate made is highly influenced by the reason for the requested estimate.<>
{"title":"The probability of failure depends on who is asking [implantable biomedical devices]","authors":"Margaret G. E. Peterson","doi":"10.1109/CBMS.1995.465448","DOIUrl":"https://doi.org/10.1109/CBMS.1995.465448","url":null,"abstract":"There are occasions when an implanted product which is on the market starts to show an unacceptable failure rate or mode of failure. Inevitable questions arise about the number and frequency of failures in this population of patients. This paper discusses the methods available statistically to examine the problem when the rate of failure is low but unacceptable. The estimate made is highly influenced by the reason for the requested estimate.<<ETX>>","PeriodicalId":254366,"journal":{"name":"Proceedings Eighth IEEE Symposium on Computer-Based Medical Systems","volume":"70 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124252033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：