Works (6)

Updated: February 19th, 2024 08:11

2022 article

Learning Local-Global Contextual Adaptation for Multi-Person Pose Estimation

2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), pp. 13055–13064.

By: N. Xue n, T. Wu n, G. Xia* & L. Zhang*

TL;DR: This paper proposes a multi-person pose estimation approach, dubbed as LOGO-CAP, by learning the LOcal-GlObal Contextual Adaptation for human Pose, which is end-to-end trainable with near real-time inference speed in a single forward pass, obtaining state-of-the-art performance on the COCO keypoint benchmark for bottom-up human pose estimation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: December 19, 2022

2020 article

Holistically-Attracted Wireframe Parsing

2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), pp. 2785–2794.

TL;DR: This paper presents a fast and parsimonious parsing method to accurately and robustly detect a vectorized wireframe in an input image with a single forward pass, and is thus called Holistically-Attracted Wireframe Parser (HAWP). (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: March 15, 2021

2019 article

Learning Attraction Field Representation for Robust Line Segment Detection

2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), pp. 1595–1603.

TL;DR: A region-partition based attraction field dual representation for line segment maps, which poses the problem of line segment detection (LSD) as the region coloring problem and harnesses the best practices developed in ConvNets based semantic segmentation methods such as the encoder-decoder architecture and the a-trous convolution. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: July 13, 2020

2016 conference paper

H-2-clustering of closed-loop consensus networks under a class of LQR design

2016 american control conference (acc), 7141–7146.

By: N. Xue n & A. Chakrabortty n

TL;DR: An upper bound on the difference between the closed-loop transfer matrix of the original network with the full-order controller and that with the projected controller is derived in terms of P, and a design for P using K-means is proposed that tightens the bound while guaranteeing numerical feasibility. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2016 conference paper

H-2-clustering of closed-loop consensus networks under generalized LQR designs

2016 ieee 55th conference on decision and control (cdc), 5116–5121.

By: N. Xue n & A. Chakrabortty n

TL;DR: An upper bound is derived on the difference between the closed-loop transfer matrix of the original network with the full-order controller and that with the projected controller in the sense of ℋ2 norm and a design for P is proposed using weighted k-means that tightens the bound. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2016 journal article

Parallel Identification of Power System Dynamic Models Under Scheduling Constraints

IEEE TRANSACTIONS ON POWER SYSTEMS, 31(6), 4584–4594.

By: N. Xue n & A. Chakrabortty n

author keywords: Parallel algorithms; system identification; least-squares; integer programming; synchrophasor
TL;DR: Two sets of parallel algorithms for identifying real-time, small-signal dynamic models of power systems using multiple sources of Synchrophasor data are presented and a novel scheduling algorithm is proposed to enable flexible deadlines that meet these constraints. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.