TY - GEN
T1 - Structural matching of 2D electrophoresis gels using graph models
AU - Noma, Alexandre
AU - Pardo, Alvaro
AU - Cesar, Roberto M.
PY - 2008
Y1 - 2008
N2 - 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. The complete task of individual spot matching and gel registration is a complex and time consuming process when strong variations between corresponding sets of spots are expected. Besides, because an oneto-one mapping is expected between the two images, missing spots there may exist on both images (i.e. spots without correspondence). In order to solve this problem, this paper proposes a new distance 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 an isomorphism between subgraphs. Successful experimental results using real data are presented, including a comparative performance evaluation.
AB - 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. The complete task of individual spot matching and gel registration is a complex and time consuming process when strong variations between corresponding sets of spots are expected. Besides, because an oneto-one mapping is expected between the two images, missing spots there may exist on both images (i.e. spots without correspondence). In order to solve this problem, this paper proposes a new distance 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 an isomorphism between subgraphs. Successful experimental results using real data are presented, including a comparative performance evaluation.
UR - http://www.scopus.com/inward/record.url?scp=56749175184&partnerID=8YFLogxK
U2 - 10.1109/SIBGRAPI.2008.14
DO - 10.1109/SIBGRAPI.2008.14
M3 - Contribución a la conferencia
AN - SCOPUS:56749175184
SN - 9780769533582
T3 - Proceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008
SP - 71
EP - 78
BT - Proceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008
T2 - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008
Y2 - 12 October 2008 through 15 October 2008
ER -