universiti teknologi malaysia -...

29
SIMULATION OF GREYSCALE IMAGE COLOURING USING BLOB DETECTION AHMAD IZUL FAKHRUDDIN BIN AZIMI UNIVERSITI TEKNOLOGI MALAYSIA

Upload: dodung

Post on 29-Jul-2019

212 views

Category:

Documents


0 download

TRANSCRIPT

SIMULATION OF GREYSCALE IMAGE COLOURING USING BLOB

DETECTION

AHMAD IZUL FAKHRUDDIN BIN AZIMI

UNIVERSITI TEKNOLOGI MALAYSIA

SIMULATION OF GREYSCALE IMAGE COLOURING USING BLOB

DETECTION

AHMAD IZUL FAKHRUDDIN BIN AZIMI

A thesis submitted in fulfillment of the

requirements for the award of the degree of

Master of Science (Mathematics)

Faculty of Science

Universiti Teknologi Malaysia

JANUARY 2017

iii

To my beloved father and mother

Azimi bin Ismail and Wan Fauziah binti Wan Agil

and family

iv

ACKNOWLEDGEMENT

While preparing this thesis, I was in contact with many people including

academician, researcher and others who have helped me towards my understanding

and thoughts. First of all, I would like to express my sincere gratitude to my

supervisor, Prof. Dr. Shaharuddin Salleh for all the guidance, critics, thoughts and

encouragement. I am also very thankful to Amir Syafiq, Ahmad Hanis, Basri

Badyalina, Mohd Amirul and Mohd Aidil for the advices and motivation. Without

their continuous support, this thesis would not have been the same as presented here.

A million thanks to my beloved family members for their continuing support

and prays for all the year. All the patience, understanding, love and kindness have

blessed my life and made it easy for me to keep on fighting for the thesis. Last but

not least, to all my fellow friends and all who had helped me in accomplishing this

project. Thank you so much for all the support and assistance at various occasions.

v

ABSTRACT

Automatic colouring of greyscale images using computer is one of the

important fields in digital image processing. It helps to produce more appealing

visuals to human eye when one have to deal with medical images, night vision

cameras or scientific illustrations. However, to produce images that are at par with

the ability of human eyes, computerised colouring process takes a lot of time and

ample calculation. Recent years, blob detection has shown a good development for

finding features in an image. This method not only can run on low memory devices

but also provides users with faster calculation. Encouraged by these advantages –

work on low memory devices and enable faster calculation, two models of untrained

colouring of greyscale images are proposed in this study. The maximum number of

blob features is examined using Centre Surround Extremas (CenSurE) and Binary

Robust Independent Elementary Features (BRIEF). The result of this study proves

that the images coloured by these models look better with increment features of the

key point if the minimum matching distance is as low as possible. In addition, when

comparing feature descriptors using Fast Retina Keypoint (FREAK) solely and

FREAK together with Speeded-Up Robust Features (SURF), it is concluded that the

result is getting better with the decrement of minimum Hessian in the image. This

experiment leads to the discovery that the selection of feature descriptors will

influence the result of colouring.

vi

ABSTRAK

Proses mewarnakan gambar berskala kelabu secara automatik menggunakan

komputer adalah satu daripada bidang yang penting dalam pemprosesan imej digital.

Ia membantu untuk menambahbaikkan penglihatan manusia apabila seseorang perlu

berhadapan dengan imej-imej perubatan, kamera penglihatan malam atau ilustrasi

saintifik. Walau bagaimanapun, untuk menghasilkan imej yang selari dengan

kemampuan mata manusia, proses pewarnaan ini memerlukan masa yang lama dan

pengiraan yang banyak. Beberapa tahun kebelakangan ini, pengesanan tompok telah

menunjukkan perkembangan yang baik dalam mencari ciri-ciri dalam imej. Kaedah

ini bukan sahaja dapat dijalankan pada peranti memori yang rendah, tetapi juga

memberikan pengiraan lebih cepat kepada pengguna. Terdorong oleh kelebihan-

kelebihan ini – kerja pada peranti memori rendah dan membolehkan pengiraan

dengan pantas, dua model pewarnaan gambar berskala kelabu tanpa latihan telah

