Local Diagonal Extrema Pattern: A New and Efficient Feature Descriptor for CT Image Retrieval IEEE Signal Processing Letters, 2015 Shiv Ram Dubey, Satish Kumar Singh and Rajat Kumar Singh Indian Institute of Information Technology, Allahabad

𝑖,𝑗

𝐼1 𝐼

𝑖,𝑗

𝑖,𝑗 𝐼3

(c)

15

56 (b) An Example 50

𝑖,𝑗 𝐼4

160

100

(d)

𝑖,𝑗

𝐼𝜏𝑚𝑎𝑥 = 160 𝑖,𝑗 𝐼𝜏𝑚𝑖𝑛 𝑖,𝑗

𝐼

= 15 = 50

𝜏𝑚𝑎𝑥 + 8𝛿 = 19 𝜏𝑚𝑖𝑛 + 4 + 8𝛿 = 22

𝛿=2

(e)

𝜏𝑚𝑎𝑥 = 3 𝜏𝑚𝑖𝑛 = 2

(f)

𝐿𝐷𝐸𝑃𝑖,𝑗 = (0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0, 0,0,1,0,0,1,0,0) (g) Final Local Diagonal Extrema Pattern Fig.1. The computation of 𝐿𝐷𝐸𝑃 diagram with an example.

𝑖,𝑗

pattern for center 𝐼

𝑖,𝑗

using the flow

60

  

Descriptors Compared – Local Binary Pattern (LBP) [3], Local Ternary Pattern (LTP) [4], Center Symmetric LBP (CSLBP) [5],Center Symmetric LTP (CSLTP) [6], Local Mesh Pattern (LMeP) [7], and Local Ternary Co-occurrence Pattern (LTCoP) [8]. Results – The retrieval results are reported in terms of average retrieval precision (ARP), average retrieval rate (ARR), F-score, and total retrieval time in seconds. Fig. 2 illustrates the comparison results over Emphysema-CT database. Fig. 3 depicts the retrieval results over NEMA-CT database. The proposed descriptor is having the comparable performance with best one while maintaining very less retrieval time.

50

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

40 30

50

20 10

40 20

40 60 Number of Top Matches

80

20

100

(a) Total Retrieval Time in seconds

F_score (%)

50 40

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

30 20 10 20

40 60 Number of Top Matches

40 60 Number of Top Matches

80

100

(b)

60

80

0.5

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

0.4 0.3 0.2 0.1

100

0 Descriptors

(c) (d) Fig.2. Comparison of (a) ARP (%), (b) ARR (%), (c) F_score (%), and (d) total retrieval time in seconds using LBP, LTP, CSLBP, CSLTP, LMeP, LTCoP and LDEP descriptors over Emphysema-CT database. 100 70

95

60

90 85 80 75 70 65

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

10

50

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

40 30 20 10

20 30 Number of Top Matches

40

50

10

(a)

Experiments and Results Databases Used – Emphysema-CT [1]: Three categories Normal Tissue (NT), Centrilobular Emphysema (CLE), and Paraseptal Emphysema (PSE) containing 59, 50 and 59 images respectively. NEMA-CT [2]: The 499 CT images from different parts of the body are collected from National Electrical Manufacturers Association (NEMA) and categorized into 8 categories having 104, 46, 29, 71, 108, 39, 33 and 69 images.

60

ARR (%)



𝜏 𝑚𝑖𝑛

70

ARR (%)

ARP (%)

70

20 30 Number of Top Matches

40

50

(b) 5

80

Total Retrieval Time in seconds

(a) 𝐼 𝑖,𝑗 2

𝜏 𝑚𝑎𝑥

2, 𝐸𝑙𝑠𝑒 Note that the dimension of the pattern 𝐿𝐷𝐸𝑃𝑖,𝑗 is the maximum possible value of 𝑘 which is 24 when 𝜏𝑚𝑖𝑛 = 4 and 𝛿 = 2. It means that the dimension 𝑑𝑖𝑚 of the 𝐿𝐷𝐸𝑃𝑖,𝑗 is 24. The value of 𝛿 for considered example is demonstrated in the Fig. 1(e). Fig. 1(f) shows the values of 𝜏𝑚𝑎𝑥 + 8𝛿 and (𝜏𝑚𝑖𝑛 + 4 + 8𝛿). Finally, the LDEP pattern is depicted in Fig. 1(g). Only two elements of the pattern are set to 1 and the rest are zeros.

80

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

𝑖,𝑗

