A Key‐Pose Caching System for Rendering an Animated Crowd in Real‐Time

Lister, Wayne Daniel; Laycock, Robert G.; Day, A. M.

doi:10.1111/j.1467-8659.2010.01715.x

Cited by 12 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another interesting application is related to the rendering of an animated crow in real-time [29]. In the article, the authors present a method to accelerate the visualization of large crowds of animated characters.…”

Section: The Set Union Knapsack Problemmentioning

confidence: 99%

A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

et al. 2021

View full text Add to dashboard Cite

Optimization techniques, specially metaheuristics, are constantly refined in order to decrease execution times, increase the quality of solutions, and address larger target cases. Hybridizing techniques are one of these strategies that are particularly noteworthy due to the breadth of applications. In this article, a hybrid algorithm is proposed that integrates the k-means algorithm to generate a binary version of the cuckoo search technique, and this is strengthened by a local search operator. The binary cuckoo search algorithm is applied to the NP-hard Set-Union Knapsack Problem. This problem has recently attracted great attention from the operational research community due to the breadth of its applications and the difficulty it presents in solving medium and large instances. Numerical experiments were conducted to gain insight into the contribution of the final results of the k-means technique and the local search operator. Furthermore, a comparison to state-of-the-art algorithms is made. The results demonstrate that the hybrid algorithm consistently produces superior results in the majority of the analyzed medium instances, and its performance is competitive, but degrades in large instances.

show abstract

Section: The Set Union Knapsack Problemmentioning

confidence: 99%

A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Recently, Lister et al . [LLD10] improved the efficiency of linear‐blend skinning by using the temporal and intra‐crowd coherencies that are inherent within populated scenes (see Figure 18). They achieved it through the allocation of a small geometry cache within which transformed key‐poses can be stored.…”

Section: Lossless Acceleration Techniquesmentioning

confidence: 99%

“…Current hardware features offer new possibilities for optimizing the rendering of large crowds. These techniques include primitive instancing, palette skinning, and key-pose caching [MR06b,Dud07b,LLD10].…”

Section: Introductionmentioning

confidence: 99%

A Survey of Real‐Time Crowd Rendering

Beacco

Pelechano

Andújar

2015

Computer Graphics Forum

View full text Add to dashboard Cite

In this survey we review, classify and compare existing approaches for real-time crowd rendering. We first overview character animation techniques, as they are highly tied to crowd rendering performance, and then we analyze the state of the art in crowd rendering. We discuss different representations for level-of-detail (LoD) rendering of animated characters, including polygon-based, point-based, and image-based techniques, and review different criteria for runtime LoD selection. Besides LoD approaches, we review classic acceleration schemes, such as frustum culling and occlusion culling, and describe how they can be adapted to handle crowds of animated characters. We also discuss specific acceleration techniques for crowd rendering, such as primitive pseudo-instancing, palette skinning, and dynamic key-pose caching, which benefit from current graphics hardware. We also address other factors affecting performance and realism of crowds such as lighting, shadowing, clothing and variability. Finally we provide an exhaustive comparison of the most relevant approaches in the field.

show abstract

“…Recently, Lister et al [Lister et al, 2010] improved the efficiency of linear-blend skinning by using the temporal and intra-crowd coherencies that are inherent within populated scenes. They achieved it through the allocation of a small geometry cache within which transformed key-poses can be stored.…”

Section: Dynamic Cachingmentioning

confidence: 99%

“…Figure 3.37: Dynamic caching accelerates the rendering of an animated crowd. [Lister et al, 2010] This cache size becomes also a trade off between the rendering performance and the memory usage, because it is the number of characters that have the key-poses stored in the cache that will have the greatest effect on the rendering performance. Clearly, the choice of which key-poses to store is critical to maximize the potential of the approach.…”

Section: Dynamic Cachingmentioning

confidence: 99%

Simulation, animation and rendering of crowds in real-time

Beacco Porres

View full text Add to dashboard Cite