disarankan dalam kajian ini. Bilangan ciri-ciri maksimum sesebuah tompok telah

dikaji menggunakan Centre Surround Extremas (CenSurE) dan Binary Robust

Independent Elementary Features (BRIEF). Hasil kajian ini membuktikan gambar

yang diwarnakan menggunakan model ini semakin baik dengan penambahan ciri-ciri

jika jarak kesamaan minimum adalah serendah yang mungkin. Tambahan lagi, kajian

terhadap perbandingan hasil penggunaan Fast Retina Keypoint (FREAK) dan hasil

penggunaan FREAK bersama Speeded-up Robust Features (SURF) sebagai

pengesan ciri merumuskan bahawa hasil kajian akan bertambah baik dengan

pengurangan nilai minimum Hessian di dalam gambar. Eksperimen ini membawa

kepada penemuan bahawa pemilihan ciri-ciri pengesan akan mempengaruhi hasil

mewarnakan objek di dalam gambar.

vii

TABLE OF CONTENTS

CHAPTER TITLE PAGE

DECLARATION ii

DEDICATION iii

ACKNOWLEDGEMENT iv

ABSTRACT v

ABSTRAK vi

TABLE OF CONTENTS vii

LIST OF FIGURES xi

LIST OF SYMBOLS xviii

LIST OF ABBRIVIATION xx

1 INTRODUCTION 1

1.1 Introduction 1

1.2 Background of Problem 2

1.3 Problem Statement 3

1.4 Research Question 4

1.5 Objectives of the Study 4

1.6 Significance of the Study 4

1.7 Scope of Study 5

1.8 Thesis Organisation 5

viii

2 LITERATURE REVIEW 6

2.1 Introduction 6

2.2 Principle of Digital Image 6

2.3 Colouring Trials 9

2.3.1 Hand Colouring 9

2.3.2 Semi Automatic Colouring 10

2.3.3 Automatic Colouring 13

2.4 Matched Image Colouring 13

2.5 User Selection Colouring 20

2.6 Feature Detection and Description 24

2.7 Feature Detection using CenSurE 25

2.8 Feature Detection using SURF 27

2.9 Feature Description using SURF 28

2.10 Feature Description using BRIEF 30

2.11 Feature Description using FREAK 31

2.12 The Proposed Colourisation Approach 32

3 CENSURE-AND-BRIEF FOR COLOUR IMAGING 36

3.1 Introduction 36

3.2 Discussion 36

3.2.1 Twice Minimum Matching Distance 37

3.2.1.1 Maximised Number of Feature (5) 38

3.2.1.2 Maximised Number of Feature (10) 27

3.2.1.3 Maximised Number of Feature (15) 40

3.2.1.4 Maximised Number of Feature (20) 41

3.2.1.5 Maximised Number of Feature (25) 42

3.2.1.6 Maximised Number of Feature (50) 43

3.2.2 Twice and a Half Minimum Matching Distance 45

3.2.2.1 Maximised Number of Feature (5) 45

3.2.2.2 Maximised Number of Feature (10) 46

3.2.2.3 Maximised Number of Feature (15) 47

3.2.2.4 Maximised Number of Feature (20) 48

3.2.2.5 Maximised Number of Feature (25) 49

3.2.2.6 Maximised Number of Feature (50) 51

ix

3.2.3 Thrice Minimum Matching Distance 52

3.2.3.1 Maximised Number of Feature (5) 52

3.2.3.2 Maximised Number of Feature (10) 53

3.2.3.3 Maximised Number of Feature (15) 54

3.2.3.4 Maximised Number of Feature (20) 56

3.2.3.5 Maximised Number of Feature (25) 57

3.2.3.6 Maximised Number of Feature (50) 58

3.3 Conclusion 60

4 FREAK -AND- SURF DESCRIPTOR FOR COLOUR 64

IMAGING

4.1 Introduction 64

4.2 Discussion 65

4.2.1 Colourisation Using FREAK Descriptor 66

4.2.1.1 Minimisation of Hessian (300) 66

4.2.1.2 Minimisation of Hessian (350) 67

4.2.1.3 Minimisation of Hessian (400) 68

