Pith. sign in

REVIEW

Building a Modal-balanced BlockChain with Semantic Reconstruction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.02428 v1 pith:7ZBMCSHN submitted 2023-03-04 cs.MM

classification cs.MM
keywords semantictextbfblockchainalgorithmvisualimageinformationoriginal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The current large blockchain systems (BTC Lightning network, Ethereum, etc.) are generally facing the problems of low persistence rates and high storage costs. Therefore, users tend to store single modal (textual) information on the existing blockchain systems. Inspired by semantic communication algorithms, this paper presents a new algorithm to solve the serious imbalance between textual and visual modals on blockchains. After semantic sampling of the original visual image, the resulting semantic text will be stored on the chain, and the end users can reconstruct a semantically similar image using the \textbf{R}elative \textbf{O}ptimal \textbf{S}emantic \textbf{I}sotope \textbf{S}election algorithm. Experiments on the DIV2K dataset show that the blockchain with our algorithm can achieve 430,000 times the storage capacity and 550,000 times the persistence rate for the original visual data with acceptable semantic information loss.

Discussion (0). Sign in to comment.

Pith tools