An Novel Binarization Algorithm Based on Wavelet and an Optimal Box Counting Fractal Dimension for MEMS Measurement

2013 ◽  
Vol 718-720 ◽  
pp. 1094-1099
Author(s):  
Yuan Luo ◽  
Xue Qiang Tang
Keyword(s):  
Fractal Dimension ◽  
Wavelet Analysis ◽  
Image Binarization ◽  
Noise Background ◽  
Box Counting ◽  
Binarization Algorithm ◽  
Binarization Method

In MEMS parameter measure based on vision,the process of binarization is critical. In the situation of unbalancing illumination and noise background,the performance of traditional binarization method degrades. In this paper, a binarization method based on wavelet analysis and an optimal box counting (OBC) fractal dimension algorithm is proposed. At first,wavelet analysis is used to eliminate the effect of illumination distribution.Then the MEMS image binarization based on OBC reduces the effect of noise. Experiments show that, the method can get a considerable binarization result.

scholarly journals Binarization methods and investigation of their influence on the fractal dimension of functional coatings

2020 ◽  
pp. 30-42
Author(s):  
Anna Zhurba ◽  
Michail Gasik
Keyword(s):  
Fractal Dimension ◽  
Fractal Analysis ◽  
Quantitative Characteristic ◽  
Image Binarization ◽  
Counting Method ◽  
Functional Coatings ◽  
Binary Images ◽  
Box Counting ◽  
Box Counting Method ◽  
Binarization Threshold

An essential element of fractal analysis of functional coatings is the fractal dimension, which is an important quantitative characteristic. Typically, coating images are represented as colored or halftone, and most fractal dimension algorithms are for binary images. Therefore, an important step in fractal analysis is binarization, which is a threshold separation operation and the result of which is a binary image.The purpose of the study is to study and program the methods of image binarization and to study the influence of these methods on the value of fractal dimension of functional coatings.As a result of the binarization threshold, the image is split into two regions, one containing all pixels with values below a certain threshold and the other containing all pixels with values above that threshold. Of great importance is the determination of the binarization threshold.The study analyzed a number of functional coating images, determined the fractal dimension of the image by the Box Counting method at different binarization thresholds and when applying different binarization methods (binarization with lower and upper threshold, with double restriction, and the average method for determining the optimal binarization threshold) images. The Box Counting method is used to depict any structure on a plane. This method allows us to determine the fractal dimension of not strictly self-similar objects. Each image binarization method is used for different types of images and for solving different problems.As a result, the methods of image binarization were developed and implemented, the fractal dimension of binary images was calculated, and the influence of these methods on the value of fractal dimension of functional coatings was investigated.The surfaces of composite steel structure, metallic porous materials, and natural cave structures are analyzed.

Image binarization method for markers tracking in extreme light conditions

2021 ◽  
pp. 1-15
Author(s):  
Milan Ćurković ◽  
Andrijana Ćurković ◽  
Damir Vučina
Keyword(s):  
Image Processing ◽  
3D Scanning ◽  
Scanning System ◽  
Image Size ◽  
Image Binarization ◽  
Basic Part ◽  
Binarization Algorithm ◽  
Binarization Method ◽  
Scanning Systems ◽  
Time Image

Image binarization is one of the fundamental methods in image processing and it is mainly used as a preprocessing for other methods in image processing. We present an image binarization method with the primary purpose to find markers such as those used in mobile 3D scanning systems. Handling a mobile 3D scanning system often includes bad conditions such as light reflection and non-uniform illumination. As the basic part of the scanning process, the proposed binarization method successfully overcomes the above problems and does it successfully. Due to the trend of increasing image size and real-time image processing we were able to achieve the required small algorithmic complexity. The paper outlines a comparison with several other methods with a focus on objects with markers including the calibration system plane of the 3D scanning system. Although it is obvious that no binarization algorithm is best for all types of images, we also give the results of the proposed method applied to historical documents.

3D box-counting algorithm for calculating fractal dimension of cities

2010 ◽  
Vol 30 (8) ◽  
pp. 2070-2072
Author(s):  
Le-shan ZHANG ◽  
Ge CHEN ◽  
Yong HAN ◽  
Tao ZHANG
Keyword(s):  
Fractal Dimension ◽  
Box Counting ◽  
Counting Algorithm

