Home

Results 1 - 10 of 144,743 for complexities. Search took 0.825 seconds.  
Sort by date/Sort by relevance
Section 3 contains a summary of complexity related activities occurring since Fairfax including an announcement of complexity related contributions registered for the Klagenfurt meeting. 2 Summary of Complexity Related Contributions Adopted in Fairfax Three contributions related to H.26L complexity were adopted at the Fairfax meeting. (...) Simulation results are provided showing that the proper use of AVC tools allows for the same performances of the most complex configuration (“everything on”) at the expense of an acceptable complexity increase vs. the simple one. 3.1 Reflector Activity There was surprisingly little communication on the complexity minimization AHG reflector: owner-jvt-complexity-list@imec.be . (...) [Sato+] Adaptive MC Interpolation for Complexity Reduction JVT-D088 Info. [Tabatabai+] Verif. for JVT-C038 (Arith coding complexity bound) JVT-D110 Prop.
Language:English
Score: 563700.73 - https://www.itu.int/wftp3/av-a...002_07_Klagenfurt/JVT-D008.doc
Data Source: un
Section 2 contains a summary of contributions related to H.26L complexity presented at the JVT Geneva meeting. Section 3 contains a summary of complexity related activities occurring since Geneva including an announcement of complexity related contributions registered for the Fairfax meeting. Section 4 provides a list of references. 2 Summary of Complexity Related Contributions from Geneva Several contributions related to H.26L complexity were presented at the Geneva meeting. (...) Results The reduction in software complexity was estimated to be a factor of 2-4. A remark was made that the reduction in hardware complexity is smaller than the complexity reduction in software.
Language:English
Score: 560138.04 - https://www.itu.int/wftp3/av-a...e/2002_05_Fairfax/JVT-C016.doc
Data Source: un
Section 3 contains a summary of complexity related activities occurring since Pattaya including an announcement of complexity related contributions registered for the Geneva meeting. Section 4 provides a list of references. 2 Summary of Complexity Related Contributions from Pattaya Several contributions related to H.26L complexity were presented at the Pattaya meeting. (...) The loop filter ad hoc group was activated again to evaluate and harmonize new proposals. 2.4.2 Medium Complexity Loop-Filter A loop filter algorithm with lower complexity than the one found in TML 8.5 was presented.
Language:English
Score: 558584.13 - https://www.itu.int/wftp3/av-a...deo-site/0201_Gen/JVT-B012.doc
Data Source: un
Section 3 contains a summary of complexity related activities occurring since Pattaya including an announcement of complexity related contributions registered for the Geneva meeting. Section 4 provides a list of references. 2 Summary of Complexity Related Contributions from Pattaya Several contributions related to H.26L complexity were presented at the Pattaya meeting. (...) The loop filter ad hoc group was activated again to evaluate and harmonize new proposals. 2.4.2 Medium Complexity Loop-Filter A loop filter algorithm with lower complexity than the one found in TML 8.5 was presented.
Language:English
Score: 558584.13 - https://www.itu.int/wftp3/av-a...te/2002_01_Geneva/JVT-B012.doc
Data Source: un
Different techniques have been used to achieve the goal of reduced complexity. All contributions provide solutions to the major complexity problem in TML-8. (...) Complexity Algorithm complexity: Estimates of complexity should count the cycles corresponding to all operations, including memory accesses. In estimating complexity of memory access the complexity of address generation must be included for fast algorithms that access nonsequential addresses.
Language:English
Score: 557132.7 - https://www.itu.int/wftp3/av-a...deo-site/0109_San/VCEG-N78.doc
Data Source: un
A more detailed description will follow when it is complete. 4.1 Computational Complexity We will measure each algorithm’s computational complexity for an average and worst case. (...) Average complexity will be measured for each of the sources specified in the common conditions document. 4.2 Storage Complexity We will measure the storage complexity of each algorithm by summing the number of bytes of memory allocated in all memory buffers of substantial size. (...) File:perf vs complexity Page: 1 Date Printed: 1/11/01
Language:English
Score: 556041.55 - https://www.itu.int/wftp3/av-a...deo-site/0101_Eib/VCEG-L36.doc
Data Source: un
The joint complexity of the transform and quantization must be considered. (...) In this regard, the trade-off between complexity reduction and coding efficiency must be evaluated. 1. (...) The trade-off between complexity reduction and coding performance will govern this decision.
Language:English
Score: 553752.54 - https://www.itu.int/wftp3/av-a...o-site/0109_San/VCEG-N78r1.doc
Data Source: un
Mandates · Investigate measurement criteria to assess the complexity of encoder and decoder algorithmic design elements, including computational complexity, parallelism, memory bandwidth, memory capacity, dynamic range requirements, etc. · Identify and recommend tools for algorithmic complexity assessment Reflector activity There was moderate activity on the e-mail reflector related to Complexity Assessment since the July meeting. A total of 18 e-mails on the subject were exchanged. · It has been pointed out that the concept of “complexity” still needs a satisfactory definition. · It has been suggested that the computational complexity could be assessed by measuring the CPU clock cycles using the rdtsc instruction, but there was no consensus on the reliability of this kind of measure. · It has been suggested to use profile tools like e.g. (...) The reason for that has not been clarified yet. 1 Related contributions Several Tool Experiments ran between the last meeting and the current meeting aimed at providing both coding efficiency and complexity measurement results. The AHG recommends the JCT-VC experts to review the complexity results considering possible issues with precision, accuracy and reproducibility on different systems. 2 Conclusions The AHG encourages further simulation experiments and discussions among JCT-VC experts to reach consensus on suitable complexity definitions and methods to measure it.
Language:English
Score: 553624.95 - https://www.itu.int/wftp3/av-a..._10_C_Guangzhou/JCTVC-C010.doc
Data Source: un
The following H.26L complexity documents were registered for this meeting as of noon on March 27: VCEG-M23 Investigation of complexity and coding performance for different motion search ranges. (...) VCEG-M21 Investigation of complexity and coding performance for reduced complexity in-loop deblocking filter. (...) VCEG-M34 Investigation of complexity and coding performance for: a) Rate-Distortion Quantization vs.
Language:English
Score: 553508.5 - https://www.itu.int/wftp3/av-a...deo-site/0104_Aus/VCEG-M06.doc
Data Source: un
Different techniques have been used to achieve the goal of reduced complexity. We provide some criteria to evaluate implementation complexity. 2. (...) In estimating complexity of memory access the complexity of address generation must be included for fast algorithms that access nonsequential addresses. (...) We propose a goal of supporting low complexity decoding with 12-bit source data. 4. References 1.
Language:English
Score: 553208.64 - https://www.itu.int/wftp3/av-a...deo-site/0109_San/VCEG-N69.doc
Data Source: un