Search results for " Coding"
showing 10 items of 139 documents
Whatever next? Predictive brains, situated agents, and the future of cognitive science
2012
In the target article, Andy Clark addresses the question of how a probabilistic predictive coding model of the mind relates to our personal level mental lives. This question, he suggests, is “potentially the most important” (MS46). The question is important indeed, but Clark’s answer fails to capitalize on another possible advantage of this approach. Clark suggests that there is a disconnect between the way the world appears to us, on one hand, and the way that it is represented in the brain, on the other. He deals with this disconnect by limiting the scope of the theory, by pointing out that he is discussing a theory of how brains encode and process information, not a theory about how thin…
Polyomino Number Theory (II)
2003
Polyominoes are connected plane figures formed of joining unit squares edge to edge. We have a monomino, a domino, two trominoes named I and V, five tetrominoes named I, L, N, O and T, respectively, and twelve pentominoes (a registered trademark of Solomon W. Golomb) named F, I, L, N, P, T, U, V, W, X, Y and Z respectively.
New super-orthogonal space-time trellis codes using differential M-PSK for noncoherent mobile communication systems with two transmit antennas
2010
Published version of an article in the journal: Annals of Telecommunications-Annales Des Telecommunications. Also available from the publisher at: http://dx.doi.org/10.1007/s12243-010-0191-1 In this paper, we develop super-orthogonal space-time trellis codes (SOSTTCs) using differential binary phase-shift keying, quadriphase-shift keying and eight-phase shift keying for noncoherent communication systems with two transmit antennas without channel state information at the receiver. Based on a differential encoding scheme proposed by Tarokh and Jafarkhani, we propose a new decoding algorithm with reduced decoding complexity. To evaluate the performance of the SOSTTCs by way of computer simulat…
Low-Rate Reduced Complexity Image Compression using Directionlets
2006
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth images. However, it fails to capture efficiently one-dimensional (1-D) discontinuities, like edges and contours, that are anisotropic and characterized by geometrical regularity along different directions. In our previous work, we proposed a construction of critically sampled perfect reconstruction anisotropic transform with directional vanishing moments (DVM) imposed in the corresponding basis functions, called directionlets. Here, we show that the computational complexity of our transform is comparable to the co…
Playfully Coding
2017
This paper describes a framework for successful interaction between universities and schools. It is common for computing academics interested in outreach (computer science evangelism) to work with local schools, particularly in countries where the computing curriculum in K-12 is new or underdeveloped. However it is rare for these collaborations to be ongoing, and for resources created through these school-university links to be shared beyond the immediate neighborhood. We have achieved this, through shared resources, careful evaluation, and cross-country collaboration. The activities themselves are inspired by ideas from the Lifelong Kindergarten group at MIT, emphasizing playful exploratio…
A GPU-Based DVC to H.264/AVC Transcoder
2010
Mobile to mobile video conferencing is one of the services that the newest mobile network operators can offer to users With the apparition of the distributed video coding paradigm which moves the majority of complexity from the encoder to the decoder, this offering can be achieved by introducing a transcoder This device has to convert from the distributed video coding paradigm to traditional video coding such as H.264/AVC which is formed by simpler decoders and more complex encoders, and allows to the users to execute only the low complex algorithms In order to deal with this high complex video transcoder, this paper introduces a graphics processing unit based transcoder as base station The…
Topology Inference and Signal Representation Using Dictionary Learning
2019
This paper presents a Joint Graph Learning and Signal Representation algorithm, called JGLSR, for simultaneous topology learning and graph signal representation via a learned over-complete dictionary. The proposed algorithm alternates between three main steps: sparse coding, dictionary learning, and graph topology inference. We introduce the “transformed graph” which can be considered as a projected graph in the transform domain spanned by the dictionary atoms. Simulation results via synthetic and real data show that the proposed approach has a higher performance when compared to the well-known algorithms for joint undirected graph topology inference and signal representation, when there is…
Single neuron binding properties and the magical number 7
2008
When we observe a scene, we can almost instantly recognize a familiar object or can quickly distinguish among objects differing by apparently minor details. Individual neurons in the medial temporal lobe of humans have been shown to be crucial for the recognition process, and they are selectively activated by different views of known individuals or objects. However, how single neurons could implement such a sparse and explicit code is unknown and almost impossible to investigate experimentally. Hippocampal CA1 pyramidal neurons could be instrumental in this process. Here, in an extensive series of simulations with realistic morphologies and active properties, we demonstrate how n radial (ob…
Out-of-Band Signaling Scheme for High Speed Wireless LANs
2007
In recent years, the physical layer data rate provided by 802.11 Wireless LANs has dramatically increased thanks to significant advances in the modulation and coding techniques employed. However, previous studies show that the 802.11 MAC operation, namely the distributed coordination function (DCF), represents a limiting factor: the throughput efficiency drops as the channel bit rate increases, and a throughput upper limit does indeed exist when the channel bit rate goes to infinite high. These findings indicate that the performance of the DCF protocol will not be efficiently improved by merely increasing the channel bit rate. This paper shows that the DCF performance may significantly bene…
Improved Statistically Based Retrievals via Spatial-Spectral Data Compression for IASI Data
2019
In this paper, we analyze the effect of spatial and spectral compression on the performance of statistically based retrieval. Although the quality of the information is not com- pletely preserved during the coding process, experiments reveal that a certain amount of compression may yield a positive impact on the accuracy of retrievals. We unveil two strategies, both with interesting benefits: either to apply a very high compression, which still maintains the same retrieval performance as that obtained for uncompressed data; or to apply a moderate to high compression, which improves the performance. As a second contribution of this paper, we focus on the origins of these benefits. On the one…