loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Affiliation

Indian Institute of Technology Bombay, India
Context (please use complete words only)
Field
Sort by

20 Papers

Galerkin Enhanced Graph-Based FEM for Interactive Fracture and Sculpting Applications

Topics: Real-Time Rendering; Real-Time Visual Simulation; Physics-Based Animation; Simulation of Elastic Rods, Shells, and Solids; Interactive 3D Graphics and Immersive Systems

Authors: Avirup Mandal 1 , Parag Chaudhuri 2 and Subhasis Chaudhuri 3

Affiliations: 1 Department of Computer Science and Engineering, Indian Institute of Technology Palakkad, Kanjikode, India , 2 Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai, India , 3 Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India

Digital Object Identifier: 10.5220/0013142800003912

Proceedings of GRAPP 2025, ISBN: 978-989-758-728-3

Collapse Button Quick Abstract
Physically-based fracture and cutting simulations are rarely incorporated in interactive graphics systems because the required computation stifles the speed of interaction. We enhance a physically based method for object deformation and fracture by using multigrid approximations to expedite the full dynamics solve of the system. Our method combines a Galerkin multigrid approach with the graph-based Finite Element Method so that remeshing-free fracture and cutting simulation can be done by solving the system dynamics on a hierarchy of coarse to fine meshes while accumulating residual error that is fully resolved only at the coarsest level. We demonstrate the effectiveness of our algorithm by using it to develop an interactive virtual sculpting framework that enables users to shape object meshes in a physically consistent manner. We compare our method with other state-of-the-art virtual 3D object editing solutions to show that our method can provide better physically consistent solutions at interactive speeds.

Real-Time Physics-Based Mesh Deformation with Haptic Feedback and Material Anisotropy

Topics: Real-Time Graphics; Physics-Based Animation; Dynamic Simulation of Physical Behaviour; Simulation of Elastic Rods, Shells, and Solids; Interactive 3D Graphics and Immersive Systems

Authors: Avirup Mandal 1 , Parag Chaudhuri 2 and Subhasis Chaudhuri 1

Affiliations: 1 Department of Electrical Engineering, IIT Bombay, Powai, Mumbai, India , 2 Department of Computer Science and Engineering, IIT Bombay, Powai, Mumbai, India

Digital Object Identifier: 10.5220/0011611800003417

Proceedings of GRAPP 2023/VISIGRAPP, ISBN: 978-989-758-634-7

Collapse Button Quick Abstract
We present a real-time, physics-based framework to simulate porous, deformable materials and interactive tools with haptic feedback that can reshape them. In order to allow the material to be moulded nonhomogeneously, we propose an algorithm to change the material properties of the object depending on its water content. To enable stable visual and haptic feedback at interactive rates, we implement a multi-resolution, multi-timescale solution. We test our model for physical consistency, accuracy, interactivity and appeal through a user study and quantitative performance evaluation.

Non-linear Monte Carlo Ray Tracing for Visualizing Warped Spacetime

Topic: Scientific Visualization

Authors: Avirup Mandal , Kumar Ayush and Parag Chaudhuri

Affiliation: Indian Institute of Technology Bombay, Powai, Mumbai, India

Digital Object Identifier: 10.5220/0010217600760087

Proceedings of IVAPP 2021/VISIGRAPP, ISBN: 978-989-758-488-6

Collapse Button Quick Abstract
General relativity describes the curvature of spacetime. Rays of light follow geodesic paths in curved space-time. Visualizing scenes containing spacetime regions with pronounced curvature requires tracing of these light ray paths. We present a Monte Carlo approach for non-linear raytracing to render scenes in curved space-time. In contrast to earlier work, we can accurately resolve ray-object interactions. This allows us to create plausible visualizations of what happens when a black hole appears in a more known environment, like a room with regular specular and diffuse surfaces. We demonstrate that our solution is correct at cosmological scales by showing how spacetime warps around a stationary Schwarzschild black hole and a non-stationary Kerr black hole. We verify that the solution is consistent with the predictions of general relativity. In the absence of any curvature in spacetime, our renderer behaves like a normal linear ray tracer. Our method has the potential to create rich, physically plausible visualizations of complex phenomena that can be used for a range of purposes, from creating visual effects to making pedagogical aids to understand the behaviour of spacetime as predicted by general relativity.

Learning Plaintext in Galbraith’s LWE Cryptosystem

Topics: Data Integrity; Applied Cryptography

Authors: Tikaram Sanyashi , Sreyans Nahata , Rushang Dhanesha and Bernard Menezes

Affiliation: Indian Institute of Technology Bombay, Powai, Mumbai and India

Digital Object Identifier: 10.5220/0006909407250731

Proceedings of SECRYPT 2018, ISBN: 978-989-758-319-3

