Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guan Xu

dblp:22/4479 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
1since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Image and video processing · 88% Geometric modeling and processing · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Image and video processing › pattern detection › shape detection
ellipse detection
0.912025
Accurate and Robust Three-Intersection-Chord-Invariant Ellipse Detection · IEEE Trans. Image Process. 2025
Image and video processing
feature extraction
0.912025
Accurate and Robust Three-Intersection-Chord-Invariant Ellipse Detection · IEEE Trans. Image Process. 2025
Geometric modeling and processing
arc segmentation
0.312025
Accurate and Robust Three-Intersection-Chord-Invariant Ellipse Detection · IEEE Trans. Image Process. 2025
Image and video processing
edge detection
0.312025
Accurate and Robust Three-Intersection-Chord-Invariant Ellipse Detection · IEEE Trans. Image Process. 2025

Methods — techniques the papers use, named apart from their topics

chord-invariant model · 0.9arc segment clustering · 0.9PCA minimum bounding box · 0.9
YearPublicationVenuePosition
2025 Accurate and Robust Three-Intersection-Chord-Invariant Ellipse Detection
abstract
Ellipse detection is of great significance in the fields of image processing and computer vision. Accurate, stable and direct ellipse detection in real-world images has always been a key issue. Therefore, an ellipse detection method is proposed on the basis of the constructed three-intersection-chord-invariant. First, in the inflexion point detection, the PCA minimum bounding box considering the distribution characteristics of edge points is studied to achieve the more refined line segment screening. Second, a multi-scale inflexion point detection method is proposed to effectively avoid over-segmentation of small arc segments, providing assurance for more reasonable and reliable arc segment combinations. Then, the 20 precisely classified arc segment combinations are refined into 4 combinations. A number of non-homologous arc segment combinations can be quickly removed to reduce incorrect combinations by the constructed midpoint distance constraint and quadrant constraint. Moreover, in order to accurately reflect the strict arc segment combination constraints of geometric features of ellipses, a three-intersection-chord-invariant model of ellipses is established with strong constraint of relative distances among five constraint points, by which a more robust initial ellipse set of homologous arc segment combinations is further obtained. Finally, ellipse validation and clustering are performed on the initial set of ellipses to obtain the high-precision ellipses. The algorithm accuracy of the ellipse detection method is experimentally validated on 6 publicly available datasets and 2 established wheel rim datasets.
Guan Xu, Yunkun Wang, Hui Shen 0003, Xiaotao Li
IEEE Trans. Image Process.1
2020 Multiple Delay and Sum With Enveloping Beamforming Algorithm for Photoacoustic Imaging
abstract
Delay and Sum (DAS) is one of the most common beamforming algorithms for photoacoustic imaging (PAI) reconstruction. Based on calculating beamformed signal with simple delaying and summing, DAS can function in a quick response and is quite suitable for real-time PAI. However, high sidelobes and intense artifacts may appear when using DAS due to summing with unnecessary data. In this paper, a beamforming algorithm called Multiple Delay and Sum with Enveloping (multi-DASE) is introduced to solve this problem. Compared to DAS, the multi-DASE algorithm calculates not only the initial value of the beamformed signal but also the complete N-shaped photoacoustic signal for each pixel. Through computer simulation, a phantom experiment and experiment on human finger joint, the multi-DASE algorithm is compared with other beamforming methods in removing artifacts by evaluating the quality of the reconstructed images. Furthermore, by rearranging the calculation sequences, the multi-DASE algorithm can be computing in parallel using GPU acceleration to meet the needs of real-time clinical application.
Xiang Ma 0007, Chenglei Peng, Guan Xu, Xueding Wang, Paul L. Carson
IEEE Trans. Medical Imaging5
2017 Bandwidth-aware energy efficient flow scheduling with SDN in data center networks
Guan Xu, Bin Dai 0002, Benxiong Huang, Jun Yang 0011, Sheng Wen
Future Gener. Comput. Syst.1
2017 Enabling network innovation in data center networks with software defined networking: A survey
Bin Dai 0002, Guan Xu, Bengxiong Huang, Peng Qin 0003, Yang Xu 0010
J. Netw. Comput. Appl.2
2016 Taking a free ride for routing topology inference in peer-to-peer networks
Peng Qin 0003, Bin Dai 0002, Guan Xu, Kui Wu 0001, Benxiong Huang
Peer-to-Peer Netw. Appl.3
2015 Challenges and opportunities on network resource management in DCN with SDN
abstract
With the explosive growth of applications and application traffic, data centers networks are challenged in network utilization and network performance, which is crucial to guarantee the efficiency of computing and storage resources of data center servers. Recently, software defined network has been exploited to manage the network resource in a center controller, which provides opportunities to optimize the network resource utilization. In this paper, we analyze the challenges of the network resource management in data center with software defined network, and point out the opportunities.
Guan Xu, Jun Yang 0011, Bin Dai 0002
IEEE BigData1
2013 A survey and tutorial of wireless relay network protocols based on network coding
Ahmed Hassan M. Hassan, Bin Dai 0002, Benxiong Huang, Muhammad Azhar Iqbal, Guan Xu, Peng Qin 0003, Shui Yu 0001
J. Netw. Comput. Appl.5