Abdullah Aydın Alatan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abdullah Aydın Alatan has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Cevahir Cigla
Department of Electrical and Electronics Engineering, M.E.T.U, Turkey
6 shared publications - Evren Imre
Department of Electrical & Electronics Engineering, METU, Balgat 06531 Ankara, TURKEY
5 shared publications - Uğur Güdükbay
Department of Computer Engineering, Bilkent University, Ankara, Turkey
4 shared publications - Osman Serdar Gedik
Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey
3 shared publications - Alper Koz
Center for Image Analysis, Middle East Technical University, Ankara 06800, Turkey
2 shared publications - Medeni Soysal
Görüntü İşleme Grubu, TÜBİTAK UZAY, Ankara, Türkiye
2 shared publications
Latest Publications
- 16 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 43 (5) , 1395-1405
3-D Rigid Body Tracking Using Vision and Depth Sensors
In robotics and augmented reality applications, model-based 3-D tracking of rigid objects is generally required. With the help of accurate pose estimates, it is required to increase reliability and decrease jitter in total. Among many solutions of pose estimation in the literature, pure vision-based 3-D trackers require either manual initializations or offline training stages. On the other hand, trackers relying on pure depth sensors are not suitable for AR applications. An automated 3-D tracking algorithm, which is based on fusion of vision and depth sensors via extended Kalman filter, is proposed in this paper. A novel measurement-tracking scheme, which is based on estimation of optical flow using intensity and shape index map data of 3-D point cloud, increases 2-D, as well as 3-D, tracking performance significantly. The proposed method requires neither manual initialization of pose nor offline training, while enabling highly accurate 3-D tracking. The accuracy of the proposed method is tested against a number of conventional techniques, and a superior performance is clearly observed in terms of both objectively via error metrics and subjectively for the rendered scenes.
- 16 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 43 (5) , 1395-1405
3-D Rigid Body Tracking Using Vision and Depth Sensors
In robotics and augmented reality applications, model-based 3-D tracking of rigid objects is generally required. With the help of accurate pose estimates, it is required to increase reliability and decrease jitter in total. Among many solutions of pose estimation in the literature, pure vision-based 3-D trackers require either manual initializations or offline training stages. On the other hand, trackers relying on pure depth sensors are not suitable for AR applications. An automated 3-D tracking algorithm, which is based on fusion of vision and depth sensors via extended Kalman filter, is proposed in this paper. A novel measurement-tracking scheme, which is based on estimation of optical flow using intensity and shape index map data of 3-D point cloud, increases 2-D, as well as 3-D, tracking performance significantly. The proposed method requires neither manual initialization of pose nor offline training, while enabling highly accurate 3-D tracking. The accuracy of the proposed method is tested against a number of conventional techniques, and a superior performance is clearly observed in terms of both objectively via error metrics and subjectively for the rendered scenes.
- 8 August 2013
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 74 (8) , 2611-2637
Joint utilization of local appearance and geometric invariants for 3D object recognition
- 8 August 2013
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 74 (8) , 2611-2637
Joint utilization of local appearance and geometric invariants for 3D object recognition
- 18 August 2010
- Published by Springer Nature
- p. 305-308
Joint Utilization of Appearance and Geometry for Scene Logo Retrieval
- 18 August 2010
- Published by Springer Nature
- p. 305-308
Joint Utilization of Appearance and Geometry for Scene Logo Retrieval
- 1 January 2010
- Published by Springer Nature
- p. 219-244
Next Generation Frame Rate Conversion Algorithms
- 1 January 2010
- Published by Springer Nature
- p. 219-244
Next Generation Frame Rate Conversion Algorithms
- 20 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 18 (3) , 483-494
Rate-Distortion Efficient Piecewise Planar 3-D Scene Representation From 2-D Images
In any practical application of the 2-D-to-3-D conversion that involves storage and transmission, representation efficiency has an undisputable importance that is not reflected in the attention the topic received. In order to address this problem, a novel algorithm, which yields efficient 3-D representations in the rate distortion sense, is proposed. The algorithm utilizes two views of a scene to build a mesh-based representation incrementally, via adding new vertices, while minimizing a distortion measure. The experimental results indicate that, in scenes that can be approximated by planes, the proposed algorithm is superior to the dense depth map and, in some practical situations, to the block motion vector-based representations in the rate-distortion sense.
- 20 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 18 (3) , 483-494
Rate-Distortion Efficient Piecewise Planar 3-D Scene Representation From 2-D Images
In any practical application of the 2-D-to-3-D conversion that involves storage and transmission, representation efficiency has an undisputable importance that is not reflected in the attention the topic received. In order to address this problem, a novel algorithm, which yields efficient 3-D representations in the rate distortion sense, is proposed. The algorithm utilizes two views of a scene to build a mesh-based representation incrementally, via adding new vertices, while minimizing a distortion measure. The experimental results indicate that, in scenes that can be approximated by planes, the proposed algorithm is superior to the dense depth map and, in some practical situations, to the block motion vector-based representations in the rate-distortion sense.
- 1 January 2009
- Published by European Alliance for Innovation n.o.
Multi-view Dense Depth Map Estimation
- 1 January 2009
- Published by European Alliance for Innovation n.o.
Multi-view Dense Depth Map Estimation
- 1 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21612021,p. 185-188
Depth Assisted Object Segmentation in Multi-View Video
In this work, a novel and unified approach for multi-view video (MVV) object segmentation is presented. In the first stage, a region-based graph-theoretic color segmentation algorithm is proposed, in which the popular normalized cuts segmentation method is improved with some modifications on its graph structure. Segmentation is obtained by recursive bi-partitioning of a weighted graph of an initial over-segmentation mask. The available segmentation mask is also utilized during dense depth map estimation step, based on a novel modified plane- and angle- sweeping strategy for each of these regions. Dense depth estimation is achieved by region-wise planarity assumption for the whole scene, in which depth models are estimated for sub-regions. Finally, the multi-view image segmentation algorithm is extended to object segmentation in MVV by the additional optical flow information. The required motion field is obtained via region- based matching that has consistent parameterization with color segmentation and dense depth map estimation algorithms. Experimental results indicate that proposed approach segments semantically meaningful objects in MVV with high precision.
- 1 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21612021,p. 185-188
Depth Assisted Object Segmentation in Multi-View Video
In this work, a novel and unified approach for multi-view video (MVV) object segmentation is presented. In the first stage, a region-based graph-theoretic color segmentation algorithm is proposed, in which the popular normalized cuts segmentation method is improved with some modifications on its graph structure. Segmentation is obtained by recursive bi-partitioning of a weighted graph of an initial over-segmentation mask. The available segmentation mask is also utilized during dense depth map estimation step, based on a novel modified plane- and angle- sweeping strategy for each of these regions. Dense depth estimation is achieved by region-wise planarity assumption for the whole scene, in which depth models are estimated for sub-regions. Finally, the multi-view image segmentation algorithm is extended to object segmentation in MVV by the additional optical flow information. The required motion field is obtained via region- based matching that has consistent parameterization with color segmentation and dense depth map estimation algorithms. Experimental results indicate that proposed approach segments semantically meaningful objects in MVV with high precision.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21650608,p. 1-4
Watermarking for Image-Based Rendering via Homography-Based Virtual Camera Location Estimation
The recent advances in image based rendering (IBR) have pioneered freely determining the viewing position and angle in a scene from multi-view video. Remembering that a person could also record a personal video for this arbitrarily selected view and misuse this content, it is apparent that copyright and copy protection problems also exist and should be solved for IBR applications, as well. In our recent work (Alper Koz, 2006), we propose a watermarking method, which embeds the watermark pattern into every frame of multi-view video and extracts this watermark from a rendered image, generated by the nearest-interpolation based light-field rendering (LFR) and watermark detection is achieved for the cases in which the virtual camera could be arbitrarily located on the camera plane only. This paper presents an extension to the previous formulation for the rendered images, which are generated by using bilinear interpolation, namely the most attractive and promising interpolation method in LFR-based applications. Moreover, the location of the virtual camera could be completely arbitrary in this new formulation. The results show that the watermark could be extracted successfully for LFR via bilinear interpolation for any imagery camera location and rotation, as long as the visual quality of the rendered image is preserved.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21650608,p. 1-4
Watermarking for Image-Based Rendering via Homography-Based Virtual Camera Location Estimation
The recent advances in image based rendering (IBR) have pioneered freely determining the viewing position and angle in a scene from multi-view video. Remembering that a person could also record a personal video for this arbitrarily selected view and misuse this content, it is apparent that copyright and copy protection problems also exist and should be solved for IBR applications, as well. In our recent work (Alper Koz, 2006), we propose a watermarking method, which embeds the watermark pattern into every frame of multi-view video and extracts this watermark from a rendered image, generated by the nearest-interpolation based light-field rendering (LFR) and watermark detection is achieved for the cases in which the virtual camera could be arbitrarily located on the camera plane only. This paper presents an extension to the previous formulation for the rendered images, which are generated by using bilinear interpolation, namely the most attractive and promising interpolation method in LFR-based applications. Moreover, the location of the virtual camera could be completely arbitrary in this new formulation. The results show that the watermark could be extracted successfully for LFR via bilinear interpolation for any imagery camera location and rotation, as long as the visual quality of the rendered image is preserved.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Region-Based Dense Depth Extraction from Multi-View Video
A novel multi-view region-based dense depth map estimation problem is presented, based on a modified plane-sweeping strategy. In this approach, the whole scene is assumed to be region-wise planar. These planar regions are defined by back-projections of the over-segmented homogenous color regions on the images and the plane parameters are determined by angle-sweeping at different depth levels. The position and rotation of the plane patches are estimated robustly by minimizing a segment-based cost function, which considers occlusions, as well. The quality of depth map estimates is measured via reconstruction quality of the conjugate views, after warping segments into these views by the resulting homographies. Finally, a greedy-search algorithm is applied to refine the reconstruction quality and update the plane equations with visibility constraint. Based on the simulation results, it is observed that the proposed algorithm handles large un-textured regions, depth discontinuities at object boundaries, slanted surfaces, as well as occlusions.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Region-Based Dense Depth Extraction from Multi-View Video
A novel multi-view region-based dense depth map estimation problem is presented, based on a modified plane-sweeping strategy. In this approach, the whole scene is assumed to be region-wise planar. These planar regions are defined by back-projections of the over-segmented homogenous color regions on the images and the plane parameters are determined by angle-sweeping at different depth levels. The position and rotation of the plane patches are estimated robustly by minimizing a segment-based cost function, which considers occlusions, as well. The quality of depth map estimates is measured via reconstruction quality of the conjugate views, after warping segments into these views by the resulting homographies. Finally, a greedy-search algorithm is applied to refine the reconstruction quality and update the plane equations with visibility constraint. Based on the simulation results, it is observed that the proposed algorithm handles large un-textured regions, depth discontinuities at object boundaries, slanted surfaces, as well as occlusions.