DNA computer based algorithm for recyclable waste paper segregation

Mohammad Osiur Rahman, Aini Hussain, Edgar Scavino, Hannan M A, Hassan Basri

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This article explores the application of DNA computing in recyclable waste paper sorting. The primary challenge in paper recycling is to obtain raw materials with the highest purity. In recycling, waste papers are segregated according to their various grades, and these are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products, while saving on processing chemicals and energy. In the industry, different sensors are used in paper sorting systems, namely, ultrasonic, lignin, gloss, stiffness, infra-red, mid-infra red, and color sensors. Different mechanical and optical paper sorting systems have been developed based on the different sensors. However, due to inadequate throughput and some major drawbacks related to mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. The automated paper sorting systems offer significant advantages over the manual systems in terms of human fatigue, throughput, speed, and accuracy. This research has two objectives: (1) to use a web camera as an image sensor for the vision system in lieu of different sensors; and (2) to develop a new DNA computing algorithm based on the theme of template matching techniques for segregating recyclable waste papers according to paper grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method. This is the main strength of the DNA computing algorithm in actual inspections. The algorithm is implemented by using a silicon-based computer to verify the success rate in paper grade identification.

Original languageEnglish
Pages (from-to)223-240
Number of pages18
JournalApplied Soft Computing Journal
Volume31
DOIs
Publication statusPublished - 2015

Fingerprint

Waste paper
Sorting
DNA
Recycling
Template matching
Sensors
Throughput
Infrared radiation
Lignin
Image sensors
Raw materials
Inspection
Ultrasonics
Cameras
Stiffness
Fatigue of materials
Color
Silicon
Processing
Industry

Keywords

  • DNA computing
  • Paper grade
  • Template matching
  • Waste paper sorting

ASJC Scopus subject areas

  • Software

Cite this

DNA computer based algorithm for recyclable waste paper segregation. / Rahman, Mohammad Osiur; Hussain, Aini; Scavino, Edgar; M A, Hannan; Basri, Hassan.

In: Applied Soft Computing Journal, Vol. 31, 2015, p. 223-240.

Research output: Contribution to journalArticle

@article{a90d055d602d4466ba26a93e158b8208,
title = "DNA computer based algorithm for recyclable waste paper segregation",
abstract = "This article explores the application of DNA computing in recyclable waste paper sorting. The primary challenge in paper recycling is to obtain raw materials with the highest purity. In recycling, waste papers are segregated according to their various grades, and these are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products, while saving on processing chemicals and energy. In the industry, different sensors are used in paper sorting systems, namely, ultrasonic, lignin, gloss, stiffness, infra-red, mid-infra red, and color sensors. Different mechanical and optical paper sorting systems have been developed based on the different sensors. However, due to inadequate throughput and some major drawbacks related to mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. The automated paper sorting systems offer significant advantages over the manual systems in terms of human fatigue, throughput, speed, and accuracy. This research has two objectives: (1) to use a web camera as an image sensor for the vision system in lieu of different sensors; and (2) to develop a new DNA computing algorithm based on the theme of template matching techniques for segregating recyclable waste papers according to paper grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method. This is the main strength of the DNA computing algorithm in actual inspections. The algorithm is implemented by using a silicon-based computer to verify the success rate in paper grade identification.",
keywords = "DNA computing, Paper grade, Template matching, Waste paper sorting",
author = "Rahman, {Mohammad Osiur} and Aini Hussain and Edgar Scavino and {M A}, Hannan and Hassan Basri",
year = "2015",
doi = "10.1016/j.asoc.2015.02.042",
language = "English",
volume = "31",
pages = "223--240",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - DNA computer based algorithm for recyclable waste paper segregation

AU - Rahman, Mohammad Osiur

AU - Hussain, Aini

AU - Scavino, Edgar

AU - M A, Hannan

AU - Basri, Hassan

PY - 2015

Y1 - 2015

N2 - This article explores the application of DNA computing in recyclable waste paper sorting. The primary challenge in paper recycling is to obtain raw materials with the highest purity. In recycling, waste papers are segregated according to their various grades, and these are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products, while saving on processing chemicals and energy. In the industry, different sensors are used in paper sorting systems, namely, ultrasonic, lignin, gloss, stiffness, infra-red, mid-infra red, and color sensors. Different mechanical and optical paper sorting systems have been developed based on the different sensors. However, due to inadequate throughput and some major drawbacks related to mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. The automated paper sorting systems offer significant advantages over the manual systems in terms of human fatigue, throughput, speed, and accuracy. This research has two objectives: (1) to use a web camera as an image sensor for the vision system in lieu of different sensors; and (2) to develop a new DNA computing algorithm based on the theme of template matching techniques for segregating recyclable waste papers according to paper grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method. This is the main strength of the DNA computing algorithm in actual inspections. The algorithm is implemented by using a silicon-based computer to verify the success rate in paper grade identification.

AB - This article explores the application of DNA computing in recyclable waste paper sorting. The primary challenge in paper recycling is to obtain raw materials with the highest purity. In recycling, waste papers are segregated according to their various grades, and these are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products, while saving on processing chemicals and energy. In the industry, different sensors are used in paper sorting systems, namely, ultrasonic, lignin, gloss, stiffness, infra-red, mid-infra red, and color sensors. Different mechanical and optical paper sorting systems have been developed based on the different sensors. However, due to inadequate throughput and some major drawbacks related to mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. The automated paper sorting systems offer significant advantages over the manual systems in terms of human fatigue, throughput, speed, and accuracy. This research has two objectives: (1) to use a web camera as an image sensor for the vision system in lieu of different sensors; and (2) to develop a new DNA computing algorithm based on the theme of template matching techniques for segregating recyclable waste papers according to paper grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method. This is the main strength of the DNA computing algorithm in actual inspections. The algorithm is implemented by using a silicon-based computer to verify the success rate in paper grade identification.

KW - DNA computing

KW - Paper grade

KW - Template matching

KW - Waste paper sorting

UR - http://www.scopus.com/inward/record.url?scp=84953873522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84953873522&partnerID=8YFLogxK

U2 - 10.1016/j.asoc.2015.02.042

DO - 10.1016/j.asoc.2015.02.042

M3 - Article

VL - 31

SP - 223

EP - 240

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -