This paper considers the use of interpolative coding for lossless chain code compression. The most popular chain codes are used, including Freeman chain code in eight (F8) and four directions (F4), ...Vertex Chain Code (VCC), and three-orthogonal chain code (3OT). The whole compression pipeline consists of the Burrows–Wheeler transform, Move-To-Front transform and the interpolative coding, which was improved by FELICS and new Ψ-coding. The approach was compared with the state-of-the-art chain code compression algorithms. For VCC, 3OT and F4, the obtained results are slightly better than the existing approaches. However, an important improvement was achieved with F8 chain code, where the presented approach is considerably better.
With the rapid enhancement in the design and development of the Internet of Things creates a new research interest in the adaptation in industrial domains. It is due to the impact of distributed ...emerging technology and topology of industrial Internet of Things and the security-related resource constraints of industrial 5.0. This conducts new paradigm along with critical challenges to the existing information preservation, node transactions and communication, transmission, trust and privacy, and security protection related problems. These critical aspects pose serious limitations and issues for the industry to provide industrial data integrity, information exchange reliability, provenance, and trustworthiness for the overall activities and service delivery prospects. In addition, the intersection of blockchain and industrial IoT has gained more consideration and research interest. However, there is an emerging limitation between the inadequate performance of industrial IoT and connected nodes, and the high resource requirement of permissioned private blockchain ledger has not yet been tackled with the complete solution. Due to the introductions of NuCypher Re-Encryption infrastructure, hashing tree and allocation, and deployment of blockchain proof-of-work required more computational power as well. This paper is divided into three different folds; first, we studied various related literature of blockchain-enabling industrial Internet of Things and its critical implementation challenging aspects along with the solution. Secondly, we proposed a blockchain hyperledger sawtooth-enabled framework. This framework provides a secure and trusted execution environment, in which service delivery mechanisms and protocols are designed with an acknowledgment, including the immutable ledger storage security, along with the peer-to-peer network on-chain and off-chain communication of industrial activities. Thirdly, we design pseudo-chain codes and consensus protocols to provide smooth industrial node streamline transactions and broadcast content. The proposed multiple proof-of-work investigated and simulated using Hyperledger Sawtooth-enabled docker for testing to exchange information between connected devices of industrial Internet of Things within the limited usage of resource constraints.
Burrows-Wheeler Transform, followed by Move-To-Front Transform, are often used transformation techniques in data compression. They may reduce the information entropy of the input sequence, which ...becomes more compressible in this way. This paper suggests an alternative, a Prediction-based Move-To-Front Transform, which may replace the aforementioned transformations. According to the context, consisting of a few already seen symbols, the Prediction-based Move-To-Front Transform selects an appropriate ordered domain of symbols to achieve a better match with the currently transforming symbol. Freeman chain code in four and eight directions, Three-Orthogonal chain code, and Vertex Chain Code were used for experiments. We confirmed that the proposed approach, when using an appropriate length of context, reduces the information entropy to a similar extent as the Burrows-Wheeler Transform followed by the Move-To-Front Transform on chain code data. Both approaches led to a very similar compression efficiency on 32 testing shapes when an arithmetic coder was used in the final stage. The proposed approach turned out to be more efficient when longer chain code sequences were used, obtained by merging all the testing chain codes of the same type.
This paper introduces a new lossy approach for compression of cartoon images. The image is firstly partitioned into regions of roughly the same colour. The chain codes are then determined of all ...regions. The sequence of the obtained chain code symbols is transformed with the Burrows-Wheeler Transform, Move-To-Front transform, and compressed with Run-Length Encoding. In the final step, an arithmetic encoder may be used to compress the obtained binary stream additionally. The proposed algorithm is asymmetric, meaning that the decompression does not reverse all the steps of the compression procedure. The experimental results have shown that the described method produces considerably better compression ratios than JPEG, JPEG2000, WebP, SPIHT, PNG, and two of the algorithms specialised in compression of cartoon images: the algorithm using quad-tree, and RS-LZ algorithm.
The robust development of the blockchain distributed ledger, the Internet of Things (IoT), and fog computing-enabled connected devices and nodes has changed our lifestyle nowadays. Due to this, the ...increased rate of device sales and utilization increases the demand for edge computing technology with collaborative procedures. However, there is a well-established paradigm designed to optimize various distinct quality-of-service requirements, including bandwidth, latency, transmission power, delay, duty cycle, throughput, response, and edge sense, and bring computation and data storage closer to the devices and edges, along with ledger security and privacy during transmission. In this article, we present a systematic review of blockchain Hyperledger enabling fog and edge computing, which integrates as an outsourcing computation over the serverless consortium network environment. The main objective of this article is to classify recently published articles and survey reports on the current status in the domain of edge distributed computing and outsourcing computation, such as fog and edge. In addition, we proposed a blockchain-Hyperledger Sawtooth-enabled serverless edge-based distributed outsourcing computation architecture. This theoretical architecture-based solution delivers robust data security in terms of integrity, transparency, provenance, and privacy-protected preservation in the immutable storage to store the outsourcing computational ledgers. This article also highlights the changes between the proposed taxonomy and the current system based on distinct parameters, such as system security and privacy. Finally, a few open research issues and limitations with promising future directions are listed for future research work.
The computation of correct features is an essential phase for efficient data representation and benchmarked accuracy in text recognition systems. The offline text lacks dynamic information regarding ...the writing order or nature of trajectories of stroke. Recovery of drawing order technique helps to retrieve trajectory of a stroke. This information aids in computing dynamic feature vector based on chain codes or trajectory points for text recognition. The present work proposes a dynamic feature extraction approach based on recovery of drawing order to understand scene text in Indic script Gurmukhi. An inhouse dataset of strokes was obtained from 820 real time Gurmukhi signboard images. Stroke recognition was performed using Conv1D, SVM and HMM classifiers. Best recognition results were achieved using SVM and Conv1D as 82.88% and 84.67%. The major objective of present study is to propose dynamic features based recognition scheme for Indic scripts signboard images suitable for real-life applications.
This paper presents a new lossless raster font compression method that uses vertex chain code to define character’s outline. Obtained chain codes are compressed by Huffman coding algorithm. The ...results show that the new method requires least memory space to store the raster fonts among the known methods. Moreover, the font size has almost no impact on the coder efficiency. Due to the low complexity of the decoder that occupies only 2.7
kB of memory space, this method is ideal for use in embedded systems.
•Interpolative coding is efficient at chain code compression.•Interpolative coding is improved with Golomb coding.•Proper selection of Golomb parameter yields slightly better compression.
A lossless ...chain code compression algorithm consisting of Burrows-Wheeler Transform, Move-To-Front Transform, and a modified interpolative coding is presented in this paper. The interpolative coding divides a strictly increasing array of integers and encodes the middle element recursively, where the required number of bits is obtained from the difference of the array’s border values. In this paper, it is shown that, for some intervals, Golomb coding is more efficient than the interpolative coding. This fact was used to construct a hybrid approach that yields slightly better compression results than the state-of-the-art while compressing Three OrThogonal chain code, Freeman chain code in four and eight directions, and Vertex Chain Code.
Pattern substrings analysis to find high redundancy in binary shapes is carried out to improve compression levels in binary objects. Modifications of a recent set of symbols to encode arbitrary ...contour shapes is proposed. The concept of
Pieces of Discrete Straight Lines is introduced and the probability of appearance of symbols in contours is analyzed to propose a code of nine symbols, MDF9. Also, this code is compared with the six well-known contour codes for compression without loss of information: FCCE, FCCF, VCC, 3OT, DFCCE and C_VCC. The proposed MDF9 code in this paper, gives better compression efficiency than existing codes.
PDF
