Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Speckles: Microscopic Analysis

In course

MICRO-321: Optical engineering

Ce cours présente différentes facettes de l'optique moderne et met à la fois l'accent sur des bases rigoureuses et des applications pratiques. Le cours inclut une partie théorique avec un cours et des exercices, ainsi qu'une partie expérimentale avec des t ...

Description

This lecture covers the microscopic analysis of speckles, including topics such as labeling, quantification, and position determination. The instructor discusses the use of various techniques for speckle analysis and their applications in research.

Instructors (2)

Olivier Martin

Olivier J.F. Martin received the M.Sc. and Ph.D. degrees in physics in 1989 and 1994, respectively, from the Swiss Federal Institute of Technology, Lausanne (EPFL), Switzerland. In 1989, he joined IBM Zurich Research Laboratory, where he investigated thermal and optical properties of semiconductor laser diodes. Between 1994 and 1997 he was a research staff member at the Swiss Federal Institute of Technology, Zurich (ETHZ). In 1997 he received a Lecturer fellowship from the Swiss National Science Foundation (SNSF). During the period 1996-1999, he spent a year and a half in the U.S.A., as invited scientist at the University of California in San Diego (UCSD). In 2001 he received a Professorship grant from the SNSF and became Professor of Nano-Optics at the ETHZ. In 2003, he was appointed Professor of Nanophotonics and Optical Signal Processing at the Swiss Federal Institute of Technology, Lausanne (EPFL), where he is currently head of the Nanophotonics and Metrology Laboratory and Director of the Microengineering Section.

Karim Achouri

Official source

Related concepts (5)

Quantifier (logic)

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula.

Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

Existential quantification

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some". It is usually denoted by the logical operator symbol ∃, which, when used together with a predicate variable, is called an existential quantifier ("∃x" or "∃(x)" or "(∃x)"). Existential quantification is distinct from universal quantification ("for all"), which asserts that the property or relation holds for all members of the domain.

Branching quantifier

In logic a branching quantifier, also called a Henkin quantifier, finite partially ordered quantifier or even nonlinear quantifier, is a partial ordering of quantifiers for Q ∈ {∀,∃}. It is a special case of generalized quantifier. In classical logic, quantifier prefixes are linearly ordered such that the value of a variable ym bound by a quantifier Qm depends on the value of the variables y1, ..., ym−1 bound by quantifiers Qy1, ..., Qym−1 preceding Qm. In a logic with (finite) partially ordered quantification this is not in general the case.

Uniqueness quantification

In mathematics and logic, the term "uniqueness" refers to the property of being the one and only object satisfying a certain condition. This sort of quantification is known as uniqueness quantification or unique existential quantification, and is often denoted with the symbols "∃!" or "∃=1". For example, the formal statement may be read as "there is exactly one natural number such that ". The most common technique to prove the unique existence of a certain object is to first prove the existence of the entity with the desired condition, and then to prove that any two such entities (say, and ) must be equal to each other (i.

Related lectures (31)

The Role of Symmetries

Delves into symmetries in physics, covering group theory, perturbation, and quantification.

Predicate Logic: Quantifiers, CNF, DNF

Covers Predicate Logic, focusing on Quantifiers, CNF, and DNF.

Inference Engines: Resolution and Horn Clauses

Covers inference engines based on resolution, Horn clauses, filtering, and unification in artificial intelligence.

Automated PV Hosting Capacity Quantification

Explores the development of an open-source tool for automated PV hosting capacity quantification in distribution networks using Power Factory.

Methods in Immunology: Part I MOOC: Introduction to immunology (part 2)