Parag Agarwal

Learn More
Digital watermarking for copyright protection of 3-D meshes cannot be directly applied to point clouds, since we need to derive consistent connectivity information, which might change due to attacks, such as noise addition and cropping. Schemes for point clouds operate only on the geometric data and, hence, are generic and applicable to mesh-based(More)
In this paper, we propose a scheme to enhance the robustness of authentication based watermarking algorithms for 3D models (3D meshes) against compression and decompression. We target different compression techniques such as Compressed Progressive Meshes (CPM) [9], Progressive Forest Split (PFS) compression [11], and Progressive Mesh (PM) [7]. The idea(More)
The commercial reuse of 3D motion capture (Mocap) data in animation and life sciences raises issues with respect to its copyright. In order to improvise content protection of Mocap data, we devise a substitutive blind watermarking technique. This technique visualizes 3D Mocap data as a series of non-intersecting cluster of triangles. Bits are encoded inside(More)
The paper discusses an approach involving digital image processing and geometric logic for recognition of two dimensional shapes of objects such as squares, circles, rectangles and triangles as well as the color of the object. This approach can be extended to applications like robotic vision and computer intelligence. The methods involved are three(More)
The paper improves the reliability of audio streams in a lossy channel. The mechanism groups audio data samples into source and carrier sets. The carrier set carry the information about the source set which is encoded using data hiding methodology quantization index modulation. At the receiver side, a missing source data sample can be reconstructed using(More)
Animation authoring involves an author’s interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detection and prediction of collision in minimal time and with high accuracy is a challenge. This paper proposes using the bounding volume-based space subdivision mechanism to reduce search(More)