| Both sides previous revision
Previous revision
|
|
members:toeppe [2013/02/06 18:58]
toeppe |
members:toeppe [2013/02/06 19:13] (current)
toeppe |
| |
| I am currently working in the following research areas: | I am currently working in the following research areas: |
| |[[research:Single View 3D Reconstruction|{{:research:topics:image-based_3d_reconstruction:cockatoo_recon.png?150|}}]]|[[research:Single View 3D Reconstruction]] Based on a single image the silhouette of the object is extracted. By applying additional constraints e.g. on the volume of the object or the shape along cross sections 3D models can be computed from variational approaches.| | |[[research:Single View 3D Reconstruction|{{:research:topics:image-based_3d_reconstruction:cockatoo_recon.png?150|}}]]|[[research:Single View 3D Reconstruction]]. Based on a single image the silhouette of the object is extracted. By applying additional constraints e.g. on the volume of the object or the shape along cross sections 3D models can be computed from variational approaches.| |
| |[[research:image_segmentation|{{:spezial:bib:nieuwenhuis-cremers-pami12.jpg?150|}}]]|[[research:image_segmentation]] Theoretical and experimental comparison of discrete and continuous optimization methods for multilabel problems.| | |[[research:image_segmentation|{{:spezial:bib:nieuwenhuis-cremers-pami12.jpg?150|}}]]|[[research:image_segmentation]]. Theoretical and experimental comparison of discrete and continuous optimization methods for multilabel problems.| |
| |{{:research:software:software_planarcut.png?120|}}|The PlanarCut library computes a max-flow/min-s-t-cut on planar graphs. It implements an efficient algorithm, which has almost linear running time. The code to the project can be downloaded [[https://vision.in.tum.de/data/software|here]]. | | |{{:research:software:software_planarcut.png?120|}}|[[https://vision.in.tum.de/data/software|Planar Graph Cuts]]. The PlanarCut library computes a max-flow/min-s-t-cut on planar graphs. It implements an efficient algorithm, which has almost linear running time. The code to the project can be downloaded. | |
Login