scholarly journals Supramolecular Fractal Growth of Self-Assembled Fibrillar Networks

Gels ◽  
2021 ◽  
Vol 7 (2) ◽  
pp. 46
Author(s):  
Pedram Nasr ◽  
Hannah Leung ◽  
France-Isabelle Auzanneau ◽  
Michael A. Rogers
Keyword(s):  
Fractal Dimension ◽  
Crystallization Temperature ◽  
Cayley Tree ◽  
Fractal Dimensions ◽  
Self Similarity ◽  
Avrami Model ◽  
Cluster Aggregation ◽  
Box Counting ◽  
Self Assembled ◽  
Limited Diffusion

Complex morphologies, as is the case in self-assembled fibrillar networks (SAFiNs) of 1,3:2,4-Dibenzylidene sorbitol (DBS), are often characterized by their Fractal dimension and not Euclidean. Self-similarity presents for DBS-polyethylene glycol (PEG) SAFiNs in the Cayley Tree branching pattern, similar box-counting fractal dimensions across length scales, and fractals derived from the Avrami model. Irrespective of the crystallization temperature, fractal values corresponded to limited diffusion aggregation and not ballistic particle–cluster aggregation. Additionally, the fractal dimension of the SAFiN was affected more by changes in solvent viscosity (e.g., PEG200 compared to PEG600) than crystallization temperature. Most surprising was the evidence of Cayley branching not only for the radial fibers within the spherulitic but also on the fiber surfaces.

Classification and Recognition of Plant Leaf Based on Neural Networks

2011 ◽  
Vol 464 ◽  
pp. 38-42 ◽  
Author(s):  
Ping Ye ◽  
Gui Rong Weng
Keyword(s):  
Neural Networks ◽  
Fractal Dimension ◽  
Recognition Rate ◽  
Image Binarization ◽  
Characteristic Parameters ◽  
Moment Invariant ◽  
Plant Leaf ◽  
The Neural Networks ◽  
Novel Method ◽  
The Moment

This paper proposed a novel method for leaf classification and recognition. In the method, the moment invariant and fractal dimension were regarded as the characteristic parameters of the plant leaf. In order to extract the representative characteristic parameters, pretreatment of the leaf images, including RGB-gray converting, image binarization and leafstalk removing. The extracted leaf characteristic parameters were further utilized as training sets to train the neural networks. The proposed method was proved effectively to reach a recognition rate about 92% for most of the testing leaf samples

CT Image Analysis on the Meso-Damage of Construction Waste Recycled Brick

2012 ◽  
Vol 588-589 ◽  
pp. 1930-1933
Author(s):  
Guo Song Han ◽  
Hai Yan Yang ◽  
Xin Pei Jiang
Keyword(s):  
Fractal Dimension ◽  
Strain Curve ◽  
Ct Image ◽  
Stress Strain Curve ◽  
Crack Evolution ◽  
Construction Waste ◽  
Box Counting ◽  
Industrial Ct ◽  
Ct Image Analysis ◽  
Box Counting Method

Based on industrial CT technique, Meso-mechanical experiment was conducted on construction waste recycled brick to get the real-time CT image and stress-strain curve of brick during the loading process. Box counting method was used to calculate the fractal dimension of the inner pore transfixion and crack evolution. The results showed that lots of pore in the interfacial transition zone mainly resulted in the damage of the brick. With the increase of stress, the opening through-pore appeared and crack expanded, and the fractal dimension increased.

Outer Cutoff Value for the Box-Counting Method for Fractal Analysis of the Nucleus Using Kirsch Edge Detection

2020 ◽  
pp. 1-8
Author(s):  
Haruhiko Yoshioka ◽  
Kouki Minami ◽  
Hirokazu Odashima ◽  
Keita Miyakawa ◽  
Kayo Horie ◽  
...  
Keyword(s):  
Fractal Dimension ◽  
Edge Detection ◽  
Fractal Analysis ◽  
Nuclear Size ◽  
Original Position ◽  
Cytological Diagnosis ◽  
Cutoff Value ◽  
Position Bias ◽  
Box Counting ◽  
Nuclear Rotation

