Übersetzung für "State transition diagram" in Deutsch

In other words, the state transition diagram of FIG.

Figure 2, below, shows the state-transition diagram.

This RDM algorithm converts the exponential search tree to a linear state transition diagram, which makes R-D optimization possible in the first place.

Here, the trellis diagram 450 corresponds to the representation of the state transition diagram 400 which is plotted via the time axis.

In the second step 20, a trellis, or a state transition diagram, is constructed from the R-D data thus collected, wherein an optimum path, or the optimum order of quantization parameter values Qi*, is selected using a cost function.

In still other words, a compression rate—distortion-multipass video encoding method was described in the foregoing, which is applicable to MPEG-4, for example, and addresses the problem of dependent quantization in a hybrid encoding scheme by constructing, or building, a state transition diagram from the exponentially growing search tree, which is then searched using a Lagrange cost function, for example.

Further, in step 202, a state transition diagram was built in the foregoing, according to which the optimum set of encoding parameter values could be established by state transitions, based on an initial state.

In the second substep 204 of the optimization step 20, the generated state transition diagram is searched using the Viterbi algorithm and a Lagrange cost function.

Based on this similar-distortion assumption just explained, states with a similar distortion are merged with each other in step 202 to obtain a connected state transition diagram.

In this optimization step, a Viterbi algorithm is used, for example, to find the optimum path through the constructed state transition diagram.

As mentioned in the foregoing, in the last step 30, the frame sequence is encoded using the optimum order of quantization parameter values Qi*, if desired, wherein it should be understood that, since the state transition diagram was the result of an estimation as described in the foregoing, the actual distortion and the actual compression rate of the encoded frame sequence may be different than would be expected from the minimum of the Lagrange cost function, for example.

In the first substep 202, a state transition diagram, or trellis, is constructed from the collected data points or D/R tuples.

Each branch connecting two states of the state transition diagram is characterized by the quantization parameter value Q used to reach the next state, and the resulting values for R and D for this frame.

As far as it has previously been described, the construction of the tree structure of FIG. 2, or the corresponding state transition diagram of FIG. 3, represents an inherent result of steps 102 - 106 of data collection step 10 .

Consequently, the state transition diagram, or trellis, in its current form up to now as inherently obtained from steps 102 - 106 is not yet suitable for use for optimization since a change in the quantization parameter value is not yet possible.

Thus, the ends of these incomplete paths are returned back, via transition branches, from the previous tree structure level into the current tree structure level onto the main paths, whereby a state transition diagram results, from which an optimum path may be established such that it leads to an optimum order of encoding parameter values for encoding the frame sequence with regard to a desired trade-off between compression rate and image quality, or image distortion.

I use state transition diagrams for object classes that typically have a lot of dynamic behavior.

Examples of semiformal styles include data-flow diagrams, state transition diagrams, entity-relationship diagrams, data structure diagrams, process or program structure diagrams, and the CCITT recommended specification notation SDL.

Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudo code, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown.