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

facebooktwittermailshare

A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES

Abstract: 

We introduce a novel discrete signal processing framework, called discrete-lattice SP, for signals indexed by a finite lattice. A lattice is a partially ordered set that supports a meet (or join) operation that returns the greatest element below two given elements. Discrete-lattice SP chooses the meet as shift operation and derives associated notion of (meet-invariant) convolution, Fourier transform, frequency response, and a convolution theorem. Examples of lattices include sets of sets that are closed under intersection and trees. Thus our framework is applicable to certain sparse set functions, signals on sparse hypergraphs, and signals on trees. Another view on discrete-lattice SP is as an SP framework for a certain class of directed graphs. However, it is fundamentally different from the prior graph SP as it is based on more than one basic shift and all shifts are always simultaneously diagonalizable.

up
0 users have voted:

Paper Details

Authors:
Submitted On:
10 May 2019 - 8:23am
Short Link:
Type:
Poster
Event:
Presenter's Name:
Markus Püschel
Paper Code:
1328
Document Year:
2019
Cite

Document Files

Poster for publication DSP on meet/join lattices

(41)

Subscribe

[1] , "A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4319. Accessed: Dec. 09, 2019.
@article{4319-19,
url = {http://sigport.org/4319},
author = { },
publisher = {IEEE SigPort},
title = {A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES},
year = {2019} }
TY - EJOUR
T1 - A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES
AU -
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4319
ER -
. (2019). A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES. IEEE SigPort. http://sigport.org/4319
, 2019. A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES. Available at: http://sigport.org/4319.
. (2019). "A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES." Web.
1. . A DISCRETE SIGNAL PROCESSING FRAMEWORK FOR MEET/JOIN LATTICES WITH APPLICATIONS TO HYPERGRAPHS AND TREES [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4319