Google Scholar [www]


3D Shape Deformation

Detail-preserving Mesh Unfolding for Non-rigid Shape Retrieval

Yusuf Sahillioğlu and Ladislav Kavan
ACM Transactions on Graphics, (Proc. SIGGRAPH), Vol. 35, No. 3, pp. 27, 2016

[pdf]  [ppt *]  [code and executable]  [supplementary material]  [video]
Input A tetrahedral mesh to be unfolded with preserved details
Output The tetrahedral and triangular meshes in the detail-preserved unfolded pose
Idea Use mass-spring system to separate each mesh vertex as far as possible while preserving original edge lengths; additional finite element constraints enhace the regularization

Skuller: A Volumetric Shape Registration Algorithm for Modeling Skull Deformities

Yusuf Sahillioğlu and Ladislav Kavan
Medical Image Analysis, Vol. 23, No. 1, pp. 15-27, 2015

[pdf]  [ppt]  [code and executable] [video]
Input Subject-specific CT scan data and a generic skull model
Output Deformed skull model conformed to the CT data
Idea Volumetric models on both source and target sides of the registration pipeline

A Shape Deformation Algorithm for Constrained Multidimensional Scaling

Yusuf Sahillioğlu
Computers & Graphics, Vol. 53, pp. 156-165, 2015

[pdf]  [code and executable]  [video]
Input A tetrahedral mesh to be brought into its MDS pose with preserved details
Output The tetrahedral and triangular meshes in the detail-preserved MDS pose
Idea Guide the deformation by MDS representation using a fast sparse linear system

3D Shape Retrieval

Sketch-based Articulated 3D Shape Retrieval

Yusuf Sahillioğlu and Metin Sezgin
IEEE Computer Graphics and Applications, accepted/to appear, 2017

[pdf]  [code and executable]
Input Pose-independent 2D sketch of the 3D shape to be retrieved and the 3D model database to explore
Output Set of 3D shapes that are similar to the query sketch up to articulations
Idea Use our good continuation rule on sketches to facilitate articulation-invariant comparisons

3D Shape Correspondence

SHREC'16: Matching of Deformable Shapes with Topological Noise

Z. Lahner, E. Rodola, M. M. Bronstein, D. Cremers, O. Burghard, L. Cosmo, A. Dieckmann, R. Klein, Y. Sahillioğlu
In Proc. of Eurographics Workshop on 3D Object Retrieval (3DOR), 2016

