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 “Chain code”

CONVERTING RUN CODE TO CHAIN CODE

B.G. Batchelor, B. K. MARLOW · Cybernetics & Systems · 1981

Abstract The run code is easy to generate on-line from a video signal but the chain code is often more useful. A simple, fast algorithm is presented for constructing chain code from run code. The algorithm defines the order of preference of the next move for a “bug,” given its most recent move. The task for this bug is to travel right around the outermost edge elements of the object whose silhouette appears in the binary image. It is assumed that there is only one such object which may contain holes, although these are not coded by this simple algorithm. The algorithm generates a 4-value code whereas it is more usual to use an 8-value chain code which can be created by a simple method described by Freeman in his definitive work on the chain code.

Cited by 7

mermaidnicheboutique-code/luxbin-chain: luxbin chain

Bastian Köcher, Gavin Wood, Svyatoslav Nikolsky et al. · Zenodo (CERN European Organization for Nuclear Research) · 2026

What's Changed Bump the ci_dependencies group with 4 updates by @dependabot[bot] in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/1 Main by @mermaidnicheboutique-code in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/2 Bump the ci_dependencies group with 2 updates by @dependabot[bot] in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/6 Bump flask-cors from 4.0.0 to 6.0.0 in /hct-app in the pip group across 1 directory by @dependabot[bot] in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/7 New Contributors @dependabot[bot] made their first contribution in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/1 Full Changelog: https://github.com/mermaidnicheboutique-code/luxbin-chain/commits/v2

Cited by 0Open access

mermaidnicheboutique-code/luxbin-chain: luxbin chain

Bastian Köcher, Gavin Wood, Svyatoslav Nikolsky et al. · Zenodo (CERN European Organization for Nuclear Research) · 2026

What's Changed Bump the ci_dependencies group with 4 updates by @dependabot[bot] in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/1 Main by @mermaidnicheboutique-code in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/2 Bump the ci_dependencies group with 2 updates by @dependabot[bot] in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/6 Bump flask-cors from 4.0.0 to 6.0.0 in /hct-app in the pip group across 1 directory by @dependabot[bot] in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/7 New Contributors @dependabot[bot] made their first contribution in https://github.com/mermaidnicheboutique-code/luxbin-chain/pull/1 Full Changelog: https://github.com/mermaidnicheboutique-code/luxbin-chain/commits/v2

Cited by 0Open access

Fast generation of chain code

B.G. Batchelor, B.E. Marlow · 1980

The chain code is an attractive and economical method of coding a binary image, but it is not particularly easy to generate. This article describes a hardware/software mechanism for improving the speed of chain-code generation. At the heart of the procedure is an r.o.m. which is used to detect certain (binary) patterns in the input image. The r.o.m. also controls the acquisition of data by an r.a.m.; the result is a set of data triples of the form (x co-ordinate, y co-ordinate, chain-code element) describing a certain subset of the edge points. A software algorithm is then used to ‘thread’ these elemental items together to generate the complete chain-code string. The procedure can accommodate holes and multiblob images.

Cited by 6

Chain code compression results using PMTFT

Lukac, Niko · Mendeley Data · 2020

Data used in the manuscript (INS-D-18-3241) entitled Can Burrows-Wheeler Transform be replaced in chain code compression?, which was submitted to journal Information Sciences.

Cited by 0Open access

Code for equipment leasing supply chain

Ting, Zhao · Zenodo (CERN European Organization for Nuclear Research) · 2024

This code is for the paper "Equipment leasing supply chain with a stochastic demand". By running this code, we can calculate the expected profits of cooperative game and Stackberg game under different problem parameters. The parameters can be revised in the file 'parameters.py'. Some figures and the results of tables in the paper are obtained by running this code.

Cited by 0Open access

Code Change Sniffer: Predicting Future Code Changes with Markov Chain

Ekincan Ufuktepe, Tuğkan Tuğlular · 2021

