{"title":"A New Automated Quality Assessment Algorithm for Night Vision Image Fusion","authors":"Yin Chen, Rick S. Blum","doi":"10.1109/CISS.2007.4298361","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298361","url":null,"abstract":"In this paper we propose a perceptual quality evaluation method for image fusion which is based on human visual system (HVS) models. Our method assesses the image quality of a fused image using the following steps. First the source and fused images are filtered by a contrast sensitivity function (CSF) after which a local contrast map is computed for each image. Second, a contrast preservation map is generated to describe the relationship between the fused image and each source image. Finally, the preservation maps are weighted by a saliency map to obtain an overall quality map. The mean of the quality map indicates the quality for the fused image. Experimental results compare the predictions made by our algorithm with human perceptual evaluations for several different parameter settings in our algorithm. For some specific parameter settings, we find our algorithm provides better predictions, which are more closely matched to human perceptual evaluations, than the existing algorithms.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129674296","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}
{"title":"Power Control and Receiver Design for Energy Efficiency in Multipath CDMA Channels with Bandlimited Waveforms","authors":"S. Buzzi, V. Massaro, H. Poor","doi":"10.1109/CISS.2007.4298314","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298314","url":null,"abstract":"This paper is focused on the cross-layer design problem of joint multiuser detection and power control for energy-efficiency optimization in a wireless data network through a game-theoretic approach. Building on work of Meshkati, et al., wherein the tools of game-theory are used in order to achieve energy-efficiency in a simple synchronous code division multiple access system, system asynchronism, the use of bandlimited chip-pulses, and the multipath distortion induced by the wireless channel are explicitly incorporated into the analysis. Several non-cooperative games are proposed wherein users may vary their transmit power and their uplink receiver in order to maximize their utility, which is denned here as the ratio of data throughput to transmit power. In particular, the case in which a linear multiuser detector is adopted at the receiver is considered first, and then, the more challenging case in which non-linear decision feedback multiuser detectors are employed is considered. The proposed games are shown to admit a unique Nash equilibrium point, while simulation results show the effectiveness of the proposed solutions, as well as that the use of a decision-feedback multiuser receiver brings remarkable performance improvements.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129891281","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}
{"title":"Fusion for Component Based Face Recognition","authors":"Yanjun Yan, L. Osadciw","doi":"10.1109/CISS.2007.4298364","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298364","url":null,"abstract":"This paper proposes a practical way to realize the diversity in face recognition system for performance improvement by fusing the classification results from the components (characteristic regions such as eyes, nose and mouth) and from the whole face image, instead of concatenating the face feature and the modular features for a single classifier. The extracted sub-images are not totally independent from the face image, but the experiments show that the fused result is improved from the recognition result based on the face or components alone. The fusion is implemented and compared at both score level and decision level. Communication resources are preserved between the sensor and fusion point in decision level fusion at the expense of performance, and the selection of which fusion scheme to use depends on the system resources and performance requirement.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124415886","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}
{"title":"Quantum Switching Networks with Classical Routing","authors":"R. Ratan, M. K. Shukla, A. Oruç","doi":"10.1109/CISS.2007.4298416","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298416","url":null,"abstract":"Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing architectures. Since qubits cannot be copied, this operation of moving qubits can be relatively costly in terms of resources. Moreover, implementation of quantum gates requires precise and extensive classical control and computation too. Accordingly, we consider the problem of dynamically permuting groups of qubits, i.e., qubit packets using reconfigurable quantum switches in which routing information is calculated classically as a possible way to reduce this cost. We design a 2 x 2 switch based on the controlled-swap quantum gate and show that if switch settings are determined using efficient classical algorithms, then quantum switches can be mapped onto classical non-blocking interconnection switch topologies with low cost by using this switch. Specific quantum switch designs for the optimal Benes network and the planar Spanke-Bcnes network are given.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117170289","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}
{"title":"The Design of the Maximum-Likelihood Decoding Algorithm of LDPC Codes over BEG","authors":"Ki-Moon Lee, H. Radha","doi":"10.1109/CISS.2007.4298350","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298350","url":null,"abstract":"We improve the design of the maximum likelihood decoding algorithm (MLDA) for the development of LDPC codes. Furthermore, we apply the improved design to the decoding of progressive edge growth (PEG) LDPC codes over binary erasure channels (BEC). We also demonstrate clear improvements over current LDPC decoding algorithms.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131492144","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}
{"title":"Rate-Distortion Analysis of Multiplierless Lifting-based IDCT Approximations","authors":"Lijie Liu, T. Tran","doi":"10.1109/CISS.2007.4298399","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298399","url":null,"abstract":"In this paper, we study the rate-distortion performance of our two proposed multiplierless lifting-based IDCT approximations. The proposed IDCT approximations comprise of butterflies and dyadic-rational lifting steps that can be implemented using only shift and add operations, and allows the computational scalability with different accuracy-versus-complexity trade-offs. As rounding approximation leads to the truncation errors in the lifting steps, we estimate the worse-case truncation errors of our IDCT schemes as the distortion performance measurement. Because the cost of a hardware bit shift operation is negligible as compared with that of an addition operation, the overall rate cost is measured by the total minimal number of additions required to complete the IDCT multiplierless implementations. Through the rate and distortion analysis, we obtain the rate-distortion (RD) curves of 32-bit fixed-point implementations of our IDCT structures. From these RD curves, we present two complementary optimal solutions. The first optimal solution can pass IEEE-1180 test with the minimal number of additions. The second optimal solution can result in the finest IDCT approximations compared with the floating-type IDCT. Moreover, our RD analysis confirms that the solution proposed in (L. Liu and T.D. Tran, 2007) is RD-optimized and has a very good performance in terms of accuracy and complexity.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131105099","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}
{"title":"A Semi-Blind Adaptive GSM Beamformer Using Re-Encoded Data","authors":"Myung-Hoon Yeon, J. Shynk, R. Gooch","doi":"10.1109/CISS.2007.4298432","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298432","url":null,"abstract":"An adaptive beamforming algorithm for the global system for mobile communications (GSM) is presented where the weights are updated using re-encoded data and a semi-blind technique. The receiver consists of several stages operating on the synchronization channel (SCH) in an iterative manner to improve the reliability of the cochannel signal decisions. An extension of the constant modulus algorithm (CMA) with a least-squares (LS) formulation is used to implement the semi-blind technique. Iterative semi-blind processing is introduced to further refine the beamformer weights. The performance of the enhanced GSM receiver is evaluated using real and simulated data.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114135347","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}
{"title":"Proportionate-Type Steepest Descent and NLMS Algorithms","authors":"K. Wagner, M. Doroslovački","doi":"10.1109/CISS.2007.4298271","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298271","url":null,"abstract":"In this paper, a unified framework for representing proportionate type algorithms is presented. This novel representation enables a systematic approach to the problem of design and analysis of proportionate type algorithms. Within this unified framework, the feasibility of predicting the performance of a stochastic proportionate algorithm by analyzing the performance of its associated deterministic steepest descent algorithm is investigated, and found to have merit. Using this insight, various steepest descent algorithms are studied and used to predict and explain the behavior of their counterpart stochastic algorithms. In particular, it is shown that the mu-PNLMS algorithm possesses robust behavior. In addition to this, the epsiv-PNLMS algorithm is proposed and its performance is evaluated.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124071923","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}
{"title":"Finding a Needle in a Haystack","authors":"B. Jedynak, D. Karakos","doi":"10.1109/CISS.2007.4298320","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298320","url":null,"abstract":"Summary form only given. We study a simplified version of the problem of target detectability in the presence of clutter. The target (the needle) is a sample of size N from a discrete distribution p. The clutter (the haystack) is made up of M independent samples of size JV from a distribution q (which is different from p, but with the same support). Two cases can be easily shown: (i) If M is fixed and JV goes to infinity, the target can be detected with probability that approaches 1. (ii) If TV is fixed and M goes to infinity, then, with probability approaching 1, the target cannot be detected. For the case where both JV, M go to infinity, we show that the asymptotic behavior of the optimal detector (if p, q are known) and of a plug-in detector (which estimates p, q on the fly) is determined by the asymptotic behavior of the quantity Mexp(-ND(pq)) : if it goes to zero (resp. infinity), then, with high probability, the target can (resp. cannot) be detected.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124319614","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}
{"title":"Collector Receiver Design for Data Collection and Localization in Sensor-driven Networks","authors":"B. Ananthasubramaniam, Upamanyu Madhow","doi":"10.1109/CISS.2007.4298377","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298377","url":null,"abstract":"We consider a sensor network in which the sensors communicate at will when they have something to report, without prior coordination with other sensors or with data collection nodes. The burden of demodulating the sensor data, and localizing the sensor which is communicating, falls on a network of collector nodes which are perpetually monitoring transmissions from the sensor network. This model allows the random deployment of very large numbers of sensor nodes with minimal capabilities, while shifting the complexity to a network of collector nodes. While the philosophy is similar to prior work on \"imaging\" sensor nets, the key difference is that the communication model is now sensor-driven, rather than collector-driven. The two major technical challenges addressed in this paper are as follows: (a) Are there simple physical layer implementations of the collector receiver for jointly solving the tasks of detection of a sensor transmission, estimation of the direction from which it comes, and demodulating the data? (b) Given that the collectors are not time synchronized well enough to permit the use of time-difference-of-arrival techniques for sensor localization, how well can the sensors be localized with spatial information alone, assuming that each collector node has a relatively small number of antennas? The results reported in this paper indicate that the preceding issues can be addressed satisfactorily with appropriate design of the collector physical layer, together with Bayesian combining of the spatial information extracted by each collector.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372113","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}