Block Partitioning Research Articles

Steering linkage topology design using angle-based block partitioning symmetric model (APSM)

Steering linkage topology design using angle-based block partitioning symmetric model (APSM)

AutoGMap: Learning to Map Large-Scale Sparse Graphs on Memristive Crossbars.

The sparse representation of graphs has shown great potential for accelerating the computation of graph applications (e.g., social networks and knowledge graphs) on traditional computing architectures (CPU, GPU, or TPU). But, the exploration of large-scale sparse graph computing on processing-in-memory (PIM) platforms (typically with memristive crossbars) is still in its infancy. To implement the computation or storage of large-scale or batch graphs on memristive crossbars, a natural assumption is that a large-scale crossbar is demanded, but with low utilization. Some recent works question this assumption; to avoid the waste of storage and computational resource, the fixed-size or progressively scheduled "block partition" schemes are proposed. However, these methods are coarse-grained or static and are not effectively sparsity-aware. This work proposes the dynamic sparsity-aware mapping scheme generating method that models the problem with a sequential decision-making model, and optimizes it by reinforcement learning (RL) algorithm (REINFORCE). Our generating model [long short-term memory (LSTM), combined with the dynamic-fill scheme] generates remarkable mapping performance on the small-scale graph/matrix data (complete mapping costs 43% area of the original matrix) and two large-scale matrix data (costing 22.5% area on qh882 and 17.1% area on qh1484). Our method may be extended to sparse graph computing on other PIM architectures, not limited to the memristive device-based platforms.

Dual image watermarking based on NSST-LWT-DCT for color image

Advanced internet technology allows unauthorized individuals to modify and distribute digital images. Image watermarking is a popular solution for copyright protection and ensuring digital security. This research presents an embedding scheme with a set of conditions using non-subsampled Shearlet transform (NSST), lifting wavelet transform (LWT), and discrete cosine transform (DCT). Red and green channels are employed for the embedding process. The red channel is converted by NSST-LWT. The low-frequency area (LL) frequency is then split into small blocks of 8×8, each partition block is then transformed by DCT. The DCT coefficient of (3,4), (5,2), (5,3), (3,5), called matrix M1, and (2,5), (4,3), (6,2), (4,4), called matrix M2 are selected for singular value decomposition (SVD) process. With a set of conditions, the watermark bits are incorporated into those singular values. The green channel is cropped to get the center image before splitting into 4×4 pixels. The block components are then selected based on the least entropy value for the embedding regions. The selected blocks are then computed using LWT-SVD. A set of conditions for U(1,1) and U(2,1) are used to incorporate the watermark logo. The experimental findings reveal that the suggested scheme achieves high imperceptibility and resilience under various evaluating attacks with an average peak signal-to-noise ratio (PSNR) and correlation value (NC) values are up to 43.89 dB and 0.96, respectively.

CC-SMC: Chain coding-based segmentation map lossless compression

A segmentation map, either static or dynamic, refers to a two-dimensional picture that may vary with time and indicates the segmentation label per pixel. Both the semantic map and the occupancy map in video-based point cloud compression (V-PCC) belong to the segmentation map we referred to. The semantic map can work for many machine vision tasks like tracking and has been used as a layer of image representation in some image compression methods. The occupancy map constitutes a part of the point cloud coding bitstream. Since segmentation maps are widely used, how to efficiently compress them is of interest. We propose a segmentation map lossless compression scheme namely CC-SMC, exploiting the nature of segmentation maps that usually contain limited colors and sharp edges. Specifically, we design a chain coding-based scheme combined with quadtree-based block partitioning. For intraframe coding, one block is partitioned recursively with a quadtree structure, until the block contains only one color, is smaller than a threshold, or satisfies the defined chain coding condition. We revise the three-orthogonal chain coding method to incorporate contextual information and design effective intraframe prediction methods. For interframe coding, one block may find a reference block; the chain difference between the current and the reference blocks is coded. We implement the proposed scheme and test it on several different kinds of segmentation maps. Compared with advanced lossless image compression techniques, our proposed scheme obtains more than 10% bits reduction as well as more than 20% decoding time-saving. The code is available at https://github.com/Yang-Runyu/CC-SMC.

Sparse reconstruction of sound field using pattern-coupled Bayesian compressive sensing.

