Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Block size”

Holes percentage using block size 8x8 and block size 16x16 tested dataset [38].

Imran Uddin Afridi (6729776), Tariq Bashir (127259), Hasan Ali Khattak (6729779) et al. · Figshare · 2019

<p>Holes percentage using block size 8x8 and block size 16x16 tested dataset [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0217246#pone.0217246.ref038" target="_blank">38</a>].</p>

Cited by 0Open access

Novel step search of block-size selection for variable block-size motion estimation

Hsueh-Yen Yang, Yu‐Cheng Fan, Hen‐Wai Tsao · 2010

Variable block-size motion estimation (VBSME) of H.264/AVC utilizes seven block-sizes to describe the movement of video details. The VBSME can extremely improve the efficiency of compressed image but the problems of the block-size selection and aspect effects impact the resultant quality. Therefore, the number of motion vector (MV) determines the efficiency of video coding. Additionally, because the block matching algorithm (BMA) of small block would be interfered by surrounding aperture, the searching results often mistake the originals of vision reception and cause the unreliability of reconstructed frame. In the paper, we propose dual issues to solve current problems of VBSME. First, weighted calculation of VBSME is presented to avoid the affects of aperture effects. However, a step search of block-size selection is proposed to detect the object motion and efficiently apply the MVs of small-size block.

Cited by 2

Holes percentage using block size 8x8 and block size 16x16 tested dataset [37].

Imran Uddin Afridi (6729776), Tariq Bashir (127259), Hasan Ali Khattak (6729779) et al. · Figshare · 2019

<p>Holes percentage using block size 8x8 and block size 16x16 tested dataset [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0217246#pone.0217246.ref037" target="_blank">37</a>].</p>

Cited by 0Open access

Variable size block motion estimation

D. Shckler, Yusuf Ozturk, H. Abut · 2002

The success of video compression standards H.261/H.263, MPEG-1/MPEG-2 is greatly due to fairly efficient motion detection, estimation and compensation stages. In this study, we attempt to improve the inherent search process of the motion estimation and the compensation stage in some application specific cases including highway traffic video sequences. The proposed variable block size motion estimation approach takes advantage of the highly correlated spatial motion in highway traffic sequences for fast yet efficient motion estimation. The methodology presented outperforms the modified logarithmic search (MLS) and the conjugate directions search (CDS) algorithm in reduced complexity and residual entropy.

Cited by 1

Block size and average increase.

Junaid Nasir Qureshi (18196205), Muhammad Shoaib Farooq (17775812) · Figshare · 2024

<div><p>Software Development based on Scrum Agile in a distributed development environment plays a pivotal role in the contemporary software industry by facilitating software development across geographic boundaries. However, in the past different frameworks utilized to address the challenges like communication and collaboration in scrum agile distributed software development (SADSD) were notably inadequate in transparency, security, traceability, geographically dispersed location work agreements, geographically dispersed teamwork effectiveness, and trust. These deficiencies frequently resulted in delays in software development and deployment, customer dissatisfaction, canceled agreements, project failures, and disputes over payments between customers and development teams. To address these challenges of SADSD, this paper proposes a new framework called ChainAgile, which leverages blockchain technology. ChainAgile employs a private Ethereum blockchain to facilitate the execution of smart contracts. These smart contracts cover a range of functions, including acceptance testing, secure payments, requirement verification, task prioritization, sprint backlog, user story design and development and payments with the automated distribution of payments via digital wallets to development teams. Moreover, in the ChainAgile framework, smart contracts also play a pivotal role in automatically imposing penalties on customers for making late payments or for no payments and penalties on developers for completing the tasks that exceed their deadlines. Furthermore, ChainAgile effectively addresses the scalability limitations intrinsic in blockchain technology by incorporating the Interplanetary File System (IPFS) is used for storage solutions as an off-chain mechanism. The experimental results conclusively show that this innovative approach substantially improves transparency, traceability, coordination, communication, security, and trust for both customers and developers engaged in scrum agile distributed software development (SADSD).</p></div>

Cited by 0Open access

Frames with Block Size Four

Rolf S. Rees, Douglas R. Stinson · Canadian Journal of Mathematics · 1992

Abstract We investigate the spectrum for frames with block size four, and discuss several applications to the construction of other combinatorial designs. Our main result is that a frame of type h u , having blocks of size four, exists if and only if u ≥ 5, h ≡ 0 mod 3 and h(u — 1) ≡ 0 mod 4, except possibly where (i) h = 9 and u ∈ ﹛13,17,29,33,93,113,133,153,173,193﹜; (ii) h ≡ 0 mod 12 and u ∈ ﹛8,12﹜, h = 36 and u ∈ ﹛7,18,23,28,33,38,43,48﹜, h = 24 or 120 and u ∈ ﹛7﹜, h = 72 and u ∈ 2Z + U ﹛n : n ≡ 3 mod4 and n ≤527﹜ U ﹛563﹜; or (iii) h ≡ 6mod l2 and u ∈ (﹛17,29,33,563﹜ U ﹛n : n ≡ 3 or 11 mod 12 and n ≤ 527﹜ U ﹛n : n ≡ 7 mod 12 and n ≤ 259﹜), h = 18. Additionally, we give a new recursive construction for resolvable group-divisible designs from frames: if there is a resolvable k-GDD of type g u , a k-frame of type ﹛mg) v where u ≥ m + 1, and a resolvable TD(k, mv) then there is a resolvable k-GDD of type (mg) uv . We use this to construct some new resolvable GDDs with group size three and block size four.

Cited by 53Open access

Variable Block-Size Motion Estimation

Fakhouri, Elie Michel. · eScholarship@McGill (McGill) · 1997

L'auteur a accord une licence non exclusive permettant la Bibliothque nationale du Canada de reproduire, prter, distribuer ou vendre des copies de cette thse sous la forme de microfiche/film, de reproduction sur papier ou sur format lectronique.L'auteur conserve la proprit du droit d'auteur qui protge cette thse.Ni la thse ni des extraits substantiels de celle-ci ne doivent tre imprims ou autrement reproduits sans son autorisation.0-612-37260-X Canada l am thankful to my advisor Eric Dubois for his patience,

Cited by 0Open access

Adjustable block size coherent caches

Czarek Dubnicki, Thomas J. LeBlanc · ACM SIGARCH Computer Architecture News · 1992

Several studies have shown that the performance of coherent caches depends on the relationship between the granularity of sharing and locality exhibited by the program and the cache block size. Large cache blocks exploit processor and spatial locality, but may cause unnecessary cache invalidations due to false sharing. Small cache blocks can reduce the number of cache invalidations, but increase the nuber of bus or network transactions required to load data into the cache. In this paper we describe a cache organization that dynamically adjusts the cache block size according to recently observed reference behavior. Cache blocks are split across cache lines when false sharing occurs, ad merged back into a single cache line to explit spatial locality. To evaluate this cache organization, we simulate a scalable multiprocessor with coherent caches, using a suite of memory reference traces to model program behavior. We show that for evry fixed block size, some program suffers a 33% increase in the average waiting time per reference, and a factor of 2 increase in the average number of words transferred per reference, when compared against the performance of an adjustable block size cache. In the few cases where adjusting the block size does not provide superior performance, it comes within 7% of the best fixed block size alternative. We conclude that an adjustable block size cache offers significantly better performance than every fixed block size cache, especially when there is variability in the granularity of sharing exhibited by applications.

Cited by 15Open access

Hierarchical variable‐block‐size motion detection with a constant average block size per frame

Toshifumi Kanamaru, Yoshihiko Ogawa, Tomoaki Shirakawa et al. · Systems and Computers in Japan · 1995

Abstract This paper proposes a new motion detection method for image‐sequence processing. It consists of hierarchical variable‐block‐size motion detection with a constant average block size. It makes use of hierarchical images to detect motion vectors. The block size is decided by termination of motion search in a hierarchy level with a small matching error. The termination threshold is decided by the detection result in the highest hierarchy level. It can be set up according to a desired average block size per frame. Efficacy of the proposed method is confirmed by simulations on video coding.

Cited by 0

Constant Block-Size with Constant Sum-Block Partially Balanced Incomplete Block Designs

Babatunde Lateef Adeleke, Gabriel Olusola Adebayo, Kazeem Adewale Osuolale · IntechOpen eBooks · 2024

This chapter delves into the introduction, methodology, and application of Constant Block-Size with Constant Sum-Block Partially Balanced Incomplete Block Designs (CBS-CSB PBIBDs) as an innovative class of experimental designs. The study defines key concepts, including constant block-size, constant block-sum, and constant sum-block, and outlines conditions for implementing CBS-CSB PBIBDs. The research presents experimental designs for various scenarios, such as t = 21, k = 3; t = 15, k = 3; t = 27, k = 3, and illustrates their respective cases through line charts. Notably, the study demonstrates that as the number of replicates (r) increases, the efficiency factors also increase, and when r = 1, efficiency (E) equals 0. In conclusion, CBS-CSB PBIBDs emerge as a valuable tool for experimental prioritization, offering a new perspective on partially balanced incomplete block designs. The research highlights the significance of CBS-CSB PBIBDs across diverse fields of experimentation. The findings equip readers with the ability to define, design, and analyze experiments using CBS-CSB PBIBDs, while acknowledging challenges and limitations associated with this approach. This study contributes to the broader understanding of experimental design and provides a foundation for future research directions in this innovative field.

Cited by 2Open access

Multiple block-size search algorithm for fast block motion estimation

Ka-Ho Ng, Lai-Man Po, Ka-Man Wong et al. · 2009

Although variable block-size motion estimation provides significant video quality and coding efficiency improvement, it requires much higher computational complexity compared with fixed block size motion estimation. The reason is that the current motion estimation algorithms are mainly designed for fixed block size. Current variable block-size motion estimation implementation simply applies these existing motion estimation algorithms independently for different block sizes to find the best block size and the corresponding motion vector. Substantial computation is wasted because distortion data reuse among motion searches of different block sizes is not considered. In this paper, a motion estimation algorithm intrinsically designed for variable block-size video coding is presented. The proposed multiple block-size search (MBSS) algorithm unifies the motion searches for different block sizes into a single searching process instead of independently performing the search for each block size. In this unified search, the suboptimal motion vectors for different block sizes are used to determine the next search steps. Its prediction quality is comparable with that obtained by performing motion search for different block sizes independently while the computational load is substantially reduced. Experimental results show that the prediction quality of MBSS is similar to full search.

Cited by 9