Rameswar Panda

Rameswar Panda

Auto-generated profile, based on publicly available information

Rameswar Panda

MIT-IBM Watson AI Lab

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 September 2020
Verified
Book Chapter
Closed access
PDF file
NKNewton M. Kinyanjui
Newton M. Kinyanjui
TOTimothy Odonga
Timothy Odonga
CCCelia Cintas
Celia Cintas
NCNoel C. F. Codella
Noel C. F. Codella
RPRameswar Panda
Rameswar Panda
KVKush Varshney
Kush Varshney

9 October 2018
Verified
Book Chapter
Closed access
PDF file
RPRameswar Panda
Rameswar Panda
JZJianming Zhang
Jianming Zhang
HLHaoxiang Li
Haoxiang Li
JLJoon-Young Lee
Joon-Young Lee
XLXin Lu
Xin Lu
ARAmit K. Roy-Chowdhury
Amit K. Roy-Chowdhury

26 May 2017 in IEEE Transactions on Image Processing
Verified
Journal Article
Open access
RPRameswar Panda
Rameswar Panda
NMNiluthpol Chowdhury Mithun
Niluthpol Chowdhury Mithun
ARAmit K. Roy-Chowdhury
Amit K. Roy-Chowdhury
Most video summarization approaches have focused on extracting a summary from a single video; we propose an unsupervised framework for summarizing a collection of videos. We observe that each video in the collection may contain some information that other videos do not have, and thus exploring the underlying complementarity could be beneficial in creating a diverse informative summary. We develop a novel diversity-aware sparse optimization method for multi-video summarization by exploring the complementarity within the videos. Our approach extracts a multi-video summary, which is both interesting and representative in describing the whole video collection. To efficiently solve our optimization problem, we develop an alternating minimization algorithm that minimizes the overall objective function with respect to one video at a time while fixing the other videos. Moreover, we introduce a new benchmark data set, Tour20, that contains 140 videos with multiple manually created summaries, which were acquired in a controlled experiment. Finally, by extensive experiments on the new Tour20 data set and several other multi-view data sets, we show that the proposed approach clearly outperforms the state-of-the-art methods on the two problems-topic-oriented video summarization and multi-view video summarization in a camera network.

1 January 2024
Verified
Conference Paper
Open access
PDF file
BPBowen Pan
Bowen Pan
RPRameswar Panda
Rameswar Panda
SJSouYoung Jin
SouYoung Jin
RFRogerio Feris
Rogerio Feris
AOAude Oliva
Aude Oliva
YKYoon Kim
Yoon Kim
Bowen Pan, Rameswar Panda, SouYoung Jin, Rogerio Feris, Aude Oliva, Phillip Isola, Yoon Kim. Findings of the Association for Computational Linguistics: NAACL 2024. 2024.

1 June 2020
Verified
Conference Paper
Open access
SASk Miraj Ahmed
Sk Miraj Ahmed
ALAske R. Lejbolle
Aske R. Lejbolle
RPRameswar Panda
Rameswar Panda
ARAmit K. Roy-Chowdhury
Amit K. Roy-Chowdhury
Most of the existing approaches for person re-identification consider a static setting where the number of cameras in the network is fixed. An interesting direction, which has received little attention, is to explore the dynamic nature of a camera network, where one tries to adapt the existing re-identification models after on-boarding new cameras, with little additional effort. There have been a few recent methods proposed in person re-identification that attempt to address this problem by assuming the labeled data in the existing network is still available while adding new cameras. This is a strong assumption since there may exist some privacy issues for which one may not have access to those data. Rather, based on the fact that it is easy to store the learned re-identifications models, which mitigates any data privacy concern, we develop an efficient model adaptation approach using hypothesis transfer learning that aims to transfer the knowledge using only source models and limited labeled data, but without using any source camera data from the existing network. Our approach minimizes the effect of negative transfer by finding an optimal weighted combination of multiple source models for transferring the knowledge. Extensive experiments on four challenging benchmark datasets with variable number of cameras well demonstrate the efficacy of our proposed approach over state-of-the-art methods.

7 February 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
RPRameswar Panda
Rameswar Panda
SKSanjay Kumar Kuanar
Sanjay Kumar Kuanar
ACAnanda S. Chowdhury
Ananda S. Chowdhury
Movie scene detection has emerged as an important problem in present day multimedia applications. Since a movie typically consists of huge amount of video data with widespread content variations, detecting a movie scene has become extremely challenging. In this paper, we propose a fast yet accurate solution for movie scene detection using Nyström approximated multisimilarity spectral clustering with a temporal integrity constraint. We use multiple similarity matrices to model the wide content variations typically present in any movie dataset. Nyström approximation is employed to reduce the high computational cost of constructing multiple similarity measures. The temporal integrity constraint captures the inherent temporal cohesion of the movie shots. Experiments on five movie datasets from different genres clearly demonstrate the superiority of the proposed solution over the state-of-the-art methods.