activity
20142023
most citedRobust Target Localization Based on Squared Range Iterative Reweighted Least Squares

24 citations · 78 across the 11 of their papers we have counts for

collaborators

12 papers

q-bio.NC2023

Upper bounds for integrated information

Alireza Zaeemzadeh, Giulio Tononi

Originally developed as a theory of consciousness, integrated information theory provides a mathematical framework to quantify the causal irreducibility of systems and subsets of u…

q-bio.NC2022★ 15 cited

Integrated information theory (IIT) 4.0: Formulating the properties of phenomenal existence in physical terms

Larissa Albantakis, Leonardo Barbosa, Graham Findlay +13

This paper presents Integrated Information Theory (IIT) 4.0. IIT aims to account for the properties of experience in physical (operational) terms. It identifies the essential prope…

q-bio.NC2022★ 21 cited

System Integrated Information

William Marshall, Matteo Grasso, William GP Mayner +7

Integrated information theory (IIT) starts from consciousness itself and identifies a set of properties (axioms) that are true of every conceivable experience. The axioms are trans…

cs.LG2021

RL-NCS: Reinforcement learning based data-driven approach for nonuniform compressed sensing

Nazmul Karim, Alireza Zaeemzadeh, Nazanin Rahnavard

A reinforcement-learning-based non-uniform compressed sensing (NCS) framework for time-varying signals is introduced. The proposed scheme, referred to as RL-NCS, aims to boost the…

cs.ET2019

AQuRate: MRAM-based Stochastic Oscillator for Adaptive Quantization Rate Sampling of Sparse Signals

Soheil Salehi, Ramtin Zand, Alireza Zaeemzadeh +2

Recently, the promising aspects of compressive sensing have inspired new circuit-level approaches for their efficient realization within the literature. However, most of these rece…

cs.CV2018★ 2 cited

Iterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision

Mohsen Joneidi, Alireza Zaeemzadeh, Nazanin Rahnavard +1

The goal of data selection is to capture the most structural information from a set of data. This paper presents a fast and accurate data selection method, in which the selected sa…

cs.CV2018

Norm-Preservation: Why Residual Networks Can Become Extremely Deep?

Alireza Zaeemzadeh, Nazanin Rahnavard, Mubarak Shah

Augmenting neural networks with skip connections, as introduced in the so-called ResNet architecture, surprised the community by enabling the training of networks of more than 1,00…

math.OC2018★ 24 cited

Robust Target Localization Based on Squared Range Iterative Reweighted Least Squares

Alireza Zaeemzadeh, Mohsen Joneidi, Behzad Shahrasbi +1

In this paper, the problem of target localization in the presence of outlying sensors is tackled. This problem is important in practice because in many real-world applications the…

math.OC2018★ 3 cited

Dynamic Sensor Selection for Reliable Spectrum Sensing via E-Optimal Criterion

Mohsen Joneidi, Alireza Zaeemzadeh, Nazanin Rahnavard

Reliable and efficient spectrum sensing through dynamic selection of a subset of spectrum sensors is studied. The problem of selecting K sensor measurements from a set of M potenti…

stat.AP2017★ 1 cited

Adaptive Non-uniform Compressive Sampling for Time-varying Signals

Alireza Zaeemzadeh, Mohsen Joneidi, Nazanin Rahnavard

In this paper, adaptive non-uniform compressive sampling (ANCS) of time-varying signals, which are sparse in a proper basis, is introduced. ANCS employs the measurements of previou…

cs.OH2015★ 12 cited

Missing Spectrum-Data Recovery in Cognitive Radio Networks Using Piecewise Constant Nonnegative Matrix Factorization

Alireza Zaeemzadeh, Mohsen Joneidi, Behzad Shahrasbi +1

In this paper, we propose a missing spectrum data recovery technique for cognitive radio (CR) networks using Nonnegative Matrix Factorization (NMF). It is shown that the spectrum m…

cs.IT2014

Matrix Coherency Graph: A Tool for Improving Sparse Coding Performance

Mohsen Joneidi, Mahdi Barzegar Khalilsarai, Alireza Zaeemzadeh +1

Exact recovery of a sparse solution for an underdetermined system of linear equations implies full search among all possible subsets of the dictionary, which is computationally int…