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

John W. Nicholson 0001

dblp:261/4256-1 · also John Nicholson 0001, John Weldon Nicholson · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0005-3193-9082ORCID · verified

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 · 3 · 3 since 2021Human-computer interaction and ubiquitous computing · 1 · 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
Visual content generation and editing · 100%

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

TopicWeightPapersLastEvidence papers
Visual content generation and editing › face editing
face aging
0.912025
The Aging Multiverse: Generating Condition-Aware Facial Aging Tree via Training-Free Diffusion · SIGGRAPH Asia 2025
Visual content generation and editing
face editing
0.912025
The Aging Multiverse: Generating Condition-Aware Facial Aging Tree via Training-Free Diffusion · SIGGRAPH Asia 2025

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

diffusion model · 0.9attention mixing · 0.9
YearPublicationVenuePosition
2026 From Darkness to Detail: Frequency-Aware SSMs for Low-Light Vision
abstract
Low-light image enhancement remains a persistent challenge in computer vision, where state-of-the-art models are often hampered by hardware constraints and computational inefficiency, particularly at high resolutions. While foundational architectures like transformers and diffusion models have advanced the field, their computational complexity limits their deployment on edge devices. We introduce ExpoMamba, a novel architecture that integrates a frequency-aware state-space model within a modified U-Net. ExpoMamba is designed to address mixed-exposure challenges by decoupling the modeling of amplitude (intensity) and phase (structure) in the frequency domain. This allows for targeted enhancement, making it highly effective for real-time applications, including downstream tasks like object detection and segmentation. Our experiments on six benchmark datasets show that ExpoMamba is up to 2-3x faster than competing models and achieves a 6.8\% PSNR improvement, establishing a new state-of-the-art in efficient, high-quality low-light enhancement. Source code: https://www.github.com/eashanadhikarla/ExpoMamba.
Eashan Adhikarla, Kai Zhang 0039, John W. Nicholson 0001, Brian D. Davison 0001
WACV4
2025 The Aging Multiverse: Generating Condition-Aware Facial Aging Tree via Training-Free Diffusion
abstract
We introduce the Aging Multiverse, a framework for generating multiple plausible facial aging trajectories from a single image, each conditioned on external factors such as environment, health, and lifestyle. Unlike prior methods that model aging as a single deterministic path, our approach creates an aging tree that visualizes diverse futures. To enable this, we propose a training-free diffusion-based method that balances identity preservation, age accuracy, and condition control. Our key contributions include attention mixing to modulate editing strength and a Simulated Aging Regularization strategy to stabilize edits. Extensive experiments and user studies demonstrate state-of-the-art performance across identity preservation, aging realism, and conditional alignment, outperforming existing editing and age-progression models, which often fail to account for one or more of the editing criteria. By transforming aging into a multi-dimensional, controllable, and interpretable process, our approach opens up new creative and practical avenues in digital storytelling, health education, and personalized visualization.
Bang Gong, Luchao Qi, Jiaye Wu 0001, Zhicheng Fu, Chunbo Song, John W. Nicholson 0001, Roni Sengupta
SIGGRAPH Asia6
2024 Unified-EGformer: Exposure Guided Lightweight Transformer for Mixed-Exposure Image Enhancement
Eashan Adhikarla, Kai Zhang 0039, Rosaura G. VidalMata, Manjushree B. Aithal, Nikhil Ambha Madhusudhana, John W. Nicholson 0001, Lichao Sun 0001, Brian D. Davison 0001
ICPR (29)6
2008 Maintaining population diversity by maintaining family structures
abstract
The selection event algorithm introduced an interesting method of creating offspring from parents in a multi-generational manner with a period of fitness neutrality followed by an intense selection event. This algorithm did not have a focus on maintaining diversity in the population, so it had all of the same pitfalls as other algorithms lacking such a focus. However, due to the novel multi-generational growth structure a natural family tree is created in the population, allowing for an equally natural diversity maintenance to be implemented which does not require any artificial diversity constraints to be placed on the fitness function. Instead, diversity is maintained (and encouraged) in the population through the growth dynamics of each family.
John W. Nicholson 0001, Mark White 0003
GECCO1
2006 Benefits of a Periodic Selection Event in Evolutionary Strategy Algorithms
abstract
We compare common, fixed population size evolutionary strategies with a strategy incorporating a growing population size and intermittent selection events. In the latter strategy, the population size grows geometrically and selection free every generation. After a fixed number of generations, a selection event occurs which kills many of the individuals in the population and reduces the population size back to an initial value. The quality of solutions and speed of this algorithm are compared using four real-valued problem domains, to common evolutionary strategy algorithms based on (μ, λ) and (μ + λ), with promising results.
John W. Nicholson 0001, Mark White 0003
IEEE Congress on Evolutionary Computation1