Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Irina Delia Nemoianu

dblp:120/7249 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Digital forensics and information hiding · 50% Network security · 50%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%
Computer networks
1 paper
Content delivery and video streaming · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing › source separation
blind source separation
0.212014
On a Hashing-Based Enhancement of Source Separation Algorithms Over Finite Fields With Network Coding Perspectives · IEEE Trans. Multim. 2014
Digital forensics and information hiding
information hiding
0.212014
On a Hashing-Based Enhancement of Source Separation Algorithms Over Finite Fields With Network Coding Perspectives · IEEE Trans. Multim. 2014
Network security
network coding
0.212014
On a Hashing-Based Enhancement of Source Separation Algorithms Over Finite Fields With Network Coding Perspectives · IEEE Trans. Multim. 2014
Content delivery and video streaming
multimedia transmission
0.112014
On a Hashing-Based Enhancement of Source Separation Algorithms Over Finite Fields With Network Coding Perspectives · IEEE Trans. Multim. 2014

Methods — techniques the papers use, named apart from their topics

non-linear message digest · 0.6entropy-based separation · 0.6
YearPublicationVenuePosition
2016 Softcast with per-carrier power-constrained channels
abstract
This paper considers the Softcast joint source-channel video coding scheme for data transmission over parallel channels with different power constraints and noise characteristics, typical in DSL or PLT channels. To minimize the mean square error at receiver, an optimal precoding matrix design problem has to be solved, which requires the solution of an inverse eigenvalue problem. Such solution is taken from the MIMO channel precoder design literature. Alternative suboptimal precoding matrices are also proposed and analyzed, showing the efficiency of the optimal precoding matrix within Softcast, which provides gains increasing with the encoded video quality.
Marc Antonini, Marco Cagnazzo, Lorenzo Guerrieri, Michel Kieffer, Irina Delia Nemoianu, Roger Samy
ICIP6
2014 On a Hashing-Based Enhancement of Source Separation Algorithms Over Finite Fields With Network Coding Perspectives
abstract
Blind Source Separation (BSS) deals with the recovery of source signals from a set of observed mixtures, when little or no knowledge of the mixing process is available. BSS can find an application in the context of network coding, where relaying linear combinations of packets maximizes the throughput and increases the loss immunity. By relieving the nodes from the need to send the combination coefficients, the overhead cost is largely reduced. However, the scaling ambiguity of the technique and the quasi-uniformity of compressed media sources makes it unfit, at its present state, for multimedia transmission. In order to open new practical applications for BSS in the context of multimedia transmission, we have recently proposed to use a non-linear encoding to increase the discriminating power of the classical entropy-based separation methods. Here, we propose to append to each source a non-linear message digest, which offers an overhead smaller than a per-symbol encoding and that can be more easily tuned. Our results prove that our algorithm is able to provide high decoding rates for different media types such as image, audio, and video, when the transmitted messages are less than 1.5 kilobytes, which is typically the case in a realistic transmission scenario.
Irina Delia Nemoianu, Claudio Greco 0001, Marco Cagnazzo, Béatrice Pesquet-Popescu
IEEE Trans. Multim.1
2013 On a practical approach to source separation over finite fields for network coding applications
abstract
In Blind Source Separation, or BSS, a set of source signals are recovered from a set of mixed observations without knowledge of the mixing parameters. Originated for real signals, BSS has recently been applied to finite fields, enabling more practical applications. However, classical entropy-based techniques do not perform well in finite fields. Here, we propose a non-linear encoding of the sources to increase the discriminating power of the separation methods. Our results show that the encoding improves the success rate of the separation for sources with few samples in large finite fields, both conditions met in practical networking applications. Our results open new possibilities in the context of network coding-wherein linear combinations of packets are sent in order to maximize throughput and increase loss immunity- by relieving the nodes from the need to send the combination coefficients, thus reducing the overhead cost.
Irina Delia Nemoianu, Claudio Greco 0001, Marc Castella, Béatrice Pesquet-Popescu, Marco Cagnazzo
ICASSP1
2012 A framework for joint multiple description coding and network coding over wireless ad-hoc networks
abstract
Network coding (NC) can achieve the maximum information flow in the network by allowing nodes to combine received packets before retransmission. Several papers have shown NC to be beneficial in mobile ad-hoc networks, but the delay introduced by buffered decoding raises a problem in real-time streaming applications. Here we propose to use NC jointly with multiple description coding (MDC) to allow instant decoding of the received packets. The optimal encoding coefficients are chosen via distributed optimisation of the expected video quality. Nodes receive up-to-date information about the network topology through a recently proposed protocol, originally designed for real-time streaming of MDC video. Results show that, due to the limitations imposed by instant decoding to the coding window size, our approach consistently outperforms the popular technique of random linear network coding.
Irina Delia Nemoianu, Claudio Greco 0001, Marco Cagnazzo, Béatrice Pesquet-Popescu
ICASSP1
2012 Multi-view video streaming over wireless networks with RD-optimized scheduling of network coded packets
abstract
Multi-view video streaming is an emerging video paradigm that enables new interactive services, such as free viewpoint television and immersive teleconferencing. However, it comes with a high bandwidth cost, as the equivalent of many single-view streams has to be transmitted. Network coding (NC) can improve the performance of the network by allowing nodes to combine received packets before retransmission. Several works have shown NC to be beneficiai in wireless networks, but the delay introduced by buffering before decoding raises a problem in real-time streaming applications. Here, we propose to use Expanding Window NC (EWNC) for multi-view streaming to allow immediate decoding of the received packets. The order in which the packets are included in the coding window is chosen via RD-optimization for the current sending opportunity. Results show that our approach consistently outperforms both classical NC applied on each view independently and transmission without NC.
Irina Delia Nemoianu, Claudio Greco 0001, Marco Cagnazzo, Béatrice Pesquet-Popescu
VCIP1