Conventional near-field acoustic holography based on compressive sensing either does not fully exploit the underlying block-sparse structures of the signal or suffers from a mismatch between the actual and predefined block structure due to the lack of prior information about block partitions, resulting in poor accuracy in sound field reconstruction. In this paper, a pattern-coupled Bayesian compressive sensing method is proposed for sparse reconstruction of sound fields. The proposed method establishes a hierarchical Gaussian-Gamma probability model with a pattern-coupled prior based on the equivalent source method, transforming the sound field reconstruction problem into recovering the sparse coefficient vector of the equivalent source strengths within the compressive sensing framework. A set of hyperparameters is introduced to control the sparsity of each element in the sparse coefficient vector of the equivalent source strengths, where the sparsity of each element is determined by both its own hyperparameters and those of its immediate neighbors. This approach enables the promotion of block sparse solutions and achieves better performance in solving for the sparse coefficient vector of the equivalent source strengths without prior information of block partitions. The effectiveness and superiority of the proposed method in reconstructing sound fields are verified by simulations and experiments.

Fast Coding Unit Partitioning Algorithm for Video Coding Standard Based on Block Segmentation and Block Connection Structure and CNN

The recently introduced Video Coding Standard, VVC, presents a novel Quadtree plus Nested Multi-Type Tree (QTMTT) block structure. This structure enables a more flexible block partition and demonstrates enhanced compression performance compared to its predecessor, HEVC. However, The introduction of the new structure has led to a more complex partition search process, resulting in a considerable increase in time complexity. The QTMTT structure yields diverse Coding Unit (CU) block sizes, posing challenges for CNN model inference. In this study, we propose a representation structure termed Block Segmentation and Block Connection (BSC), rooted in texture features. This ensures that partial CU blocks are uniformly represented in size. To address different-sized CUs, various levels of CNN models are designed for prediction. Moreover, we introduce a post-processing method and a multi-thresholding scheme to further mitigate errors introduced by CNNs. This allows for flexible and adjustable acceleration, achieving a trade-off between coding time complexity and performance. Experimental results indicate that, in comparison to VTM-10.0, our “Fast” scheme reduces the average complexity by 57.14% with a 1.86% increase in BDBR. Meanwhile, the “Moderate” scheme reduces average complexity by 50.14% with only a 1.39% increase in BDBR.

CADC-FPRLE: Content-aware deduplication clustering analysis using file partitioning and a running length encoder for cloud storage optimization

To address this storage issue, we propose a Content-Aware Deduplication Clustering Analysis for Cloud Storage Optimization (CADC-FPRLE) based on a file partitioning running length encoder. At first, preprocessing was done by indexing, counting terms, cleansing, and tokenizing. Further multi-objective clustering points are analysed based on the bisecting divisible partition block, which divides a set of documents. The count terms are filtered from the divisible blocks and make up the count terms content block. Using Content-Aware Multi-Hash Ensemble Clustering (CAMH-EC) to group the similar blocks into clusters. This creates a high-dimensional Euclidean interval to create the number of clusters, and points are performed randomly to set the initial collection. Then, the Magnitude Vector Space Rate (MVSR) estimates the similarity distance between the groups to select the highest scatter value content for indexing. Finally, the Running Block Parity Encoder (RBPE) generates similarity parity in order to reduce the content to a redundant, singularized file in order to optimise storage. This implementation proves a higher level of storage optimization compared to the previous system than other methods.

An energy-efficient GMRES–multigrid solver for space-time finite element computation of dynamic poroelasticity

We present and analyze computationally Geometric MultiGrid (GMG) preconditioning techniques for Generalized Minimal RESidual (GMRES) iterations to space-time finite element methods (STFEMs) for a coupled hyperbolic–parabolic system modeling, for instance, flow in deformable porous media. By using a discontinuous temporal test basis, a time marching scheme is obtained. Higher order approximations that offer the potential to inherit most of the rich structure of solutions to the continuous problem on computationally feasible grids increase the block partitioning dimension of the algebraic systems, comprised of generalized saddle point blocks. Our V-cycle GMG preconditioner uses a local Vanka-type smoother. Its action is defined in an exact mathematical way. Due to nonlocal coupling mechanisms of 348 unknowns, the smoother is applied on patches of elements. This ensures damping of higher order error frequencies. By numerical experiments of increasing complexity, the efficiency of the solver for STFEMs of different polynomial order is illustrated and confirmed. Its parallel scalability is analyzed. Beyond this study of classical performance engineering, the solver’s energy efficiency is investigated as an additional and emerging dimension in the design and tuning of algorithms on the hardware.

Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC

