Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Cluster Sampling Method

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...

Applications of Integration to Find Centers of Mass

Applications of Integration to Find Centers of Mass

Rotational equilibrium provides a natural framework for defining the center of mass of a system. For a plank balanced on a pivot with two unequal masses, equilibrium is achieved when the net torque about the pivot is zero. Torque is defined as the product of a force and its perpendicular distance from the pivot. When the torques due to all forces cancel, the pivot coincides with the center of mass of the system.For a system composed of several discrete point masses, the center of mass lies at...

Extraction: Partition and Distribution Coefficients

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...

You might also read

Related Articles

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

Sort by

Same author

A preclinical model of hyperalgesia following spinal stenosis/compression.

European journal of pain (London, England)·2015

Same author

A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms.

IEEE transactions on pattern analysis and machine intelligence·2012

Same author

Curvature and tangential deflection of discrete arcs: a theory based on the commutator of scatter matrix pairs and its application to vertex detection in planar shape data.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Determination of size distribution of spherical polydispersions using scattered radiation data.

Applied optics·2010

Same author

Coefficients of the legendre and fourier series for the scattering functions of spherical particles.

Applied optics·2010

Same author

Intensity and polarization of the radiation emerging from a plane-parallel atmosphere containing monodispersed aerosols.

Applied optics·2010

Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

IEEE transactions on pattern analysis and machine intelligence·2026

Same journal

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026

See all related articles

Search research articles

Related Experiment Video

Updated: May 29, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

Efficient Implementation of the Fuzzy c-Means Clustering Algorithms.

R L Cannon¹, J V Dave, J C Bezdek

¹Department of Computer Science, University of South Carolina, Columbia, SC 29208.

IEEE Transactions on Pattern Analysis and Machine Intelligence

|August 27, 2011

Summary

This summary is machine-generated.

This study introduces an Approximate Fuzzy C-Means (AFCM) algorithm that significantly speeds up fuzzy c-means (FCM) clustering. AFCM reduces computation time by using estimates in its equations, making it ideal for image processing tasks.

More Related Videos

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

Related Experiment Videos

Last Updated: May 29, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

Area of Science:

Computer Science
Data Science
Image Processing

Background:

Fuzzy C-Means (FCM) clustering is a widely used data analysis technique.
Traditional FCM can be computationally intensive, especially for large datasets.
Optimizing FCM performance is crucial for real-time applications.

Purpose of the Study:

To propose and numerically compare an Approximate Fuzzy C-Means (AFCM) algorithm against the standard FCM.
To evaluate the computational efficiency and cluster quality of the AFCM implementation.
To demonstrate AFCM's applicability in image processing scenarios.

Main Methods:

Developed an AFCM implementation by approximating exact variates in FCM equations with estimates.
Utilized lookup tables for computing Euclidean distances and exponentiation within AFCM.
Performed numerical comparisons on a nine-band digital image dataset.

Main Results:

AFCM reduced CPU time per iteration to approximately one-sixth of the standard FCM.
The AFCM implementation maintained the overall quality of terminal clusters.
Pseudocode for AFCM was provided for practical applications.

Conclusions:

AFCM offers a significant acceleration of FCM processing.
The algorithm is particularly effective when the feature space consists of integer-valued coordinates.
AFCM is a viable alternative for accelerating FCM in image analysis and other relevant fields.