Pub Date : 2005-12-13DOI: 10.1109/CAMAP.2005.1574185
W. Case, B. Bertram
This paper attempts to show how multi-sensor imagery data may be used to generate image reconstructions that are superior to any produced from individual sensors, and to provide a plausibility argument as to why this comes about. The case of two sensors will be considered for convenience and brevity.
{"title":"A computational multi-kernel approach to multi-sensor problems using cross-referencing (CREF)","authors":"W. Case, B. Bertram","doi":"10.1109/CAMAP.2005.1574185","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574185","url":null,"abstract":"This paper attempts to show how multi-sensor imagery data may be used to generate image reconstructions that are superior to any produced from individual sensors, and to provide a plausibility argument as to why this comes about. The case of two sensors will be considered for convenience and brevity.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"-1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133508161","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574201
Lek-Heng Lim
We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix eigenvalues. These notions are particularly useful in generalizing certain areas where the spectral theory of matrices has traditionally played an important role. For illustration, we will discuss a multilinear generalization of the Perron-Frobenius theorem
{"title":"Singular values and eigenvalues of tensors: a variational approach","authors":"Lek-Heng Lim","doi":"10.1109/CAMAP.2005.1574201","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574201","url":null,"abstract":"We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix eigenvalues. These notions are particularly useful in generalizing certain areas where the spectral theory of matrices has traditionally played an important role. For illustration, we will discuss a multilinear generalization of the Perron-Frobenius theorem","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115632214","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574212
C. Juarez-Landin, V. Ponomaryov, J. L. Sanchez-Ramirez
It is presented the development of two methods for recognition of ultrasound images (US) using artificial neural networks (ANN). In the first method, a neural network of the backpropagation type was used, and the second one it has been implemented a stage of extraction of characteristics applying the wavelet transform before ANN using. The experimental results have shown the advantages and drawbacks of each a method
{"title":"Recognition of ultrasound images using wavelet transform and artificial neural networks","authors":"C. Juarez-Landin, V. Ponomaryov, J. L. Sanchez-Ramirez","doi":"10.1109/CAMAP.2005.1574212","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574212","url":null,"abstract":"It is presented the development of two methods for recognition of ultrasound images (US) using artificial neural networks (ANN). In the first method, a neural network of the backpropagation type was used, and the second one it has been implemented a stage of extraction of characteristics applying the wavelet transform before ANN using. The experimental results have shown the advantages and drawbacks of each a method","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123655470","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574186
I. Chudinovich, C. Constanda
An efficient approximation method is developed for computing the bending displacements of a plate with transverse shear deformation lying on an elastic foundation, typical of the materials and structures used in the manufacturing and nondestructive testing of mechanical sensors for industrial containers.
{"title":"Dual methods for sensor testing of industrial containers. I. The classical approach","authors":"I. Chudinovich, C. Constanda","doi":"10.1109/CAMAP.2005.1574186","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574186","url":null,"abstract":"An efficient approximation method is developed for computing the bending displacements of a plate with transverse shear deformation lying on an elastic foundation, typical of the materials and structures used in the manufacturing and nondestructive testing of mechanical sensors for industrial containers.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124676141","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 : 2005-12-13DOI: 10.1109/CAMAP.2005.1574227
V.M. Ochoa-Mayorga, P. Boulanger, M. García
The accuracy of the electromagnetic tracking systems has been always an important issue with application to motion and kinematic analysis. Applications in virtual reality and gesture recognition require not only of improved accuracy but also fast error compensation. Several analytic methods have been used in order to correct the position error and they are well known and fast: polynomial fitting, calibration tables, and more recent, neural networks. We are interested in the orientation calibration of working spaces with possible high distortion conditions. Such conditions are prevalent in virtual environment spaces such as the CAVE and it is not always possible to avoid metallic components in the surroundings. In this paper, we introduce a calibration method for a multiple-sensor electromagnetic tracking system in an environment with highly electromagnetic distortional conditions. The target system is a twelve-sensor Ultratrak Polhemus Inc.trade system. We compare two possible formulations: global parameter estimation and local parameter estimation for the corrective functions. It is assumed that the inverse quaternion error Q-1isin exists and it is a function of the three-dimensional location: Q-1 isin rarr f(x,y,z)
{"title":"Local quaternion weighted difference functions for orientation calibration on electromagnetic trackers","authors":"V.M. Ochoa-Mayorga, P. Boulanger, M. García","doi":"10.1109/CAMAP.2005.1574227","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574227","url":null,"abstract":"The accuracy of the electromagnetic tracking systems has been always an important issue with application to motion and kinematic analysis. Applications in virtual reality and gesture recognition require not only of improved accuracy but also fast error compensation. Several analytic methods have been used in order to correct the position error and they are well known and fast: polynomial fitting, calibration tables, and more recent, neural networks. We are interested in the orientation calibration of working spaces with possible high distortion conditions. Such conditions are prevalent in virtual environment spaces such as the CAVE and it is not always possible to avoid metallic components in the surroundings. In this paper, we introduce a calibration method for a multiple-sensor electromagnetic tracking system in an environment with highly electromagnetic distortional conditions. The target system is a twelve-sensor Ultratrak Polhemus Inc.trade system. We compare two possible formulations: global parameter estimation and local parameter estimation for the corrective functions. It is assumed that the inverse quaternion error Q-1isin exists and it is a function of the three-dimensional location: Q-1 isin rarr f(x,y,z)","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"15 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829443","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 : 2005-12-01DOI: 10.1109/CAMAP.2005.1574196
E. Karipidis, N. Sidiropoulos, Z. Luo
The problem of transmits beamforming to multiple co-channel multicast groups is considered, from the viewpoint of guaranteeing a prescribed minimum signal-to-interference-plus-noise-ratio (SENR) at each receiver. The problem is a multicast generalization of the SENR-constrained multiuser downlink beamforming problem: the difference is that each transmitted stream is directed to multiple receivers, each with its own channel. Such generalization is relevant and timely, e.g., in the context of 802.16 wireless networks. Based on earlier results for a single multicast group, the joint problem is easily shown to be NP-hard, a fact that motivates the pursuit of quasi-optimal computationally efficient solutions. It is shown that Lagrangian relaxation coupled with a randomization/co-channel multicast power control loop yields a computationally efficient high-quality approximate solution. For a significant fraction of problem instances, the solutions generated this way are exactly optimal. Carefully designed and extensive simulation results are presented to support the main findings.
{"title":"Transmit beamforming to multiple co-channel multicast groups","authors":"E. Karipidis, N. Sidiropoulos, Z. Luo","doi":"10.1109/CAMAP.2005.1574196","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574196","url":null,"abstract":"The problem of transmits beamforming to multiple co-channel multicast groups is considered, from the viewpoint of guaranteeing a prescribed minimum signal-to-interference-plus-noise-ratio (SENR) at each receiver. The problem is a multicast generalization of the SENR-constrained multiuser downlink beamforming problem: the difference is that each transmitted stream is directed to multiple receivers, each with its own channel. Such generalization is relevant and timely, e.g., in the context of 802.16 wireless networks. Based on earlier results for a single multicast group, the joint problem is easily shown to be NP-hard, a fact that motivates the pursuit of quasi-optimal computationally efficient solutions. It is shown that Lagrangian relaxation coupled with a randomization/co-channel multicast power control loop yields a computationally efficient high-quality approximate solution. For a significant fraction of problem instances, the solutions generated this way are exactly optimal. Carefully designed and extensive simulation results are presented to support the main findings.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"46 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120821371","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 : 2005-12-01DOI: 10.1109/CAMAP.2005.1574198
S. Farahmand, Z. Luo, G. Giannakis, R. D’Andrea
The standard robust beamforming approach tries to optimize the worst case performance over a continuum of signal steering vector distortions with a bounded norm. This approach can be too conservative when the norm bound on distortions is large and if an estimated distortion vector is available. In this paper, we propose a new robust formulation, which approximates the robust solution by an affine mapping incorporating the side information of an estimated distortion vector (when available). Within this formulation, the conventional robust beamformer can be viewed as a constant approximation of the robust solution for the case when the side information of distortion vector is unavailable. We present two reformulations of the robust affine beamforming problem as a semi-definite program (SDP) that can be efficiently solved using the interior point methods. Once computed, the affine mapping can be used repeatedly to generate low-complexity robust approximations to the optimum beamforming solution whenever new information on distortion vector is available
{"title":"An affine approximation to the robust beamforming problem","authors":"S. Farahmand, Z. Luo, G. Giannakis, R. D’Andrea","doi":"10.1109/CAMAP.2005.1574198","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574198","url":null,"abstract":"The standard robust beamforming approach tries to optimize the worst case performance over a continuum of signal steering vector distortions with a bounded norm. This approach can be too conservative when the norm bound on distortions is large and if an estimated distortion vector is available. In this paper, we propose a new robust formulation, which approximates the robust solution by an affine mapping incorporating the side information of an estimated distortion vector (when available). Within this formulation, the conventional robust beamformer can be viewed as a constant approximation of the robust solution for the case when the side information of distortion vector is unavailable. We present two reformulations of the robust affine beamforming problem as a semi-definite program (SDP) that can be efficiently solved using the interior point methods. Once computed, the affine mapping can be used repeatedly to generate low-complexity robust approximations to the optimum beamforming solution whenever new information on distortion vector is available","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121045529","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 : 2005-12-01DOI: 10.1109/CAMAP.2005.1574173
J. Palmer, J. Homer, M. Martorella, F. Berizzi
This paper investigates the application of emulated bistatic radar geometries to interferometric processing techniques. This is carried out in order to allow an estimation of a target's height without the complexity associated with standard interferometric processing systems. In this paper the interferometric technique is reformulated to incorporate an emulated bistatic radar configuration. Simulation results with error analysis are also provided.
{"title":"Target height estimation in an emulated bistatic radar via interferometric processing","authors":"J. Palmer, J. Homer, M. Martorella, F. Berizzi","doi":"10.1109/CAMAP.2005.1574173","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574173","url":null,"abstract":"This paper investigates the application of emulated bistatic radar geometries to interferometric processing techniques. This is carried out in order to allow an estimation of a target's height without the complexity associated with standard interferometric processing systems. In this paper the interferometric technique is reformulated to incorporate an emulated bistatic radar configuration. Simulation results with error analysis are also provided.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130119654","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 : 2005-12-01DOI: 10.1109/CAMAP.2005.1574182
Jinjun Xiao, Z. Luo
Consider the problem of estimating a vector source with a bandwidth constrained sensor network in which sensors make distributed observations on the source and collaborate with a fusion center (FC) to generate a final estimate. Due to power and bandwidth limitations, each sensor must compress its data and transmit to the FC only the minimum amount of information necessary to ensure the final estimate meets a given distortion bound. The optimal power allocation for the class of linear decentralized analog compression schemes was considered in Z-Q Luo et al. (2005) and proved to be NP-hard in general. In this paper, we consider the optimal rate allocation problem in the so called Berger-Tung achievable rate distortion region. In contrast to the power allocation for the linear analog compression schemes, we show that the optimal rate allocation can be formulated as a convex optimization problem which can be efficiently solved by interior point methods. Our convex reformulation technique is also applicable to the vector Gaussian multiterminal source coding problem.
{"title":"Optimal rate allocation for the vector Gaussian CEO problem","authors":"Jinjun Xiao, Z. Luo","doi":"10.1109/CAMAP.2005.1574182","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574182","url":null,"abstract":"Consider the problem of estimating a vector source with a bandwidth constrained sensor network in which sensors make distributed observations on the source and collaborate with a fusion center (FC) to generate a final estimate. Due to power and bandwidth limitations, each sensor must compress its data and transmit to the FC only the minimum amount of information necessary to ensure the final estimate meets a given distortion bound. The optimal power allocation for the class of linear decentralized analog compression schemes was considered in Z-Q Luo et al. (2005) and proved to be NP-hard in general. In this paper, we consider the optimal rate allocation problem in the so called Berger-Tung achievable rate distortion region. In contrast to the power allocation for the linear analog compression schemes, we show that the optimal rate allocation can be formulated as a convex optimization problem which can be efficiently solved by interior point methods. Our convex reformulation technique is also applicable to the vector Gaussian multiterminal source coding problem.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128915257","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 : 2005-12-01DOI: 10.1109/CAMAP.2005.1574190
Ioannis Kyriakides, D. Morrell, A. Papandreou-Suppappola
In this paper, we propose the constrained motion proposal (COMP) algorithm that incorporates target kinematic constraint information into a particle filter to track multiple targets. We represent deterministic or stochastic constraints on target motion as a likelihood function that is incorporated into the particle filter proposal density. Using Monte Carlo simulations, we demonstrate that this approach improves tracking performance while reducing computational cost relative to the independent partition particle filter with and without a constraint likelihood function.
{"title":"Multiple target tracking with constrained motion using particle filtering methods","authors":"Ioannis Kyriakides, D. Morrell, A. Papandreou-Suppappola","doi":"10.1109/CAMAP.2005.1574190","DOIUrl":"https://doi.org/10.1109/CAMAP.2005.1574190","url":null,"abstract":"In this paper, we propose the constrained motion proposal (COMP) algorithm that incorporates target kinematic constraint information into a particle filter to track multiple targets. We represent deterministic or stochastic constraints on target motion as a likelihood function that is incorporated into the particle filter proposal density. Using Monte Carlo simulations, we demonstrate that this approach improves tracking performance while reducing computational cost relative to the independent partition particle filter with and without a constraint likelihood function.","PeriodicalId":281761,"journal":{"name":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124605805","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
扫码关注我们
求助内容：
应助结果提醒方式：