Local Binary Pattern (LBP) Operators for Image Texture Analysis
An introduction to three distinct Local Binary Pattern (LBP) operators for extracting local texture features from images, with implementation insights.
Explore MATLAB source code curated for "图像" with clean implementations, documentation, and examples.
An introduction to three distinct Local Binary Pattern (LBP) operators for extracting local texture features from images, with implementation insights.
A novel method for automatic rigid image registration using MATLAB and C++ hybrid programming for enhanced processing speed, featuring optimized algorithms and parallel computing implementation.
This program implements region growing algorithm for image segmentation with four input parameters: 1) x-coordinate of seed point, 2) y-coordinate of seed point, 3) input image for segmentation, 4) threshold value used during region growth. The algorithm uses pixel connectivity and similarity criteria to expand regions from seed points.
A widely-used MATLAB image region growing program that expands from a single seed point based on specified threshold conditions
MATLAB implementation of gamma correction algorithm for adjusting uneven illumination in images, featuring code implementation details and parameter adjustment techniques.
A homomorphic filtering algorithm for images, demonstrating visual comparisons between pre-filtered and post-filtered images through implementation code
Implementation of FCM-based image segmentation in MATLAB requires calling main(image, C) function where 'image' must be a pre-loaded JPG file and 'C' specifies the number of clusters for classification using Fuzzy C-Means algorithm.
This MATLAB-based source code package demonstrates image spectrum analysis techniques, including sample images for practical testing and algorithm verification.
MATLAB implementation for extracting image texture features including variance, entropy, angular second moment, with code demonstrations and algorithm explanations.
Convex Polygon Detection and Display - First extract salient regions from images, then encompass these regions with minimum convex polygons, and finally visualize the polygons