4 resultados para depth map
em WestminsterResearch - UK
Resumo:
A simple but effective technique to improve the performance of the Max-Log-MAP algorithm is to scale the extrinsic information exchanged between two MAP decoders. A comprehensive analysis of the selection of the scaling factors according to channel conditions and decoding iterations is presented in this paper. Choosing a constant scaling factor for all SNRs and iterations is compared with the best scaling factor selection for changing channel conditions and decoding iterations. It is observed that a constant scaling factor for all channel conditions and decoding iterations is the best solution and provides a 0.2-0.4 dB gain over the standard Max- Log-MAP algorithm. Therefore, a constant scaling factor should be chosen for the best compromise.
Resumo:
The iterative nature of turbo-decoding algorithms increases their complexity compare to conventional FEC decoding algorithms. Two iterative decoding algorithms, Soft-Output-Viterbi Algorithm (SOVA) and Maximum A posteriori Probability (MAP) Algorithm require complex decoding operations over several iteration cycles. So, for real-time implementation of turbo codes, reducing the decoder complexity while preserving bit-error-rate (BER) performance is an important design consideration. In this chapter, a modification to the Max-Log-MAP algorithm is presented. This modification is to scale the extrinsic information exchange between the constituent decoders. The remainder of this chapter is organized as follows: An overview of the turbo encoding and decoding processes, the MAP algorithm and its simplified versions the Log-MAP and Max-Log-MAP algorithms are presented in section 1. The extrinsic information scaling is introduced, simulation results are presented, and the performance of different methods to choose the best scaling factor is discussed in Section 2. Section 3 discusses trends and applications of turbo coding from the perspective of wireless applications.
Resumo:
Of the many ways in which depth can be intimated in drawings, perspective has undoubtedly been one of the most frequently examined. But there is also an equally rich history associated with other forms of pictorial representation. Alternatives to perspective became particularly significant in the early twentieth century as artists and architects, intent on throwing off the conventions of their predecessors, looked to new ways of depicting depth. In architecture, this tendency was exemplified by Modernism’s preference for parallel projection – most notably axonometric and oblique. The use of these techniques gave architects the opportunity to convey a new and uniquely modern form of spatial expression. At once shallow and yet expansive, a key feature of these drawings was their ability to support perceptual ambiguity. This paper will consider the philosophy and science of vision, out of which these preoccupations emerged. In this context, the nineteenth-century discovery of stereopsis and the invention of the stereoscope will be used to illustrate the way in which attempts to test the limits of spatial perception led to an opening up of visual experience; and provided a definition of visual experience that could encompass the representational ambiguities later exploited by the early twentieth-century avant-garde.
Resumo:
At the core of this paper is a psychosocial inquiry into the Marxist concept of alienation and its applications to the field of digital labour. Following a brief review of different theoretical works on alienation, it looks into its recent conceptualisations and applications to the study of online social networking sites. Finally, the authors offer suggestions on how to extend and render more complex these recent approaches through in-depth analyses of Facebook posts that exemplify how alienation is experienced, articulated, and expressed online. For this perspective, the article draws on Rahel Jaeggi’s (2005) reassessment of alienation, as well as the depth-hermeneutic method of “scenic understanding” developed by Alfred Lorenzer (e.g. 1970; 1986).