[pdf]  [code and executable
Input Isometric (or nearly isometric) shape pairs with topological noise
Output Coarse correspondence b/w evenly-spaced high-curvature samples on two shapes
Idea Alternating minimization of the isometric distortion using topologically-robust biharmonic distance

SHREC'16: Partial Matching of Deformable Shapes

L. Cosmo, E. Rodola, M. M. Bronstein, A. Torsello, D. Cremers, Y. Sahillioğlu
In Proc. of Eurographics Workshop on 3D Object Retrieval (3DOR), 2016

[pdf]  [code and executable
Input Partially isometric shape pairs where the partial model is an isometric subset of the complete one
Output Partial correspondence b/w two shapes
Idea A distortion measure for partial matching based on raw geodesic distances guides the mapping computation

Multiple Shape Correspondence by Dynamic Programming

Yusuf Sahillioğlu and Yücel Yemez
Computer Graphics Forum (Proc. PG), Vol. 33, No. 7, pp. 121-130, 2014

[pdf]  [ppt]  [code and executable]  [video]
Input A collection of isometric (or nearly isometric) shapes
Output The set of consistent maps b/w all shape pairs w/ the least overall isometric distortion
Idea Optimal path of nodes is found on a graph where each node is a pairwise map

Partial 3D Correspondence from Shape Extremities

Yusuf Sahillioğlu and Yücel Yemez
Computer Graphics Forum, Vol. 33, No. 6, pp. 63-76, 2014

[pdf]  [code and executable]
Input Isometric (or nearly isometric or partially isometric) shape pairs; partial shapes w/ uncommon parts are welcome
Output Partial or complete correspondences b/w two shapes
Idea Triplets of qualified matches produce votes based on the dense matching around

Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips

Yusuf Sahillioğlu and Yücel Yemez
Computer Graphics Forum, Vol. 32, No. 1, pp. 177-189, 2013

[pdf]  [code and executable]
Input Isometric (or nearly isometric) shape pairs
Output Correspondence b/w two shapes at desired resolution
Idea Handle the symmetric flip problem by tracking multiple maps upto a level of detail

Scale Normalization for Isometric Shape Matching

Yusuf Sahillioğlu and Yücel Yemez
Computer Graphics Forum (Proc. PG), Vol. 31, No. 7, pp. 2233-2240, 2012

[pdf]  [ppt]  [code and executable]
Input Isometric (or nearly isometric or partially isometric) shape pairs; partial model is an isometric subset of the complete one
Output Partial or complete correspondences b/w two shapes
Idea A distortion measure for partial matching based on raw/unnormalized geodesic distances; use the fact that ratios between geodesic distances are preserved under scaling and isometric deformations

Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm

Yusuf Sahillioğlu and Yücel Yemez
IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), Vol. 34, No. 11, pp. 2203-2215, 2012

[pdf]  [code and executable]
Input Isometric (or nearly isometric) shape pairs
Output Coarse correspondence b/w evenly-spaced high-curvature samples on two shapes
Idea Alternating minimization of the isometric distortion

Coarse-to-Fine Combinatorial Matching For Dense Isometric Shape Correspondence

Yusuf Sahillioğlu and Yücel Yemez
Computer Graphics Forum (Proc. SGP), Vol. 30, No. 5, pp. 1461-1470, 2011

[pdf]  [ppt]  [code and executable]
Input Isometric (or nearly isometric) shape pairs
Output Correspondence b/w two shapes at desired resolution
Idea Recursively subdivide matched patches into smaller patches to be matched

3D Shape Correspondence by Isometry-Driven Greedy Optimization

Yusuf Sahillioğlu and Yücel Yemez
IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 453-458, 2010

[pdf]  [code and executable] [video]
Input Isometric (or nearly isometric) shape pairs
Output Coarse correspondence b/w evenly-spaced samples on two shapes
Idea Initial spectral correspondence is exposed to a greedy refinement

Algorithms for 3D Isometric Shape Correspondence

Yusuf Sahillioğlu
PhD Thesis, Computer Science Dept., Koç University, Turkey, August 2012
(Graduate studies excellence award)

[pdf]  [ppt *]
Input Isometric (or nearly isometric or partially isometric) shape pairs
Output Complete or partial correspondences according to the given scenario
Idea towards PhD

3D Shape Reconstruction

Coarse-to-Fine Surface Reconstruction from Silhouettes and Range Data Using Mesh Deformation

Yusuf Sahillioğlu and Yücel Yemez
Computer Vision and Image Understanding (CVIU), Vol. 114, pp. 334-348, 2010

[pdf
Input Real-world object along w/ its multi-view silhouettes and range data
Output Visual hull and cavity-sensitive refined mesh of the object
Idea A scan line of range data brings the intersected triangle from the visual hull surface to the range surface

Triangulation-free 3D Reconstruction from LiDAR Data

Yusuf Sahillioğlu
International Conference on Computer Graphics & Virtual Reality (CGVR), pp. 27-32, 2010

[pdf]
Input Unorganized, noisy, and dense 3D points acquired by a LiDAR system
Output Low-resolution 2-manifold triangular mesh approximating the LiDAR surface
Idea Guide the deformation w.r.t. the best-fit tangent planes spread over LiDAR points

Shape from Silhouette Using Topology-Adaptive Mesh Deformation

Yücel Yemez and Yusuf Sahillioğlu
Pattern Recognition Letters, Vol. 30, pp. 1198-1207, 2009

[pdf
Input Real-world object along w/ its multi-view silhouettes and range data
Output Visual hull of the object
Idea Project each 3D vertex of the deforming surface to the silhouettes in order to guide the topology-adaptive deformation

A Surface Deformation Framework for 3D Shape Recovery

Yusuf Sahillioğlu
MS Thesis, Computer Science Dept., Koç University, Turkey, 2006

[pdf]   [ppt]
Input Multi-view silhouettes and/or range data of the real-world object to be reconstructed
Output Reconstruction, i.e., visual hull and/or its refined version, as a 2-manifold triangular mesh
Idea Deform bounding sphere in the guidance of silhouettes, and then refine it further w/ scan lines of the range data

Others

My C++ implementation of the ICP algorithm: [code and executable]
A marching algorithm for isosurface extraction from face-centered cubic lattices, Y. Sahillioğlu, Turkish Journal of Electrical Engineering and Computer Sciences (TJEECS), 2016. [pdf] [code and executable]
iAutoMotion - an Autonomous Content-based Video Retrieval Engine, L. Rossetto, I. Giangreco, C. Tanase, H. Schuldt, O. Seddati, S. Dupont. T. M. Sezgin, Y. Sahillioğlu, 22nd International Conference on Multimedia Modeling, 2016. [pdf]
IMOTION - Searching for Video Sequences using Multi-Shot Sketch Queries, L. Rossetto, I. Giangreco, S. Heller, C. Tanase, H. Schuldt, O. Seddati, S. Dupont. T. M. Sezgin, O. C. Altıok, Y. Sahillioğlu, 22nd International Conference on Multimedia Modeling, 2016. [pdf]
IMOTION: A Content-based Video Retrieval Engine, L. Rossetto, I. Giangreco, H. Schuldt, S. Dupont, O. Seddati, T. M. Sezgin, Y. Sahillioğlu, 21st International Conference on Multimedia Modeling, 2015. [pdf]
3B İzometrik Şekil Eşleme, Yusuf Sahillioğlu and Yücel Yemez, IEEE Sinyal İşleme ve Uygulamaları Kurultayı(SİU), 2010 [pdf] (Best student paper)
3D Correspondence by Breadth-First Search Frontiers, Yusuf Sahillioğlu, Int. Conference on Computer Graphics & Virtual Reality (CGVR), pp. 203-207, 2009 [pdf]
A Surface Deformation Framework for 3D Shape Recovery, Yusuf Sahillioğlu and Yücel Yemez, Lecture notes in Computer Science (MCRS), 4105, 570-577, 2006 [pdf]
Çok Kameralı Video Görüntülerinden Yüzey Deformasyonu ile 3B Şekil Geri Çatma ve İzleme, Yusuf Sahillioğlu and Yücel Yemez, SİU, 2006 [pdf]
Hair Motion Simulation, Yusuf Sahillioğlu and Bülent Özgüç, Int. Symp. on Computer and Inf. Sciences (ISCIS), pp. 126-135, 2004 [pdf]


Thanks to my friend Emre Ünal for his help on the design of this site.


as i turn to sand, you took me by the hand [SOAD]