Objectives. The problem of choosing the best methods and programs for circuit implementation as part of digital ASIC (Application-Specific Integrated Circuit) sparse systems of disjunctive normal forms (DNF) of completely defined Boolean functions is considered. For matrix forms of sparse DNF systems, the ternary matrix specifying elementary conjunctions contains a large proportion of undefined values corresponding to missing literals of Boolean input variables, and the Boolean matrix specifying the occurrences of conjunctions in DNF functions contains a large proportion of zero values.Methods. It is proposed to investigate various methods of technologically independent logical optimization performed at the first stage of logical synthesis: joint minimization of systems of functions in the DNF class, separate and joint minimization in classes of multilevel representations in the form of Boolean networks and BDD representations using mutually inverse cofactors, as well as the division of a system of functions into subsystems with a limited number of input variables and the method of block cover of DNF systems, focused on minimizing the total area of the blocks forming the cover.Results. When implementing sparse DNF systems of Boolean functions in ASIC, along with traditional methods of joint minimization of systems of functions in the DNF class, methods for optimizing multilevel representations of Boolean function systems based on Shannon expansions can be used for technologically independent optimization, while separate minimization and joint minimization of the entire system as a whole turn out to be less effective compared with block partitions and coatings of the DNF system and subsequent minimization of multilevel representations. Schemes obtained as a result of synthesis using minimized representations of Boolean networks often have a smaller area than schemes obtained using minimized BDD representations.Conclusion. For the design of digital ASIC, the effectiveness of combined approach is shown, when initially the block coverage programs of the DNF system is used, followed by the use of programs to minimize multilevel block representations in the form of Boolean networks minimized based on Shannon expansion.

Block Partitioning Information-Based CNN Post-Filtering for EVC Baseline Profile.

The need for efficient video coding technology is more important than ever in the current scenario where video applications are increasing worldwide, and Internet of Things (IoT) devices are becoming widespread. In this context, it is necessary to carefully review the recently completed MPEG-5 Essential Video Coding (EVC) standard because the EVC Baseline profile is customized to meet the specific requirements needed to process IoT video data in terms of low complexity. Nevertheless, the EVC Baseline profile has a notable disadvantage. Since it is a codec composed only of simple tools developed over 20 years, it tends to represent numerous coding artifacts. In particular, the presence of blocking artifacts at the block boundary is regarded as a critical issue that must be addressed. To address this, this paper proposes a post-filter using a block partitioning information-based Convolutional Neural Network (CNN). The proposed method in the experimental results objectively shows an approximately 0.57 dB for All-Intra (AI) and 0.37 dB for Low-Delay (LD) improvements in each configuration by the proposed method when compared to the pre-post-filter video, and the enhanced PSNR results in an overall bitrate reduction of 11.62% for AI and 10.91% for LD in the Luma and Chroma components, respectively. Due to the huge improvement in the PSNR, the proposed method significantly improved the visual quality subjectively, particularly in blocking artifacts at the coding block boundary.

Eye-Tracking Analysis of Proposed Signage Design to Prevent Accidents Caused by the Abrupt Appearance of Dividers on Indian Roads

The road transport system is expanding considerably in developing countries. Villages are connecting to major cities for business, education, health, and many other reasons because of road development and smooth transportation. There has been a rise in the number of road accidents observed, caused by abruptly appearing dividers on roads and a lack of required signage systems. This paper discusses scenarios of accidents due to such abruptly appearing dividers and offers a strategy to design appropriate signage to avoid road accidents in the future. It has been observed that permanent or movable arbitrary fixtures, such as a barricade or a small partition block wall, are installed to separate lanes, in addition to white-colored stripes that are typically employed for lane separation on roads. These fixtures, although they are intended as lane-dividing solutions on roads, cause serious, and at times, fatal accidents, due their sudden, uninitiated appearance on the road. To address this problem, alternative signage designs were designed and tested on Indian roads, based on human cognitive responses and visual attention analysis on signage using an eye-tracking method. In addition, the semantic quality and legibility of alternate signage designs were evaluated using a questionnaire to judge their overall efficacy. Hence, the best signage design solution is proposed for implementation near or before occurrences of road dividers to avoid accidents.

SVG-CNN: A shallow CNN based on VGGNet applied to intra prediction partition block in HEVC

SVG-CNN: A shallow CNN based on VGGNet applied to intra prediction partition block in HEVC

Service Life Prediction and Life Cycle Costs of Light Weight Partitions

