Improving Retrieval Performance of Zernike Moment Descriptor on Affined Shapes Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info Tech Monash.

Slides:



Advertisements
Similar presentations
Binary Shape Clustering via Zernike Moments
Advertisements

Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Context-based object-class recognition and retrieval by generalized correlograms by J. Amores, N. Sebe and P. Radeva Discussion led by Qi An Duke University.
Group Meeting Presented by Wyman 10/14/2006
Presented by Xinyu Chang
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Chapter 8 Content-Based Image Retrieval. Query By Keyword: Some textual attributes (keywords) should be maintained for each image. The image can be indexed.
IDEAL 2005, 6-8 July, Brisbane Multiresolution Analysis of Connectivity Atul Sajjanhar, Deakin University, Australia Guojun Lu, Monash University, Australia.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
November 4, 2014Computer Vision Lecture 15: Shape Representation II 1Signature Another popular method of representing shape is called the signature. In.
Relevance Feedback Content-Based Image Retrieval Using Query Distribution Estimation Based on Maximum Entropy Principle Irwin King and Zhong Jin Nov
Young Deok Chun, Nam Chul Kim, Member, IEEE, and Ick Hoon Jang, Member, IEEE IEEE TRANSACTIONS ON MULTIMEDIA,OCTOBER 2008.
A Study of Approaches for Object Recognition
Detecting Image Region Duplication Using SIFT Features March 16, ICASSP 2010 Dallas, TX Xunyu Pan and Siwei Lyu Computer Science Department University.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2005 with a lot of slides stolen from Steve Seitz and.
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
Stepan Obdrzalek Jirı Matas
Sharif University of Technology A modified algorithm to obtain Translation, Rotation & Scale invariant Zernike Moment shape Descriptors G.R. Amayeh Dr.
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Multiple Object Class Detection with a Generative Model K. Mikolajczyk, B. Leibe and B. Schiele Carolina Galleguillos.
Ashish Uthama EOS 513 Term Paper Presentation Ashish Uthama Biomedical Signal and Image Computing Lab Department of Electrical.
Content-based Image Retrieval (CBIR)
SIEVE—Search Images Effectively through Visual Elimination Ying Liu, Dengsheng Zhang and Guojun Lu Gippsland School of Info Tech,
Introduction --Classification Shape ContourRegion Structural Syntactic Graph Tree Model-driven Data-driven Perimeter Compactness Eccentricity.
Computer vision.
1 Faculty of Information Technology Generic Fourier Descriptor for Shape-based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info.
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
Digital Image Processing Lecture 20: Representation & Description
Shape Matching with Occlusion in Image Databases Aristeidis Diplaros Euripides G.M. Petrakis Evangelos Milios Technical University of Crete.
Shape Based Image Retrieval Using Fourier Descriptors Dengsheng Zhang and Guojun Lu Gippsland School of Computing and Information Technology Monash University.
A Statistical Approach to Speed Up Ranking/Re-Ranking Hong-Ming Chen Advisor: Professor Shih-Fu Chang.
A 3D Model Alignment and Retrieval System Ding-Yun Chen and Ming Ouhyoung.
Shape Analysis and Retrieval Structural Shape Descriptors Notes courtesy of Funk et al., SIGGRAPH 2004.
Invariants to affine transform What is affine transform ?
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL Presented by 2006/8.
1 Multiple Classifier Based on Fuzzy C-Means for a Flower Image Retrieval Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki Graduate School of Engineering,
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Representation & Description.
Lecture 7: Features Part 2 CS4670/5670: Computer Vision Noah Snavely.
Dengsheng Zhang and Melissa Chen Yi Lim
Local invariant features Cordelia Schmid INRIA, Grenoble.
Fourier Descriptors For Shape Recognition Applied to Tree Leaf Identification By Tyler Karrels.
2005/12/021 Content-Based Image Retrieval Using Grey Relational Analysis Dept. of Computer Engineering Tatung University Presenter: Tienwei Tsai ( 蔡殿偉.
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
1 A Compact Feature Representation and Image Indexing in Content- Based Image Retrieval A presentation by Gita Das PhD Candidate 29 Nov 2005 Supervisor:
2006 Mouse AHM Mapping 2D slices to 3D atlases - Application of the Digital Atlas Erh-Fang Lee Laboratory of NeuroImage UCLA.
Content-Based Image Retrieval Using Block Discrete Cosine Transform Presented by Te-Wei Chiang Department of Information Networking Technology Chihlee.
Ivica Dimitrovski 1, Dragi Kocev 2, Suzana Loskovska 1, Sašo Džeroski 2 1 Faculty of Electrical Engineering and Information Technologies, Department of.
CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.
Content-Based Image Retrieval QBIC Homepage The State Hermitage Museum db2www/qbicSearch.mac/qbic?selLang=English.
Content Based Color Image Retrieval vi Wavelet Transformations Information Retrieval Class Presentation May 2, 2012 Author: Mrs. Y.M. Latha Presenter:
1 Overview representing region in 2 ways in terms of its external characteristics (its boundary)  focus on shape characteristics in terms of its internal.
Image features and properties. Image content representation The simplest representation of an image pattern is to list image pixels, one after the other.
1 Faculty of Information Technology Enhanced Generic Fourier Descriptor for Object-Based Image Retrieval Dengsheng Zhang, Guojun Lu Gippsland School of.
Sheng-Fang Huang Chapter 11 part I.  After the image is segmented into regions, how to represent and describe these regions? ◦ In terms of its external.
Image Representation and Description – Representation Schemes
Digital Image Processing Lecture 20: Representation & Description
Content-Based Image Retrieval Readings: Chapter 8:
A Perceptual Shape Descriptor
Yun-FuLiu Jing-MingGuo Che-HaoChang
Color-Texture Analysis for Content-Based Image Retrieval
Slope and Curvature Density Functions
Computer Vision Lecture 16: Texture II
SIFT keypoint detection
CSE 185 Introduction to Computer Vision
Fourier Transform of Boundaries
Lecture VI: Corner and Blob Detection
Recognition and Matching based on local invariant features
Color Image Retrieval based on Primitives of Color Moments
Presentation transcript:

Improving Retrieval Performance of Zernike Moment Descriptor on Affined Shapes Dengsheng Zhang, Guojun Lu Gippsland School of Comp. & Info Tech Monash University Churchill, VIC 3842 Australia dengsheng.zhang@infotech.monash.edu.au http://www.gscit.monash.edu.au/~dengs/

Outline Motivations Zernike Moment Descriptor (ZMD) Problem Improving ZMD Experimental Results Conclusions

Motivations Content-based Image Retrieval Image description is an important issue, which constitutes one of the key parts of MPEG-7. Shape is an important image feature along with color and texture Effective and Efficient Shape Descriptor good retrieval accuracy, compact features, general application, low computation complexity, robust retrieval performance and hierarchical coarse to fine representation Affined Shape Retrieval Affined shapes are common in nature due to objects being viewed from different angles and objects being stretched, skewed.

Affine Distorted Shapes Are Common

Zernike Moment Basically, ZMD is derived by applying Zernike moment transform on shape image in polar space.

Zernike Moment The first 36 Zernike moments of up to order 10 are shown in Table 1. Order (n) Zernike moment of order n with repetition m (Anm) Total number of moments up to order 10 A0, 0 36 1 A1, 1 2 A2, 0, A2, 2 3 A3, 1, A3, 3 4 A4, 0, A4, 2, A4, 4 5 A5, 1, A5, 3, A5, 5 6 A6, 0, A6, 2, A6, 4, A6, 6 7 A7, 1, A7, 3, A7, 5, A7, 7 8 A8, 0, A8, 2, A8, 4, A8, 6, A8, 8 9 A9, 1, A9, 3, A9, 5, A9, 7, A9, 9 10 A10, 0, A10, 2, A10, 4, A10, 6, A10, 8, A10, 10

Problem Generally, ZMD has good performance on generic shapes. Its overall retrieval precision after full recall is 97.6% for rotated shapes, 85.3% for scaled shapes, 99.3% for rotated and scaled shapes, 68.5.1% for perspective transformed shapes and 66.5% for generally distorted shapes. Compared with rotation and scaling invariance test, the retrieval performance on perspective transform and generally distorted shapes are significantly lower. The problem is caused by the polar raster sampling method.

Only half the sampled positions contain Under-sampling Problem Skewed Only half the sampled positions contain shape information Non-distorted Virtually all the sampled positions contain shape information

Improving ZMD Normalization R S Find major axis Rotation normalization so that major axis of the shape is horizontal Scaling normalization so that the ecentricity of the shape is 1. R S

Improving ZMD Optimized Major Axis Algorithm (MAA) Find the boundary point pairs in a number of directions (e.g. 360). Find the two points p1, p2 with the furthest distance in the found boundary points, then p1p2 is the major axis. The computation of MAA is O(N) rather than O(N2).

Improving ZMD Normalization Result: Normalization Normalization

Improving ZMD Applying ZMD transform on the rotation and scaling normalized image. The normalized transform coefficients are the improved ZMD. Each shape in the database is indexed using the derived ZMD. The similarity between two shapes is measured by the Euclidean distance between their ZMDs.

Experiment Dataset Indexing and automatic retrieval Two datasets from MPEG-7 region shape database CE-2 are used. (CE-2 has been organized by MPEG-7 into six datasets to test a shape descriptor’s behaviors under different distortions) Set A4 consists of 3101 from the whole database, it is for test of robustness to perspective transform. 330 shapes in Set A4 have been organized into 30 groups (11 similar shapes in each group) which are used as queries. The whole database consists of 3621 shapes, 651 shapes have been organized into 31 groups (21 similar shapes in each group) which are used as queries. Indexing and automatic retrieval

Performance Measurement Recall vs Precision For each query, the precision of the retrieval at each level of the recall is obtained. The result precision of retrieval is the average precision of all the query retrievals.  

Results Average Precision-Recall of the improved ZMD on perspective shapes. Compared with GFD, the improvement on Set A4 is 17.6%, the overall precision is increased from 68.5% to 86.1%.

Results Average Precision-Recall of EGFD on Generally Distorted Shapes Compared with GFD, the improvement on CE-2 is 22.5%, the overall precision is increased from 66.5% to 89%.

Results Improved ZMD ZMD Improved ZMD ZMD

Results Improved ZMD ZMD Improved ZMD ZMD

Application The application of the enhancement process is database/ application dependent. If the database has abundant perspective shapes, this technique can be very effective in retrieving similar shapes. If the database does not have perspective shapes, or the user wants finer distinction between similar shapes, the enhanced process may not be desirable. For example, if the user wants to distinguish between rectangles and squares, or to distinguish between ellipses and circles, the improved ZMD can fail, because it normalizes all the shapes into same eccentricity (=1). In general applications, the enhancement is a useful option to the retrieval system.

Conclusions The proposed technique improves ZMD significantly. It improves ZMD’s relatively lower retrieval performance on severely skewed and stretched shapes. It also improves ZMD’s robustness to general shape distortions. A shape normalization method is presented. The shape normalization method can be exploited for general shape representation purposes. An optimized major axis algorithm (MAA) is proposed. MA is a common normalization mechanism in shape modeling and representation. Common MAA is only for finding MA of contour shape. The proposed optimized MAA can be used for finding MA of generic shapes.