where 𝑑𝑖𝑚 is the length of the 𝐿𝐷𝐸𝑃 pattern and 𝐿𝐷𝐸𝑃𝑘 is the 𝑘 𝑡ℎ element of the 𝐿𝐷𝐸𝑃𝑖,𝑗 and given using following formulae, 1, 𝑖𝑓 𝑘 = 𝜏𝑚𝑎𝑥 + 8𝛿 𝑖,𝑗 𝐿𝐷𝐸𝑃𝑘 |𝑘∈[1,𝑑𝑖𝑚 ] = (2) 𝑜𝑟 𝑘 = (𝜏𝑚𝑖𝑛 + 4 + 8𝛿) 0, 𝐸𝑙𝑠𝑒 where 𝛿 is defined as, 𝑖,𝑗 𝑖,𝑗 0, 𝐼𝑓 𝐼𝜏 𝑚𝑎𝑥 < 𝐼 𝑖,𝑗 𝑎𝑛𝑑 𝐼𝜏 𝑚𝑖𝑛 < 𝐼 𝑖,𝑗 𝑖,𝑗 𝑖,𝑗 𝛿 = 1, (3) 𝐼𝑓 𝐼 ≥ 𝐼 𝑖,𝑗 𝑎𝑛𝑑 𝐼 ≥ 𝐼 𝑖,𝑗

Local Diagonal Extrema Pattern  The relationship of local diagonal extremes (i.e. maxima and minima) with the center pixel is used to encode the LDEP descriptor.  The computation process of LDEP is illustrated using an example in Fig. 1.  Fig. 1(a) shows the position of four diagonal neighbors with 𝑖,𝑗 𝑖,𝑗 𝑖,𝑗 𝑖,𝑗 intensity values 𝐼1 , 𝐼2 , 𝐼3 and 𝐼4 of center with intensity value 𝐼 𝑖,𝑗 .  The example considered is depicted in Fig. 1(b).  Let 𝜏𝑚𝑎𝑥 and 𝜏𝑚𝑖𝑛 are the position of maximum and minimum diagonal neighbors.  The values of maximum and minimum diagonal neighbors (i.e. 𝑖,𝑗 𝑖,𝑗 𝐼𝜏 𝑚𝑎𝑥 and 𝐼𝜏 𝑚𝑖𝑛 respectively) as well as center pixel are extracted in Fig. 1(c).  The values of 𝜏𝑚𝑎𝑥 and 𝜏𝑚𝑖𝑛 are shown in Fig. 1(d).

80

ARP (%)

 The major problems with the existing descriptors are, 1) discriminative descriptors are high dimensional and 2) low dimensional descriptors are less discriminative.  Local Diagonal Extrema Pattern (LDEP) uses the relationship among local neighbors as well as relationship of center with local neighbors.  The consideration of only diagonal neighbors greatly reduces the dimension of the feature vector.  The superiority in terms of performance and efficiency in terms of speedup of the proposed method are confirmed by the experiments over two CT image databases.

 The values and indexes of the local diagonal extremes are computed which is used with the central pixel to form the local diagonal extrema pattern.  The local diagonal extrema pattern (LDEP) for 𝑃𝑖,𝑗 is represented as a binary pattern 𝐿𝐷𝐸𝑃𝑖,𝑗 as follows, 𝑖,𝑗 𝑖,𝑗 𝑖,𝑗 𝐿𝐷𝐸𝑃𝑖,𝑗 = (𝐿𝐷𝐸𝑃1 , 𝐿𝐷𝐸𝑃2 , … , 𝐿𝐷𝐸𝑃𝑑𝑖𝑚 ) (1)

70 60

F_score (%)

Introduction

50

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

40 30 20 10 10

20 30 Number of Top Matches

40

50

LBP LTP CSLBP CSLTP LMeP LTCoP LDEP

4 3 2 1 0 Descriptors

(c) (d) Fig.3. Comparison of (a) ARP (%), (b) ARR (%), (c) F_score (%), and (d) total retrieval time in seconds using LBP, LTP, CSLBP, CSLTP, LMeP, LTCoP and LDEP descriptor over NEMA-CT database.

References [1] [2] [3] [4] [5] [6] [7] [8]

Sørensen et al., “Quantitative Analysis of Pulmonary Emphysema using Local Binary Patterns,” IEEE Transactions on Medical Imaging, 29(2): 559-569, 2010. NEMA–CT image database, 〈ftp://medical.nema.org/ medical/Dicom/Multiframe/〉. Ojala et al., “Multiresolution gray-scale and rotation invariant texture classification with local binary patterns,” IEEE TPAMI, 24(7): 971-987, 2002. Tan and Triggs, “Enhanced local texture feature sets for face recognition under difficult lighting conditions,” IEEE TIP, 19(6): 1635-1650, 2010. Heikkil et al., “Description of interest regions with local binary patterns,” Pattern Recognition, 42: 425-436, 2009. Gupta et al., “Robust order-based methods for feature description,” IEEE CVPR, 2010, pp. 334-341. Murala and Wu, “Local Mesh Patterns Versus Local Binary Patterns: Biomedical Image Indexing and Retrieval,” IEEE JBHI, 18(3): 929-938, 2014. Murala and Wu, “Local ternary co-occurrence patterns: A new feature descriptor for MRI and CT image retrieval,” Neurocomputing, 119: 399-412, 2013.

Local Diagonal Extrema Pattern: A New and Efficient ...

[8] Murala and Wu, “Local ternary co-occurrence patterns: A new feature descriptor for. MRI and CT image retrieval,” Neurocomputing, 119: 399-412, 2013. 20. 40. 60. 80. 100. 40. 50. 60. 70. 80. Number of Top Matches. A. R. P. (%. ) LBP. LTP. CSLBP. CSLTP. LMeP. LTCoP. LDEP. 20. 40. 60. 80. 100. 10. 20. 30. 40. 50. 60.

