Fast and Famous: Looking for the Fastest Speed at Which a Face Can be Recognized

Gladys Barragan-Jason1, Gabriel Besson, Mathieu Ceccaldi

  • 1Centre de Recherche Cerveau et Cognition, Université de Toulouse, CNRS-UMR 5549 Toulouse, France.

Related Concept Videos

Association Areas of the Cortex01:21

Association Areas of the Cortex

Association areas are regions of the cerebral cortex that do not have a specific sensory or motor function. Instead, they integrate and interpret information from various sources to enable higher cognitive processes such as memory, learning, and decision-making. Some key association areas include the following:
Prefrontal Association Area: This area is located in the frontal lobe and is involved in planning, decision-making, and moderating social behavior. It connects with primary motor areas,...
Prosopagnosia01:24

Prosopagnosia

Prosopagnosia, also known as face blindness, is the inability to recognize faces. In severe cases, individuals with prosopagnosia may not recognize close family members, including parents and spouses, by their faces. For instance, someone with prosopagnosia might walk past their child in a crowd, only realizing their mistake upon noticing their child's distinctive backpack or favorite jacket. Prosopagnosia specifically impairs facial recognition, while the recognition of other objects or...
Parallel Processing01:20

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Fast Reactions01:27

Fast Reactions

Fast reactions occurring in times shorter than the time needed to mix reactants pose a unique challenge for investigation. In a liquid-phase continuous-flow system, reactants A and B are swiftly pushed into the mixing chamber, where mixing occurs within 1 ms. The reaction mixture then flows through an observation tube, and one measures light absorption to determine species concentrations at various points of the tube. This method is most appropriate when relatively large volumes of reactants...