Angeline Aguinaldo

Angeline Aguinaldo

Auto-generated profile, based on publicly available information

Angeline Aguinaldo

University of Maryland College Park

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
19 December 2016 in Nature Communications
Verified
Journal Article
Open access
MCM. Cecilia Caino
M. Cecilia Caino
JSJae Ho Seo
Jae Ho Seo
AAAngeline Aguinaldo
Angeline Aguinaldo
EWEric Wait
Eric Wait
KBKelly G. Bryant
Kelly G. Bryant
DADario C. Altieri
Dario C. Altieri
The role of mitochondria in cancer is controversial. Using a genome-wide shRNA screen, we now show that tumours reprogram a network of mitochondrial dynamics operative in neurons, including syntaphilin (SNPH), kinesin KIF5B and GTPase Miro1/2 to localize mitochondria to the cortical cytoskeleton and power the membrane machinery of cell movements. When expressed in tumours, SNPH inhibits the speed and distance travelled by individual mitochondria, suppresses organelle dynamics, and blocks chemotaxis and metastasis, in vivo. Tumour progression in humans is associated with downregulation or loss of SNPH, which correlates with shortened patient survival, increased mitochondrial trafficking to the cortical cytoskeleton, greater membrane dynamics and heightened cell invasion. Therefore, a SNPH network regulates metastatic competence and may provide a therapeutic target in cancer.

5 October 2018 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Open access
MWMark Winter
Mark Winter
WMWalter C. Mankowski
Walter C. Mankowski
EWEric Wait
Eric Wait
EHEdgar Cardenas De La Hoz
Edgar Cardenas De La Hoz
AAAngeline Aguinaldo
Angeline Aguinaldo
ACAndrew R. Cohen
Andrew R. Cohen
One of the most important and error-prone tasks in biological image analysis is the segmentation of touching or overlapping cells. Particularly for optical microscopy, including transmitted light and confocal fluorescence microscopy, there is often no consistent discriminative information to separate cells that touch or overlap. It is desired to partition touching foreground pixels into cells using the binary threshold image information only, and optionally incorporating gradient information. The most common approaches for segmenting touching and overlapping cells in these scenarios are based on the watershed transform. We describe a new approach called pixel replication for the task of segmenting elliptical objects that touch or overlap. Pixel replication uses the image Euclidean distance transform in combination with Gaussian mixture models to better exploit practically effective optimization for delineating objects with elliptical decision boundaries. Pixel replication improves significantly on commonly used methods based on watershed transforms, or based on fitting Gaussian mixtures directly to the thresholded image data. Pixel replication works equivalently on both 2-D and 3-D image data, and naturally combines information from multi-channel images. The accuracy of the proposed technique is measured using both the segmentation accuracy on simulated ellipse data and the tracking accuracy on validated stem cell tracking results extracted from hundreds of live-cell microscopy image sequences. Pixel replication is shown to be significantly more accurate compared with other approaches. Variance relationships are derived, allowing a more practically effective Gaussian mixture model to extract cell boundaries for data generated from the threshold image using the uniform elliptical distribution and from the distance transform image using the triangular elliptical distribution.

16 July 2021 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
AAAngeline Aguinaldo
Angeline Aguinaldo
JBJacob Bunker
Jacob Bunker
BPBlake Pollard
Blake Pollard
ASAnkit Shukla
Ankit Shukla
ACArquimedes Canedo
Arquimedes Canedo
WRWilliam Regli
William Regli
RobotCat uses a goal-oriented, declarative approach for robot programming that leverages mathematical representations found in category theory as a way to formally model modularity and behavioral knowledge. We define hierarchical interfaces that require only local modifications when new software or work cell models are introduced, thus making robot programming more interoperable. Note to Practitioners —RoboCat can be put into practice and be beneficial to different stakeholders: 1) a student (or small, individual manufacturer) is in charge of planning the production of a new product. Instead of tedious programming, she sketches out process diagrams using conceptual templates for actions (e.g., “move,” “carry,” “locate”) that can produce vastly more resilient production plans than would normally be expected from someone without many years of experience; 2) a robot platform manufacturer has a new manipulator that they would like to provide to the existing customers. Usually, such an upgrade requires a complex retooling of the fabrication lines to accommodate the new functionality. Further complicating matters, the new manipulator contains third-party hardware and software, requiring a full re-architecting of the integrated system. Rather than a wholesale swap of the old system for the new, the third-party application programming interfaces (APIs) can be systematically translated to fit snuggly within the existing modular system with seamless interoperability; and 3) a company is designing the production process associated with their new product launch and they wish to spread their supply chain across several manufacturing vendors. Rather than writing individual process plans customized for each manufacturer, they compose a high-level plan in a functional language. This plan is compiled into implementations specific to each manufacturer’s systems, without the need for human intervention.

