AVAnthony Vetro

Anthony Vetro

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Anthony Vetro has a total of 49 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Graph Signal Processing for Geometric Data and Beyond: Theory and Applications

    by Wei Hu, Jiahao Pang, Xianming Liu, Dong Tian, Chia-Wen Lin, Anthony Vetro

    Geometric data acquired from real-world scenes, e.g., 2D depth images, 3D point clouds, and 4D dynamic point clouds, have found a wide range of applications including immersive telepresence, autonomous driving, surveillance, etc. Due to irregular sampling patterns of most geometric data, traditional image/video processing methodologies are limited, while Graph Signal Processing (GSP)---a fast-developing field in the signal processing community---enables processing signals that reside on irregular domains and plays a critical role in numerous applications of geometric data from low-level processing to high-level analysis. To further advance the research in this field, we provide the first timely and comprehensive overview of GSP methodologies for geometric data in a unified manner by bridging the connections between geometric data and graphs, among the various geometric data modalities, and with spectral/nodal graph filtering techniques. We also discuss the recently developed Graph Neural Networks (GNNs) and interpret the operation of these networks from the perspective of GSP. We conclude with a brief discussion of open problems and challenges.


  • Open Access

    Graph Signal Processing for Geometric Data and Beyond: Theory and Applications

    by Wei Hu, Jiahao Pang, Xianming Liu, Dong Tian, Chia-Wen Lin, Anthony Vetro

    Geometric data acquired from real-world scenes, e.g., 2D depth images, 3D point clouds, and 4D dynamic point clouds, have found a wide range of applications including immersive telepresence, autonomous driving, surveillance, etc. Due to irregular sampling patterns of most geometric data, traditional image/video processing methodologies are limited, while Graph Signal Processing (GSP) -- a fast-developing field in the signal processing community -- enables processing signals that reside on irregular domains and plays a critical role in numerous applications of geometric data from low-level processing to high-level analysis. To further advance the research in this field, we provide the first timely and comprehensive overview of GSP methodologies for geometric data in a unified manner by bridging the connections between geometric data and graphs, among the various geometric data modalities, and with spectral/nodal graph filtering techniques. We also discuss the recently developed Graph Neural Networks (GNNs) and interpret the operation of these networks from the perspective of GSP. We conclude with a brief discussion of open problems and challenges.

  • Improving Manipulation Capabilities of Autonomous Robots

    by Anthony Vetro

    Human-level manipulation continues to be beyond the capabilities of today’s robotic systems. Not only do current industrial robots require significant time to program a specific task, but they lack the flexibility to generalize to other tasks and be robust to changes in the environment. While collaborative robots help to reduce programming effort and improve the user interface, they still fall short on generalization and robustness. This talk will highlight recent advances in a number of key areas to improve the manipulation capabilities of autonomous robots, including methods to accurately model the dynamics of the robot and contact forces, sensors and signal processing algorithms to provide improved perception, optimization-based decision-making and control techniques, as well as new methods of interactivity to accelerate and enhance robot learning.

  • Top Cited Papers

    Fast Resampling of Three-Dimensional Point Clouds via Graphs

    by Siheng Chen, Dong Tian, Chen Feng, Anthony Vetro, Jelena Kovacevic

    To reduce cost in storing, processing and visualizing a large-scale point cloud, we consider a randomized resampling strategy to select a representative subset of points while preserving application-dependent features. The proposed strategy is based on graphs, which can represent underlying surfaces and lend themselves well to efficient computation. We use a general feature-extraction operator to represent application-dependent features and propose a general reconstruction error to evaluate the quality of resampling. We obtain a general form of optimal resampling distribution by minimizing the reconstruction error. The proposed optimal resampling distribution is guaranteed to be shift, rotation and scale-invariant in the 3D space. We next specify the feature-extraction operator to be a graph filter and study specific resampling strategies based on all-pass, low-pass, high-pass graph filtering and graph filter banks. We finally apply the proposed methods to three applications: large-scale visualization, accurate registration and robust shape modeling. The empirical performance validates the effectiveness and efficiency of the proposed resampling methods.


  • Open Access

    Dimensionality reduction of visual features for efficient retrieval and classification

    by Petros T. Boufounos, Hassan Mansour, Shantanu Rane, Anthony Vetro

    Visual retrieval and classification are of growing importance for a number of applications, including surveillance, automotive, as well as web and mobile search. To facilitate these processes, features are often computed from images to extract discriminative aspects of the scene, such as structure, texture or color information. Ideally, these features would be robust to changes in perspective, illumination, and other transformations. This paper examines two approaches that employ dimensionality reduction for fast and accurate matching of visual features while also being bandwidth-efficient, scalable, and parallelizable. We focus on two classes of techniques to illustrate the benefits of dimensionality reduction in the context of various industrial applications. The first method is referred to as quantized embeddings, which generates a distance-preserving feature vector with low rate. The second method is a low-rank matrix factorization applied to a sequence of visual features, which exploits the temporal redundancy among feature vectors associated with each frame in a video. Both methods discussed in this paper are also universal in that they do not require prior assumptions about the statistical properties of the signals in the database or the query. Furthermore, they enable the system designer to navigate a rate versus performance trade-off similar to the rate-distortion trade-off in conventional compression.


  • Open Access

    Chebyshev and Conjugate Gradient Filters for Graph Image Denoising

    by Dong Tian, Hassan Mansour, Andrew Knyazev, Anthony Vetro

    In 3D image/video acquisition, different views are often captured with varying noise levels across the views. In this paper, we propose a graph-based image enhancement technique that uses a higher quality view to enhance a degraded view. A depth map is utilized as auxiliary information to match the perspectives of the two views. Our method performs graph-based filtering of the noisy image by directly computing a projection of the image to be filtered onto a lower dimensional Krylov subspace of the graph Laplacian. We discuss two graph spectral denoising methods: first using Chebyshev polynomials, and second using iterations of the conjugate gradient algorithm. Our framework generalizes previously known polynomial graph filters, and we demonstrate through numerical simulations that our proposed technique produces subjectively cleaner images with about 1-3 dB improvement in PSNR over existing polynomial graph filters.

  • Analysis of view synthesis prediction architectures in modern coding standards

    by Dong Tian, Feng Zou, Chris Lee, Anthony Vetro, Huifang Sun

    Depth-based 3D formats are currently being developed as extensions to both AVC and HEVC standards. The availability of depth information facilitates the generation of intermediate views for advanced 3D applications and displays, and also enables more efficient coding of the multiview input data through view synthesis prediction techniques. This paper outlines several approaches that have been explored to realize view synthesis prediction in modern video coding standards such as AVC and HEVC. The benefits and drawbacks of various architectures are analyzed in terms of performance, complexity, and other design considerations. It is hence concluded that block-based VSP prediction for multiview video signals provides attractive coding gains with comparable complexity as traditional motion/disparity compensation.

  • Introduction to the special section on 3D representation, compression, and rendering

    by Anthony Vetro, Pascal Frossard, Sanghoon Lee, Karsten Mueller, Jens-Rainer Ohm, Gary Sullivan

    A new set of three-dimensional (3D) data formats and associated compression technologies are emerging with the aim to achieve more flexible representation and higher compression of 3D and multiview video content. These new tools will facilitate the generation of multiview output (e.g., as needed for multiview auto-stereoscopic displays), provide richer immersive multimedia experiences, and allow new interactive applications. This special section includes a timely set of papers covering the most recent technical developments in this area with papers covering topics in the different aspects of 3D systems, from representation and compression algorithms to rendering techniques and quality assessment. This special section includes a good balance on topics that are of interest to academic, industrial, and standardization communities. We believe that this collection of papers represent the most recent advances in representation, compression, rendering, and quality assessment of 3D scenes.

  • Low complexity efficient raw SAR data compression

    by Shantanu Rane, Petros Boufounos, Anthony Vetro, Yu Okada

    We present a low-complexity method for compression of raw Synthetic Aperture Radar (SAR) data. Raw SAR data is typically acquired using a satellite or airborne platform without sufficient computational capabilities to process the data and generate a SAR image on-board. Hence, the raw data needs to be compressed and transmitted to the ground station, where SAR image formation can be carried out. To perform low-complexity compression, our method uses 1-dimensional transforms, followed by quantization and entropy coding. In contrast to previous approaches, which send uncompressed or Huffman-coded bits, we achieve more efficient entropy coding using an arithmetic coder that responds to a continuously updated probability distribution. We present experimental results on compression of raw Ku-SAR data. In those we evaluate the effect of the length of the transform on compression performance and demonstrate the advantages of the proposed framework over a state-of-the-art low complexity scheme called Block Adaptive Quantization (BAQ).