4.2.1.4 Minimisation of Hessian (450) 69

4.2.1.5 Minimisation of Hessian (500) 70

4.2.1.6 Minimisation of Hessian (550) 71

4.2.1.7 Minimisation of Hessian (600) 72

4.2.1.8 Minimisation of Hessian (650) 73

4.2.1.9 Minimisation of Hessian (700) 74

4.2.2 Colourisation Using FREAK and SURF Descriptor 75

4.2.2.1 Colourisation Using SURF with 76

Minimisation of Hessian (1)

4.2.2.2 Minimisation of Hessian (300) 77

4.2.2.3 Minimisation of Hessian (350) 77

4.2.2.4 Minimisation of Hessian (400) 78

4.2.2.5 Minimisation of Hessian (450) 79

4.2.2.6 Minimisation of Hessian (500) 80

4.2.2.7 Minimisation of Hessian (550) 80

4.2.2.8 Minimisation of Hessian (600) 81

4.2.2.9 Minimisation of Hessian (650) 82

x

4.2.2.10 Minimisation of Hessian (700) 83

4.2.2.11 Colourisation Using SURF with 83

Minimisation of Hessian (500)

4.2.2.12 Minimisation of Hessian (300) 84

4.2.2.13 Minimisation of Hessian (350) 85

4.2.2.14 Minimisation of Hessian (400) 86

4.2.2.15 Minimisation of Hessian (450) 87

4.2.2.16 Minimisation of Hessian (500) 87

4.2.2.17 Minimisation of Hessian (550) 88

4.2.2.18 Minimisation of Hessian (600) 89

4.2.2.19 Minimisation of Hessian (650) 90

4.2.2.20 Minimisation of Hessian (700) 90

4.3 Conclusion 91

5 CONCLUSION AND RECOMMENDATION 98

5.1 Summary 98

5.2 Recommendation for Future Studies 99

REFERENCES 101

xi

LIST OF FIGURES

FIGURE NO. TITLE PAGE

2.1 Binary Image. 7

2.2 Intensity Image. 8

2.3 Indexed image . 8

2.4 True colour image. 8

2.5 Colourisation using DaVinci Resolve . 10

2.6 Example of colouring using two layer technique. 10

2.7 Look Up Table for Pseudocolouring. 12

2.8 Quantisation of Look Up Table. 12

2.9 Pseudocolouring using colourmap on (a) natural image, 12

and (b) medical image.

2.10 Global matching colouring result. 15

2.11 Night vision image colouring. 15

2.12 Local colour transfer results. 15

2.13 Welsh swatches colouring method. 17

2.14 Matting colouring algorithm sequence. (a) Grayscale Image. 17

(b) Masks. (c) Objects. (d) Examples.

(e) Colourised Objects, and (f) Colourised Image.

2.15 (a) Original colour images; (b) Estimated colour images using 19

evenly spaced 5 × 5 references; and (c) Estimated ones using

evenly spaced 20 × 20 references.

2.16 Data training in fully automatic colouring system. 19

2.17 Levin system’s result. 22

xii

2.18 Konushin colouring results. (a) Original black and white photo 23

with scribbled colours. (b) Result of colourisation.

2.19 Premoˇze aerial orthoimagery colouring. (a) Greyscale image. 23

(b) Classified image, and (c) Coloured image.

2.20 Centre surround bi level filters. (a) Circles. (b) Octagons. 25

(c) Hexagons. (d) Boxes.

2.21 Example of integral image technique. 26

2.22 SURF feature detection. (a) Scale space pyramid. 27

(b) Non maximal suppression of 3 × 3 × 3 neighbourhood.

2.23 Discretised Gaussians and the approximations of ,yyL p 28

and ,xyL p .

2.24 A SURF descriptor consists of 4 × 4 grid cells subdivided 29

window that is laid over the detected point.

2.25 Three example of BRIEF descriptors built by a random 30

gaussian distributor.

2.26 The FREAK sampling pattern and the example of its discriminant 31

pair depicted by lines.

2.27 Flow chart of the proposed approach. 34

2.28 Edge Removal on both image to reduce the inappropriate feature. 34