This study investigates the life expectancy (LE) and life cycle costs (LCC) of three alternatives of interior partitions in residential units: gypsum board, autoclaved concrete block, and hollow concrete block partitions. The aim is to examine the sustainability and cost-effectiveness of these partitions in various service and occupancy conditions. Three different service conditions were analyzed: Standard (constructed without faults), Inherent Defect Conditions (with initial, non-progressing defects), and Failure Conditions (developing defects over time). To analyze the impact of occupancy conditions, six ‘negative occupancy factors’ were identified that accelerate partition deterioration, including non-ownership, poor maintenance, high residential density, the presence of young children, the presence of domestic animals, and the density of furniture. These factors define four occupancy condition categories: light, moderate, standard, and intensive. The research found that hollow concrete block partitions are the most durable, exceeding 100 years in light or moderate conditions. Gypsum board partitions, while cost-effective, have a lower life expectancy, needing replacement in 11–27 years in intensive conditions. Autoclaved concrete blocks offer moderate durability, with similar costs to hollow blocks in normal conditions. Overall, the study highlights the influence of service and occupancy on the lifespan of interior building components, and provides recommendations for partition type selection that are based on specific conditions. These recommendations are a pivotal outcome, highlighting the study’s significant contribution to the understanding of the long-term performance and sustainability of building materials in residential construction.

A Unique Approach for Block Partitioning and Merging for Large-Scale Structure-from-Motion using Apache Spark

In response to the growing demand for large-scale reconstructions, this paper addresses the scalability challenges encountered by traditional Structure from Motion (SfM) methods. Our research aims to leverage Apache Spark’s distributed computing capabilities to enhance the efficiency of SfM methodologies. The motivation behind this work lies in the increasing need for robust solutions capable of handling extensive reconstruction tasks. To tackle this challenge, we propose a method that harnesses the advantages of Apache Spark, including scalability, speed, fault-tolerance, flexibility, and ease of use. The abstracted problem centers around the limitations inherent in Apache Spark’s traditional operations like maps, reduces, and joins. Our methodology focuses on a block partitioning and merging strategy, strategically distributing the workload using Spark. Our paper also presents experimental results showing the feasibility of our approach through the 3D reconstructions of multiple datasets. The experiments were executed on a standalone Spark instance, demonstrating the potential of Apache Spark in effectively distributing SfM workloads. In summary, this paper elucidates the necessity for addressing scalability challenges in large-scale reconstructions, outlines the research goals, and details a method leveraging Apache Spark to overcome limitations and enhance the efficiency of SfM.

OPERATIONS ON BLOCK PREDICATE MATRICES

This article discusses the possibility of performing basic logical operations on matrices that are divided into rectangular blocks in an arbitrary manner. The results obtained are illustrated using the example of predicate logical matrices defined over a field of finite predicates of arbitrary arity. The possibility of extending the results obtained to Boolean matrices is also justified (they are considered to be defined over a field of finite predicates of zero arity). At the same time, using the apparatus of multivalued logic, starting from Boolean logical matrices, the results obtained can also be extended to the study of logical objects that are not Boolean. Block partitioning of matrices allows you to divide information specified in matrix form into parts, process these parts separately, and then combine them into a single whole, adhering to certain rules and restrictions described in this article. These methods can find their application in graph theory, in the theory of algorithms, programming and in other areas of theoretical and practical activity that are in one way or another related to mathematical logic.

Fast intra coding in AVS3 based on direct non-first pre-coding skip

The third generation of Audio Video Coding Standard (AVS3) adopts sophisticated block partitioning structure with a multi-type tree, which includes Quad-Tree (QT), Binary-Tree (BT), and Extend Quad-Tree (EQT). During multi-type tree recursive block partitioning and pre-coding process of encoding, each Coding Unit (CU) of each Size at each Location (CUeSeL) of the picture is repeatedly pre-coded many times when visiting each branch of each tree. Although there are early termination mechanism, the number of visits for each CUeSeL is still very high and up to more than fifty. This process brings very high coding complexity. In order to reduce the coding complexity of AVS3, this paper proposes a method named Direct Non-First Pre-coding Skip (DNFPS) for a CUeSeL to directly and completely skip all non-first pre-coding under specific conditions. The conditions include, but are not limited to, those related to the first pre-coding. The contributions of the paper are as follows. In I pictures, for a CUeSeL with top-left location (x, y), if both x and y are multiples of 64 or if a set of conditions related to first pre-coding is satisfied, then each non-first pre-coding is skipped, and the coding result of the first pre-coding is reused for each non-first pre-coding skipped. In non-I pictures, each non-first pre-coding is skipped, and the coding result of the first pre-coding is reused for each non-first pre-coding skipped, provided a set of conditions related to first pre-coding is satisfied. The experimental results demonstrate that DNFPS has a negligible impact on coding efficiency under All Intra (AI) configurations, and coding runtime is reduced by 16 %.

