Sökning: "sparse coding"
Visar resultat 6 - 10 av 17 avhandlingar innehållade orden sparse coding.
6. Sparse Codes on Graphs with Convolutional Code Constraints
Sammanfattning : Modern coding theory is based on the foundation of the sparse codes on graphs, such as the low-density parity-check (LDPC) codes, and the turbo-like codes (TCs) with component convolutional codes. The success of the LDPC codes and the TCs lies in their ability to perform low-complexity iterative message passing decoding procedures. LÄS MER
7. Aspects of memory and representation in cortical computation
Sammanfattning : Denna avhandling i datalogi föreslår modeller för hur vissa beräkningsmässiga uppgifter kan utföras av hjärnbarken. Utgångspunkten är dels kända fakta om hur en area i hjärnbarken är uppbyggd och fungerar, dels etablerade modellklasser inom beräkningsneurobiologi, såsom attraktorminnen och system för gles kodning. LÄS MER
8. Feature-Based Image Processing for Rendering, Compression, and Visual Search
Sammanfattning : Visual communication, vivid, meaningful, and creative, permits a way to express information visually. The communication media, by images, graphs and videos, passes informative color and shape to human perception sensors. LÄS MER
9. Some computational aspects of attractor memory
Sammanfattning : In this thesis I present novel mechanisms for certain computational capabilities of the cerebral cortex, building on the established notion of attractor memory. A sparse binary coding network for generating efficient representation of sensory input is presented. LÄS MER
10. Analysis and Design of Rateless Codes
Sammanfattning : The invention of turbo codes and the re-discovery of sparse graph codes constitute a milestone in error-correction codes designed for communication and storage systems. Sparse graph codes such as low-density parity-check codes can offer a performance that approaches the previously elusive Shannon capacity with reasonable practical computational complexity. LÄS MER