(a) Original image; (b) Dilated edge image; and

(c) Subtracted image.

2.29 (a) Keypoints detection; and (b) Selected keypoints matching. 35

2.30 Crop image. 35

3.1 Five centre surround bi level filters in box shaped with 37

different lengths.

3.2 Colouring result of 5 number maximum feature 38

with twice the minimum matching distance.

3.3 Colouring result of 10 number maximum feature 39

with twice the minimum matching distance.

3.4 Colouring result of 15 number maximum feature 41

with twice the minimum matching distance.

xiii

3.5 Colouring result of 20 number maximum feature 42

with twice the minimum matching distance.

3.6 Colouring result of 25 number maximum feature 43

with twice the minimum matching distance.

3.7 Colouring result of 50 number maximum feature 44

with twice the minimum matching distance.

3.8 Colouring result of 5 number maximum feature 46

with twice and a half the minimum matching distance.

3.9 Colouring result of 10 number maximum feature 47

with twice and a half the minimum matching distance.

3.10 Colouring result of 15 number maximum feature 48

with twice and a half the minimum matching distance.

3.11 Colouring result of 20 number maximum feature 49

with twice and a half the minimum matching distance.

3.12 Colouring result of 25 number maximum feature 50

with twice and a half the minimum matching distance.

3.13 Colouring result of 50 number maximum feature 52

with twice and a half the minimum matching distance.

3.14 Colouring result of 5 number maximum feature 53

with thrice the minimum matching distance.

3.15 Colouring result of 10 number maximum feature 54

with thrice the minimum matching distance.

3.16 Colouring result of 15 number maximum feature 55

with thrice the minimum matching distance.

3.17 Colouring result of 20 number maximum feature 57

with thrice the minimum matching distance.

3.18 Colouring result of 25 number maximum feature 58

with thrice the minimum matching distance.

3.19 Colouring result of 50 number maximum feature 59

with thrice the minimum matching distance.

3.20 Results of colouring a greyscale image using twice 61

of minimum distance sorted from left to right

and up to down (5, 10, 15, 20, 25 and 50).

xiv

3.21 Results of colouring a greyscale image using twice 62

and a half of minimum distance sorted from left to right

and up to down (5, 10, 15, 20, 25 and 50).

3.22 Results of colouring a greyscale image using thrice 63

of minimum distance sorted from left to right

and up to down (5, 10, 15, 20, 25 and 50).

4.1 Colouring result of minimisation of Hessian values 67

at 300 using FREAK descriptor.

4.2 Colouring result of minimisation of Hessian values 68

at 350 using FREAK descriptor.

4.3 Colouring result of minimisation of Hessian values 69

at 400 using FREAK descriptor.

4.4 Colouring result of minimisation of Hessian values 70

at 450 using FREAK descriptor.

4.5 Colouring result of minimisation of Hessian values 71

at 500 using FREAK descriptor.

4.6 Colouring result of minimisation of Hessian values 72

at 550 using FREAK descriptor.

4.7 Colouring result of minimisation of Hessian values 73

at 600 using FREAK descriptor.

4.8 Colouring result of minimisation of Hessian values 74

at 650 using FREAK descriptor.

4.9 Colouring result of minimisation of Hessian values 75

at 700 using FREAK descriptor.

4.10 Colouring result of minimisation of Hessian values 76

at 1 using SURF descriptor.

4.11 Colouring result of minimisation of Hessian values 77

at 300 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.12 Colouring result of minimisation of Hessian values 78

at 350 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.13 Colouring result of minimisation of Hessian values 79

at 400 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

xv

4.14 Colouring result of minimisation of Hessian values 79

at 450 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.15 Colouring result of minimisation of Hessian values 80

at 500 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.16 Colouring result of minimisation of Hessian values 81

at 550 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.17 Colouring result of minimisation of Hessian values 82

at 600 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.18 Colouring result of minimisation of Hessian values 82

at 650 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.19 Colouring result of minimisation of Hessian values 83

at 700 using FREAK descriptor with prescribed value

of minimum Hessian at 1 for SURF descriptor.

4.20 Colouring result of minimisation of Hessian values 84

at 500 using SURF descriptor.

