binary shape clustering via zernike moments
DESCRIPTION
Binary Shape Clustering via Zernike Moments. By: Stephen Yoo Michael Vorobyov. Moments. In general, moments describe numeric quantities at some distance from a reference point or axis. . Regular (Cartesian) Moments. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/1.jpg)
Binary Shape Clustering via Zernike Moments
By:Stephen Yoo
Michael Vorobyov
![Page 2: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/2.jpg)
Moments
• In general, moments describe numeric quantities at some distance from a reference point or axis.
![Page 3: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/3.jpg)
Regular (Cartesian) Moments
• A regular moment has the form of projection of onto the monomial
![Page 4: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/4.jpg)
Problems of Regular Moments
• The basis set is not orthogonal The moments contain redundant information.
• As increases rapidly as order increases, high computational precision is needed.
• Image reconstruction is very difficult.
![Page 5: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/5.jpg)
Benefits of Regular Moments
• Simple translational and scale invariant properties
• By preprocessing an image using the regular moments we can get an image to be translational and scale invariant before running Zernike moments
![Page 6: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/6.jpg)
Orthogonal Functions
• A set of polynomials orthogonal with respect to integration are also orthogonal with respect to summation.
![Page 7: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/7.jpg)
Orthogonal Moments• Moments produced using orthogonal basis
sets.
• Require lower computational precision to represent images to the same accuracy as regular moments.
![Page 8: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/8.jpg)
Zernike Polynomials• Set of orthogonal polynomials defined on
the unit disk.
![Page 9: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/9.jpg)
![Page 10: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/10.jpg)
Zernike Moments
• Simply the projection of the image function onto these orthogonal basis functions.
![Page 11: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/11.jpg)
Advantages of Zernike Moments
• Simple rotation invariance• Higher accuracy for detailed shapes• Orthogonal – Less information redundancy–Much better at image reconstruction (vs.
normal moments)
![Page 12: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/12.jpg)
Scale and Translational Invariance
Scale: Multiply by the scale factor raised to a certain power
Translational: Shift image’s origin to centroid (computed from normal first order moments)
![Page 13: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/13.jpg)
Rotational Invariance
The magnitude of each Zernike moment is invariant under rotation.
![Page 14: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/14.jpg)
Image Reconstruction
• Orthogonality enables us to determine the individual contribution of each order moment.
• Simple addition of these individual contributions reconstructs the image.
![Page 15: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/15.jpg)
Image ReconstructionReconstruction of a crane shape via Zernike moments up to order 10k-5, k = {1,2,3,4,5}.
(a) (b)
(c) (d)
(e) (f)
![Page 16: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/16.jpg)
Determining Min. Order
After reconstructing image up to moment 1. Calculate the Hamming distance,
which is the number of pixels that aredifferent between and .
2. Since, in general, decreases as increases, finding the first for which
will determine the minimum order to reach a predetermined accuracy.
![Page 17: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/17.jpg)
Experimentation & Results
• 40th order moments on 22 binary 128 x 128 images of 7 different leaf types.
• Clustering was done by K-means, with the farthest-first approach for seeding original means.
![Page 18: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/18.jpg)
Original Clusters
Type 1 Type 5
Type 4
Type 6
Type 7
Type 2
Type 3
![Page 19: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/19.jpg)
Type 2
Type 3
Type 1 Type 5
Type 4
Type 6
Type 7
The Zernike Clusters
![Page 20: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/20.jpg)
Conclusion
• Zernike moments have rotational invariance, and can be made scale and translational invariant, making them suitable for many applications.
• Zernike moments are accurate descriptors even with relatively few data points.
• Reconstruction of Zernike moments can be used to determine the amount of moments necessary to make an accurate descriptor.
![Page 21: Binary Shape Clustering via Zernike Moments](https://reader033.vdocument.in/reader033/viewer/2022061610/56816762550346895ddc3d0b/html5/thumbnails/21.jpg)
Future Research
• Better seeding algorithm for K-means/ different clustering algorithm
• Apply Zernike’s to supervised classification problem
• Make hybrid descriptor which combines Zernike’s and contour curvature to capture shape and boundary information