15 November 2017 in IEEE Pulse
Verified
Journal Article
Closed access
CGClaudia Gutierrez
Claudia Gutierrez
MPMeaghan Paulosky
Meaghan Paulosky
AAAngeline Aguinaldo
Angeline Aguinaldo
JGJackie Gerhart
Jackie Gerhart
While the field of engineering as a whole is largely male-dominated, biomedical engineering (BME) is one area poised to overturn this trend. Women in the United States were awarded only 20% of all engineering B.S. degrees in 2015; in BME, however, 40.9% of the degree recipients were women. This stands in stark contrast to the more traditional fields of mechanical and electrical engineering, where women were awarded just 13.2% and 12.5% of B.S. degrees, respectively. This trend toward more female participation in BME continues at both the M.S. and Ph.D. degree levels. In fact, in 2015, BME had the highest percentage of female engineering M.S. degree recipients in the United States of all engineering disciplines, according to the American Society for Engineering Education (Figure 1).

22 January 2024 in Proceedings of the AAAI Symposium Series
Verified
Journal Article
Open access
PDF file
AAAngeline Aguinaldo
Angeline Aguinaldo
EPEvan Patterson
Evan Patterson
JFJames Fairbanks
James Fairbanks
WRWilliam Regli
William Regli
JRJaime Ruiz
Jaime Ruiz
Classical planning representation languages based on first-order logic have preliminarily been used to model and solve robotic task planning problems. Wider adoption of these representation languages, however, is hindered by the limitations present when managing implicit world changes with concise action models. To address this problem, we propose an alternative approach to representing and managing updates to world states during planning. Based on the category-theoretic concepts of C-sets and double-pushout rewriting (DPO), our proposed representation can effectively handle structured knowledge about world states that support domain abstractions at all levels. It formalizes the semantics of predicates according to a user-provided ontology and preserves the semantics when transitioning between world states. This method provides a formal semantics for using knowledge graphs and relational databases to model world states and updates in planning. In this paper, we conceptually compare our category-theoretic representation with the classical planning representation. We show that our proposed representation has advantages over the classical representation in terms of handling implicit preconditions and effects, and provides a more structured framework in which to model and solve planning problems.

1 February 2019 in arXiv
Verified
Preprint
Open access
PDF file
AAAngeline Aguinaldo
Angeline Aguinaldo
PCPing-Yeh Chiang
Ping-Yeh Chiang
AGAlex Gain
Alex Gain
APAmeya Patil
Ameya Patil
KPKolten Pearson
Kolten Pearson
SFSoheil Feizi
Soheil Feizi
Generative Adversarial Networks (GANs) have been used in several machine learning tasks such as domain transfer, super resolution, and synthetic data generation. State-of-the-art GANs often use tens of millions of parameters, making them expensive to deploy for applications in low SWAP (size, weight, and power) hardware, such as mobile devices, and for applications with real time capabilities. There has been no work found to reduce the number of parameters used in GANs. Therefore, we propose a method to compress GANs using knowledge distillation techniques, in which a smaller "student" GAN learns to mimic a larger "teacher" GAN. We show that the distillation methods used on MNIST, CIFAR-10, and Celeb-A datasets can compress teacher GANs at ratios of 1669:1, 58:1, and 87:1, respectively, while retaining the quality of the generated image. From our experiments, we observe a qualitative limit for GAN's compression. Moreover, we observe that, with a fixed parameter budget, compressed GANs outperform GANs trained using standard training methods. We conjecture that this is partially owing to the optimization landscape of over-parameterized GANs which allows efficient training using alternating gradient descent. Thus, training an over-parameterized GAN followed by our proposed compression scheme provides a high quality generative model with a small number of parameters.