Collapse Button Quick Abstract
Unlike many widely used cryptosytems, Learning with Errors (LWE) - based cryptosystems are known to be invulnerable to quantum computers. Galbraith’s Binary LWE (GB-LWE) was proposed to reduce the large key size of the original LWE scheme by over two orders of magnitude. In GB-LWE, recovering the plaintext from the ciphertext involves solving for the binary vector x in the equation xA = b (A, a 640×256 binary matrix and b, a 256 element integer vector are knowns). Previously, lattice-based attacks on binary matrices larger than 400 × 256 were found to be infeasible. Linear programming was proposed and shown to handle significantly larger matrices but its success rate for 640 × 256 matrices was found to be negligible. Our strategy involves identification of regimes L, M and H within the output (based on LP relaxation) where the mis-prediction rates are low, medium or high respectively. Bits in the output vector are guessed and removed to create and solve a reduced instance. We report extensive experimental results on prediction accuracy and success probability as a function of number of bits removed in L, M and H. We identify trade-offs between lower execution time and greater probability of success. Our success probability is much higher than previous efforts and its execution time of 1 day with 150 cores is a partial response to the challenge posed in (Galbraith, 2013) to solve a random 640 × 256 instance using “current computing facilities in less than a year”.
Collapse Button Related Ontology Subjects/Areas/Topics (6)
Applied Cryptography

Data Engineering

Databases and Data Security

Cryptographic Techniques and Key Management

Data Integrity

Information and Systems Security

SheetAnim - From Model Sheets to 2D Hand-drawn Character Animation

Topics: Animation Systems; Human Figure Animation; Sketch-Based Interfaces

Authors: Heena Gupta and Parag Chaudhuri

Affiliation: IIT Bombay, India

Digital Object Identifier: 10.5220/0006514100170027

Proceedings of GRAPP 2018/VISIGRAPP, ISBN: 978-989-758-287-5

Collapse Button Quick Abstract
We present an intuitive method to create 2D hand-drawn character animation suitable for novice animators. Given the 2D model sheet of the character that shows how the character looks from the front and side, our method can generate sketched views of the character from any direction, using the sketch stroke style used in the model sheet. Subsequently, our system can generate an animation of the character using motion capture data, and render it using the same sketched strokes. Our method is not only able to reproduce the sketch stroke style, but also the colours and other character details that the animator adds to the model sheet. The method can resolve occlusion correctly, both due to moving body parts and change in orientation of the character with respect to the camera. The animator can interactively change the sketch style, colours or other details, at any frame, as required. The animation generated by our method has the fluid style of hand sketched animation, and provides a very good starting point for novice animators that can be then improved to create the final, desired animation.
Collapse Button Related Ontology Subjects/Areas/Topics (6)
Animation and Simulation

Computer Vision, Visualization and Computer Graphics

Interactive Environments

Animation Systems

Human Figure Animation

Sketch-Based Interfaces

Narrow Band Pressure Computation for Eulerian Fluid Simulation

Topics: Physics-Based Animation; Scalable Fluid Simulation

Authors: Aditya Prakash and Parag Chaudhuri

Affiliation: Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0006090200170026

Proceedings of GRAPP 2017/VISIGRAPP, ISBN: 978-989-758-224-0

Collapse Button Quick Abstract
An Eulerian fluid simulation for incompressible fluids spends a lot of time in enforcing incompressibility by solving a large Poisson’s equation. This involves solving a large system of equations using a solver like conjugate gradients. We introduce a way of accelerating this computation by dividing the grid domain of the fluid simulation into a narrow band of high resolution grid cells near fluid-solid boundaries and a coarser grid everywhere else. Judiciously reducing the number of high resolution grid cells significantly lowers the cost of the pressure projection step, while not sacrificing the simulation quality. The coarse grid values are upgraded to a finer grid before advecting the fluid surface so that enough degrees of freedom are available to resolve surface detail. We present and analyse two methods to perform this upgradation, namely, velocity interpolation and pressure field smoothing. We discuss the merits and demerits of each and quantify the errors introduced in the simulation as a function of size of the narrow band. Finally, since we are primarily interested in visualizing the fluid animation, we produce rendered fluid simulation output to also validate the visual quality of the simulations.
Collapse Button Related Ontology Subjects/Areas/Topics (3)
Animation and Simulation

Computer Vision, Visualization and Computer Graphics

Physics-Based Animation

TraceMove: A Data-assisted Interface for Sketching 2D Character Animation

Topics: Animation Systems; Character Animation; Sketch-Based Interfaces

Authors: Priyanka Patel , Heena Gupta and Parag Chaudhuri

Affiliation: Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0005672501890197

Proceedings of GRAPP 2016/VISIGRAPP, ISBN: 978-989-758-175-5

Collapse Button Quick Abstract
In this paper we present TraceMove, a system to help novice animators create 2D, hand-drawn, character animation. The system and interface assists not only in sketching the character properly but also in animating it. A database of image frames, from recorded videos of humans performing various motions, is used to provide pose silhouette suggestions as a static pose hint to the users as they draw the character. The user can trace and draw over the generated suggestions to create the sketch of the pose. Then the sketch of the next frame of the animation being drawn is automatically generated by the system as a moving pose hint. In order to do this, the user marks the skeleton of the character in a single sketched pose, and a motion capture database is used to predict the skeleton for the subsequent frame. The sketched pose is then deformed according to the predicted skeleton pose. Furthermore, the sketch generated by the system for any frame can always be edited by the animator. This lets novice artists and animators generate hand-drawn 2D animated characters with minimal effort.
Collapse Button Related Ontology Subjects/Areas/Topics (6)
Animation and Simulation

