Docking III: Matching via Critical Points Yusu Wang Joint Work with P. K. Agarwal, H. Edelsbrunner, J. Harer Duke University.

Slides:



Advertisements
Similar presentations
Top-Down & Bottom-Up Segmentation
Advertisements

The fundamental matrix F
Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,
L1 sparse reconstruction of sharp point set surfaces
Inferring Disjunctive Postconditions Corneliu Popeea and Wei-Ngan Chin School of Computing National University of Singapore - ASIAN
Bio-CAD M. Ramanathan Bio-CAD. Molecular surfaces Bio-CAD.
Omer Bobrowski Mathematics Department Duke University Joint work with Sayan Mukherjee 6/19/13.
Robust Global Registration Natasha Gelfand Niloy Mitra Leonidas Guibas Helmut Pottmann.
Extreme Elevation on a 2- Manifold Pankaj K. Agarwal Joint Work with H. Edelsbrunner, J. Harer, Y. Wang Duke University.
Flow Complex Joachim Giesen Friedrich-Schiller-Universität Jena.
Persistent Heat Signature for Pose-oblivious Matching of Incomplete Models Tamal K. Dey, Kuiyu Li, Chuanjiang Luo, Pawas Ranjan, Issam Safa, Yusu Wang.
A 3-D reference frame can be uniquely defined by the ordered vertices of a non- degenerate triangle p1p1 p2p2 p3p3.
Guillaume Lavoué Mohamed Chaker Larabi Libor Vasa Université de Lyon
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
Doc.: IEEE /0630r0 Submission May 2015 Intel CorporationSlide 1 Verification of IEEE ad Channel Model for Enterprise Cubical Environment.
Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.
Uncertainty and Variability in Point Cloud Surface Data Mark Pauly 1,2, Niloy J. Mitra 1, Leonidas J. Guibas 1 1 Stanford University 2 ETH, Zurich.
Docking Algorithm Scheme Part 1: Molecular shape representation Part 2: Matching of critical features Part 3: Filtering and scoring of candidate transformations.
Iterative closest point algorithms
Alignment of Flexible Molecular Structures. Motivation Proteins are flexible. One would like to align proteins modulo the flexibility. Hinge and shear.
Fixed-outline Floorplanning Through Better Local Search
Docking of Protein Molecules
T. J. Peters, University of Connecticut Computer Science Mathematics with K. Abe, J. Bisceglio, A. C. Russell, T. Sakkalis,
I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis Pankaj K. Agarwal, Lars Arge, and Ke Yi Duke University University of Aarhus.
BL5203: Molecular Recognition & Interaction Lecture 5: Drug Design Methods Ligand-Protein Docking (Part I) Prof. Chen Yu Zong Tel:
QSD – Quadratic Shape Descriptors Surface Matching and Molecular Docking Using Quadratic Shape Descriptors Goldman BB, Wipke WT. Quadratic Shape Descriptors.
Kyle Heath, Natasha Gelfand, Maks Ovsjanikov, Mridul Aanjaneya, Leo Guibas Image Webs Computing and Exploiting Connectivity in Image Collections.
T. J. Peters, University of Connecticut with I-TANGO Team, ++ Computational Topology for Animation and Simulation.
On Neighbors in Geometric Permutations Shakhar Smorodinsky Tel-Aviv University Joint work with Micha Sharir.
Protein-protein and Protein- ligand Docking The geometric filtering.
Identifying similar surface patches on proteins using a spin-image surface representation M. E. Bock Purdue University, USA G. M. Cortelazzo, C. Ferrari,
Tamal K. Dey The Ohio State University Computing Shapes and Their Features from Point Samples.
Longbiao Kang, Baotian Hu, Xiangping Wu, Qingcai Chen, and Yan He Intelligent Computing Research Center, School of Computer Science and Technology, Harbin.
CSE 788 X.14 Topics in Computational Topology: --- An Algorithmic View Lecture 1: Introduction Instructor: Yusu Wang.
Tracking Surfaces with Evolving Topology Morten Bojsen-Hansen IST Austria Hao Li Columbia University Chris Wojtan IST Austria.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence Yusuf Sahillioğlu and Yücel Yemez Computer Eng. Dept., Koç University, Istanbul,
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
DSP Slide 1 Graph theory x y y = x x y a y = a x x z y y = x and z = x xz y z = x + y z = x - y xz y - y = z -1 x x y z -1 DSP graphs are made up of points.
5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.
Ozgur Ozturk, Ahmet Sacan, Hakan Ferhatosmanoglu, Yusu Wang The Ohio State University LFM-Pro: a tool for mining family-specific sites in protein structure.
Images Similarity by Relative Dynamic Programming M. Sc. thesis by Ady Ecker Supervisor: prof. Shimon Ullman.
Mingyang Zhu, Huaijiang Sun, Zhigang Deng Quaternion Space Sparse Decomposition for Motion Compression and Retrieval SCA 2012.
Extraction and remeshing of ellipsoidal representations from mesh data Patricio Simari Karan Singh.
3D Object Modelling and Classification Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University,
3D Face Recognition Using Range Images
Multiple Instance Learning for Sparse Positive Bags Razvan C. Bunescu Machine Learning Group Department of Computer Sciences University of Texas at Austin.
Coarse and Reliable Geometric Alignment for Protein Docking Yusu Wang Stanford University Joint Work with P. K. Agarwal, P. Brown, H. Edelsbrunner, J.
CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis Lecture 0: Introduction Instructor: Yusu Wang.
ACM-GIS Morphology-Driven Simplification and Multiresolution Modeling of Terrains Emanuele Danovaro, Leila De Floriani, Paola Magillo, Mohammed.
Critical points and flow structure for density data Joint work with H. Edelsbrunner, J. Harer, and V. Pascucci Vijay Natarajan Duke University.
Topic 8 Reeb Graphs and Contour Trees Yusu Wang Computer Science and Engineering Dept The Ohio State University.
Qualitative Curve Descriptions
A Definition of Interfaces for Protein Oligomers
Machine Learning Feature Creation and Selection
Multi-modality image registration using mutual information based on gradient vector flow Yujun Guo May 1,2006.
Topological Ordering Algorithm: Example
3D Scan Alignment Using ICP
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Spectral methods for Global Network Alignment
Range Queries on Uncertain Data
Topological Ordering Algorithm: Example
Topological Ordering Algorithm: Example
Multi-Information Based GCPs Selection Method
Chapter 5: Morse functions and function-induced persistence
Topological Ordering Algorithm: Example
Rong Ge, Duke University
Presentation transcript:

