Donald J. Bucci, Sayandeep Acharya, Timothy J. Pleskac, M. Kam
{"title":"Subjective confidence and source reliability in soft data fusion","authors":"Donald J. Bucci, Sayandeep Acharya, Timothy J. Pleskac, M. Kam","doi":"10.1109/CISS.2014.6814173","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814173","url":null,"abstract":"There is ongoing interest in constructing data fusion systems which are capable of using human (i.e., soft) decisions and confidence assessments as inputs. Most relevant studies involved experimentation with humans which is often expensive, subject to strict institutional regulations, and hard to validate and replicate. Here we make use of a mathematical model of human decision-making and human confidence assessment developed by Pleskac and Busemeyer (2010) in order to compare four types of fusion operators: (1) operators that use human-subject decisions (such as the k-out-of-N majority rule); (2) operators that use subject decisions and error rates (the Chair and Varshney fusion rule); (3) operators that use subject decisions and confidence assessments (Yager's rule and the Proportional Conflict Redistribution rule #5); and (4) operators that use subject decisions, confidence assessments, and the average strength of each subject's confidence assessment, namely the average Brier scores (Dempster's rule of combination and Bayes' rule of probability combination). The ability of each fusion system to discriminate between alternatives was determined by computing the normalized area under the receiver operating characteristic curves (AUC). When the number of sources used by the fusion algorithm exceeded five, fusion operators which made use of decisions and confidence assessments alone (i.e., type (3)) produced the lowest (namely, worst) normalized AUC values. Operators which made use of subject reliabilities (i.e., types (2) and (4)) produced larger (namely, better) normalized AUC values which, in addition, were similar to those of fusion algorithms that relied on decisions alone (i.e., type (1)). For the city size discrimination task studied by Pleskac and Busmeyer, these results suggest that as the number of sources increases, the importance of decision self-assessment diminishes.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131036706","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":"Delay minimization with channel-adaptive packetization policy for random data traffic","authors":"A. Razi, A. Abedi, A. Ephremides","doi":"10.1109/CISS.2014.6814128","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814128","url":null,"abstract":"Packet lengths have crucial impact on the end-to-end delay in a queuing system over noisy time-varying wireless channels that is overlooked in most system designs. In this paper, a delay optimal adaptive packetization policy in network layer is proposed that adjusts framing intervals based on the underlying physical layer parameters in order to minimize the end-to-end packet delivery time. The arrival stream of fixed-length symbols with exponential inter-arrival time distribution are bundled into packets in an optimal manner and are scheduled for transmission over a noisy wireless channel with Automatic Repeat Request (ARQ) retransmission mechanism. The underlying channel quality in terms of BER is considered known to the scheduler. The proposed solution not only minimizes the end-to-end latency but also prohibits potential queue instability in dynamic channel situations.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133173402","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":"On the bit error rate of repeated error-correcting codes","authors":"Weihao Gao, Yury Polyanskiy","doi":"10.1109/CISS.2014.6814087","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814087","url":null,"abstract":"Classically, error-correcting codes are studied with respect to performance metrics such as minimum distance (combinatorial) or probability of bit/block error over a given stochastic channel. In this paper, a different metric is considered. It is assumed that the block code is used to repeatedly encode user data. The resulting stream is subject to adversarial noise of given power, and the decoder is required to reproduce the data with minimal possible bit-error rate. This setup may be viewed as a combinatorial joint source-channel coding. Two basic results are shown for the achievable noise-distortion tradeoff: the optimal performance for decoders that are informed of the noise power, and global bounds for decoders operating in complete oblivion (with respect to noise level). General results are applied to the Hamming [7, 4, 3] code, for which it is demonstrated (among other things) that no oblivious decoder exist that attains optimality for all noise levels simultaneously.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124784370","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":"Dynamic best spectral bands selection for face recognition","authors":"Hamdi Jamel Bouchech, S. Foufou, M. Abidi","doi":"10.1109/CISS.2014.6814081","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814081","url":null,"abstract":"In this paper, face recognition in uncontrolled illumination conditions is investigated. A twofold contribution is proposed. First, three state-of-art algorithms, namely Multiblock Local Binary Pattern (MBLBP), Histogram of Gabor Phase Patterns (HGPP) and Local Gabor Binary Pattern Histogram Sequence (LGBPHS) are evaluated upon the IRIS-M3 face database to study their robustness against a high illumination variation conditions. Second, we propose to use visible multispectral images, provided by the same face database, to enhance the performance of the three mentioned algorithms. To reduce the high data dimensionality introduced by the use of multispectral images, we have designed a system to dynamically select the best spectral bands for each new subject. Our semi-supervised system for best spectral bands selection learn the relation between the recognition performance of each spectral band and its intrinsic quality using techniques of transfer learning and finite mixture of Gaussian for data distribution estimation. The obtained model is function of the image quality, and for each new spectral band, the likelihood ratio test is used to determine if the former belongs to either the set of good spectral bands or bad spectral bands. To the best of our knowledge, this is the first system proposed to dynamically select the best visible spectral bands for face recognition. Our results highlighted further the still challenging problem of face recognition in conditions with high illumination variation, as well as the effectiveness of our subspectral images based approach to increase the accuracy of the studied algorithms by at least 21.66 % upon the proposed database. Finally, our dynamic system has shown a superiority of performance over non-dynamic systems developed for the same face database.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124893146","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":"Output decisions for stochastic LDPC decoders","authors":"Kuo-Lun Huang, V. Gaudet, M. Salehi","doi":"10.1109/CISS.2014.6814072","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814072","url":null,"abstract":"Stochastic decoding is a method to iteratively decode error-correcting codes such as low-density parity-check codes. Due to the computational simplicity of its decoding algorithm, stochastic decoding provides not only low silicon area but also competitive performance. In this paper, we research the different techniques used to determine the code bits generated by stochastic decoders during the final decision process. We investigate an efficient method where code bits are directly decided based on the final stochastic bits generated at output nodes. This observation contributes to saving chip area and providing high throughput for stochastic decoders.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129453108","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":"Software-Defined Access Network (SDAN)","authors":"K. Kerpez, G. Ginis","doi":"10.1109/CISS.2014.6814134","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814134","url":null,"abstract":"Control-plane functions are migrating from dedicated network equipment into software running on commodity hardware. The Software-Defined Access Network (SDAN) concept is introduced here that extends the benefits of Software-Defined Networking (SDN) into broadband access. The SDAN virtualizes access-network control and management functions for broadband access, to enable network optimizations, streamline operations, and encourage innovative services creation, particularly in multi-operator environments. This paper identifies software-definable control and management functions for broadband access, and presents some specific network optimizations using the SDAN.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128390400","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":"Unsupervised active contour model for multiphase inhomogeneous image segmentation","authors":"Yunyun Yang, Yi Zhao, Boying Wu, Hongpeng Wang","doi":"10.1109/CISS.2014.6814164","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814164","url":null,"abstract":"This paper presents an unsupervised active contour model for multiphase inhomogeneous image segmentation. We propose the new model based on a local intensity fitting term and a phase balancing term by incorporating the idea of the local intensity fitting energy model into the phase balancing model. Instead of using intensity average constants, we use local fitting functions to approximate the intensities in different phases, thus the new model can segment inhomogeneous images. Besides, the new model can identify the number of phases automatically without any user input with the phase balancing term. Then a fast brute-force algorithm is provided to minimize the new nonlinear energy functional directly without computing the Euler-Lagrange equation. The new model has been applied to real images. Numerical results have demonstrated that the new model can deal with inhomogeneous images and give a reasonable number of phases simultaneously.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128253478","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":"Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting","authors":"Kevin G. Jamieson, R. Nowak","doi":"10.1109/CISS.2014.6814096","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814096","url":null,"abstract":"This paper is concerned with identifying the arm with the highest mean in a multi-armed bandit problem using as few independent samples from the arms as possible. While the so-called “best arm problem” dates back to the 1950s, only recently were two qualitatively different algorithms proposed that achieve the optimal sample complexity for the problem. This paper reviews these recent advances and shows that most best-arm algorithms can be described as variants of the two recent optimal algorithms. For each algorithm type we consider a specific instance to analyze both theoretically and empirically thereby exposing the core components of the theoretical analysis of these algorithms and intuition about how the algorithms work in practice. The derived sample complexity bounds are novel, and in certain cases improve upon previous bounds. In addition, we compare a variety of state-of-the-art algorithms empirically through simulations for the best-arm-problem.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129825585","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":"Transmission of correlated Gaussian samples over a multiple-access channel","authors":"Ayşe Ünsal, R. Knopp","doi":"10.1109/CISS.2014.6814111","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814111","url":null,"abstract":"This paper provides lower bounds on the reconstruction error for transmission of two continuous correlated random vectors sent over a sum channel using the help of two causal feedback links from the decoder to the encoders connected to each sensor. This construction is considered for standard normally distributed sources. Additionally, a two-way retransmission protocol, which is a non-coherent dual-source adaptation of the original work by Yamamoto [1] is introduced for an additive white Gaussian noise channel. Asymptotic optimality of the protocol is analyzed and upper bounds on the distortion level are derived for two-rounds considering two extreme cases of high and low correlation among the two sources. It is shown by both the upper and lower-bounds that collaboration can be achieved through energy accumulation.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132454888","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":"Fading channels in energy-harvesting receivers","authors":"H. Mahdavi-Doost, R. Yates","doi":"10.1109/CISS.2014.6814126","DOIUrl":"https://doi.org/10.1109/CISS.2014.6814126","url":null,"abstract":"We consider the operation of an energy harvesting receiver in a point-to-point fading channel with additive white Gaussian noise (AWGN). Knowledge of the channel state information is not available at the transmitter. The limited rate of harvesting energy at the receiver along with the time variation of the channel can degrade the performance of the system. However, we will show that channel state knowledge at the receiver can improve the performance of the system. We propose a channel-selective sampling strategy that optimizes a tradeoff between the energy costs of sampling and decoding at the receiver. Based on this tradeoff, we derive a policy maximizing the communication rate and we characterize an energy-constrained rate region. We extend the results to the receivers with finite battery capacity.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132966584","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}