Structural matching of 2D electrophoresis gels using deformed graphs

2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential analysis between pairs of images to study changes in protein content. It is thus necessary to register two images by finding spot correspondences. Although it may seem a simple task, generally, the manual processing of this kind of images is very cumbersome, especially when strong variations between corresponding sets of spots are expected (e.g. strong non-linear deformations and outliers). In order to solve this problem, this paper proposes a new quadratic assignment formulation together with a correspondence estimation algorithm based on graph matching which takes into account the structural information between the detected spots. Each image is represented by a graph and the task is to find a maximum common subgraph. Successful experimental results using real data are presented, including an extensive comparative performance evaluation with ground-truth data.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Roberto Marcondes Cesar Junior,et al.  Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms , 2005, Pattern Recognit..

[3]  D. I. Jones,et al.  Comparison of optimization algorithms , 1984 .

[4]  Javier Preciozzi,et al.  Processing of 2D Electrophoresis Gels , 2007, ICCV 2007.

[5]  Jim Graham,et al.  Robust and Accurate Registration of 2-D Electrophoresis Gels Using Point-Matching , 2007, IEEE Transactions on Image Processing.

[6]  Dale Schuurmans,et al.  Graphical Models and Point Pattern Matching , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Roberto Marcondes Cesar Junior,et al.  Structural Image Segmentation with Interactive Model Generation , 2007, 2007 IEEE International Conference on Image Processing.

[8]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[9]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[10]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[11]  Anand Rangarajan,et al.  A new algorithm for non-rigid point matching , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[12]  Roberto Marcondes Cesar Junior,et al.  Structural Matching of 2D Electrophoresis Gels using Graph Models , 2008, 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing.

[13]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Jianbo Shi,et al.  Balanced Graph Matching , 2006, NIPS.

[15]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.