Jove
Visualize
Contact Us

Related Concept Videos

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
State Space Representation01:27

State Space Representation

The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
Conservative Vector Fields01:29

Conservative Vector Fields

A conservative vector field describes a force or field in which the work done between two points depends only on the initial and final positions. For a ball moving in Earth’s gravitational field, gravity performs work determined by the difference in height, regardless of whether the ball moves vertically or follows a curved trajectory.A vector field is conservative if it can be expressed as the gradient of a scalar potential function, f. In two dimensions, this is written...
Linearization and Approximation01:26

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Assessing the quality of whole slide images in cytology from nuclei features.

Journal of pathology informatics·2025
Same author

Two-Stage Hybrid Convolutional-Transformer Models for Breast Cancer Histopathology.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2025
Same author

Tug of War games and PDEs on graphs with applications in image and high dimensional data processing.

Scientific reports·2023
Same author

Multi-features extraction based on deep learning for skin lesion classification.

Tissue & cell·2021
Same author

A Novel Iterative MLEM Image Reconstruction Algorithm Based on Beltrami Filter: Application to ECT Images.

Tomography (Ann Arbor, Mich.)·2021
Same author

Improved Simultaneous Algebraic Reconstruction Technique Algorithm for Positron-Emission Tomography Image Reconstruction via Minimizing the Fast Total Variation.

Journal of medical imaging and radiation sciences·2019
Same journal

Mask-guided Asymmetric Contrastive and Semantic Alignment for Unsupervised Person Re-Identification.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Hyperbolic Cycle Alignment for Infrared-Visible Image Fusion.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Learning Gaze Synthesizer via 3D-eye Controlled Diffusion and Cross-domain Feature Alignment.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Underlying Semantic Diffusion for Effective and Efficient In-Context Learning.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

DiffRES: Unleashing Text-to-Image Diffusion Models for Generative Referring Expression Segmentation without Information Leakage.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same journal

Location Matters: Frequency-Spatial Dual Space Adaptation for Cross-Domain Few-Shot Segmentation.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Nonlocal discrete regularization on weighted graphs: a framework for image and manifold processing.

Abderrahim Elmoataz1, Olivier Lezoray, Sébastien Bougleux

  • 1Université de Caen Basse-Normandie, and ENSICAEN, GREYC Laboratory, Image Team, Caen Cedex, France. abder.elmoataz@greyc.ensicaen.fr

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society
|July 1, 2008
PubMed
Summary
This summary is machine-generated.

We developed a new nonlocal discrete regularization framework for image and manifold processing. This versatile method uses weighted graphs and a p-Dirichlet energy to enable fast, nonlinear processing on various data types.

Related Experiment Videos

Area of Science:

  • Computer Vision
  • Image Processing
  • Computational Geometry

Background:

  • Traditional image and manifold processing methods often struggle with complex data structures and arbitrary topologies.
  • Existing nonlocal and semi-local methods offer improvements but can lack a unified theoretical framework.
  • Continuous regularization functionals have shown promise but require discrete analogues for practical application.

Purpose of the Study:

  • To introduce a novel nonlocal discrete regularization framework applicable to weighted graphs with arbitrary topologies.
  • To establish a variational approach minimizing a combination of regularization and approximation energy terms.
  • To provide a discrete analogue of continuous nonlocal regularization functionals for broader applicability.

Main Methods:

  • Formulating the problem as a variational approach involving minimization of a weighted sum of energies.
  • Utilizing a discrete weighted p-Dirichlet energy for regularization.
  • Developing nonlinear processing methods based on the weighted p-Laplace operator, parameterized by p, graph structure, and weights.

Main Results:

  • The proposed framework yields simple and fast nonlinear processing methods.
  • These methods are graph-based versions of established techniques like bilateral, TV digital, and nonlocal means filters.
  • The approach demonstrates equal efficacy on 2-D/3-D images, meshes, manifolds, and general graph-represented data.

Conclusions:

  • The nonlocal discrete regularization framework offers a unified and flexible approach for diverse data processing tasks.
  • The method's adaptability to arbitrary graph topologies and weighted structures enhances its practical utility.
  • This work extends nonlocal regularization concepts to discrete settings, enabling efficient processing of complex data.