Reconstruction Algorithm for Complex Dexel Models Based on Composite Block Partition

Abstract In machining simulations, dexel models are often used to represent objects to achieve high accuracy and real-time performance. However, this approach leads to the loss of original surface information and topological relationships, thereby affecting the visualization effect of simulations. Furthermore, existing reconstruction methods have the drawbacks of generalization or redundancy. To reconstruct the surface of dexel models efficiently and accurately, this paper proposes an algorithm based on “composite block” partition, which converts the dexel model into a polyhedral model. The algorithm begins by partitioning the entire dexel model within the grids into several composite blocks based on the “Connectivity Principle” and generating their end faces. Subsequently, the transitional zone’s surface is reconstructed based on the connectivity relationships of the boundaries of composite blocks. Finally, an optimization process refines the boundaries to generate smoother side faces at a low computational cost. The paper first validates the algorithm’s reconstruction capability and the effectiveness of edge refinement through the reconstruction of various dexel models with different precision levels. It is observed that edge refinement does not introduce excessive additional computation, doubling the overall efficiency compared to existing algorithms. Furthermore, by changing model volumes and performing separate reconstructions, it’s noted that as the volume increases, the incremental growth in conversion time gradually decreases. This makes the algorithm particularly suitable for reconstructing large-scale complex dexel models. Finally, the application of this algorithm in virtual-real simulation systems and industrial digital twin systems is briefly introduced.

New modes of converting chemical information with colloidal photonic crystal sensing units

Photonic crystal is a kind of device which can convert a chemical signal into an optical signal and is commonly used in sensing and detection. The maximum reflection wavelength representing the photonic band gap has been the most common converting mode in analytical usage which however discard too much valuable chemical information. In this work, we established two additional modes for mining chemical information more deeply in time and space as the sensing information to distinguish analytes. They are respectively based on dynamic analysis of the spectrum shift and the distinction of the RGB partition block value information of optical image. The molecular imprinting sensing mechanism worked well on three organophosphorus compounds to the detection limit of 10−4 M. The principle component analysis of above data did present a good discrimination of organophosphorus analytes from interfering counter anions to a low detection limit of 10−6 M. To make the detection more convenient and to achieve real-time on-site detection, we have designed the portable photonic crystal signal acquisition kit. Together with the mobile terminal, the kit connects the optical image collected on site, the algorithm working on the cloud and the input/output interactive interface of users in detection. The methods were constructed on an example made of a three-dimensional molecularly imprinted photonic crystal hydrogels sensing unit targeting on organo-phosphides.

On Time–Frequency Domain Flexible Structure of Delayless Partitioned Block Adaptive Filtering Approach for Active Noise Control

On Time–Frequency Domain Flexible Structure of Delayless Partitioned Block Adaptive Filtering Approach for Active Noise Control

Block-Adaptive Point Cloud Attribute Coding With Region-Aware Optimized Transform

Block-based compression scheme shows remarkable success in image and video coding. However, existing tree-type block partition methods usually divide point clouds into clusters with few or disjoint points due to the irregular sampling, which is adverse for the subsequent transform to exploit the local region correlation. Moreover, the widely-used optimal transform, e.g., Discrete Cosine Transform (DCT), is deduced with the assumption of the specified probability model. Thus these transforms cannot adequately conform to diverse statistical characteristics of point cloud attributes. To address the above two problems, we propose a block-adaptive codec with the optimized transform for point cloud attribute compression, including Progressive Clustering (PC) for block partition and Region-Aware Signal Modeling (RASM) for transform. PC is designed via the split-and-merge strategy. In the splitting phase, over-segmented clusters are obtained by iteratively searching the nearest neighbors to maintain the spatial continuity of points in one cluster. In the merging step, blocks are determined by merging over-segmented clusters under the guidance of minimizing texture complexity, which adjusts block sizes to adapt to texture variation. RASM adaptively captures the color correlations to respond to diverse statistical characteristics by optimizing the overall Rate-Distortion (RD) cost. Then, the optimal transform bases are obtained via the eigen-decomposition of the color correlation representation with respect to the Gaussian Markov Random Field, where input colors are obtained considering the linear relationship between geometry and color variations. The linear coefficients also need to be encoded to combine geometry to reconstruct the transform bases at the decoder in the same way as the encoder. Particularly, we accelerate the RASM by constraining the independent relationship between signals in the local region, which hardly influences RD performance. Extensive experiments not only indicate the effectiveness of PC and RASM but also show the significant RD gains achieved by our approach compared with several state-of-the-art platforms.