Sorry, you need to enable JavaScript to visit this website.

Emerging: Big Data

ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS

Paper Details

Authors:
Submitted On:
23 March 2016 - 9:10pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

icassp16_poster_ming_hou.pdf

(168 downloads)

Keywords

Subscribe

[1] , "ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1015. Accessed: Jun. 29, 2017.
@article{1015-16,
url = {http://sigport.org/1015},
author = { },
publisher = {IEEE SigPort},
title = {ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS},
year = {2016} }
TY - EJOUR
T1 - ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS
AU -
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1015
ER -
. (2016). ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS. IEEE SigPort. http://sigport.org/1015
, 2016. ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS. Available at: http://sigport.org/1015.
. (2016). "ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS." Web.
1. . ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1015

Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches

Paper Details

Authors:
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega
Submitted On:
21 March 2016 - 7:53pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ppt_v2.pdf

(201 downloads)

Keywords

Additional Categories

Subscribe

[1] Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega, "Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/941. Accessed: Jun. 29, 2017.
@article{941-16,
url = {http://sigport.org/941},
author = {Eyal En Gad; Akshay Gadde; Salman Avestimehr; Antonio Ortega },
publisher = {IEEE SigPort},
title = {Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches},
year = {2016} }
TY - EJOUR
T1 - Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches
AU - Eyal En Gad; Akshay Gadde; Salman Avestimehr; Antonio Ortega
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/941
ER -
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega. (2016). Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches. IEEE SigPort. http://sigport.org/941
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega, 2016. Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches. Available at: http://sigport.org/941.
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega. (2016). "Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches." Web.
1. Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega. Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/941

BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS


china temperature graph

The observation of frequency folding in graph spectrum during down-sampling for signals on bipartite graphs—analogous to the same phenomenon in Fourier domain for regularly sampled signals—has led to the development of critically sampled wavelet filterbanks such as GraphBior. However, typical graph-signals live on general graphs that are not necessarily bipartite.

Paper Details

Authors:
Jin Zeng, Gene Cheung, Antonio Ortega
Submitted On:
20 March 2016 - 10:58am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP16_Jin.pdf

(184 downloads)

Keywords

Subscribe

[1] Jin Zeng, Gene Cheung, Antonio Ortega, "BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/878. Accessed: Jun. 29, 2017.
@article{878-16,
url = {http://sigport.org/878},
author = {Jin Zeng; Gene Cheung; Antonio Ortega },
publisher = {IEEE SigPort},
title = {BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS},
year = {2016} }
TY - EJOUR
T1 - BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS
AU - Jin Zeng; Gene Cheung; Antonio Ortega
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/878
ER -
Jin Zeng, Gene Cheung, Antonio Ortega. (2016). BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS. IEEE SigPort. http://sigport.org/878
Jin Zeng, Gene Cheung, Antonio Ortega, 2016. BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS. Available at: http://sigport.org/878.
Jin Zeng, Gene Cheung, Antonio Ortega. (2016). "BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS." Web.
1. Jin Zeng, Gene Cheung, Antonio Ortega. BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/878

Distributed Estimation via Paid Crowd Work


Consider a distributed estimation problem to be carried out by paid crowdworkers, where results are to be returned quickly and accurately. Estimation accuracy is a function of the number of workers completing the job and of the quality of the workers, both of which may be influenced by the payment offered. With limited budget, payment allocation should consider both effects to obtain best results. Since people are not deterministic, payment offers will lead to a random number of variable-quality workers, as governed by choice models.

poster.pdf

PDF icon poster.pdf (256 downloads)

Paper Details

Authors:
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney
Submitted On:
19 March 2016 - 8:40pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

poster.pdf

(256 downloads)

Keywords

Subscribe

[1] Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney, "Distributed Estimation via Paid Crowd Work", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/840. Accessed: Jun. 29, 2017.
@article{840-16,
url = {http://sigport.org/840},
author = {Song Jianhan; Vei Wang Isaac Phua; and Lav R. Varshney },
publisher = {IEEE SigPort},
title = {Distributed Estimation via Paid Crowd Work},
year = {2016} }
TY - EJOUR
T1 - Distributed Estimation via Paid Crowd Work
AU - Song Jianhan; Vei Wang Isaac Phua; and Lav R. Varshney
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/840
ER -
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney. (2016). Distributed Estimation via Paid Crowd Work. IEEE SigPort. http://sigport.org/840
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney, 2016. Distributed Estimation via Paid Crowd Work. Available at: http://sigport.org/840.
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney. (2016). "Distributed Estimation via Paid Crowd Work." Web.
1. Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney. Distributed Estimation via Paid Crowd Work [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/840

Introduction to the Special Session on Topological Data Analysis


Topological Data Analysis (TDA) is a topic which has recently seen many applications. The goal of this special session is to highlight the bridge between signal processing, machine learning and techniques in topological data analysis. In this way, we hope to encourage more engineers to start exploring TDA and its applications. This paper briefly introduces the standard techniques used in this area, delineates the common theme connecting the works presented in this session, and concludes with a brief summary of each of the papers presented.

Paper Details

Authors:
Harish Chintakunta, Michael Robinson, Hamid Krim
Submitted On:
19 March 2016 - 8:29pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

20160324_ICASSP.pdf

(250 downloads)

Keywords

Subscribe

[1] Harish Chintakunta, Michael Robinson, Hamid Krim, "Introduction to the Special Session on Topological Data Analysis", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/839. Accessed: Jun. 29, 2017.
@article{839-16,
url = {http://sigport.org/839},
author = {Harish Chintakunta; Michael Robinson; Hamid Krim },
publisher = {IEEE SigPort},
title = {Introduction to the Special Session on Topological Data Analysis},
year = {2016} }
TY - EJOUR
T1 - Introduction to the Special Session on Topological Data Analysis
AU - Harish Chintakunta; Michael Robinson; Hamid Krim
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/839
ER -
Harish Chintakunta, Michael Robinson, Hamid Krim. (2016). Introduction to the Special Session on Topological Data Analysis. IEEE SigPort. http://sigport.org/839
Harish Chintakunta, Michael Robinson, Hamid Krim, 2016. Introduction to the Special Session on Topological Data Analysis. Available at: http://sigport.org/839.
Harish Chintakunta, Michael Robinson, Hamid Krim. (2016). "Introduction to the Special Session on Topological Data Analysis." Web.
1. Harish Chintakunta, Michael Robinson, Hamid Krim. Introduction to the Special Session on Topological Data Analysis [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/839

D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization

Paper Details

Authors:
Jean Lafond, Hoi-To Wai, Eric Moulines
Submitted On:
18 March 2016 - 2:56pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

d_fw_slides.pdf

(200 downloads)

Keywords

Subscribe

[1] Jean Lafond, Hoi-To Wai, Eric Moulines, "D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/775. Accessed: Jun. 29, 2017.
@article{775-16,
url = {http://sigport.org/775},
author = {Jean Lafond; Hoi-To Wai; Eric Moulines },
publisher = {IEEE SigPort},
title = {D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization},
year = {2016} }
TY - EJOUR
T1 - D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization
AU - Jean Lafond; Hoi-To Wai; Eric Moulines
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/775
ER -
Jean Lafond, Hoi-To Wai, Eric Moulines. (2016). D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization. IEEE SigPort. http://sigport.org/775
Jean Lafond, Hoi-To Wai, Eric Moulines, 2016. D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization. Available at: http://sigport.org/775.
Jean Lafond, Hoi-To Wai, Eric Moulines. (2016). "D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization." Web.
1. Jean Lafond, Hoi-To Wai, Eric Moulines. D-FW: Communication Efficient Distributed Algorithms for High-dimensional Sparse Optimization [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/775

Effecient Sensor Position Selection Using Graph Signal Sampling Theory


We consider the problem of selecting optimal sensor placements. The proposed approach is based on the sampling theorem of graph signals. We choose sensors that maximize the graph cut-off frequency, i.e., the most informative sensors for predicting the values on unselected sensors. We study the existing methods in the context of graph signal processing and clarify the relationship between these methods and the proposed approach. The effectiveness of our approach is verified through numerical experiments, showing advantages in prediction error and execution time.

Paper Details

Authors:
Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega
Submitted On:
18 March 2016 - 2:54am
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

Sakiyama_etal_ICASSP2016_3.pdf

(190 downloads)

Keywords

Subscribe

[1] Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega, "Effecient Sensor Position Selection Using Graph Signal Sampling Theory", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/761. Accessed: Jun. 29, 2017.
@article{761-16,
url = {http://sigport.org/761},
author = {Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega },
publisher = {IEEE SigPort},
title = {Effecient Sensor Position Selection Using Graph Signal Sampling Theory},
year = {2016} }
TY - EJOUR
T1 - Effecient Sensor Position Selection Using Graph Signal Sampling Theory
AU - Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/761
ER -
Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega. (2016). Effecient Sensor Position Selection Using Graph Signal Sampling Theory. IEEE SigPort. http://sigport.org/761
Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega, 2016. Effecient Sensor Position Selection Using Graph Signal Sampling Theory. Available at: http://sigport.org/761.
Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega. (2016). "Effecient Sensor Position Selection Using Graph Signal Sampling Theory." Web.
1. Yuichi Tanaka; Toshihisa Tanaka; Antonio Ortega. Effecient Sensor Position Selection Using Graph Signal Sampling Theory [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/761

Signal Processing on Graphs: Performance of Graph Structure Estimation

Paper Details

Authors:
Jonathan Mei, José M F Moura
Submitted On:
15 March 2016 - 4:02pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

icassp_jmei2016.pptx

(182 downloads)

Keywords

Subscribe

[1] Jonathan Mei, José M F Moura, "Signal Processing on Graphs: Performance of Graph Structure Estimation", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/696. Accessed: Jun. 29, 2017.
@article{696-16,
url = {http://sigport.org/696},
author = {Jonathan Mei; José M F Moura },
publisher = {IEEE SigPort},
title = {Signal Processing on Graphs: Performance of Graph Structure Estimation},
year = {2016} }
TY - EJOUR
T1 - Signal Processing on Graphs: Performance of Graph Structure Estimation
AU - Jonathan Mei; José M F Moura
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/696
ER -
Jonathan Mei, José M F Moura. (2016). Signal Processing on Graphs: Performance of Graph Structure Estimation. IEEE SigPort. http://sigport.org/696
Jonathan Mei, José M F Moura, 2016. Signal Processing on Graphs: Performance of Graph Structure Estimation. Available at: http://sigport.org/696.
Jonathan Mei, José M F Moura. (2016). "Signal Processing on Graphs: Performance of Graph Structure Estimation." Web.
1. Jonathan Mei, José M F Moura. Signal Processing on Graphs: Performance of Graph Structure Estimation [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/696

SmartRoadSense - A collaborative project for monitoring road surface conditions


SmartRoadSense is a collaborative project aimed at monitoring road surface conditions exploiting the sensors, i.e., accelerometers and GPS, commonly embedded in most mobile devices. Given a smartphone connected to the cabin of a car travelling on a road, the SmartRoadSense app analyzes the accelerometer signals and extracts a roughness index (based on a linear predictive coding analysis) characterizing the quality of the road.

Paper Details

Authors:
Emanuele Lattanzi, Valerio Freschi, Alessandro Bogliolo
Submitted On:
5 April 2016 - 5:31am
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

SmartRoadSense.pdf

(158 downloads)

Keywords

Additional Categories

Subscribe

[1] Emanuele Lattanzi, Valerio Freschi, Alessandro Bogliolo, "SmartRoadSense - A collaborative project for monitoring road surface conditions", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/677. Accessed: Jun. 29, 2017.
@article{677-16,
url = {http://sigport.org/677},
author = {Emanuele Lattanzi; Valerio Freschi; Alessandro Bogliolo },
publisher = {IEEE SigPort},
title = {SmartRoadSense - A collaborative project for monitoring road surface conditions},
year = {2016} }
TY - EJOUR
T1 - SmartRoadSense - A collaborative project for monitoring road surface conditions
AU - Emanuele Lattanzi; Valerio Freschi; Alessandro Bogliolo
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/677
ER -
Emanuele Lattanzi, Valerio Freschi, Alessandro Bogliolo. (2016). SmartRoadSense - A collaborative project for monitoring road surface conditions. IEEE SigPort. http://sigport.org/677
Emanuele Lattanzi, Valerio Freschi, Alessandro Bogliolo, 2016. SmartRoadSense - A collaborative project for monitoring road surface conditions. Available at: http://sigport.org/677.
Emanuele Lattanzi, Valerio Freschi, Alessandro Bogliolo. (2016). "SmartRoadSense - A collaborative project for monitoring road surface conditions." Web.
1. Emanuele Lattanzi, Valerio Freschi, Alessandro Bogliolo. SmartRoadSense - A collaborative project for monitoring road surface conditions [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/677

Non-monotone Quadratic Potential Games with single Quadratic constraints


We consider the problem of solving a quadratic potential game with single quadratic constraints, under no monotonicity condition of the game, nor convexity in any of the player's problem. We show existence of Nash equilibria (NE) in the game, and propose a framework to calculate Pareto efficient solutions. Regarding the corresponding non-convex potential function, we show that strong duality holds with its corresponding dual problem, give existence results of solutions and present conditions for global optimality. Finally, we propose a centralized method to solve the potential problem, and a distributed version for compact constraints. We also present simulations showing convergence behavior of the proposed distributed algorithm.

Paper Details

Authors:
Santiago Zazo, Sergio Valcarcel Macua
Submitted On:
29 March 2016 - 9:57am
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

quadratic_poster.pdf

(110 downloads)

Keywords

Additional Categories

Subscribe

[1] Santiago Zazo, Sergio Valcarcel Macua, "Non-monotone Quadratic Potential Games with single Quadratic constraints", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/632. Accessed: Jun. 29, 2017.
@article{632-16,
url = {http://sigport.org/632},
author = {Santiago Zazo; Sergio Valcarcel Macua },
publisher = {IEEE SigPort},
title = {Non-monotone Quadratic Potential Games with single Quadratic constraints},
year = {2016} }
TY - EJOUR
T1 - Non-monotone Quadratic Potential Games with single Quadratic constraints
AU - Santiago Zazo; Sergio Valcarcel Macua
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/632
ER -
Santiago Zazo, Sergio Valcarcel Macua. (2016). Non-monotone Quadratic Potential Games with single Quadratic constraints. IEEE SigPort. http://sigport.org/632
Santiago Zazo, Sergio Valcarcel Macua, 2016. Non-monotone Quadratic Potential Games with single Quadratic constraints. Available at: http://sigport.org/632.
Santiago Zazo, Sergio Valcarcel Macua. (2016). "Non-monotone Quadratic Potential Games with single Quadratic constraints." Web.
1. Santiago Zazo, Sergio Valcarcel Macua. Non-monotone Quadratic Potential Games with single Quadratic constraints [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/632

Pages