Pub Date : 1998-07-13DOI: 10.1109/NAECON.1998.710119
M. Goodman
The position and identification information the E-3 Airborne Warning and Control System (AWACS) supplies to a myriad of off-board users is critical to future success on the battlefield. AWACS has progressively become more and more integrated into all military operations. As a direct result of its critical function, the expectations for the crews of AWACS have become progressively more demanding. With the advent of a more extensive use of the Joint Tactical Information Distribution System (JTIDS) to share large quantities of battlefield information among Combat Air Force (CAF) combatants, there has been a marked increase in the need to use the position and identification information resident on AWACS. Programmed enhancements to the E-3 mission systems promise to offer a marked increase in onboard identification capabilities. Improvements to the AWACS radar and the processing of onboard data will help produce more accurate and timely position and identification information. However, there are a number of real problems within the AWACS community that must be properly addressed and quickly corrected before they significantly detract from the capacity of the AWACS community to positively influence US military operations on the battlefields of the future. Without near-term resolution to these problems, the E-3 AWACS may falter in its ability to be the centerpiece for CAF command, control, and identification.
{"title":"E-3 AWACS: Centerpiece for CAF command, control, and identification?","authors":"M. Goodman","doi":"10.1109/NAECON.1998.710119","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710119","url":null,"abstract":"The position and identification information the E-3 Airborne Warning and Control System (AWACS) supplies to a myriad of off-board users is critical to future success on the battlefield. AWACS has progressively become more and more integrated into all military operations. As a direct result of its critical function, the expectations for the crews of AWACS have become progressively more demanding. With the advent of a more extensive use of the Joint Tactical Information Distribution System (JTIDS) to share large quantities of battlefield information among Combat Air Force (CAF) combatants, there has been a marked increase in the need to use the position and identification information resident on AWACS. Programmed enhancements to the E-3 mission systems promise to offer a marked increase in onboard identification capabilities. Improvements to the AWACS radar and the processing of onboard data will help produce more accurate and timely position and identification information. However, there are a number of real problems within the AWACS community that must be properly addressed and quickly corrected before they significantly detract from the capacity of the AWACS community to positively influence US military operations on the battlefields of the future. Without near-term resolution to these problems, the E-3 AWACS may falter in its ability to be the centerpiece for CAF command, control, and identification.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114811767","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710203
R. Baucom, T. A. DeLong, D.T. Smith, B.W. Johnson, J. Hanna
There is a need for simulator-independent, VHDL-based fault simulation. Existing techniques for VHDL-based fault simulation are reviewed. Robust, a simulator-independent fault simulator tool, is described. Slow simulation speed is identified as one limitation of the current Robust tool and distributed simulation on a network of workstations is identified as a feasible way to improve its performance. Previous network-of-workstations fault simulation experiments are reviewed. Current efforts to enhance the Robust tool using SAVANT ate described. A system using Robust (with SAVANT extensions) for fault simulation on a network of workstations is proposed, using the TyVIS VHDL simulation kernel and the Legion distributed processing system.
{"title":"VHDL-based distributed fault simulation using SAVANT","authors":"R. Baucom, T. A. DeLong, D.T. Smith, B.W. Johnson, J. Hanna","doi":"10.1109/NAECON.1998.710203","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710203","url":null,"abstract":"There is a need for simulator-independent, VHDL-based fault simulation. Existing techniques for VHDL-based fault simulation are reviewed. Robust, a simulator-independent fault simulator tool, is described. Slow simulation speed is identified as one limitation of the current Robust tool and distributed simulation on a network of workstations is identified as a feasible way to improve its performance. Previous network-of-workstations fault simulation experiments are reviewed. Current efforts to enhance the Robust tool using SAVANT ate described. A system using Robust (with SAVANT extensions) for fault simulation on a network of workstations is proposed, using the TyVIS VHDL simulation kernel and the Legion distributed processing system.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114420931","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710151
A. Sisti, S. D. Farr
The hierarchy of models, as a conceptual framework, is a sound idea. The ultimate plan is for models and simulations at the various levels in the hierarchy to be able to be reused and interconnected with models and simulations at other levels in the hierarchy. The idea sterns from their very natural desire to increase the accuracy in these higher-level simulations by incorporating the accuracy of the detailed models. Most efforts to date that have endeavored to increase realism have done so by coupling existing detailed codes; also known as "model integration". A better approach would not involve connecting the detailed code(s) with the aggregate simulation, but rather capturing the essence of the detailed codes into a form compatible with the aggregate simulation (in terms of level of complexity), and connect that version. This is the field of research called Model Abstraction, which promises to dramatically improve large-scale simulation accuracy without cost to execution time.
{"title":"Model abstraction techniques: an intuitive overview","authors":"A. Sisti, S. D. Farr","doi":"10.1109/NAECON.1998.710151","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710151","url":null,"abstract":"The hierarchy of models, as a conceptual framework, is a sound idea. The ultimate plan is for models and simulations at the various levels in the hierarchy to be able to be reused and interconnected with models and simulations at other levels in the hierarchy. The idea sterns from their very natural desire to increase the accuracy in these higher-level simulations by incorporating the accuracy of the detailed models. Most efforts to date that have endeavored to increase realism have done so by coupling existing detailed codes; also known as \"model integration\". A better approach would not involve connecting the detailed code(s) with the aggregate simulation, but rather capturing the essence of the detailed codes into a form compatible with the aggregate simulation (in terms of level of complexity), and connect that version. This is the field of research called Model Abstraction, which promises to dramatically improve large-scale simulation accuracy without cost to execution time.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804551","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710209
T. Tuinstra, R. Hardie
Many imaging systems utilize detector arrays that do not sample the scene according to the Nyquist criterion. As a result, the higher spatial frequencies admitted by the optics are aliased. This creates undesirable artifacts in the imagery. Furthermore, the blurring effects of the optics and the finite detector size also degrade the image quality. Several approaches for increasing the sampling rate have been suggested in the literature such as microscanning. Here we propose an algorithm to include the possibility of non-global motion. We show that the motion of rigid objects within the scene is often sufficient to up-sample the object. The experimental results presented illustrate the breakdown of global reconstruction algorithms in the presence of non-global rigid motion. We also present results using the proposed method that treats individual moving objects and background separately. The results include data from an infrared detector.
{"title":"High resolution image reconstruction from digital video by exploitation of non-global motion","authors":"T. Tuinstra, R. Hardie","doi":"10.1109/NAECON.1998.710209","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710209","url":null,"abstract":"Many imaging systems utilize detector arrays that do not sample the scene according to the Nyquist criterion. As a result, the higher spatial frequencies admitted by the optics are aliased. This creates undesirable artifacts in the imagery. Furthermore, the blurring effects of the optics and the finite detector size also degrade the image quality. Several approaches for increasing the sampling rate have been suggested in the literature such as microscanning. Here we propose an algorithm to include the possibility of non-global motion. We show that the motion of rigid objects within the scene is often sufficient to up-sample the object. The experimental results presented illustrate the breakdown of global reconstruction algorithms in the presence of non-global rigid motion. We also present results using the proposed method that treats individual moving objects and background separately. The results include data from an infrared detector.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132762424","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710097
M. Artelli, S. Kramer
In periods of declining budgets, it becomes increasingly important to select the best possible research and development programs to invest in, and then to be able to articulate the rationale for the selection. Competing alternative investments will have a complex tradeoff of costs and diverse benefits, over different time periods and with different levels of certainty. In particular, the Air Force Research Laboratory needs to select which investments to pursue to improve fixed-wing vehicle performance. Multi-objective decision analysis is applied to this problem to produce a decision aid that captures their corporate objectives and allows full analysis of the tradeoffs between alternatives. The decision aid is described in detail and a brief example of its use is presented.
{"title":"A decision aid for selecting among alternative research and development investments","authors":"M. Artelli, S. Kramer","doi":"10.1109/NAECON.1998.710097","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710097","url":null,"abstract":"In periods of declining budgets, it becomes increasingly important to select the best possible research and development programs to invest in, and then to be able to articulate the rationale for the selection. Competing alternative investments will have a complex tradeoff of costs and diverse benefits, over different time periods and with different levels of certainty. In particular, the Air Force Research Laboratory needs to select which investments to pursue to improve fixed-wing vehicle performance. Multi-objective decision analysis is applied to this problem to produce a decision aid that captures their corporate objectives and allows full analysis of the tradeoffs between alternatives. The decision aid is described in detail and a brief example of its use is presented.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131817050","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710128
J. Montgomery, R. Sanderson, B. L. Clinton, F. Baxley
Two-color mid-infrared background measurements of terrain were completed in the fall of 1997. The data was collected using a 256/spl times/256 InSb sensor with optimized two color filter wheel integrated with the optics. This configuration allowed the collection of temporally correlated, radiometrically calibrated data in two spectral bands that was compared to background imagery taken with a different sensor in the summer of 1996. The data collections were taken from a modified Cessna 172 at medium and low altitudes. The new sensor possesses higher spatial resolution, greater sensitivity, larger field of regard, and optimized spectral bands to provide excellent capability for collection of meaningful phenomenological data. The data was analyzed to assess the new inter-band correlation and compared to collections made last year with an earlier sensor. Analysis of the collected data using embedded targets was accomplished in order to characterize the discrimination potential of the modified bands.
{"title":"Characterization of two color mid-infrared measurements","authors":"J. Montgomery, R. Sanderson, B. L. Clinton, F. Baxley","doi":"10.1109/NAECON.1998.710128","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710128","url":null,"abstract":"Two-color mid-infrared background measurements of terrain were completed in the fall of 1997. The data was collected using a 256/spl times/256 InSb sensor with optimized two color filter wheel integrated with the optics. This configuration allowed the collection of temporally correlated, radiometrically calibrated data in two spectral bands that was compared to background imagery taken with a different sensor in the summer of 1996. The data collections were taken from a modified Cessna 172 at medium and low altitudes. The new sensor possesses higher spatial resolution, greater sensitivity, larger field of regard, and optimized spectral bands to provide excellent capability for collection of meaningful phenomenological data. The data was analyzed to assess the new inter-band correlation and compared to collections made last year with an earlier sensor. Analysis of the collected data using embedded targets was accomplished in order to characterize the discrimination potential of the modified bands.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127681730","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710105
R. Mitchell, J. Westerkamp
The statistical feature-based (StaF) classifier is presented for robust high range resolution (HRR) radar moving ground target identification. The target features used for classification are the amplitude and location of HRR signature peaks. The StaF classifier was initially developed for air target identification with the primary goal of increasing classifier robustness by maintaining high performance known target identification while minimizing errors from unknown targets. Meeting this requirement is significantly more challenging than forced decision classification. Results are presented showing the performance variability of the StaF classifier with respect to feature extraction variations. More importantly, the StaF classifier performance is compared to that of the quadratic classifier. It is found that the StaF classifier performs significantly better than the quadratic at high declaration rates demonstrating that the StaF classifier can significantly reduce errors associated with unknown targets while maintaining a high probability of correct classification.
{"title":"Statistical feature based target recognition","authors":"R. Mitchell, J. Westerkamp","doi":"10.1109/NAECON.1998.710105","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710105","url":null,"abstract":"The statistical feature-based (StaF) classifier is presented for robust high range resolution (HRR) radar moving ground target identification. The target features used for classification are the amplitude and location of HRR signature peaks. The StaF classifier was initially developed for air target identification with the primary goal of increasing classifier robustness by maintaining high performance known target identification while minimizing errors from unknown targets. Meeting this requirement is significantly more challenging than forced decision classification. Results are presented showing the performance variability of the StaF classifier with respect to feature extraction variations. More importantly, the StaF classifier performance is compared to that of the quadratic classifier. It is found that the StaF classifier performs significantly better than the quadratic at high declaration rates demonstrating that the StaF classifier can significantly reduce errors associated with unknown targets while maintaining a high probability of correct classification.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125186945","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710210
I. Younus, R. Hardie, J. Blackshire
Phase unwrapping is critical in the analysis of phase maps from a variety of interferometric systems. For some methods, an unwrapping error, due to noise, at some point can corrupt all subsequent phase demodulations from the corrupted point on. In images, this tends to lead to erroneous stripes in the phase demodulated data. We propose a novel phase unwrapping approach that uses a spatial binary tree image decomposition to allow maximum parallelism in implementation. At each node in the tree structure, a single unwrapping decision is made between two image blocks. The unwrapping rule used here is derived from a statistical estimate framework. Specifically, a maximum likelihood estimate of the demodulation term is used. This term can be viewed as that which minimizes a discontinuity penalizing cost function. We show that the algorithm exhibits robustness in presence of noise. The algorithm is demonstrated in a phase stepped interferometric system application.
{"title":"A novel phase unwrapping algorithm and its application to phase stepped interferometry","authors":"I. Younus, R. Hardie, J. Blackshire","doi":"10.1109/NAECON.1998.710210","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710210","url":null,"abstract":"Phase unwrapping is critical in the analysis of phase maps from a variety of interferometric systems. For some methods, an unwrapping error, due to noise, at some point can corrupt all subsequent phase demodulations from the corrupted point on. In images, this tends to lead to erroneous stripes in the phase demodulated data. We propose a novel phase unwrapping approach that uses a spatial binary tree image decomposition to allow maximum parallelism in implementation. At each node in the tree structure, a single unwrapping decision is made between two image blocks. The unwrapping rule used here is derived from a statistical estimate framework. Specifically, a maximum likelihood estimate of the demodulation term is used. This term can be viewed as that which minimizes a discontinuity penalizing cost function. We show that the algorithm exhibits robustness in presence of noise. The algorithm is demonstrated in a phase stepped interferometric system application.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126632412","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710113
J. Luke, J.W. Bittorie, W. Cannon, D. Haldeman
With decreasing defense dollars available to purchase new military aircraft, the inventory of existing aircraft will have to last many more years than originally anticipated. As the avionics computers on these aging aircraft get older, they become more expensive to maintain due to parts obsolescence. In addition, expanding missions and changing requirements lead to growth in the embedded software which, in turn, requires additional processing and memory capacity. Both factors, parts obsolescence and new processing capacity, result in the need to replace the old computer hardware with newer, more capable microprocessor technology. New microprocessors, however, are not compatible with the older computer instruction set architectures. This generally requires the embedded software in these computers to be rewritten. A significant savings-estimated in the billions of dollars-could be achieved in these upgrades if the new computers could execute the old embedded code along with any new code to be added. This paper describes a commercial-off-the-shelf (COTS) based form, fit, function, and interface (F/sup 3/I) replacement strategy for legacy avionics computers that can reuse existing avionics code "as is" while providing a flexible framework for incremental upgrades and managed change. It is based on a real-time embedded software technology that executes legacy binary code on the latest generation COTS microprocessors. This technology, developed by TRW and being applied under the sponsorship of the Air Force Research Lab (AFRL), promises performance improvements of 5-10 times that of the legacy avionics computer that it replaces. It also promises a 4X decrease in cost and schedule over rewriting the code and provides a "known good" starting point for incremental upgrades of the embedded flight software. Code revalidation cost and risk are minimized since the structure of the embedded code is not changed, allowing the replacement computer to be retested at the "blackbox" level using existing qualification tests.
{"title":"A commercial off-the-shelf based replacement strategy for aging avionics computers","authors":"J. Luke, J.W. Bittorie, W. Cannon, D. Haldeman","doi":"10.1109/NAECON.1998.710113","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710113","url":null,"abstract":"With decreasing defense dollars available to purchase new military aircraft, the inventory of existing aircraft will have to last many more years than originally anticipated. As the avionics computers on these aging aircraft get older, they become more expensive to maintain due to parts obsolescence. In addition, expanding missions and changing requirements lead to growth in the embedded software which, in turn, requires additional processing and memory capacity. Both factors, parts obsolescence and new processing capacity, result in the need to replace the old computer hardware with newer, more capable microprocessor technology. New microprocessors, however, are not compatible with the older computer instruction set architectures. This generally requires the embedded software in these computers to be rewritten. A significant savings-estimated in the billions of dollars-could be achieved in these upgrades if the new computers could execute the old embedded code along with any new code to be added. This paper describes a commercial-off-the-shelf (COTS) based form, fit, function, and interface (F/sup 3/I) replacement strategy for legacy avionics computers that can reuse existing avionics code \"as is\" while providing a flexible framework for incremental upgrades and managed change. It is based on a real-time embedded software technology that executes legacy binary code on the latest generation COTS microprocessors. This technology, developed by TRW and being applied under the sponsorship of the Air Force Research Lab (AFRL), promises performance improvements of 5-10 times that of the legacy avionics computer that it replaces. It also promises a 4X decrease in cost and schedule over rewriting the code and provides a \"known good\" starting point for incremental upgrades of the embedded flight software. Code revalidation cost and risk are minimized since the structure of the embedded code is not changed, allowing the replacement computer to be retested at the \"blackbox\" level using existing qualification tests.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132483286","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 : 1998-07-13DOI: 10.1109/NAECON.1998.710194
K. Younis, M. Karim, R. Hardie, J. Loomis, S. Rogers, M. DeSimio
A new clustering algorithm that uses a weighted Mahdlanobis distance as a distance metric to perform partitional clustering is proposed. The covariance matrices of the generated clusters are used to determine cluster similarity and closeness so that clusters which are similar in shape and close in Mahalanobis distance can be merged together serving the ultimate goal of automatically determining the optimal number of classes present in the data. Properties of the new algorithm are presented by examining the clustering quality for codebooks designed with the proposed method and another common method that uses Euclidean distance. The new algorithm provides better results than the competing method on a variety of data sets. Application of this algorithm to the problem of detecting suspicious regions in a mammogram is discussed.
{"title":"Cluster merging based on weighted mahalanobis distance with application in digital mammograph","authors":"K. Younis, M. Karim, R. Hardie, J. Loomis, S. Rogers, M. DeSimio","doi":"10.1109/NAECON.1998.710194","DOIUrl":"https://doi.org/10.1109/NAECON.1998.710194","url":null,"abstract":"A new clustering algorithm that uses a weighted Mahdlanobis distance as a distance metric to perform partitional clustering is proposed. The covariance matrices of the generated clusters are used to determine cluster similarity and closeness so that clusters which are similar in shape and close in Mahalanobis distance can be merged together serving the ultimate goal of automatically determining the optimal number of classes present in the data. Properties of the new algorithm are presented by examining the clustering quality for codebooks designed with the proposed method and another common method that uses Euclidean distance. The new algorithm provides better results than the competing method on a variety of data sets. Application of this algorithm to the problem of detecting suspicious regions in a mammogram is discussed.","PeriodicalId":202280,"journal":{"name":"Proceedings of the IEEE 1998 National Aerospace and Electronics Conference. NAECON 1998. Celebrating 50 Years (Cat. No.98CH36185)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645716","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
扫码关注我们
求助内容：
应助结果提醒方式：