Character Animation

Interactive Environments

Animation Systems

Computer Vision, Visualization and Computer Graphics

Sketch-Based Interfaces

Design and Implementation of an Espionage Network for Cache-based Side Channel Attacks on AES

Topics: Data Protection; Applied Cryptography; Security and Privacy in the Cloud

Authors: Bholanath Roy 1 , Ravi Prakash Giri 2 , Ashokkumar C. 1 and Bernard Menezes 1

Affiliations: 1 Indian Institute of Technology - Bombay, India , 2 Shri Mata Vaishno Devi University, India

Digital Object Identifier: 10.5220/0005576804410447

Proceedings of SECRYPT 2015/ICETE, ISBN: 978-989-758-117-5

Collapse Button Quick Abstract
We design and implement the espionage infrastructure to launch a cache-based side channel attack on AES. This includes a spy controller and a ring of spy threads with associated analytic capabilities – all hosted on a single server. By causing the victim process (which repeatedly performs AES encryptions) to be interrupted, the spy threads capture the victim’s footprints in the cache memory where the lookup tables reside. Preliminary results indicate that our setup can deduce the encryption key in fewer than 30 encryptions and with far fewer victim interruptions compared to previous work. Moreover, this approach can be easily adapted to work on diverse hardware/OS platforms and on different versions of OpenSSL.
Collapse Button Related Ontology Subjects/Areas/Topics (8)
Applied Cryptography

Data Engineering

Information and Systems Security

Cryptographic Techniques and Key Management

Data Protection

Security and Privacy in the Cloud
Data and Application Security and Privacy

Databases and Data Security

Modeling Neutron Dynamics in Nuclear Reactor using Fractional-order Point Reactor Kinetics Model with Adiabatic Temperature Feedback

Topics: Dynamical Systems Models and Methods; Non-Linear Systems; Mathematical Simulation

Authors: Vishwesh Vyawahare 1 and P. S. V. Nataraj 2

Affiliations: 1 Ramrao Adik Institute of Technology, India , 2 Indian Institute of Technology Bombay, India

Digital Object Identifier: 10.5220/0005038103520360

Proceedings of SIMULTECH 2014, ISBN: 978-989-758-038-3

Collapse Button Quick Abstract
This paper deals with the development and analysis of fractional-order (FO) point reactor kinetics (FPRK) model with reactivity feedback for a nuclear reactor. Incorporation of adiabatic temperature feedback of reactivity makes this model nonlinear. It basically forms a system of coupled, nonlinear ordinary differential equations. The nonlinear subprompt critical FPRK model is developed and analyzed in detail. Fundamental motivation for this model is the fact that neutron transport inside the core of a reactor is truly a subdiffusion. The work presented here analyzes the effect of temperature feedback on the neutron concentration dynamics inside reactor core which is modeled using fractional differential equations. The system of nonlinear differential equations is solved numerically. The analysis clearly establishes the fact that the proposed model is ‘stable’ in the sense that it predicts self-limitting power excursions. The model presented in this paper constitutes an important step in the development of fractional-order model for a nuclear reactor, which can be used to achieve better control and operation.
Collapse Button Related Ontology Subjects/Areas/Topics (5)
Dynamical Systems Models and Methods

Mathematical Simulation

Simulation and Modeling
Formal Methods

Non-Linear Systems

Optimizing Elliptic Curve Scalar Multiplication with Near-Factorization

Topics: Applied Cryptography; Network Security

Authors: Pratik Poddar , Achin Bansal and Bernard Menezes

Affiliation: Indian Institute of Technology - Bombay, India

Digital Object Identifier: 10.5220/0005058703610370

Proceedings of SECRYPT 2014/ICETE, ISBN: 978-989-758-045-1

Collapse Button Quick Abstract
Elliptic curve scalar multiplication ( [k]P where k is an integer and P is a point on the elliptic curve) is widely used in encryption and signature generation. In this paper, we explore a factorization-based approach called Near-Factorization that can be used in conjunction with existing optimization techniques such as Window NAF (Non Adjacent Form). We present a performance model of Near-Factorization and validate model results with those from a simulation. We compare Near-Factorization with wNAF for a range of scalar sizes, window sizes, divisor lengths and Hamming weights of divisor. The use of Near-Factorization with wNAF results in a considerable reduction in the effective Hamming weight of the scalar and a reduction in overall computation cost for Koblitz curves.
Collapse Button Related Ontology Subjects/Areas/Topics (7)
Applied Cryptography

Databases and Data Security

Network Security

Cryptographic Techniques and Key Management

Information and Systems Security

Wireless Network Security
Data Engineering

Topic(s):

Filter listed results, by

Publication date

From:
To:
Author
Locate Author in list below
Data pager
Data pager
12345
 Page 1 of 5, items 1 to 10 of 48.
Add Author(s) to filter:
Conference
Locate Conference in list below
Add Conference(s) to filter:

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic