Procedural Generation of Isometric Racetracks Using Chain Code for Racing Games

2021 ◽  
Author(s):  
Erik Jhones F. do Nascimento ◽  
Tassiana M. Castro ◽  
Ana Carolina S. Abreu ◽  
Filipe A. Lira ◽  
Amauri H. Souza
Keyword(s):  
Chain Code ◽  
Procedural Generation

scholarly journals Automatic Detection of Pulmonary Nodules using Three-dimensional Chain Coding and Optimized Random Forest

2020 ◽  
Vol 10 (7) ◽  
pp. 2346 ◽  
Author(s):  
May Phu Paing ◽  
Kazuhiko Hamamoto ◽  
Supan Tungjitkusolmun ◽  
Sarinporn Visitsattapongse ◽  
Chuchart Pintavirooj
Keyword(s):  
Random Forest ◽  
Three Dimensional ◽  
Pulmonary Nodules ◽  
Region Growing ◽  
Favorable Result ◽  
Dimensional Chain ◽  
Chain Code ◽  
Seeded Region Growing ◽  
Chain Coding ◽  
Diagnosis Of Lung Cancer

The detection of pulmonary nodules on computed tomography scans provides a clue for the early diagnosis of lung cancer. Manual detection mandates a heavy radiological workload as it identifies nodules slice-by-slice. This paper presents a fully automated nodule detection with three significant contributions. First, an automated seeded region growing is designed to segment the lung regions from the tomography scans. Second, a three-dimensional chain code algorithm is implemented to refine the border of the segmented lungs. Lastly, nodules inside the lungs are detected using an optimized random forest classifier. The experiments for our proposed detection are conducted using 888 scans from a public dataset, and achieves a favorable result of 93.11% accuracy, 94.86% sensitivity, and 91.37% specificity, with only 0.0863 false positives per exam.

ENCRYPTION-DECRYPTION TECHNIQUES FOR PICTURES

1989 ◽  
Vol 03 (03n04) ◽  
pp. 497-503
Author(s):  
RANI SIROMONEY ◽  
K. G. SUBRAMANIAN ◽  
P. J. ABISHA
Keyword(s):  
Public Key ◽  
Two Dimensional ◽  
Chain Code ◽  
Dimensional Array ◽  
Public Key Cryptosystems ◽  
Encryption Decryption ◽  
A Chain

Language theoretic public key cryptosystems for strings and pictures are discussed. Two methods of constructing public key cryptosystems for the safe transmission or storage of chain code pictures are presented; the first one encrypts a chain code picture as a string and the second one as a two-dimensional array.

scholarly journals Fully Automated Segmentation of Lung Parenchyma Using Break and Repair Strategy

2019 ◽  
Vol 28 (2) ◽  
pp. 275-289 ◽  
Author(s):  
S. Pramod Kumar ◽  
Mrityunjaya V. Latte
Keyword(s):  
Active Contour ◽  
Lung Parenchyma ◽  
Threshold Selection ◽  
Chain Code ◽  
Repair Strategy ◽  
Automated Method ◽  
Segmentation Methods ◽  
Segmentation Accuracy ◽  
Pulmonary Parenchyma ◽  
Optimal Threshold Selection

Abstract The traditional segmentation methods available for pulmonary parenchyma are not accurate because most of the methods exclude nodules or tumors adhering to the lung pleural wall as fat. In this paper, several techniques are exhaustively used in different phases, including two-dimensional (2D) optimal threshold selection and 2D reconstruction for lung parenchyma segmentation. Then, lung parenchyma boundaries are repaired using improved chain code and Bresenham pixel interconnection. The proposed method of segmentation and repairing is fully automated. Here, 21 thoracic computer tomography slices having juxtapleural nodules and 115 lung parenchyma scans are used to verify the robustness and accuracy of the proposed method. Results are compared with the most cited active contour methods. Empirical results show that the proposed fully automated method for segmenting lung parenchyma is more accurate. The proposed method is 100% sensitive to the inclusion of nodules/tumors adhering to the lung pleural wall, the juxtapleural nodule segmentation is >98%, and the lung parenchyma segmentation accuracy is >96%.

Blind Digital Image Watermarking Algorithm Based on the Chain Code

2012 ◽  
Vol 546-547 ◽  
pp. 410-415
Author(s):  
Chun Ge Tang ◽  
Tie Sheng Fan ◽  
Lei Liu ◽  
Zhi Hui Li
Keyword(s):  
Image Quality ◽  
Digital Watermarking ◽  
Digital Image ◽  
Image Watermarking ◽  
Boundary Representation ◽  
Experimental Results ◽  
Digital Image Watermarking ◽  
Original Image ◽  
Chain Code ◽  
Decision Method

A new blind digital watermarking algorithm based on the chain code is proposed. The chain code is obtained by the characteristics of the original image -the edge contour. The feather can reflect the overall correlation of the vector image, and chain code expression can significantly reduce the boundary representation of the amount of data required. For the watermarking embedding, the original vector image is divided into sub-block images, and two bits of the watermarking information are embedded into sub-block images repeatedly by quantization. For watermarking extracting, the majority decision method is employed to determine the size of the extracted watermark. Experimental results show that the image quality is not significantly lowered after watermarking. The algorithm can resist the basic conventional attacks and has good robustness on the shear attacks.

scholarly journals Procedural generation of topologic road networks for driving simulation

2015 ◽  
Author(s):  
Carlos Campos ◽  
Joao Miguel Leitao ◽  
Joao Paulo Pereira ◽  
Antonio Ribas ◽  
Antonio Fernando Coelho
Keyword(s):  
Road Networks ◽  
Driving Simulation ◽  
Procedural Generation

A STRUCTURAL APPROACH TO ON-LINE CHARACTER RECOGNITION: SYSTEM DESIGN AND APPLICATIONS

1991 ◽  
Vol 05 (01n02) ◽  
pp. 311-335 ◽  
Author(s):  
FATHALLAH NOUBOUD ◽  
RÉJEAN PLAMONDON
Keyword(s):  
Character Recognition ◽  
Computation Time ◽  
Experimental Tests ◽  
Recognition System ◽  
Structural Approach ◽  
Chain Code ◽  
String Comparison ◽  
Average Computation Time ◽  
On Line ◽  
A Chain

This paper presents a real-time constraint-free handprinted character recognition system based on a structural approach. After the preprocessing operation, a chain code is extracted to represent the character. The classification is based on the use of a processor dedicated to string comparison. The average computation time to recognize a character is about 0.07 seconds. During the learning step, the user can define any set of characters or symbols to be recognized by the system. Thus there are no constraints on the handprinting. The experimental tests show a high degree of accuracy (96%) for writer-dependent applications. Comparisons with other system and methods are discussed. We also present a comparison between the processor used in this system and the Wagner and Fischer algorithm. Finally, we describe some applications of the system.

Sign in / Sign up

Export Citation Format

Share Document