4.21 Colouring result of minimisation of Hessian values 85

at 300 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.22 Colouring result of minimisation of Hessian values 86

at 350 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.23 Colouring result of minimisation of Hessian values 86

at 400 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.24 Colouring result of minimisation of Hessian values 87

at 450 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.25 Colouring result of minimisation of Hessian values 88

at 500 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.26 Colouring result of minimisation of Hessian values 89

at 550 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

xvi

4.27 Colouring result of minimisation of Hessian values 89

at 600 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.28 Colouring result of minimisation of Hessian values 90

at 650 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.29 Colouring result of minimisation of Hessian values 91

at 700 using FREAK descriptor with prescribed value

of minimum Hessian at 500 for SURF descriptor.

4.30 Result of colouring a greyscale image using minimum Hessian 93

at 300 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.31 Result of colouring a greyscale image using minimum Hessian 93

at 350 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.32 Result of colouring a greyscale image using minimum Hessian 94

at 400 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.33 Result of colouring a greyscale image using minimum Hessian 94

at 450 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.34 Result of colouring a greyscale image using minimum Hessian 95

at 500 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.35 Result of colouring a greyscale image using minimum Hessian 95

at 550 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

xvii

4.36 Result of colouring a greyscale image using minimum Hessian 96

at 600 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.37 Result of colouring a greyscale image using minimum Hessian 96

at 650 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

4.38 Result of colouring a greyscale image using minimum Hessian 97

at 700 on (a) FREAK descriptor solely; (b) FREAK descriptor

with prescribed value of minimum Hessian

at 1 for SURF descriptor; and (c) FREAK descriptor with

prescribed value of minimum Hessian at 500 for SURF descriptor.

xviii

LIST OF SYMBOLS

I(x,y) - intensity of the image

(x,y) - spatial coordinates in an image

US$ - United State Dollar

- colour image

- grey image

l - luminance value

α, β - chromaticity values

- luminance pixel in the source image

, - mean of luminance for the target and source image

, - standard deviations of luminance for the target and source

image

E - similarity measure

L2 - Euclidian metric

- neighbourhood in the grayscale image

- neighbourhood in the colourised image

- luminance of the colourised swatch

p - pixels in neighbourhood

2D - two dimension

Y - monochromatic luminance channel

U , V - the chrominance channels

fc - cost function

xix

wts - weighting function

ai , bi - linear coefficients

N(.) - neighbouring pixels

v(x; y) - optical flow calculated at

t - time

W - pairwise affinities matrix

D - diagonal matrix

A - symmetric matrix

- scale

, , - approximations of Gaussian

- second order derivative

- Hessian matrix

, - first order derivative

xx

LIST OF ABBRIVIATION

LoG - Laplacian of Gaussian

DoG - Difference of Gaussian

CenSurE - Centre Surround Extremas

FREAK - Fast Retina Keypoint

SURF - Speeded-Up Robust Features

RGB - the red, green, and blue values

MRI - Magnetic Resonance Imaging

SEM - Scanning Electron Microscopy

GMM - Gaussian Mixture Model

MAP - maximum a posteriori probability

CML - coupled map lattices

FAST - Features from Accelerated Segment Test

SIFT - Scale Invariant Feature Transform

BRIEF - Binary Robust Independent Elementary Features

ORB - Oriented Binary Robust Independent Elementary Features

DAISY - Dense Descriptor Applied to Wide-Baseline Stereo

BRISK - Binary Robust Invariant Scalable Keypoints

CHAPTER 1

INTRODUCTION

1.1. Introduction

Colour is a powerful medium through which man views the world. Unlike

most animals, which see only shades of grey, Bleicher [1] states that humans are

exposed to this marvelous additional dimensions of vision. Colour influences human

perception, preference, and psychology. When applied skillfully and intentionally,

colour is a valuable communication tool especially for graphic designers.

Colours have been a part of our everyday lives in such ways that we could not

imagine our life without colour. Human perception on colours has long gone an

outstretched evolution process since it was first used as a survival method of our

ancestors. We naturally react to colour as we have evolved with a certain

understanding of it, partly because the survival of our ancestors depended on it with

