JUJayakrishnan Unnikrishnan

Jayakrishnan Unnikrishnan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jayakrishnan Unnikrishnan has a total of 34 co-authors. Here are the top co-authors by number of shared publications:

  • Martin Vetterli

    School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    12 shared publications
  • Venugopal V. Veeravalli

    Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana

    8 shared publications
  • Sean Meyn

    Dept. of Electrical and Computer Engineering, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801

    4 shared publications
  • Dayu Huang

    Department of Electrical and Computer Engineering, University of Illinois at Urbana–Champaign, Champaign, IL, USA

    3 shared publications
  • Aleksandra Radenovic

    Institute of Bioengineering, School of Engineering, EPFL, Lausanne, Switzerland

    2 shared publications
  • Farid M. Naini

    Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    2 shared publications

Latest Publications

  • Joint Beamforming and Association Design for MIMO Radar

    by Urs Niesen, Jayakrishnan Unnikrishnan

    A critical task of a radar receiver is data association, which assigns radar target detections to target filter tracks. Motivated by its importance, this paper introduces the problem of jointly designing multiple-input multiple-output (MIMO) radar transmit beam patterns and the corresponding data association schemes. We show that the coupling of the beamforming and the association subproblems can be conveniently parameterized by what we term an ambiguity graph, which prescribes if two targets are to be disambiguated by the beamforming design or by the data association scheme. The choice of ambiguity graph determines which of the two subproblems is more difficult and therefore allows to trade performance of one versus the other, resulting in a detection-association trade-off. This paper shows how to design both the beam pattern and the association scheme for a given ambiguity graph. It then discusses how to choose an ambiguity graph achieving close to the optimal detection-association trade-off.


  • Association-Aware Radar Beamforming

    by Urs Niesen, Jayakrishnan Unnikrishnan

    Data association, which assigns radar target detections to target tracks, is a critical component of a radar receiver. Motivated by its importance, this paper introduces the problem of MIMO radar transmit beamforming, which explicitly takes this association step into account. Association-aware beamforming design yields two benefits. First, by avoiding simultaneous illumination of hard to disambiguate targets, the resulting association problem is simplified. Second, by allowing simultaneous illumination of easily disambiguated targets, detection performance is improved. These benefits manifest in a signal-to-noise ratio (SNR) gain and an identifiability gain.


  • Impedance-based Induction Motor Bearing Failure Detection Applied to X-Ray Tube

    by Jayakrishnan Unnikrishnan, Nidhishri Tapadia, John Breunissen, Uwe Wiedmann

    Modern bearing condition monitoring systems for induction machines typically rely on spectral analysis performed on mechanical or electrical signals measured at high sampling rate to detect vibrations at signature fault frequencies. However, in some applications, these methods may be infeasible or prohibitively complex or expensive. For such applications, we propose an alternative low-complexity strategy for detecting bearing health issues by monitoring the induction motor equivalent circuit impedance. As the equivalent circuit impedance depends on the slip of the machine, abrupt drops of the impedance are indicative of sudden onset of friction in the bearings, which is a precursor of bearing failure. We quantify the sensitivity of this approach and demonstrate the robustness to other variables such as winding resistances. We illustrate the predictive power of impedance-based methods for detecting ball-bearing failures in X-ray tube rotors by evaluating the algorithm on data collected from run-to-failure experiments performed on five different tubes. Our results indicate that the method is valuable for short-term failure prediction of induction machines in critical applications.

  • Unlabeled Sensing With Random Linear Measurements

    by Jayakrishnan Unnikrishnan, Saeid Haghighatshoar, Martin Vetterli

    We study the problem of solving a linear sensing system when the observations are unlabeled. Specifically we seek a solution to a linear system of equations y = Ax when the order of the observations in the vector y is unknown. Focusing on the setting in which A is a random matrix with i.i.d. entries, we show that if the sensing matrix A admits an oversampling ratio of 2 or higher, then, with probability 1, it is possible to recover x exactly without the knowledge of the order of the observations in y. Furthermore, if x is of dimension K, then any 2K entries of y are sufficient to recover x. This result implies the existence of deterministic unlabeled sensing matrices with an oversampling factor of 2 that admit perfect reconstruction. The result is universal in that conditioned on the realization of matrix A, recovery is guaranteed for all possible choices of x. While the proof is constructive, it uses a combinatorial algorithm which is not practical, leaving the question of complexity open. We also analyze a noisy version of the problem and show that local stability is guaranteed by the solution. In particular, for every x, the recovery error tends to zero as the signal-to-noise-ratio tends to infinity. The question of universal stability is unclear. In addition, we obtain a converse of the result in the noiseless case: If the number of observations in y is less than 2K, then with probability 1, universal recovery fails, i.e., with probability 1, there exists distinct choices of x which lead to the same unordered list of observations in y. We also present extensions of the result of the noiseless case to special cases with non-i.i.d. entries in A, and to a different setting in which the labels of a portion of the observations y are known. In terms of applications, the unlabeled sensing problem is related to data association problems encountered in different domains including robotics where it is appears in a method called “simultaneous localization and mapping” (SLAM), multi-target tracking applications, and in sampling signals in the presence of jitter.


  • Open Access

    On characterizing protein spatial clusters with correlation approaches

    by Arun Shivanandan, Jayakrishnan Unnikrishnan, Aleksandra Radenovic

    Spatial aggregation of proteins might have functional importance, e.g., in signaling, and nano-imaging can be used to study them. Such studies require accurate characterization of clusters based on noisy data. A set of spatial correlation approaches free of underlying cluster processes and input parameters have been widely used for this purpose. They include the radius of maximal aggregation ra obtained from Ripley’s L(r) − r function as an estimator of cluster size, and the estimation of various cluster parameters based on an exponential model of the Pair Correlation Function(PCF). While convenient, the accuracy of these methods is not clear: e.g., does it depend on how the molecules are distributed within the clusters, or on cluster parameters? We analyze these methods for a variety of cluster models. We find that ra relates to true cluster size by a factor that is nonlinearly dependent on parameters and that can be arbitrarily large. For the PCF method, for the models analyzed, we obtain linear relationships between the estimators and true parameters, and the estimators were found to be within ±100% of true parameters, depending on the model. Our results, based on an extendable general framework, point to the need for caution in applying these methods.


  • Weak Convergence Analysis of Asymptotically Optimal Hypothesis Tests

    by Jayakrishnan Unnikrishnan, Dayu Huang

    In recent years, solutions to various hypothesis testing problems in the asymptotic setting have been proposed using the results from large deviation theory. Such tests are optimal in terms of appropriately defined error exponents. For the practitioner, however, error probabilities in the finite sample size setting are more important. In this paper, we show how results on weak convergence of the test statistic can be used to obtain better approximations for the error probabilities in the finite sample size setting. While this technique is popular among statisticians for common tests, we demonstrate its applicability for several recently proposed asymptotically optimal tests, including tests for robust goodness of fit, homogeneity tests, outlier hypothesis testing, and graphical model estimation.


  • Open Access

    Where You Are Is Who You Are: User Identification by Matching Statistics

    by Farid M. Naini, Jayakrishnan Unnikrishnan, Patrick Thiran, Martin Vetterli

    Most users of online services have unique behavioral or usage patterns. These behavioral patterns can be exploited to identify and track users by using only the observed patterns in the behavior. We study the task of identifying users from statistics of their behavioral patterns. Specifically, we focus on the setting in which we are given histograms of users' data collected during two different experiments. We assume that, in the first dataset, the users' identities are anonymized or hidden and that, in the second dataset, their identities are known. We study the task of identifying the users by matching the histograms of their data in the first dataset with the histograms from the second dataset. In recent works, the optimal algorithm for this user identification task is introduced. In this paper, we evaluate the effectiveness of this method on three different types of datasets and in multiple scenarios. Using datasets such as call data records, web browsing histories, and GPS trajectories, we show that a large fraction of users can be easily identified given only histograms of their data; hence these histograms can act as users' fingerprints. We also verify that simultaneous identification of users achieves better performance compared to one-by-one user identification. We show that using the optimal method for identification gives higher identification accuracy than heuristics-based approaches in practical scenarios. The accuracy obtained under this optimal method can thus be used to quantify the maximum level of user identification that is possible in such settings. We show that the key factors affecting the accuracy of the optimal identification algorithm are the duration of the data collection, the number of users in the anonymized dataset, and the resolution of the dataset. We analyze the effectiveness of k-anonymization in resisting user identification attacks on these datasets.

  • Open Access

    Unlabeled Sensing with Random Linear Measurements

    by Jayakrishnan Unnikrishnan, Saeid Haghighatshoar, Martin Vetterli

    We study the problem of solving a linear sensing system when the observations are unlabeled. Specifically we seek a solution to a linear system of equations y = Ax when the order of the observations in the vector y is unknown. Focusing on the setting in which A is a random matrix with i.i.d. entries, we show that if the sensing matrix A admits an oversampling ratio of 2 or higher, then with probability 1 it is possible to recover x exactly without the knowledge of the order of the observations in y. Furthermore, if x is of dimension K, then any 2K entries of y are sufficient to recover x. This result implies the existence of deterministic unlabeled sensing matrices with an oversampling factor of 2 that admit perfect reconstruction. The result is universal in that recovery is guaranteed for all possible choices of x. While the proof is constructive, it uses a combinatorial algorithm which is not practical, leaving the question of complexity open. We also analyze a noisy version of the problem and show that local stability is guaranteed by the solution. In particular, for every x, the recovery error tends to zero as the signal-to-noise-ratio tends to infinity. The question of universal stability is unclear. We also obtain a converse of the result in the noiseless case: If the number of observations in y is less than 2K, then with probability 1, universal recovery fails, i.e., with probability 1, there exists distinct choices of x which lead to the same unordered list of observations in y. In terms of applications, the unlabeled sensing problem is related to data association problems encountered in different domains including robotics where it is appears in a method called "simultaneous localization and mapping" (SLAM), multi-target tracking applications, and in sampling signals in the presence of jitter.

  • Where You Are Is Who You Are: User Identification by Matching Statistics

    by Farid M. Naini, Jayakrishnan Unnikrishnan, Patrick Thiran, Martin Vetterli

    Most users of online services have unique behavioral or usage patterns. These behavioral patterns can be exploited to identify and track users by using only the observed patterns in the behavior. We study the task of identifying users from statistics of their behavioral patterns. In particular, we focus on the setting in which we are given histograms of users' data collected during two different experiments. We assume that, in the first data set, the users' identities are anonymized or hidden and that, in the second data set, their identities are known. We study the task of identifying the users by matching the histograms of their data in the first data set with the histograms from the second data set. In recent works, the optimal algorithm for this user identification task is introduced. In this paper, we evaluate the effectiveness of this method on three different types of data sets with up to 50 000 users, and in multiple scenarios. Using data sets such as call data records, web browsing histories, and GPS trajectories, we demonstrate that a large fraction of users can be easily identified given only histograms of their data; hence, these histograms can act as users' fingerprints. We also verify that simultaneous identification of users achieves better performance compared with one-by-one user identification. Furthermore, we show that using the optimal method for identification indeed gives higher identification accuracy than the heuristics-based approaches in the practical scenarios. The accuracy obtained under this optimal method can thus be used to quantify the maximum level of user identification that is possible in such settings. We show that the key factors affecting the accuracy of the optimal identification algorithm are the duration of the data collection, the number of users in the anonymized data set, and the resolution of the data set. We also analyze the effectiveness of k-anonymization in resisting user identification attacks on these data sets.


  • On minimal trajectories for mobile sampling of bandlimited fields

    by Karlheinz Gröchenig, José Luis Romero, Jayakrishnan Unnikrishnan, Martin Vetterli