Constructing and decoding GWBE codes using Kronecker products
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper, we present a no-reference blur metric for images and video. The blur metric is based on the analysis of the spread of the edges in an image. Its perceptual significance is validated through subjective experiments. The novel metric is near re ...
Multiple description (MD) coding is a source coding technique for information transmission over unreliable networks. In MD coding, the coder generates several different descriptions of the same signal and the decoder can produce a useful reconstruction of ...
Institute of Electrical and Electronics Engineers2002
This paper describes a backtracking algorithm for the enumeration of nonisomorphic minimally nonideal (n2n) matrices that are not degenerate projective planes. The application of this algorithm for nh12 yielded 20 such matrices, adding 5 matrices to the 15 ...
A novel approach to shadow detection is presented in this paper. The method is based on the use of invariant color models to identify and to classify shadows in digital images. The procedure is divided into two levels: first, shadow candidate regions are e ...
The mechanism of neurite penetration of three-dimensional fibrin matrices was investigated by culturing embryonic chick dorsal root ganglia (DRGs) within fibrin gels, upon fibrin gels, and upon laminin. The length of neurites within three-dimensional matri ...
We derive a recursive algorithm for the time-update of the triangular factors of non-Hermitian time-variant matrices with structure. These are matrices that undergo low-rank modifications as time progresses. special cases of which often arise in adaptive f ...
This paper proposes a method to embed information into a 3D model represented by a polygonal mesh. The approach used consists in slightly changing the position of the vertices, in uencing the length of approximation of the normals to the surface. This tech ...
We present a new approach to the discrete-time Chandrasekhar recursions and some generalizations thereof. We extend the recursions to a class of structured time-variant state-space models, and discuss connections with the (generalized) Schur algorithm. We ...