regard to what to consume and avoid [2]. What humans perceive as colour is actually

wavelengths of light reflected to a surface. Surfaces absorb all the spectral hues

except for those that bounce off in the form of visible colour.

Hues, Tints, Shade and Tones are four notions that are intimately related and

consequently are often confused with one another. In simple words, hues are colours.

We are talking about hues when we mention black, orange, red or brown. Different

hues are the results of different wavelengths of lights. On the other hand, tint is

lighter colour of the originals, shade is the original colour added with black thus

making it seems darker, and tone is the original colour added with grey. The purity of

2

a colour is attributed by the term Saturation. A colour turns greyer as the saturation

of it decreases. The colour will turn a definite grey once it is saturated ultimately.

Luminance or lightness blends in some amount of white in an original colour. The

luminosity of a colour is directly proportional to the amount of white added in it. For

an instance, if the luminosity of a colour decreases the amount of white in the colour

lessens.

There has been an escalation in number of research done on automated image

colourisation technique to date as in [3, 4, 5, 6, 7]. One of the areas frequently

explored is greyscale image colouring process. Coloured greyscale image will make

an image more visually appealing. Besides greyscale image, the colourisation

process can also be applied to classic films and photographs, and scientific images.

Furthermore, the fusion of automated colouring technique in image manipulation

package would greatly benefit the common users. They will be able to automatically

colour images instead of using the traditional colour mapping technique. Integrated

colourisation technique is relatively more practical compared to independent

applications because it allows users to fabricate and alter an image with the provided

functionalities that come with the package.

1.2. Background of the Problem

The most important function of computer vision is to address or detect

required features for further display processing. Many feature detections are

developed to date, for example blob detectors and edge and corner detectors. In

computer vision, detection of exact objects by their shape or colour, or both is

essential to maximise the chance for further successful recognition. Detection, in

computer vision context, refers to an image processing operation that is relatively

simple yet often seems computationally expensive.

Nowadays, the available detectors varies in terms of speed and accuracy. The

typical blob detection targets the detection of regions with different intensity values

from its surroundings in an image. Among the popular approaches are the Laplacian

3

of Gaussian (LoG) and the Difference of Gaussian (DoG). Convolution of the image

by a Gaussian kernel and computation of the LoG or DoG operator are required for

these approaches. Despite it being an effective technique, the convolving phase of

the process with kernels 5 by 5 or higher is computationally expensive. Because of

that, for a long time, the research in feature detection field is only concentrated on

grey-scale images.

Colourisation is the process of adding colours to monochrome images or

videos. This process plays a crucial role in the human perception of optical

information. The process of colouring a greyscale image or video comprises the

process of assigning the single dimension of intensity or luminance to the quantities

that ranges to three dimensions for example green, red and blue channels. However,

the process of mapping between colour and intensity has a range of ways and yet not

predefined, thus it demands minor amount of human interference or external

information.

1.3. Problem Statement

Numerous studies on blob detection method have been explored, especially

on object detection, yet none has covered the colouring process. This gives an insight

into exploring the process of grayscale image colouring using blob detection. As the

method works perfectly fine on low memory bandwidth, it is expected that this

untrained colouring technique can also be used on low memory devices such as on

smartphones.

Thus, this study is conducted to examine the use of blob detection as a feature

for an object in colouring process. To achieve this goal, a set of feature detector and

descriptor is tested. By the end of this study, we hope to read the best result between

the models and the feature characteristics in order to get good colouring result.

4

1.4. Research Question

This study answers the questions of:

i. Is it possible to colour a greyscale image using blob detection?

ii. What is the significance of maximised number of blob feature for

CenSurE when colouring a greyscale image?

iii. What is the consequence of minimising the matching distance on

colouring result?

iv. What are the effects of combining FREAK and SURF descriptor?

1.5. Objective of the Study

To guide this study, four objectives are formulated:

i. To introduce a new colouring technique using blob detection (CenSurE

and SURF).

ii. To investigate the significance of featured maximised number for

CenSurE in colouring the greyscale image.

iii. To inspect the consequence of minimising the matching distance on

colouring result.

iv. To analyse the effects of combining FREAK and SURF descriptors.

