Lindell, David B.; O'Toole, Matthew; Wetzstein, Gordon(2018 IEEE International Conference on Computational Photography (ICCP), Institute of Electrical and Electronics Engineers (IEEE), 2018-05-31)[Conference Paper]
Active imaging at the picosecond timescale reveals transient light transport effects otherwise not accessible by computer vision and image processing algorithms. For example, analyzing the time of flight of short laser pulses emitted into a scene and scattered back to a detector allows for depth imaging, which is crucial for autonomous driving and many other applications. Moreover, analyzing or removing global light transport effects from photographs becomes feasible. While several transient imaging systems have recently been proposed using various imaging technologies, none is capable of acquiring transient images at interactive framerates. In this paper, we present an imaging system that records transient images at up to 25 Hz. We show several transient video clips recorded with this system and demonstrate transient imaging applications, including direct-global light transport separation and enhanced depth imaging.
Kittaneh, Omar A.; Shehata, Mohamed; Majid, M. A.(2018 15th Learning and Technology Conference (L&T), Institute of Electrical and Electronics Engineers (IEEE), 2018-05-31)[Conference Paper]
Beyond energy saving, LED connected lighting systems allows for real-time data streaming, generating intelligence and creation of intelligent buildings systems. Lifetime experiments is crucial for such a connected system, as early termination would lead to big errors in estimating the lifetime model parameters, and late termination would waste time and cost. In this paper sup-entropy is applied in quantifying the amount of information in censored solid state lighting (SSL) luminaire experimental data that has Weibull distribution with respect to complete data. We use a quantity called efficiency of the censored sample as an indicator of the quality and goodness of the censoring scheme. This allowed us to determine the suitable termination time of the experiment subject to a desired efficiency. An intensive simulation study is conducted to validate our procedure.
Coutino, Mario; Chepuri, Sundeep Prabhakar; Leus, Geert(2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), Institute of Electrical and Electronics Engineers (IEEE), 2018-03-12)[Conference Paper]
In this paper, we propose sensor selection strategies, based on convex and greedy approaches, for designing sparse samplers for composite detection. Particularly, we focus our attention on sparse samplers for matched subspace detectors. Differently from previous works, that mostly rely on random matrices to perform compression of the sub-spaces, we show how deterministic samplers can be designed under a Neyman-Pearson-like setting when the generalized likelihood ratio test is used. For a less stringent case than the worst case design, we introduce a submodular cost that obtains comparable results with its convex counterpart, while having a linear time heuristic for its near optimal maximization.
Faouri, Yanal S.; Hussain, Rifaqat; Sharawi, Mohammad S.(2017 IEEE Jordan Conference on Applied Electrical Engineering and Computing Technologies (AEECT), Institute of Electrical and Electronics Engineers (IEEE), 2018-01-15)[Conference Paper]
A 4-element 2×2 sub-array based on patch antennas operating at 3.6 GHz is proposed. The sub-array can provide 4 polarizations. The design consists of two substrates (RO4350B) with 8r = 3.66 with heights of 1.524 mm and 0.762 mm for the top and bottom layers respectively. The investigated technique required adding two orthogonal slots inside the patch to allow placing PIN diodes and their connection to the biasing circuitry which is located at the bottom layer. This model provides four types of antenna polarization which are left-handed circular polarization (LHCP), right-handed circular polarization (RHCP) and two cases of linear polarization (LP_ON and LP_OFF). The maximum obtained gain was 9.63 dB and the bandwidth was 145 MHz.
Alanwar, Amr; Anwar, Fatima M.; Zhang, Yi-Fan; Pearson, Justin; Hespanha, Joao; Srivastava, Mani B.(2017 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control, and Communication (ISPCS), Institute of Electrical and Electronics Engineers (IEEE), 2017-10-05)[Conference Paper]
The Beaglebone Black single-board computer is well-suited for real-time embedded applications because its system-on-a-chip contains two
Walk, Philipp; Jung, Peter; Hassibi, Babak(2017 International Conference on Sampling Theory and Applications (SampTA), Institute of Electrical and Electronics Engineers (IEEE), 2017-09-04)[Conference Paper]
In this work we consider one-dimensional blind deconvolution with prior knowledge of signal autocorrelations in the classical framework of polynomial factorization. In particular this univariate case highly suffers from several non-trivial ambiguities and therefore blind deconvolution is known to be ill-posed in general. However, if additional autocorrelation information is available and the corresponding polynomials are co-prime, blind deconvolution is uniquely solvable up to global phase. Using lifting, the outer product of the unknown vectors is the solution to a (convex) semi-definite program (SDP) demonstrating that -theoretically- recovery is computationally tractable. However, for practical applications efficient algorithms are required which should operate in the original signal space. To this end we also discuss a gradient descent algorithm (Wirtinger flow) for the original non-convex problem. We demonstrate numerically that such an approach has performance comparable to the semidefinite program in the noisy case. Our work is motivated by applications in blind communication scenarios and we will discuss a specific signaling scheme where information is encoded into polynomial roots.
Halbawi, Wael; Duursma, Iwan; Dau, Hoang; Hassibi, Babak(2017 IEEE International Symposium on Information Theory (ISIT), Institute of Electrical and Electronics Engineers (IEEE), 2017-08-29)[Conference Paper]
We construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.
Wang, Fanggang; Ruan, Liangzhong; Win, Moe Z.(2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Institute of Electrical and Electronics Engineers (IEEE), 2017-06-20)[Conference Paper]
One of the major challenges in effectively operating a cloud radio access network (C-RAN) is the excessive overhead signaling and computation load that scale rapidly with the size of the network. In this paper, the exploitation of location information of the mobile devices is proposed to address this challenge. We consider an approach in which location-assisted channel state information (CSI) acquisition methods are introduced to complement conventional pilot-based CSI acquisition methods and avoid excessive overhead signaling. A low-complexity algorithm is designed to maximize the sum rate. An adaptive algorithm is also proposed to address the uncertainty issue in CSI acquisition. Both theoretical and numerical analyses show that location information provides a new dimension to improve throughput for next-generation massive cooperative networks.
Cai, Jian-Feng; Xu, Weiyu; Yang, Yang(2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Institute of Electrical and Electronics Engineers (IEEE), 2017-06-20)[Conference Paper]
We consider the problem of spectral compressed sensing in continuous domain, which aims to recover a 2-dimensional spectrally sparse signal from partially observed time samples. The signal is assumed to be a superposition of s complex sinusoids. We propose a semidefinite program for the 2D signal recovery problem. Our model is able to handle large scale 2D signals of size 500 × 500, whereas traditional approaches only handle signals of size around 20 × 20.
Ghalib, Asim; Hussain, Rifaqat; Sharawi, Mohammad S.(2017 11th European Conference on Antennas and Propagation (EUCAP), Institute of Electrical and Electronics Engineers (IEEE), 2017-06-07)[Conference Paper]
In this paper, a frequency reconfigurable multiple-input-multiple-output (MIMO) slot antenna is presented. The proposed design is low profile and compact with wide tunability range, covering several well-known frequency bands from 1800 MHz to 2450 MHz. The frequency reconfigurability is achieved by loading the annular slot with varactor diodes. The antenna system is also analyzed for MIMO performance metrics. Moreover, the effect of circular slot antenna on the chassis modes is also investigated using the theory of characteristic modes (TCM). The physical principle behind frequency reconfigurability is also investigated using TCM analysis. An interesting finding is observed using varactor diodes for frequency reconfigurability, that is the reactive impedance loading does not alter the modal significance (MS) plots but only aid in the input impedance matching at different frequency bands.
The export option will allow you to export the current search results of the entered query to a file. Different
formats are available for download. To export the items, click on the button corresponding with the preferred download format.
By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.
For anonymous users the allowed maximum amount is 50 search results.
To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export.
The amount of items that can be exported at once is similarly restricted as the full export.
After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.