Nowadays crowd simulation is becoming more important in computer applications such as building evacuation planning, training, videogames, etc., presenting hundreds or thousands of agents navigating in virtual environments. Some of these applications need to run in real time in order to offer complete interaction with the user. Simulated crowds should seem natural and give a good looking impression to the user. The goal should be to produce both the best motion and animation, while minimizing the awkwardness of movements and eliminating or hiding visual artifacts. Achieving simulation, animation and rendering of crowds in real-time becomes thus a major challenge. Although each of these areas has been studied individually and improvements have been made in the literature, its integration in one real-time system is not straight forward. In the process of integrating animation, simulation and rendering of real time crowds, we need to assume some trade-offs between accuracy and quality of results. The main goal of this thesis is to work on those three aspects of a real-time crowd visualization (simulation, animation and rendering) seeking for possible speed-ups and optimizations allowing us to further increase the number of agents in the simulation, to then integrate them in a real-time system, with the maximum number possible of high quality and natural looking animated agents. In order to accomplish our goal we present new techniques to achieve improvements in each one of these areas: In crowd simulation we work on a multi-domain planning approach and on planning using footsteps instead of just root velocities and positions; in animation we focus on a framework to eliminate foot sliding artifacts and on synthesizing motions of characters to follow footsteps; in rendering we provide novel techniques based on per joint impostors. Finally we present a novel framework to progressively integrate different methods for crowd simulation, animation and rendering. The framework offers level-of-detail for each of these areas, so that as new methods are integrated they can be combined efficiently to improve performance. Avui dia la simulació de multituds està agafant importància en aplicacions per computador, com la planificació d'evacuacions d'edificis, entrenament, videojocs, etc., presentant centenars o milers d'agents navegant en entorns virtuals. Algunes d'aquestes aplicacions necessiten ser executades en temps real per poder oferir una interacció completa amb l'usuari. Les multituds simulades han de resultar naturals i fer una bona impressió a l'usuari. L'objectiu ha de ser produir a la vegada tant els millors moviments com la millor animació, mentre es minimitzen els moviments estranys i s'eliminen o amaguen defectes visuals. Aconseguir la simulació, animació i visualització de multituds en temps real esdevé llavors un repte major. Encara que cadascuna d'aquestes àrees ha estat estudiada individualment i que s'han fet millores en la literatura, la seva integració en un sistema en temps real no és directa. En el procés d'integrar l'animació, la simulació i la visualització de multituds en temps real, necessitem assumir alguns equilibris entre la precisió i la qualitat dels resultats. El principal objectiu d'aquesta tesi és treballar en aquests tres aspectes de les multituds en temps real (simulació, animació i visualització) buscant possibles acceleracions i optimitzacions que ens permetin augmentar encara més el nombre d'agents simulats, per després integrar-los en un sistema en temps real, amb el màxim nombre possible de personatges d'alta qualitat i d'aspecte natural. Per aconseguir el nostre objectiu presentem noves tècniques per obtenir millores en cadascuna d'aquestes àrees: En la simulació de multituds treballem en una aproximació on es planifica en múltiples dominis, i en una planificació fent servir petjades en comptes de només velocitats i posicions dels personatges; en animació ens centrem en una arquitectura per a eliminar els problemes de lliscament dels peus i en sintetitzar els moviments d'un personatge perquè segueixi petjades; en visualització aportem noves tècniques basades en impostors per articulació. Finalment presentem una nova plataforma per a integrar progressivament diferents mètodes per a la simulació, animació i visualització de multituds. La plataforma ofereix nivells de detall per a cadascuna d'aquestes àrees, de manera que a mesura que s'integrin nous mètodes, aquests puguin ser combinats de forma eficient per a millorar el rendiment.

show abstract

A Key‐Pose Caching System for Rendering an Animated Crowd in Real‐Time

Cited by 12 publications

References 8 publications

A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem

A Survey of Real‐Time Crowd Rendering

Simulation, animation and rendering of crowds in real-time

Contact Info

Product

Resources

About