1.6. Significant of the Study

The main purpose of this study is to develop and examine the efficacy of a

new colouring technique for greyscale images using blob detectioon. Blob detection

has widely been used in real time object detection and low memory application

because of its speed in detecting features of an object. Encaurage by this advantages,

an untrained automatic colouring technique has been proposed in order to surpass the

previous technique which is mostly have to undergo the training process. This

technique also expected to be apply in the real time colouring process since the

detection used in this technique is finely used in real time object detection.

5

1.7. Scope of the Study

In this research two type of detectors and three descriptors are discussed in

two different sections. First, feature detection by CenSurE is analysed using BRIEF

descriptor before colouring a grayscale image. Then in the next section, the

combination of SURF and FREAK descriptor is compared to the solely FREAK

descriptor to choose one with better result.

1.8. Thesis Organisation

Chapter 1 starts with an explanation on the significant of colour in human’s

everyday life. The chapter then relates colour with one of the most important element

of this study which is computer vision. Relevant backgrounds of this study are

provided to shed light into the study problem. To understand the problem highlighted

and to make sure the study is on the right track, problem statement, research

questions and research objectives are also included in the chapter. The scopes that

are required throughout the study is also reviewed at the end of the chapter.

Reviews on the principle of digital image and colouring trial are highlighted

in Chapter 2. Concepts on matching and user define colouring approach are also

stated besides a brief introduction on feature detection and description. At the end of

this chapter, the proposed method is discussed in detail.

Chapter 3 presents the main ideas of colouring the grayscale image using

CenSurE detector and BRIEF descriptor. This chapter provides a complete result of

maximising the number of CenSurE feature on our colouring model. The analysis on

minimum distance feature between images conducted is also shared.

Chapter 4 consists of the results of combining the two feature descriptors -

SURF and FREAK. The conclusion of this study together with recommendations for

future studies are in Chapter 5.

100

iv. The Levin et al. [13] spreading colouring technique was adopted in this

study. We encourage the future study to explore the different kinds of

spreading colouring technique.

REFERENCES

1. Bleicher, S. Contemporary Color Theory and Use. Clifton Park, NY:.

Thomson/Delmar Learning. 2005

2. Ambrose, G. and Harris, P. Design Thinking. London, UK:. AVA Publishing

SA. 2005

3. Reinhard, E., Ashikhmin, M., Gooch, B., and Shirley, P. Color Transfer

Between Images. IEEE Computer Graphics and Applications, 2001. 21(5):

34-41.

4. Welsh, Ashikhmin, M., and Mueller, K. Transferring Color to Greyscale

Images. Proceedings of the 29th Annual Conference on Computer

Graphicsand Interactive Techniques. July 23-26, 2002. San Antonio, Texas:

2002. 277– 280.

5. Toet, A. Transferring Color to Single-Band Intensified Night Vision Images.

Proceedings of SPIE. August, 2004. Enhanced and Synthetic Vision. 2004.

5424: 40-49.

6. Tai, T., Jia, J., and Tang, C. Local Color Transfer via Probabilistic

Segmentation by Expectation Maximization. Procedding of ComputerVision

