Geethu Miriam Jacob
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Geethu Miriam Jacob has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Sukhendu Das
Indian Institute of Technology Madras
4 shared publications Sukhendu Das
Indian Institute of Technology Madras
2 shared publications- Björn Stenger
Rakuten Institute of Technology, Rakuten Group Inc., Setagaya City, Tokyo, Japan
1 shared publication - Chisato Ito
Rakuten group, Inc., Japan
1 shared publication - Masashi Kawamura
Rakuten group, Inc., Japan
1 shared publication - S. N. Sahu
Rakuten Group, Inc., India
1 shared publication
Latest Publications
- Open Access
- 4 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 538-541
Text2Illustration: Sampling and Composing Creatives With Text
- 4 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 538-541
Open AccessText2Illustration: Sampling and Composing Creatives With Text
- 29 May 2019
- Published by Springer Nature
- p. 166-182
Panorama from Representative Frames of Unconstrained Videos Using DiffeoMeshes
- 29 May 2019
- Published by Springer Nature
- p. 166-182
Panorama from Representative Frames of Unconstrained Videos Using DiffeoMeshes
- 23 January 2019
- Published by Springer Nature
- p. 740-744
GreenWarps: A Two-Stage Warping Model for Stitching Images Using Diffeomorphic Meshes and Green Coordinates
- 23 January 2019
- Published by Springer Nature
- p. 740-744
GreenWarps: A Two-Stage Warping Model for Stitching Images Using Diffeomorphic Meshes and Green Coordinates
- 25 September 2018
- Published by Springer Nature
- p. 521-533
Large Parallax Image Stitching Using an Edge-Preserving Diffeomorphic Warping Process
- 25 September 2018
- Published by Springer Nature
- p. 521-533
Large Parallax Image Stitching Using an Edge-Preserving Diffeomorphic Warping Process
- 1 August 2017
- Published by Elsevier in Image and Vision Computing
- Vol. 64, 10-22
Moving object segmentation for jittery videos, by clustering of stabilized latent trajectories
- 1 August 2017
- Published by Elsevier in Image and Vision Computing
- Vol. 64, 10-22
Moving object segmentation for jittery videos, by clustering of stabilized latent trajectories
- Open Access
- 18 December 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Video stabilization by procrustes analysis of trajectories
Video Stabilization algorithms are often necessary at the pre-processing stage for many applications in video analytics. The major challenges in video stabilization are the presence of jittery motion paths of a camera, large foreground moving objects with arbitrary motion and occlusions. In this paper, a simple, yet powerful video stabilization algorithm is proposed, by eliminating the trajectories with higher dynamism appearing due to jitter. A block-wise stabilization of the camera motion is performed, by analyzing the trajectories in Kendall's shape space. A 3-stage iterative process is proposed for each block of frames. At the first stage of the iterative process, the trajectories with relatively higher dynamism (estimated using optical flow) are eliminated. At the second stage, a Procrustes alignment is performed on the remaining trajectories and Frechet mean of the aligned trajectories is estimated. Finally, the Frechet mean is stabilized and a transformation of the stabilized Frechet mean to the original space (of the trajectories) yields the stabilized trajectories. A global optimization function has been designed for stabilization, thus minimizing wobbles and distortions in the frames. As the motion paths of the higher and lower dynamic regions become more distinct after stabilization, this iterative process helps in the identification of the stabilized background trajectories (with lower dynamism), which are used to warp the frames for rendering the stabilized frames. Experiments are done with varying levels of jitter introduced on stable videos, apart from a few benchmarked natural jittery videos. In cases, where synthetic jitter is fused on stable videos, an error norm comparing the groundtruth scores (scores of the stable videos) to the scores of the stabilized videos, is used for comparative study of performance. The results show the superiority of our proposed method over other state-of-the-art methods.
- 18 December 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessVideo stabilization by procrustes analysis of trajectories
Video Stabilization algorithms are often necessary at the pre-processing stage for many applications in video analytics. The major challenges in video stabilization are the presence of jittery motion paths of a camera, large foreground moving objects with arbitrary motion and occlusions. In this paper, a simple, yet powerful video stabilization algorithm is proposed, by eliminating the trajectories with higher dynamism appearing due to jitter. A block-wise stabilization of the camera motion is performed, by analyzing the trajectories in Kendall's shape space. A 3-stage iterative process is proposed for each block of frames. At the first stage of the iterative process, the trajectories with relatively higher dynamism (estimated using optical flow) are eliminated. At the second stage, a Procrustes alignment is performed on the remaining trajectories and Frechet mean of the aligned trajectories is estimated. Finally, the Frechet mean is stabilized and a transformation of the stabilized Frechet mean to the original space (of the trajectories) yields the stabilized trajectories. A global optimization function has been designed for stabilization, thus minimizing wobbles and distortions in the frames. As the motion paths of the higher and lower dynamic regions become more distinct after stabilization, this iterative process helps in the identification of the stabilized background trajectories (with lower dynamism), which are used to warp the frames for rendering the stabilized frames. Experiments are done with varying levels of jitter introduced on stable videos, apart from a few benchmarked natural jittery videos. In cases, where synthetic jitter is fused on stable videos, an error norm comparing the groundtruth scores (scores of the stable videos) to the scores of the stabilized videos, is used for comparative study of performance. The results show the superiority of our proposed method over other state-of-the-art methods.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 69-74
Detection of flock movement in spatio-temporal database using clustering techniques - An experience
In this paper, moving flock patterns are mined from spatio- temporal datasets by incorporating a clustering algorithm. A flock is defined as the set of data that move together for a certain continuous amount of time. Finding out moving flock patterns using clustering algorithms is a potential method to find out frequent patterns of movement in large trajectory datasets. In this approach, SPatial clusteRing algoRithm thrOugh sWarm intelligence (SPARROW) is the clustering algorithm used. The advantage of using SPARROW algorithm is that it can effectively discover clusters of widely varying sizes and shapes from large databases. Variations of the proposed method are addressed and also the experimental results show that the problem of scalability and duplicate pattern formation is addressed. This method also reduces the number of patterns produced.
- 1 July 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 69-74
Detection of flock movement in spatio-temporal database using clustering techniques - An experience
In this paper, moving flock patterns are mined from spatio- temporal datasets by incorporating a clustering algorithm. A flock is defined as the set of data that move together for a certain continuous amount of time. Finding out moving flock patterns using clustering algorithms is a potential method to find out frequent patterns of movement in large trajectory datasets. In this approach, SPatial clusteRing algoRithm thrOugh sWarm intelligence (SPARROW) is the clustering algorithm used. The advantage of using SPARROW algorithm is that it can effectively discover clusters of widely varying sizes and shapes from large databases. Variations of the proposed method are addressed and also the experimental results show that the problem of scalability and duplicate pattern formation is addressed. This method also reduces the number of patterns produced.