Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The pro...Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.展开更多
Two properties are given in this paper about the scaling function: suppose Vj; j ∈ Z is a multiresolution analysis with a continuous scaling function φ which have compact support set and that φ the Fourier transfor...Two properties are given in this paper about the scaling function: suppose Vj; j ∈ Z is a multiresolution analysis with a continuous scaling function φ which have compact support set and that φ the Fourier transform of φ is a continuous real function, compactly supported, then φ(0) ≠ 0 and when supp φ = [a1,b1]∪[a2,b2](b1 < a2,0 < a2), then we havea1 ≤ 0, 0 < b1, a1 < b2/2 ≤ b1, 2π < b2 - a1 ≤ 8π.展开更多
文摘Two dimensional(2 D) entropy method has to pay the price of time when applied to image segmentation. So the genetic algorithm is introduced to improve the computational efficiency of the 2 D entropy method. The proposed method uses both the gray value of a pixel and the local average gray value of an image. At the same time, the simple genetic algorithm is improved by using better reproduction and crossover operators. Thus the proposed method makes up the 2 D entropy method’s drawback of being time consuming, and yields satisfactory segmentation results. Experimental results show that the proposed method can save computational time when it provides good quality segmentation.
文摘Two properties are given in this paper about the scaling function: suppose Vj; j ∈ Z is a multiresolution analysis with a continuous scaling function φ which have compact support set and that φ the Fourier transform of φ is a continuous real function, compactly supported, then φ(0) ≠ 0 and when supp φ = [a1,b1]∪[a2,b2](b1 < a2,0 < a2), then we havea1 ≤ 0, 0 < b1, a1 < b2/2 ≤ b1, 2π < b2 - a1 ≤ 8π.
