Adrian M. Peter

Dr. Adrian M. Peter

Computer Engineering and Sciences, Florida Institute of Technology, Melbourne, Florida, USA
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
14 March 2008 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
Adrian M. PeterAdrian M. Peter
Adrian M. Peter
ARAnand Rangarajan
Anand Rangarajan
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g., statistical data analysis and information-theoretic image registration. Of late, wavelet-based density estimators have gained in popularity due to their ability to approximate a large class of functions, adapting well to difficult situations such as when densities exhibit abrupt changes. The decision to work with wavelet density estimators brings along with it theoretical considerations (e.g., non-negativity, integrability) and empirical issues (e.g., computation of basis coefficients) that must be addressed in order to obtain a bona fide density. In this paper, we present a new method to accurately estimate a non-negative density which directly addresses many of the problems in practical wavelet density estimation. We cast the estimation procedure in a maximum likelihood framework which estimates the square root of the density , allowing us to obtain the natural non-negative density representation . Analysis of this method will bring to light a remarkable theoretical connection with the Fisher information of the density and, consequently, lead to an efficient constrained optimization procedure to estimate the wavelet coefficients. We illustrate the effectiveness of the algorithm by evaluating its performance on mutual information-based image registration, shape point set alignment, and empirical comparisons to known densities. The present method is also compared to fixed and variable bandwidth kernel density estimators.

31 March 2008 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
Adrian M. PeterAdrian M. Peter
Adrian M. Peter
ARAnand Rangarajan
Anand Rangarajan
Shape matching plays a prominent role in the comparison of similar structures. We present a unifying framework for shape matching that uses mixture models to couple both the shape representation and deformation. The theoretical foundation is drawn from information geometry wherein information matrices are used to establish intrinsic distances between parametric densities. When a parameterized probability density function is used to represent a landmark-based shape, the modes of deformation are automatically established through the information matrix of the density. We first show that given two shapes parameterized by Gaussian mixture models (GMMs), the well-known Fisher information matrix of the mixture model is also a Riemannian metric (actually, the Fisher-Rao Riemannian metric) and can therefore be used for computing shape geodesics. The Fisher-Rao metric has the advantage of being an intrinsic metric and invariant to reparameterization. The geodesic-computed using this metric-establishes an intrinsic deformation between the shapes, thus unifying both shape representation and deformation. A fundamental drawback of the Fisher-Rao metric is that it is not available in closed form for the GMM. Consequently, shape comparisons are computationally very expensive. To address this, we develop a new Riemannian metric based on generalized \phi-entropy measures. In sharp contrast to the Fisher-Rao metric, the new metric is available in closed form. Geodesic computations using the new metric are considerably more efficient. We validate the performance and discriminative capabilities of these new information geometry-based metrics by pairwise matching of corpus callosum shapes. We also study the deformations of fish shapes that have various topological properties. A comprehensive comparative analysis is also provided using other landmark-based distances, including the Hausdorff distance, the Procrustes metric, landmark-based diffeomorphisms, and the bending energies of the thin-plate (TPS) and Wendland splines.

1 September 2009
Verified
Conference Paper
Closed access
JHJeffrey Ho
Jeffrey Ho
Adrian M. PeterAdrian M. Peter
Adrian M. Peter
ARAnand Rangarajan
Anand Rangarajan
MYMing-Hsuan Yang
Ming-Hsuan Yang
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using either Gaussian mixture models or discrete density models, and the problem of registering the point sets is treated as aligning the two distributions. Since polynomials transform as symmetric tensors under an affine transformation, the distributions' moments, which are the expected values of polynomials, also transform accordingly. Therefore, instead of solving the harder problem of aligning the two distributions directly, we solve the softer problem of matching the distributions' moments. By formulating a least-squares problem for matching moments of the two distributions up to degree three, the resulting cost function is a polynomial that can be efficiently optimized using techniques originated from algebraic geometry: the global minimum of this polynomial can be determined by solving a system of polynomial equations. The algorithm is robust in the presence of noises and outliers, and we validate the proposed algorithm on a variety of point sets with varying degrees of deformation and noise.

11 February 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
SQShaoyu Qi
Shaoyu Qi
YCYu-Tseh Jason Chi
Yu-Tseh Jason Chi
Adrian M. PeterAdrian M. Peter
Adrian M. Peter
JHJeffrey Ho
Jeffrey Ho
This paper proposes a novel image-retargeting algorithm that can retarget images to a large family of non-rectangular shapes. Specifically, we study image retargeting from a broader perspective that includes the content as well as the shape of an image, and the proposed content and shape-aware image-retargeting (CASAIR) algorithm is driven by the dual objectives of image content preservation and image domain transformation, with the latter defined by an application-specific target shape. The algorithm is based on the idea of seam segment carving that successively removes low-cost seam segments from the image to simultaneously achieve the two objectives, with the selection of seam segments determined by a cost function incorporating inputs from image content and target shape. To provide a complete characterization of shapes that can be obtained using CASAIR, we introduce the notion of bhv-convex shapes, and we show that bhv-convex shapes are precisely the family of shapes that can be retargeted to by CASAIR. The proposed algorithm is simple in both its design and implementation, and in practice, it offers an efficient and effective retargeting platform that provides its users with considerable flexibility in choosing target shapes. To demonstrate the potential of CASAIR for broadening the application scope of image retargeting, this paper also proposes a smart camera-projector system that incorporates CASAIR. In the context of ubiquitous display, CASAIR equips the camera-projector system with the capability of retargeting images online in order to maximize the quality and fidelity of the displayed images whenever the situation demands.


25 March 2023 in Data in Brief
Verified
Journal Article
Open access
RKRuksana Kabealo
Ruksana Kabealo
SWSteven Wyatt
Steven Wyatt
AAAkshay Aravamudan
Akshay Aravamudan
XZXi Zhang
Xi Zhang
DADavid N. Acaron
David N. Acaron
ELEric Lam
Eric Lam
Early detection of firearm discharge has become increasingly critical for situational awareness in both civilian and military domains. The ability to determine the location and model of a discharged firearm is vital, as this can inform effective response plans. To this end, several gunshot audio datasets have been released that aim to facilitate gunshot detection and classification of a discharged firearm based on acoustic signatures. However, these datasets often suffer from a lack of variety in the orientations of recording devices around the source of the gunshot. Additionally, these datasets often suffer from the absence of proper time synchronization, which prevents the usage of these datasets for determining the Direction of Arrival (DoA) of the sound. In this paper, we present a multi-firearm, multi-orientation time-synchronized audio dataset collected in a semi-controlled real-world setting – providing us a degree of supervision – using several edge devices positioned in and around an outdoor firing range.