Improved clustering approach for junction detection of multiple edges with modified freeman chain code

Image processing framework of two-dimensional line drawing involves three phases that are detecting junction and corner that exist in the drawing, representing the lines, and extracting features to be used in recognizing the line drawing based on the representation scheme used. As an alternative to the existing frameworks, this thesis proposed a framework that consists of improvement in the clustering approach for junction detection of multiple edges, modified Freeman chain code scheme and provide new features and its extraction, and recognition algorithm. This thesis concerns with problem in clustering line drawing for junction detection of multiple edges in the first phase. Major problems in cluster analysis such as time taken and particularly number of accurate clusters contained in the line drawing when performing junction detection are crucial to be addressed. Two clustering approaches are used to compare with the result obtained from the proposed algorithm: self-organising map (SOM) and affinity propagation (AP). These approaches are chosen based on their similarity as unsupervised learning class and do not require initial cluster count to execute. In the second phase, a new chain code scheme is proposed to be used in representing the direction of lines and it consists of series of directional codes and corner labels found in the drawing. In the third phase, namely feature extraction algorithm, three features proposed are length of lines, angle of corners, and number of branches at each corner. These features are then used in the proposed recognition algorithm to match the line drawing, involving only mean and variance in the calculation. Comparison with SOM and AP clustering approaches resulting in up to 31% reduction for cluster count and 57 times faster. The results on corner detection algorithm shows that it is capable to detect junction and corner of the given thinned binary image by producing a new thinned binary image containing markers at their locations

The framework of image recognition based on modified freeman chain code

Image recognition of line drawing involves feature extraction and feature comparison; works on the extraction required the representation of the image to be compared and analysed. Combining these two requirements, a framework that implements a new extraction algorithm of a chain code representation is presented. In addition, new corner detection is presented as pre-processing to the line drawing input in order to derive the chain code. This paper presents a new framework that consists of five steps namely pre-processing and image processing, new corner detection algorithm, chain code generator, feature extraction algorithm, and recognition process. Heuristic approach that is applied in the corner detection algorithm accepts thinned binary image as input and produces a modified thinned binary image containing J characters to represent corners in the image. Using the modified thinned binary image, a new chain code scheme that is based on Freeman chain code is proposed and an algorithm is developed to generate a single chain code series that is representing the line drawing input. The feature extraction algorithm is then extracts the three pre-defined features of the chain code for recognition purpose. The features are corner properties, distance between corners, and angle from a corner to the connected corner. The explanation of steps in the framework is supported with two line drawings. The results show that the framework successfully recognizes line drawing into five categories namely not similar line drawing, and four other categories that are similar but with attributes of rotation angle and scaling ratio

Vehicle routing with shortest path system based Floyd Warshall Technique

Vehicle routing plays an important role in courier industry. Problems normally occur during delivery process specifically in determine the receiver. From the practical point of view, solving this problem and have a good routing procedure can save the industry millions of dollars per year through cost-effective movement and delivery of goods. In addition, effective routing can increase productivity, improve operations and make the job of dispatching easier. This project was to develop a system that capable to determine the vehicle route by implementing the traditional method, Floyd Warshall. This system focus on area in a city in Penang and consider 46 locations as the case study. The system was developed in windows XP environment and the interface development developed by using Macromedia Dreamweaver 2004. Its database used Microsoft SQL server. This system was capable to give travel distance, and determine the sequence of location for goods delivery with the shortest path. The system has been tested for a currier company in Malaysia

Heuristic algorithm to generate modified Freeman Chain Code from thinned binary image

Chain code is an image representation which can be used to represent a shape of object or structure and also to represent connectivity between lines in the image boundary. It can be used in various applications because of its ability for information preservation and allows considerable storage space reduction for properties data image shape. This representation also can be applied in image processing field such as image compression, feature extraction and pattern recognition. Extracting chain code for boundary image or shape of object is simpler compared to extracting two-dimensional thinned binary image (TBI) that contain junctions. Thus, this paper presents a new chain code scheme and its algorithm to extract the chain code from TBI with multiple junctions. The importance of this chain code is mainly for feature extraction and recognition processes against such images. Before extracting the chain code, TBI with location-marked junctions is required as input data. This input data is a text file contains thinned binary image (0,1) plus junction marker, 'J' character to indicate a corner or junction at corresponding location. Junction positioning and labelling can be performed manually or by using corner/junction detection algorithm. Subsequently, the input file (0,1,J) will be traversed starting from image boundary and is followed by its inner line. In traversing process, all junction markers will be sequentially renamed to character A-Z to distinguish among existing junctions and, MFCC will be generated simultaneously. The peculiar way this MFCC is generated is due to feature extraction and recognition needs