Code changes are one of the essential processes of software evolution. These changes are performed to fix bugs, improve quality of software, and provide a better user experience. However, such changes made in code could lead to ripple effects that can cause unwanted behavior. To prevent such issues occurring after code changes, code change prediction, change impact analysis techniques are used. The proposed approach uses static call information, forward slicing, and method change information to build a Markov chain, which provides a prediction for code changes in the near future commits. For static call information, we utilized and compared call graph and effect graph. We performed an evaluation on five open-source projects from GitHub that varies between 5K-26K lines of code. To measure the effectiveness of our proposed approach, recall, precision, and f-measure metrics have been used on five open-source projects. The results show that the Markov chain that is based on call graph can have higher precision compared to effect graph. On the other hand, for small number of cases higher recall values are obtained with effect graph compared to call graph. With a Markov chain model based on call graph and effect graph, we can achieve recall values between 98%-100%.

Cited by 5

Leveraging Code Cohesion Analysis to Identify Source Code Supply Chain Attacks

Reuben, Maor, Mendel, Ido, Feldman, Or et al. · ArXiv.org · 2025

Supply chain attacks significantly threaten software security with malicious code injections within legitimate projects. Such attacks are very rare but may have a devastating impact. Detecting spurious code injections using automated tools is further complicated as it often requires deciphering the intention of both the inserted code and its context. In this study, we propose an unsupervised approach for highlighting spurious code injections by quantifying cohesion disruptions in the source code. Using a name-prediction-based cohesion (NPC) metric, we analyze how function cohesion changes when malicious code is introduced compared to natural cohesion fluctuations. An analysis of 54,707 functions over 369 open-source C++ repositories reveals that code injection reduces cohesion and shifts naming patterns toward shorter, less descriptive names compared to genuine function updates. Considering the sporadic nature of real supply-chain attacks, we evaluate the proposed method with extreme test-set imbalance and show that monitoring high-cohesion functions with NPC can effectively detect functions with injected code, achieving a Precision@100 of 36.41% at a 1:1,000 ratio and 12.47% at 1:10,000. These results suggest that automated cohesion measurements, in general, and name-prediction-based cohesion, in particular, may help identify supply chain attacks, improving source code integrity.

Cited by 0Open access

Chain Code P System using Cycle Grammar

S. Jebasingh, G. Johnsy Arputhavalli, Divya P.S · International Journal of Recent Technology and Engineering (IJRTE) · 2019

P system is a bio-inspired distributed computing model to generate string languages [4], arrays [7] and tessellation patterns [2]. Chain Code P System is a string rewriting computing model to generate chain code picture languages in the frame work of P system. A variant of chain code P system is introduced in this paper, namely Cycle Rewriting Chain Code P system, where the string rewriting rules uses cycle grammar to construct cycle picture languages. We consider the problem of constructing chain code picture languages with even number of chains, kites, Von Koch quadric 8 segment like curves and Von Koch-like curves.

Cited by 1Open access

Assurance Carrying Code for Software Supply Chain

Yutaka Matsuno, Yoriyuki Yamagata, H. Nishihara et al. · 2021 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) · 2021

Modern software systems are composed of software components supplied by a software supply chain, and it has become difficult to maintain the dependability of the software supply chain. To address this problem, we introduce assurance carrying code, a framework in which every software component in a software supply chain has its own assurance case. When integrating a software component into a supply chain, the stakeholders check (manually or automatically) the assurance case to determine whether or not the software component is dependable for the supply chain. We introduce a pattern language for Goal Structuring Notation (GSN) formalized by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\lambda$</tex> -calculus, which is used in a theory of functional programming languages theory.

Cited by 1

Research on compression-type vertex chain code

YU Guofang, Wang li · Journal of Image and Graphics · 2010

提出了两种新的压缩型顶点链码的编码方法。根据图像边界的顶点链码中通常包含大量的两个顶点的连续编号的特点，用0和9分别代替常规顶点链码的1和3，而用1到8这8个数字直接表示连续出现率最高的编号2及其数量，研究了一种动态顶点链码。将链码顶点分为1、2、3和1与3的组合4种类型，用一个字节的高位区和低位区分别表示链码编号及其连续数量，研究了一种压缩型顶点链码。结合一种编码综合效率评价方法，通过与现有的链码进行比较，结果表明本文所研究的链码不仅具有50%～70%的编码压缩比，而且编码或解码的效率也提高了10%～40%，即具有更好的实时性。

Cited by 1Open access