نتایج جستجو برای: video-prompted DCTs

تعداد نتایج: 191315  

2010

Discrete cosine transform (DCT) plays an important role in video coding. Integer DCTs which approximate the standard DCT– II have been developed for various sizes i.e., N = 4, 8, 16, etc. In this paper, a review of various integer DCTs used in H.264, AVSchina and VC-1 is provided. For a first order Markov process, with high adjacent correlation coefficient, ρ = 0.95 and N=8 properties like tran...

Abstract: Over the last few decades, several aspects of pragmatic knowledge and its effects on teaching  and  learning  a  second  language  (L2)  have  been  explored  in  many  studies.  However, among  various  studies,  the  area  of  interlanguage  pragmatic  (ILP)  assessment  is  quite  novel issue and many features of it have remained unnoticed. As ILP assessment has received more atten...

Journal: :EURASIP J. Image and Video Processing 2013
Taizo Suzuki Masaaki Ikehara

The discrete cosine transforms (DCTs) have found wide applications in image/video compression (image coding). DCT-based lapped transforms (LTs), called fast LTs (FLTs), overcome blocking artifacts generated at low bit rate image coding by DCT while keeping fast implementation. This paper presents a realization of more effective integer FLT (IntFLT) for lossy-to-lossless image coding, which is u...

2017
T. Kavitha

This paper presents a fully scalable reconfigurable parallel architecture for the computation of approximate DCT based on the algorithm. One uniquely interesting feature of the existing design is that it could be configured for the computation of 32-point DCTs for parallel computation of two 16-pointDCTs, four 8-point DCTs. We have proposed the computation of 64-point DCTs for parallel computat...

2000
Yoochang Jung Stefan G. Berg Donglok Kim Yongmin Kim

2D convolution and 2D transforms, such as wavelet transform and discrete cosine transform (DCT), are widely used in image and video processing. To reduce the computation complexity, these algorithms are often implemented in two separable passes of 1D processing (e.g., row-wise processing followed by column-wise processing). For example, the number of multiplications of a direct N x N 2D DCT is ...

2014
Murray A. Straus Maria Testa Zeev Winstok

............................................................................................................................................................. 3 THEORETICAL BASIS AND DISTINCTIVE CHARACTERISTICS OF ................................................................................ 6 DYADIC CONCORDANCE TYPES ...............................................................................

Journal: :EURASIP J. Adv. Sig. Proc. 2005
Jianguo Liu Yu Z. Liu G. Y. Wang

This paper presents a novel approach to compute DCT-I, DCT-III, and DCT-IV. By using a modular mapping and truncating, DCTs are approximated by linear sums of discrete moments computed fast only through additions. This enables us to use computational techniques developed for computing moments to compute DCTs efficiently. We demonstrate this by applying our earlier systolic solution to this prob...

2002
Clayton D. Scott Robert D. Nowak

Classification trees are one of the most popular types of classifiers, with ease of implementation and interpretation being among their attractive features. Despite the widespread use of classification trees, theoretical analysis of their performance is scarce. In this paper, we show that a new family of classification trees, called dyadic classification trees (DCTs), are near optimal (in a min...

2002
Stéphane Valente

This paper proposes some early results concerning the combination of Discrete Cosine Transforms (DCTs) of multiple sizes in a video encoder. The main difficulty consists in finding a way to obtain a fair competition between several transforms. For that purpose, we derive that the quantization of all transformed coefficients regardless of the DCT size with the same uniform linear quantizer allow...

1996
Kwei-Jay Lin Ansgar Herkert

This paper addresses the jitter control issue in time-triggered real-time systems where tasks are activated according to time. Our model is based on the temporal distance constrained task model (DCTS). However, many real-time systems have tasks that do not t the simple assumptions of the DCTS model because tasks may occasionally access shared resources, and certain tasks may arrive irregularly....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->