<b><i>Objective:</i></b> The complexity of chromatin (i.e., irregular geometry and distribution) is one of the important factors considered in the cytological diagnosis of cancer. Fractal analysis with Kirsch edge detection is a known technique to detect irregular geometry and distribution in an image. We examined the outer cutoff value for the box-counting (BC) method for fractal analysis of the complexity of chromatin using Kirsch edge detection. <b><i>Materials:</i></b> The following images were used for the analysis: (1) image of the nucleus for Kirsch edge detection measuring 97 × 122 pix (10.7 × 13.4 μm) with a Feret diameter of chromatin mesh (<i>n</i> = 50) measuring 17.3 ± 1.8 pix (1.9 ± 0.5 μm) and chromatin network distance (<i>n</i> = 50) measuring 4.4 ± 1.6 pix (0.49 ± 0.18 μm), and (2) sample images for Kirsch edge detection with varying diameters (10.4, 15.9, and 18.1 μm) and network width of 0.4 μm. <b><i>Methods:</i></b> Three types of bias that can affect the outcomes of fractal analysis in cytological diagnosis were defined. (1) Nuclear position bias: images of 9 different positions generated by shifting the original position of the nucleus in the middle of a 256 × 256 pix (28.1 μm) square frame in 8 compass directions. (2) Nuclear rotation bias: images of 8 different rotations obtained by rotating the original position of the nucleus in 45° increments (0°, 45°, 90°, 135°, 180°, 225°, 270°, and 315°). (3) Nuclear size bias: images of varying size (diameter: 190 pix [10.4 μm], 290 pix [15.9 μm], and 330 pix [18.1 μm]) with the same mesh pattern (network width: 8 pix [0.4 μm]) within a 512 × 512 pix square. Different outer cutoff values for the BC method (256, 128, 64, 32, 16, and 8 pix) were applied for each bias to assess the fractal dimension and to compare the coefficient of variation (CV). <b><i>Results:</i></b> The BC method with the outer cutoff value of 32 pix resulted in the least variation of fractal dimension. Specifically, with the cutoff value of 32 pix, the CV of nuclear position bias, nuclear rotation bias, and nuclear size bias were &#x3c;1% (0.1, 0.4, and 0.3%, respectively), with no significant difference between the position and rotation bias (<i>p</i> = 0.19). Our study suggests that the BC method with the outer cutoff value of 32 pix is suitable for the analysis of the complexity of chromatin with chromatin mesh.

Fractal and Convolutional Analysis for Deep Atmospheric Turbulence Using Machine Learning

2021 ◽  
Author(s):  
Nicholas Dudu ◽  
Arturo Rodriguez ◽  
Gael Moran ◽  
Jose Terrazas ◽  
Richard Adansi ◽  
...  
Keyword(s):  
Fractal Dimension ◽  
Atmospheric Turbulence ◽  
Isotropic Turbulence ◽  
Passive Scalar ◽  
Counting Method ◽  
Data Set ◽  
Box Counting ◽  
Box Counting Dimension ◽  
Self Similar ◽  
Box Counting Method

Abstract Atmospheric turbulence studies indicate the presence of self-similar scaling structures over a range of scales from the inertial outer scale to the dissipative inner scale. A measure of this self-similar structure has been obtained by computing the fractal dimension of images visualizing the turbulence using the widely used box-counting method. If applied blindly, the box-counting method can lead to misleading results in which the edges of the scaling range, corresponding to the upper and lower length scales referred to above are incorporated in an incorrect way. Furthermore, certain structures arising in turbulent flows that are not self-similar can deliver spurious contributions to the box-counting dimension. An appropriately trained Convolutional Neural Network can take account of both the above features in an appropriate way, using as inputs more detailed information than just the number of boxes covering the putative fractal set. To give a particular example, how the shape of clusters of covering boxes covering the object changes with box size could be analyzed. We will create a data set of decaying isotropic turbulence scenarios for atmospheric turbulence using Large-Eddy Simulations (LES) and analyze characteristic structures arising from these. These could include contours of velocity magnitude, as well as of levels of a passive scalar introduced into the simulated flows. We will then identify features of the structures that can be used to train the networks to obtain the most appropriate fractal dimension describing the scaling range, even when this range is of limited extent, down to a minimum of one order of magnitude.

Sign in / Sign up

Export Citation Format

Share Document