0000000000647462

AUTHOR

Emanuele Brugnoli

showing 3 related works from this author

Iterative Reconstruction of Signals on Graph

2020

We propose an iterative algorithm to interpolate graph signals from only a partial set of samples. Our method is derived from the well known Papoulis-Gerchberg algorithm by considering the optimal value of a constant involved in the iteration step. Compared with existing graph signal reconstruction algorithms, the proposed method achieves similar or better performance both in terms of convergence rate and computational efficiency.

Signal Processing (eess.SP)signal processing algorithmIterative methodComputer science02 engineering and technologyIterative reconstructionSettore MAT/08 - Analisi NumericaSettore MAT/05 - Analisi Matematica0202 electrical engineering electronic engineering information engineeringFOS: MathematicsFOS: Electrical engineering electronic engineering information engineeringsignal reconstructionMathematics - Numerical AnalysisElectrical and Electronic EngineeringElectrical Engineering and Systems Science - Signal ProcessingSignal reconstructionApplied Mathematics020206 networking & telecommunicationsNumerical Analysis (math.NA)Graphspectral analysisGraph theoryRate of convergenceSignal ProcessingGraph (abstract data type)Algorithmsignal processing algorithmsInterpolation
researchProduct

Enumerating the Walecki-Type Hamiltonian Cycle Systems

2017

Let Kv be the complete graph on v vertices. A Hamiltonian cycle system of odd order v (briefly HCS(v)) is a set of Hamiltonian cycles of Kv whose edges partition the edge set of Kv. By means of a slight modification of the famous HCS(4n+1) of Walecki, we obtain 2n pairwise distinct HCS(4n+1) and we enumerate them up to isomorphism proving that this is equivalent to count the number of binary bracelets of length n, i.e. the orbits of Dn, the dihedral group of order 2n, acting on binary n-tuples.

Discrete mathematicsComplete graphBinary number020206 networking & telecommunications0102 computer and information sciences02 engineering and technologyDihedral group01 natural sciencesHamiltonian pathCombinatoricssymbols.namesake010201 computation theory & mathematicsPhysics::Space Physics0202 electrical engineering electronic engineering information engineeringsymbolsDiscrete Mathematics and CombinatoricsPartition (number theory)Hamiltonian (quantum mechanics)MathematicsJournal of Combinatorial Designs
researchProduct

Iterative Methods for Signal Reconstruction on Graphs

2016

In applications such as social, energy, transportation, sensor, and neuronal networks, big data naturally reside on the vertices of graphs. Each vertex stores a sample, and the collection of these samples is referred to as a graph signal. The product of the network graph with the time series graph is considered as underlying structure for the evolution through time of graph signal “snapshots”. The framework of signal processing on graphs [4] extends concepts and methodologies from classical discrete signal processing. The task of sampling and recovery is one of the most critical topics in the signal processing community. In this talk, we present some localized iterative methods, obtained by…

Settore MAT/04 - Matematiche Complementari--
researchProduct