DARWIN - Dolphin Photo-identification Software Adaptations to Digital Camera Acquisition and Increased Matching Accuracy K. R. Debure, J. H. Stewman, S.

Slides:



Advertisements
Similar presentations
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Advertisements

Indexing DNA Sequences Using q-Grams
Alignment Visual Recognition “Straighten your paths” Isaiah.
QR Code Recognition Based On Image Processing
Feature Detection and Outline Registration in Dorsal Fin Images A. S. Russell, K. R. Debure, Eckerd College, St. Petersburg, FL Most Prominent Notch analyze.
Automatically Annotating and Integrating Spatial Datasets Chieng-Chien Chen, Snehal Thakkar, Crail Knoblock, Cyrus Shahabi Department of Computer Science.
© Leo Burnett. 2 “Moe”: April 23 “Moe” : June 6 3  Population size estimation  Behavioral studies  Phenotype analysis.
Introduction Researchers involved in the study of dolphin biology, such as migrations, ranging patterns and social association patterns, frequently use.
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
References [1] DARWIN. Eckerd College. darwin.eckerd.edu [2] FinScan. Texas A&M University. [3J M. S. Prewitt and M.L. Mendelsohn, The analysis of cell.
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
Automatic 3D Face Recognition System 邱彥霖 龔士傑 Biometric Authentication.
Automatic Feature Extraction for Multi-view 3D Face Recognition
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
Quadtrees, Octrees and their Applications in Digital Image Processing
DTM Generation From Analogue Maps By Varshosaz. 2 Using cartographic data sources Data digitised mainly from contour maps Digitising contours leads to.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Semi-automatic Range to Range Registration: A Feature-based Method Chao Chen & Ioannis Stamos Computer Science Department Graduate Center, Hunter College.
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Multiple Criteria for Evaluating Land Cover Classification Algorithms Summary of a paper by R.S. DeFries and Jonathan Cheung-Wai Chan April, 2000 Remote.
Active Calibration of Cameras: Theory and Implementation Anup Basu Sung Huh CPSC 643 Individual Presentation II March 4 th,
Iterative closest point algorithms
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
Automated Detection and Characterization of Solar Filaments and Sigmoids K. Wagstaff, D. M. Rust, B. J. LaBonte and P. N. Bernasconi Johns Hopkins University.
A Study of Approaches for Object Recognition
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Smart Templates for Chemical Identification in GCxGC-MS QingPing Tao 1, Stephen E. Reichenbach 2, Mingtian Ni 3, Arvind Visvanathan 2, Michael Kok 2, Luke.
Quadtrees, Octrees and their Applications in Digital Image Processing
Object Recognition Using Geometric Hashing
Scale Invariant Feature Transform (SIFT)
Computer-Aided Diagnosis and Display Lab Department of Radiology, Chapel Hill UNC Julien Jomier, Erwann Rault, and Stephen R. Aylward Computer.
Fast multiresolution image querying CS474/674 – Prof. Bebis.
Scale-Invariant Feature Transform (SIFT) Jinxiang Chai.
1 REAL-TIME IMAGE PROCESSING APPROACH TO MEASURE TRAFFIC QUEUE PARAMETERS. M. Fathy and M.Y. Siyal Conference 1995: Image Processing And Its Applications.
Introduction Belief propagation: known to produce accurate results for stereo processing/ motion estimation High storage requirements limit the use of.
Shape Recognition and Pose Estimation for Mobile Augmented Reality Author : N. Hagbi, J. El-Sana, O. Bergig, and M. Billinghurst Date : Speaker.
Wavelet-Based Multiresolution Matching for Content-Based Image Retrieval Presented by Tienwei Tsai Department of Computer Science and Engineering Tatung.
Multimodal Interaction Dr. Mike Spann
Automatic Registration of Color Images to 3D Geometry Computer Graphics International 2009 Yunzhen Li and Kok-Lim Low School of Computing National University.
Steps for Extraction Creation of cyan intensity image in preparation for thresholding: Although many dorsal fin images exhibit a good contrast between.
EE 492 ENGINEERING PROJECT LIP TRACKING Yusuf Ziya Işık & Ashat Turlibayev Yusuf Ziya Işık & Ashat Turlibayev Advisor: Prof. Dr. Bülent Sankur Advisor:
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.
Abstract DARWIN ( is a computer program developed to facilitate the identification of individual dolphins from photographs of.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
ISV Innovation Presented by ISV Innovation Presented by Business Intelligence Fundamentals: Data Cleansing Ola Ekdahl IT Mentors 9/12/08.
Quadtrees, Octrees and their Applications in Digital Image Processing.
In Defense of Nearest-Neighbor Based Image Classification Oren Boiman The Weizmann Institute of Science Rehovot, ISRAEL Eli Shechtman Adobe Systems Inc.
Indirect Supervision Protocols for Learning in Natural Language Processing II. Learning by Inventing Binary Labels This work is supported by DARPA funding.
Conclusions The success rate of proposed method is higher than that of traditional MI MI based on GVFI is robust to noise GVFI based on f1 performs better.
Focal Analysis of Knee Articular Cartilage Quantity and Quality Dr. Tomos G. Williams Imaging Science and Biomedical Engineering University of Manchester.
2005/12/021 Content-Based Image Retrieval Using Grey Relational Analysis Dept. of Computer Engineering Tatung University Presenter: Tienwei Tsai ( 蔡殿偉.
Computer-based identification and tracking of Antarctic icebergs in SAR images Department of Geography, University of Sheffield, 2004 Computer-based identification.
2006 Mouse AHM Mapping 2D slices to 3D atlases - Application of the Digital Atlas Erh-Fang Lee Laboratory of NeuroImage UCLA.
A B C D E F A ABSTRACT A novel, efficient, robust, feature-based algorithm is presented for intramodality and multimodality medical image registration.
A Classification-based Approach to Question Answering in Discussion Boards Liangjie Hong, Brian D. Davison Lehigh University (SIGIR ’ 09) Speaker: Cho,
A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.
CSE 185 Introduction to Computer Vision Feature Matching.
Topic 4 - Database Design Unit 1 – Database Analysis and Design Advanced Higher Information Systems St Kentigern’s Academy.
By Pushpita Biswas Under the guidance of Prof. S.Mukhopadhyay and Prof. P.K.Biswas.
MultiModality Registration Using Hilbert-Schmidt Estimators By: Srinivas Peddi Computer Integrated Surgery II April 6 th, 2001.
Refined Online Citation Matching and Adaptive Canonical Metadata Construction CSE 598B Course Project Report Huajing Li.
Recognizing specific objects Matching with SIFT Original suggestion Lowe, 1999,2004.
Automated Geo-referencing of Images Dr. Ronald Briggs Yan Li GeoSpatial Information Sciences The University.
Shadow Detection in Remotely Sensed Images Based on Self-Adaptive Feature Selection Jiahang Liu, Tao Fang, and Deren Li IEEE TRANSACTIONS ON GEOSCIENCE.
Introduction to Machine Learning, its potential usage in network area,
Chapter-4 Single-Photon emission computed tomography (SPECT)
Paper – Stephen Se, David Lowe, Jim Little
Multi-modality image registration using mutual information based on gradient vector flow Yujun Guo May 1,2006.
Presentation transcript:

DARWIN - Dolphin Photo-identification Software Adaptations to Digital Camera Acquisition and Increased Matching Accuracy K. R. Debure, J. H. Stewman, S. A. Hale, Eckerd College, St. Petersburg, FL DARWIN is a computer program that automates the photo-identification of dolphins from photographs of dorsal fins. This program allows researchers to query a database of previously identified dorsal fin images with a digital image of an unidentified dolphin's fin. The system responds with a rank ordered list of database fin images most closely resembling the query image. In this way DARWIN assists researchers to prioritize their search of database images, and potentially reduces the time required for identification. As digital cameras rapidly replace traditional film cameras for the acquisition of data in the field, adaptation of the software in response to the changing needs of the user community is critical. Compatibility with appropriate image formats, efficient handling of higher resolution image data, and automation and streamlining of data entry can facilitate the processing of increasing quantities of field data. The automated generation of the outline is one example of an effort to reduce data entry requirements. In addition, to further increase the matching accuracy and the realistic utility of the DARWIN software, the most successful aspects of a quantitative dorsal fin matching approach have been incorporated within a broad hierarchical approach using qualitative distinctions between fins. This recently enhanced software (1) facilitates subset searches of the database based on damage category (missing tip, etc), (2) selects more intuitive transformations for alignment, and (3) more closely emulates the manual photo-identification process. Automatic Outline Generation The acquisition of field data with digital cameras requires new functionality from the software. The current version reads JPEG files and uncompressed TIFF format will be available in the next version. The automatic generation of the outline of the dorsal fin is one attempt to reduce the data entry effort. The outline is extracted as follows: compute the grayscale intensity of the original image perform unsupervised thresholding based on histogram analysis use morphological processing and feature recognition to select and simplify region of interest use morphological processing to generate region outlines and select largest outline as dorsal fin contour Abstract Introduction [1] M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active contour models. International Journal of Computer Vision, pages , [2] S.Mallat. Characterization of signals from multiscale edges. IEEE Trans. on Pattern Analysis and Machine Intelligence, 14(7): , July [3] N. Otsu. A threshold selection method from gray level histograms. IEEE Trans. on Systems, Man, and Cybernetics, SMC-9:62--66, January 1992.References This research was supported by the National Science Foundation under grant numbers DBI and IIS Additional funding was provided by National Marine Fisheries Services and Eckerd College. Dorsal fin images courtesy of Eckerd College Dolphin Project. Acknowledgements DARWIN is a computer program which aids marine mammalogists in the identification of dolphins and in the management of a database of observational information. DARWIN graphically presents the digitized dorsal fin images and associated textual sighting information. The database of information can be: queried for images which are similar to the dorsal fin image of an unknown individual queried to limit the search within specified damage categories queried with the name of a specific individual organized and viewed by particular sighting information such as location, date, or fin damage category Figure 1 : Following a query of the dorsal fin database, DARWIN presents a list of database images which most closely resemble the unknown fin image. Direct comparison of fin outlines is problematic since perspective distortions can cause outlines extracted from multiple photographs of the same dolphin’s dorsal fin to differ significantly. Ideally, we would like to transform the outlines so that it appears the original fins were photographed from the same angle. The transformation process is as follows: locate sets of common feature points on pairs of fin outlines compute transformation matrix which maps one set of points onto the other apply transformation to entire outline evaluate error between registered outlines Outline Registration Figure 3 : Upper and center left: Automatically generated dorsal fin outlines. Upper and center right: Common feature points (the start of the leading edge, the end of the leading edge, the tip, the most prominent notch and the end of the trailing edge) are identified along the outline. Bottom left: Original outlines of the database and unknown fin are superimposed before alignment. Bottom center: Outlines are partially registered following an affine transform based on a triplet of feature points. Bottom right: Fully registered outlines after an iterative alignment approach. 1)Map the unknown to the database fin by using a three point affine transformation. 2)Find the ratio (R) of arc lengths between database and unknown fins 3)Traverse the database fin outline (which has evenly spaced points at approximately 3 unit separation) and at each point at arc length (A), compute a corresponding point on the unknown fin which is at a position A*R along the outline, then save the location of the midpoint between this pair of points. The sequence of midpoints forms a "medial axis" or spine that is approximately midway between the two fin outlines. 4)Traverse the medial axis, and at each point, find a perpendicular, then find the points of intersection of this perpendicular with each fin outline. The length (L) of the segment between these two points is squared (L*L) to indicate the degree of mismatch between that point pair. The arithmetic mean of these errors from the beginning of the leading edge to the end of the trailing edge is the mismatch error for the entire fin pair. Computation of Error between Outlines Two methods are used to find a "best" mapping of unknown to database fin. 1.The “Quick & Dirty” approach uses three key points (beginning of the leading edge, tip, and most significant notch) on each outline. A transformation is found mapping the unknown fin triplet to the database triplet. This transformation is then applied to the entire unknown contour effectively solving for the pose differences between the fins in the two images. 2. The “Optimal” approach adjusts the beginning positions of each leading edge and the ending positions of each trailing edge using a Newton-Raphson optimization method seeking a better three point mapping that minimizes the overall error. Algorithms for Outline Mapping Preliminary testing of the two approaches utilized a database of dorsal fin images for 200 individuals. A test set of fifty different dorsal fin images of known individuals were matched against the database. On average, both methods ranked the correct fin in the top 17% of the database. Using the “Quick & Dirty” method, the median rank was in the top 5%; using the “Optimal” method the median was in the top 8%. However, we have observed that the transformations produced by the “Optimal” method produce a more accurate alignment – thus further refinement of the error metric is needed. These results suggest that the registration methods presented herein show significant promise in perspective correction of dolphin dorsal fin images. The iterative nature of the alignment algorithm makes it less sensitive to the original designation of the outline or subsequent identification of feature points. In any case, the process has the ability to improve the registration of outlines considerably. The improved registration suitably corrects for perspective distortion and makes fin outline comparisons easier and aids in the subsequent retrieval of appropriate images. Results and Conclusions In order to query the database for fins resembling the unknown dolphin: 1.The software generates a trace of the outline of the dorsal fin 2.The user may replace the automatically generated trace with a hand-traced rough outline of the dorsal fin. Dorsal Fin Identification 3. Active contours [1] are employed to accurately position the points comprising the outline onto the actual edge of the fin. 4. Feature points along the outline are identified and used to perform a registration of the two fins. 5. Error between the registered outlines is computed and used to rank order the fins in terms of similarity. Figure 2 : The tracing window allows the user to perform a sketch based query of the database of dorsal fins. This window is also used to add new dorsal fin images and associated sighting data to the database.