Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Swarnendu Kar

dblp:76/11466 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › distributed algorithms
distributed estimation
0.212013
Linear Coherent Estimation With Spatial Collaboration · IEEE Trans. Inf. Theory 2013
Distributed systems › distributed network
sensor networks
0.212013
Linear Coherent Estimation With Spatial Collaboration · IEEE Trans. Inf. Theory 2013
Information theory
estimation theory
0.212013
Linear Coherent Estimation With Spatial Collaboration · IEEE Trans. Inf. Theory 2013
Information theory › estimation theory › mean-square estimation
minimum mean-square error
0.212013
Linear Coherent Estimation With Spatial Collaboration · IEEE Trans. Inf. Theory 2013

Methods — techniques the papers use, named apart from their topics

random geometric graph · 0.3linear combining · 0.3coherent multiple access · 0.3
YearPublicationVenuePosition
2021 A Learning-Based Approach to Parametric Rotoscoping of Multi-Shape Systems
abstract
Rotoscoping of facial features is often an integral part of Visual Effects post-production, where the parametric contours created by artists need to be highly detailed, consist of multiple interacting components, and involve significant manual supervision. Yet those assets are usually dis-carded after compositing and hardly reused. In this paper, we present the first methodology to learn from these assets. With only a few manually rotoscoped shots, we identify and extract semantically consistent and task specific landmark points and re-vectorize the roto shapes based on these land-marks. We then train two separate models - one to predict landmarks based on a rough crop of the face region, and the other to predict the roto shapes using only the inferred landmarks from the first model. In preliminary production testing, 26% of shots rotoscoped using our tool were able to be used with no adjustment, and another 47% were able to be used with minor adjustments. This represents a significant time savings for the studio, as artists are able to rotoscope almost 73% of their shots with no manual roto-scoping and some spline adjustment. This paper presents a novel application of machine learning to professional interactive rotoscoping, a methodology to convert unstructured roto shapes into a self-annotated, trainable dataset that can be harnessed to make accurate predictions on future shots of a similar object, and a limited dataset of rotoscoped multi-shape fine feature systems from a real film production.
Luis Bermudez, Nadine L. Dabby, Adelle Lin, Sara Hilmarsdottir, Narayan Sundararajan, Swarnendu Kar
WACV6
2014 A decentralized framework for linear coherent estimation with spatial collaboration
abstract
We study an estimation problem where a fusion center estimates a random parameter by using a partially connected network of sensor nodes. The process involves two stages. In the collaboration stage, the sensor nodes share their observations with their neighbors. In the estimation stage, all the sensor nodes form a coherent beam to the fusion center using the analog amplify-and-forward procedure. In the previous work of Kar and Varshney (2013) on this topic, a control center determines the optimum collaboration strategy that is sent to the sensor nodes prior to starting the two-stage procedure. In this paper, we develop a new framework where the collaboration strategies are computed in a decentralized manner using minimal communication with the control center. This makes the sensor network more energy efficient and reduces control channel communication requirements.
Swarnendu Kar, Pramod K. Varshney
ICASSP1
2014 On optimal sensor collaboration topologies for linear coherent estimation
abstract
In the context of distributed estimation we consider the problem of sensor collaboration, which refers to the act of sharing measurements with neighboring sensors prior to transmission to a fusion center. While incorporating the cost of sensor collaboration, we aim to find optimal sparse collaboration topologies subject to a certain information or energy constraint. To achieve this goal, we present a tractable optimization framework and propose efficient methods to solve the formulated sensor collaboration problems. The effectiveness of our approach is demonstrated by numerical examples.
Sijia Liu 0001, Makan Fardad, Swarnendu Kar, Pramod K. Varshney
ISIT3
2013 Linear Coherent Estimation With Spatial Collaboration
abstract
A power-constrained sensor network that consists of multiple sensor nodes and a fusion center (FC) is considered, where the goal is to estimate a random parameter of interest. In contrast to the distributed framework, the sensor nodes may be partially connected, where individual nodes can update their observations by (linearly) combining observations from other adjacent nodes. The updated observations are communicated to the FC by transmitting through a coherent multiple access channel. The optimal collaborative strategy is obtained by minimizing the expected mean-square error subject to power constraints at the sensor nodes. Each sensor can utilize its available power for both collaboration with other nodes and transmission to the FC. Two kinds of constraints, namely the cumulative and individual power constraints, are considered. The effects due to imperfect information about observation and channel gains are also investigated. The resulting performance improvement is illustrated analytically through the example of a homogeneous network with equicorrelated parameters. Assuming random geometric graph topology for collaboration, numerical results demonstrate a significant reduction in distortion even for a moderately connected network, particularly in the low local signal-to-noise ratio regime.
Swarnendu Kar, Pramod K. Varshney
IEEE Trans. Inf. Theory1
2012 On linear coherent estimation with spatial collaboration
abstract
We consider a power-constrained sensor network, consisting of multiple sensor nodes and a fusion center (FC), that is deployed for the purpose of estimating a common random parameter of interest. In contrast to the distributed framework, the sensor nodes are allowed to update their individual observations by (linearly) combining observations from neighboring nodes. The updated observations are communicated to the FC using an analog amplify-and-forward modulation scheme and through a coherent multiple access channel. The optimal collaborative strategy is obtained by minimizing the cumulative transmission power subject to a maximum distortion constraint. For the distributed scenario (i.e., with no observation sharing), the solution reduces to the power-allocation problem considered by Xiao et. al.. Collaboration among neighbors significantly improves power efficiency of the network in the low local-SNR regime, as demonstrated through an insightful example and numerical simulations.
Swarnendu Kar, Pramod K. Varshney
ISIT1