and Pattern Recognition (CVPR'05). June 20-25, 2005. IEEE Computer

Society Conference. 2005.1: 747-754

7. Chen, T., Wang, Y., Schillings, V., and Meinel, C. Grayscale Image Matting

and Colorization. Proceedings of ACCV2004. Jan 27-30, 2004. Jeju Island,

Korea. 2004. 1164-1169.

8. Yumibe, J. Moving Color: Early Film, Mass Culture, Modernism. New

Brunswick: Rutgers University Press. 2012.

9. Lipowezky, U. Grayscale Aerial and Space Image Colorization Using

Texture Classification. Pattern Recognition Letters. 2006. 27(4): 275–286.

10. Horiuchi, T. Colorization Algorithm Using Probabilistic Relaxation. Image

and Vision Computing. 2004. 22: 197–202.

11. Nodaa, H., Korekunib, J., and Niimia, M. A Colorization Algorithm Based

on Local MAP Estimation. Pattern Recognition. 2006. 39: 2212 – 2217.

12. Vieira, L., Vilela, R., Nascimento, E. D., Fernandes, F. J., Carceroni, and

Ara´ujo, A. Fully Automatic Coloring of Grayscale Images. Image and Vision

Computing, 2007. 25: 50–60.

13. Levin, A., Lischinski, D., and Weiss, Y. Colorization Using Optimization.

ACM Transactions on Graphics. 2004. 23(3): 689–694.

14. Konushin, V., Vezhnevets, V. Interactive Image Colorization and Recoloring

Based on Coupled Map Lattices. Graphicon'2006 Conference Proceedings.

July, 2006. Novosibirsk Akademgorodok, Russia. 231-234.

15. Premoˇvze, S., and Thompson, W. B. Automated Coloring of Panchromatic

Orthoimagery. 3rd ICA Mountain Cartography Workshop. May, 2002. Mt.

Hood, Oregon, USA.

16. Forstner, W. A Feature Based Correspondence Algorithm for Image

Matching. Int. Archiv. Photogram. 1986. 26(3): 150–166.

17. Fraundorfer, F., and Scaramuzza, D. Visual Odometry Part II: Matching,

Robustness, Optimization and Applications. Robotics & Automation

Magazine, IEEE. 2012. 19(2): 78–90.

18. Moravec, H. P. Obstacle Avoidance and Navigation in the Real World by a

Seeing Robot Rover. Stanford University. 1980.

19. Harris, C., and Stephens, M. A Combined Corner and Edge Detector. Alvey

Vision Conference. Manchester, UK. 1988. 15: 147–151.

20. Shi, J., and Tomasi, C. Good Features to Track Computer Vision and Pattern

Recognition. Proceedings CVPR’94. 1994. Computer Society Conference on

IEEE. 1994. 593–600.

21. Rosten, E., and Drummond, T. Machine Learning for High-speed Corner

Detection. Proceedings of the 9th European Conference on Computer Vision.

2006. 1: 430–443.

22. Lowe, D. G. Object Recognition from Local Scale-Invariant Features. The

proceedings of the seventh IEEE international conference. Computer vision.

1999 . 2: 1150–1157.

23. Bay, H., Tuytelaars, T., and Gool, V. L. Surf: Speeded up Robust Features.

Proceedings of 9th European Conference on Computer Vision. Graz, Austria.

2006. Springer. 2006. 404–417.

24. Agrawal, M., Konolige, K., and Blas, M. CenSurE: Centre Surround

Extremas for Realtime Feature Detection and Matching. Forsyth, D., Torr,

P., and Zisserman, A. (Eds.). Proceedings of 10th European Conference on

Computer Vision. 2008. Berlin Heidelberg: Springer. 2008. 5305: 102–115.

25. Calonder, M., Lepetit, V., Strecha, C., and Fua, P. BRIEF: Binary Robust

Independent Elementary Features. In European Conference on Computer

Vision, 2010. 6314: 778-792.

26. Rublee, E., Rabaud, V., Konolige, V., and Bradski, G. ORB: An Efficient

Alternative to SIFT or SURF. In Computer Vision (ICCV). IEEE

International Conference 2011. 2564-2571.

27. Tola, E., Lepetit, V., and Fua. P. DAISY: An Efficient Dense Descriptor

Applied to Wide-Baseline Stereo. Pattern Analysis and Machine Intelligence.

IEEE Transactions May, 2010. 32(5): 815-830.

28. Leutenegger, S., Chli, M., and Siegwart, R. Y. BRISK: Binary Robust

Invariant Scalable Keypoints. In Computer Vision (ICCV). IEEE

International Conference. 2011. 2548-2555.

29. Alahi, A., Ortiz, R., and Vandergheynst, P. FREAK: Fast Retina Keypoint. In

-Computer Vision and Pattern Recognition (CVPR). IEEE Conference. 2012.

510-517.

30. Chao, J., Al-Nuaimi, A., Schroth, G., and Steinbach, E. Performance

comparison of various feature detector-descriptor combinations for content-

based image retrieval with JPEG-encoded query images. In IEEE

International Workshop on Multimedia Signal Processing. 2013. pp. 029-

034.