Docking III: Matching via Critical Points Yusu Wang Joint Work with P. K. Agarwal, H. Edelsbrunner, J. Harer Duke University

Motivation Docking problem Partial matching Two steps Find coarse matching Local improvement Input: protein A and B Output: a set of coarse alignments

Matching Surfaces Model protein As a surface instead of set of balls Sample special points Knobs and caves Align two sets of points Under collision-free constraint

Our Approach Overview: Step 1. Extract critical points Design Morse function Step 2. Align critical points Use both topological and geometric info.

Critical Points : manifold (closed curves/surfaces) : Morse function Critical points : min, max, saddles for max saddlemin

Pairing Critical points capture topological information Critical pairs, persistence of critical pairs

Some Morse Functions Curvature Too local Connolly function Ratio of inside/outside perimeters

Atomic Density Function Proposed by Kuhn et al. Best fit

in 3D

Height Function Atomic density function: Critical points nice Critical pairs good for removing noise But … Height function Captures good features in vertical direction

Elevation Function Each point critical in normal direction Define

Surgery However: not continuous Blame the manifold! : apply surgery on Elevation function:

in 2D ~12~30

Surgery in 2D

Alignment Input: Two proteins A and B (P and Q) Two sets of critical points/pairs Output: Set of transformations for protein B Sorted by score(A, T(B))

NaïveMatch NaiveMatch Alg: Output: Take a pair from P, a pair from Q Align two pairs, get transformation T Compute score between A and T(B) Rank transformations by score

PairMatch PairMatch Alg: Take a critical pair from each set Align two critical pairs, get transformation T Rank T ’s by their scores Output:

Illustration

2D Results NaiveMatchPairMatch

2D Results – Cont’ : top r ranked transformations of : top s ranked transformations of How well does covers ?

Future Work Implement Elevation function in 3D Better matching algorithm in 3D? Local improvement starting from a position with collision