444KB Sizes 2 Downloads 230 Views

Recommend Documents

Local Wavelet Pattern: A New Feature Descriptor for ...
Local Wavelet Pattern: A New Feature Descriptor for Image Retrieval in Medical CT Databases. IEEE Transactions on Image ... Proposed local wavelet pattern (LWP) utilized the inter- neighbor relationship using .... Public Information Repository,” Jo

Local Wavelet Pattern: A New Feature Descriptor for ...
An example image considered from the Nema-CT database to show the effect of each step. (a) Considered Image, (b) the final local wavelet pattern map.

Efficient randomized pattern-matching algorithms
the following string-matching problem: For a specified set. ((X(i), Y(i))) of pairs of strings, .... properties of our algorithms, even if the input data are chosen by an ...

Local Bit-plane Decoded Pattern: A Novel Feature ...
(a) Cylindrical coordinate system axis, (b) the local bit-plane decomposition. The cylinder has B+1 horizontal slices. The base slice of the cylinder is composed of the original centre pixel and its neighbors with the centre pixel at the origin. The

Simple and efficient LZW-compressed multiple pattern ...
Institute of Computer Science, University of Wroc law, Poland. Max-Planck-Institute ..... is given in Multiple-pattern-matching. prefixer and detector are low-level.

PACE: Pattern Accurate Computationally Efficient ... - GitHub
More generally, disclosure of software vulnerabilities falls into three categories: ... and “off-the-shelf” tools are used to identify and classify vulnerability entities.

WZ Diagonal Weaving.pdf
Sign in. Loading… Whoops! There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying.

Efficient Pattern Matching Algorithm for Memory ...
matching approaches can no longer meet the high throughput of .... high speed. Sourdis et al. ... based on Bloom filter that provides Internet worm and virus.

Efficient Pattern Matching Algorithm for Memory ... - IEEE Xplore
intrusion detection system must have a memory-efficient pat- tern-matching algorithm and hardware design. In this paper, we propose a memory-efficient ...

A New Point Pattern Matching Method for Palmprint
Email: [email protected]; [email protected]. Abstract—Point ..... new template minutiae set), we traverse all of the candidates pair 〈u, v〉 ∈ C × D.

Efficient Local Histogram Searching via Bitmap Indexing
For exam- ple, the integral histogram proposed by Porikli [Por05] is ..... We call this voting scheme as local deposit and apply it on the active .... Plume is the Solar Plume simulation for thermal downflow ... Center for Atmospheric Research.

Grid-based Local Feature Bundling for Efficient Object Search
ratios, in practice we fix the grid size when dividing up the images. We test 4 different grid sizes .... IEEE. Conf. on Computer Vision and Pattern Recognition, 2007.

A New Efficient Transformation of Generalized ...
In a special case of GTSP, called E-GTSP, each cluster is visited exactly once. III. ..... Vehicle. Routing: Methods and Studies, North-Holland, Amsterdam, 1988.

DI NEW PATTERN BFP.pdf
Page 1 of 33. DI NEW PATTERN. 1 | P a g e. www.bankfreepdfs.in. Contact email id: [email protected]. www.bankfreepdfs.in. NEW PATTERN DI ...

A New Local Move Operator for Reconstructing Gene ...
with classic operators. First results show improvements of learnt ... In Section 2 we present Bayesian network and a new operator called ”iterative swap cycle” (ISC) for local search algorithms. .... define the swap operator as follow, swapping a

A New Efficient Transformation of Generalized ...
Mohammad Modarres. Electrical Engineering Department. Industrial Engineering Department. University of California (UCLA). Sharif University of Technology.

ON SEPARATION OF A DIAGONAL 1. Introduction In ...
Gδ-diagonal if the diagonal of the square is the intersection (of closures) of countably many open sets about the the diagonal. The proof of the next statement is obvious and is therefore omitted. Remark. Let X have a Gδ-diagonal. If X is ∆-norma

Boosted of Haar-like Features and Local Binary Pattern Based Face ...
Department of Computer Science. Ho Chi Minh University of Science. Ho Chi Minh ... like Features and LBP to achieve a good trade-off between two extreme.

JURNAL DIAGONAL (2).pdf
Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. JURNAL DIAGONAL (2).pdf. JURNAL DIAGONAL (2).pdf. Open.

New efficient decoder for product and concatenated block codes
Index Terms— Parallel concatenated ocdes, Generalized serially concatenated codes, Chase decoding, Chase-Pyndiah decoder, turbo codes, iterative ...

Definitely Diagonal Scarf 3.2016.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Definitely ...

An affinity-based new local distance function and ...
Nov 11, 2011 - a Department of Physics, University Institute of Technology, University of Burdwan, Golapbag (North), Burdwan 713104, .... Information Geometric Metric Learning (KIGML)-based distance ...... Clearwater Beach, Florida, USA.