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

Danfeng Li

dblp:02/3558 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
1since 2021 · last 2025
0000-0001-6894-6765ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author

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
Audio and music processing · 100%
Artificial intelligence
1 paper
Speech recognition and synthesis · 100%
Computer networks
1 paper
Wireless sensing and localization · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis › speech separation › computational auditory scene analysis
robot audition
0.012002
A Linear Phase Unwrapping Method for Binaural Sound Source Localization on a Robot · ICRA 2002
Audio and music processing › sound source localization
binaural localization
0.012002
A Linear Phase Unwrapping Method for Binaural Sound Source Localization on a Robot · ICRA 2002
Audio and music processing
sound source localization
0.012002
A Linear Phase Unwrapping Method for Binaural Sound Source Localization on a Robot · ICRA 2002
Wireless sensing and localization › ranging
time difference of arrival
0.012002
A Linear Phase Unwrapping Method for Binaural Sound Source Localization on a Robot · ICRA 2002

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

phase unwrapping · 0.1cross power spectrum · 0.1TDOA · 0.1
YearPublicationVenuePosition
2025 Seg2Any: Open-set Segmentation-Mask-to-Image Generation with Precise Shape and Semantic Control
abstract
Despite recent advances in diffusion models, top-tier text-to-image (T2I) models still struggle to achieve precise spatial layout control, *i.e.* accurately generating entities with specified attributes and locations. Segmentation-mask-to-image (S2I) generation has emerged as a promising solution by incorporating pixel-level spatial guidance and regional text prompts. However, existing S2I methods fail to simultaneously ensure semantic consistency and shape consistency. To address these challenges, we propose Seg2Any, a novel S2I framework built upon advanced multimodal diffusion transformers (*e.g.* FLUX). First, to achieve both semantic and shape consistency, we decouple segmentation mask conditions into regional semantic and high-frequency shape components. The regional semantic condition is introduced by a Semantic Alignment Attention Mask, ensuring that generated entities adhere to their assigned text prompts. The high-frequency shape condition, representing entity boundaries, is encoded as an Entity Contour Map and then introduced as an additional modality via multi-modal attention to guide image spatial structure. Second, to prevent attribute leakage across entities in multi-entity scenarios, we introduce an Attribute Isolation Attention Mask mechanism, which constrains each entity’s image tokens to attend exclusively to themselves during image self-attention. To support open-set S2I generation, we construct SACap-1M, a large-scale dataset containing 1 million images with 5.9 million segmented entities and detailed regional captions, along with a SACap-Eval benchmark for comprehensive S2I evaluation. Extensive experiments demonstrate that Seg2Any achieves state-of-the-art performance on both open-set and closed-set S2I benchmarks, particularly in fine-grained spatial and attribute control of entities.
Danfeng Li, Hui Zhang 0090, Zuxuan Wu
NeurIPS1
2003 A Bayes-rule based hierarchical system for binaural sound source localization
abstract
A Bayes-rule based hierarchical binaural sound source localization system is proposed. By combining three localization cues: interaural time differences (ITDs), interaural intensity differences (IIDs), and spectral cues, and a hierarchical decision making structure, this system enables a sound source to be located in a 3D space by using only the binaural inputs. Preliminary simulations have shown the effectiveness of this system. It can be used in studying binaural localization mechanism and applications such as in hearing aids and robotics.
Danfeng Li, Stephen E. Levinson
ICASSP (5)1
2003 Automatic language acquisition by an autonomous robot
abstract
There is no such thing as a disembodied mind. We posit that cognitive development can only occur through interaction with the physical world. To this end, we are developing a robotic platform for the purpose of studying cognition. We suggest that the central component of cognition is a memory which is primarily associative, one where learning occurs as the correlation of events from diverse inputs. We also posit that human-like cognition requires a well-integrated sensory-motor system, to provide these diverse inputs. As implemented in our robot, this system includes binaural hearing, stereo vision, tactile sense, and basic proprioceptive control. On top of these abilities, we are implementing and studying various models of processing, learning and decision making. Our goal is to produce a robot that will learn to carry out simple tasks in response to natural language requests. The robot's understanding of language will be learned concurrently with its other cognitive abilities. We have already developed a robust system and conducted a number or experiments on the way to this goal, some details of which appear in this paper. This is a first progress report of what we believe will be a long term project with significant implications.
Stephen E. Levinson, Weiyu Zhu, Danfeng Li, Kevin Squire, Ruei-Sung Lin, Matthew Kleffner, Matthew McClain, Johnny Lee
IJCNN3
2002 A Linear Phase Unwrapping Method for Binaural Sound Source Localization on a Robot
abstract
A robust linear phase unwrapping method is proposed to solve the 2/spl pi/ discontinuities in the phase of the cross power spectrum from the binaural inputs using two omnidirectional microphones. The relative incident angle of the interested sound is then estimated according to the time difference of arrival (TDOA) which is obtained from the unwrapped phase of the cross power spectrum. The frequency components associated with the high power are clustered into groups by the phase and frequency distance, and the dominant group is then used to obtain the initial slope estimation. The phase is unwrapped by checking the difference between the actual and the predicted phase by the estimated slope. The re-estimation is then performed by the unwrapped phase. The algorithm is tested under different incident angles and signal to noise ratio (SNR) using real speech signal and white Gaussian noise. The simulation results show the high accuracy and the robustness. This method is also Implemented to control a robot to adaptively adjust itself to the position facing the sound source directly. The satisfactory result was achieved in an open house demonstration.
Danfeng Li, Stephen E. Levinson
ICRA1
2001 HMM topology optimization for handwriting recognition
abstract
This paper addresses the problem of hidden Markov model (HMM) topology estimation in the context of on-line handwriting recognition. HMM have been widely used in applications related to speech and handwriting recognition with great success. One major drawback with these approaches, however, is that the techniques that they use for estimating the topology of the models (number of states, connectivity between the states and the number of Gaussians), are usually heuristically derived, without optimal certainty. This paper addresses this problem, by comparing a couple of commonly used heuristically derived methods to an approach that uses the Bayesian information criterion (BIC) for computing the optimal topology. Experimental results on discretely written letters show that using BIC gives comparable results to heuristic approaches with a model that has nearly 10% fewer parameters.
Danfeng Li, Alain Biem, Jayashree Subrahmonia
ICASSP1