Pembangunan sistem drp-MRP untuk industri kecil dan sederhana (IKS)

Industri Kecil dan Sederhana (IKS) merupakan antara industri yang banyak menyumbang kepada pertumbuhan ekonomi negara. Maka, untuk memastikan perjalanan dan pengurusan suatu IKS berjalan lancar, pendekatan pengawalan bahan mentah, penentuan penghasilan produk dan pemantauan kawalan kredit amat perlu diberi perhatian serius. Lembaga Pemasaran Pertanian Persekutuan (FAMA) Selayang, Selangor telah dipilih sebagai tempat kajian kes bagi projek penyelidikan “Pembangunan Sistem DRP & MRP Untuk Industri Kecil dan Sederhana (IKS)�. Ini adalah kerana pusat ini menguruskan banyak stok produk dengan pelbagai IKS yang terlibat. Oleh itu, suatu Sistem Pengurusan Inventori dan Pemantauan Kawalan Kredit dibangunkan untuk FAMA. Tujuan utama sistem ini adalah untuk menggantikan sistem semasa yang dilakukan secara manual. Suatu pendekatan Perancangan Keperluan Bahan (MRP) dan Perancangan Sumber Pengedaran (DRP) diaplikasikan bagi menguruskan masalah inventori. Kedua-dua pendekatan ini boleh menyumbang kepada pengurangan kos dan dapat meningkatkan tahap perkhidmatan pelanggan yang lebih baik. Dalam pembangunan sistem ini, Algoritma Wagner Within pula digunakan untuk menentukan saiz lot bagi mendapatkan kuantiti pesanan yang optimum. Sistem ini merupakan sistem berasas web kerana ia dapat memudahkan perkongsian maklumat di FAMA. Ia dibangunkan dengan menggunakan skrip pengaturcaraan Active Server Pages (ASP) dan Microsoft SQL Server 2000 sebagai pangkalan data

Freeman chain code extraction using differential evolution (DE) & particles swarm optimization(PSO)

This paper is focusing on extracting chain codes of a thinned binary image using two soft computing approaches, i.e. Differential Evolution (DE) and Particle Swarm Optimization (PSO). The problem is to find a continuous route which covers all of the nodes of the image. The motivation is that finding such a route is complicated when it has many branches. Literature review shows that these approaches have not been used for solving such problem. In addition, the result shows that the proposed PSO has a better performance than the proposed DE for solving the problem

Developing reflex-based agent with unity3D game engine

An agent is an autonomous entity that perceives its environments, and upon that input, responded with actions accordingly. A common trend in developing agent is through object - oriented programming (OOP). This study explores the possibility of developing agent with a game engine, namely Unity3D, which can navigate within a partially observable environment, with the purpose to enhance t he simulation of real - world situation, i.e. egress simulation. Testing and simulation of the model proves that the agent is capable enough to navigate such environment explicitly. This paper describes the development and the mechanism of the simulation model

Logical heuristic algorithm in extracting 2D structure thinned binary image into freeman chain code (FCC)

In 2D structure with junctions, problem arise as which way first should be followed when junction is found while generating chain code. This paper presents new algorithm using special characters as the means of marking the junctions to ensure all paths have been crossed. The proposed chain code will be consisting of one long alphanumeric sequence with digit characters representing direction codes and alphabets for junction markers. The aim is to reduce the chain code's length to the minimum, as opposed to other chain code generation algorithms when facing with junction problem

Pemodelan dan simulasi

Simulasi ialah suatu kaedah yang sesuai digunakan untuk mengkaji operasi sesuatu sistem. Justeru, buku ini memperkenalkan para pembaca dengan pendekatan simulasi dan langkah yang terlibat dalam pembangunan model simulasi. Buku ini membincangkan tentang pemodelan simulasi bagi sistem diskrit, dinamik, dan stokastik. Untuk mengukuhkan lagi kefahaman pembaca, banyak contoh penggunaan kaedah simulasi telah dimuatkan dalam buku ini. Pada setiap akhir bab disertakan latihan untuk menguji kefahaman pembaca. Buku ini sesuai sebagai bahan pengajaran dan pembelajaran oleh pensyarah, pelajar serta mereka yang berminat untuk mempelajari kaedah simulasi sebagai satu kaedah untuk mengkaji operasi sesuatu sistem