Sentence examples for per frame time from inspiring English sources
Low-frequency (a few cycles per frame time) scan distortion.
For dissimilarities involving position in frame and frame time, we define four dissimilarities: two for the motion (based on tracklets or optical-flows), one for the speed (in pixel per frame time), and one for the time.
This means that a total of 4 | C | bits per frame time T f is required by DLF-BRSA, which corresponds to a feedback rate on the order of a few tens of kilobits per second, given that | C | is usually on the order of tens to hundreds (e.g., see [2, 3]).
This was done by calculating the ratio of the per-frame run time of DISCOVER to H.264 (intra) from results presented in [38].
In Table 4, we provide a comparison on the per-frame computational time for the proposed template-matching-based lattice rescoring and the HMM baseline.
This result in approximately 24.6 ms per frame processing time, which is smaller than the speech signal frame rate.
Table 7 Parameter set for the reachability analysis of an example MANET Parameter Value Playground 100 m ×100 m Total nodes 300 Transmission radius 40 m Average neighborhood 100 Listening probability, p 0.0005 Slots per frame Tx time, τ 100 Rebroadcasting probabilities P tx 0.04, 0.06, 0.08 and 0.11 Mobility No.
SPECT/CT of the upper abdomen including organs at risk (kidneys, liver and spleen), applying 120 frames with a 30-s exposure time per frame (total acquisition time for SPECT is then 30 min), was performed.
LG's screen offers 8 million pixels per frame, four times the resolution of 1080p high-definition displays.
Under the conditions (fc ≈ 1.2 MHz, R = 7 fps, and W x × W y = 150 × 75 nm) used for the noninvasive imaging of tail truncated myosin V moving on an actin filament, one of the myosin's two motor domains (Atop ∼25 nm) is tapped with the tip ∼380 times per frame and ∼60 000 times in total during the 23 s movie acquisition time.
We assume by real time a value close to 1/24s per frame, thus real time performance is likely to be achieved by using a non-interpreted programming language.
