Skip to main content
SpringerLink
Log in

Clustering Algorithm for a Set of Machine Parts on the Basis of Engineering Drawings

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

For industrial logistics tasks, an algorithm for clustering a given set of machine parts on the basis of engineering drawings is proposed. To speed up clustering, the values of each parameter are fuzzified and local maximums of the N-dimensional histogram are sought. The search uses the selection of adjacent vectors based on the recalculation of coordinates from the N-dimensional space to a one-dimensional space and vice versa and on the comparison with coordinates of neighboring vectors. Thereby the algorithm finds the cluster vertices in a single pass, and it does not require the creation of numerous local lists or vector adjacency graphs, which improves the efficiency of the clustering algorithm. Experimental results on automatic grouping of machine parts on the basis of drawings are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.

Similar content being viewed by others

REFERENCES

  1. Halevi, G., Expectations and Disappointments of Industrial Innovations. Lecture Notes in Management and Industrial Engineering, Springer, 2017.

    Book  Google Scholar 

  2. Barladian, B.Kh., Voloboy, A.G., Galaktionov, V.A., and Shapiro, L.Z., Integration of realistic computer graphics into computer-aided design and product lifecycle management systems, Program. Comput. Software, 2018, vol. 44, no. 4, pp. 225–232.

    Article  Google Scholar 

  3. MacQueen, J., Some methods for classification and analysis of multivariate observations, Proc. 5th Berkeley Symp. on Math. Statistics and Probability, 1967, pp. 281–297.

  4. Sidorova, V.S., Histogram hierarchical algorithm and the reduction of the dimensionality of the spectral features space, Zh. Sib. Fed. Univ., Ser. Tekhn. Tekhnol. 2017, vol. 10, no. 6, pp. 714–722.

    Google Scholar 

  5. Narendra, P.M. and Goldberg, M., A non-parametric clustering scheme for LANDSAT, Pattern Recognit., 1977, vol. 9, no. 4, pp. 207–215.

    Article  Google Scholar 

  6. Kharinov, M.V., Pixel clustering for color image segmentation, Program. Comput. Software, 2015, vol. 41, no. 5, pp. 258–266.

    Article  MathSciNet  Google Scholar 

  7. Ward, J.H., Hierarchical grouping to optimize an objective function, J. Am. Statist. Association, 1963, vol. 58, no. 301, pp. 236–244.

    Article  MathSciNet  Google Scholar 

  8. Hodashinsky, I.A. and Mekh, M.A., Fuzzy classifier design using harmonic search methods, Program. Comput. Software, 2017, vol. 43, no. 1, pp. 37–46.

    Article  MathSciNet  Google Scholar 

  9. Wang, L., Yang, R., Xu, Y., Niu, Q., Pardalos, P.M., and Fei, M., An improved adaptive binary harmony search algorithm, Inf. Sci., 2013, vol. 232, pp. 58–87.

    Article  MathSciNet  Google Scholar 

  10. Bai, S., Liu, Z., and Bai, X., Co-spectral for robust shape clustering, Pattern Recognit. Lett., 2016, vol. 83, no. 3, pp. 388–394.

    Article  Google Scholar 

  11. Shen, W., Wang, Y., Bai, X., Wang, H., and Latecki, L.J., Shape clustering: Common structure discovery, Pattern Recognit., 2013, vol. 46, no. 2, pp. 539–550.

    Article  Google Scholar 

  12. Barton, J. and Love, D., Retrieving designs from a sketch using an automated GT coding and classification system, Prod. Plan. & Control, 2005, vol. 16, no. 8, pp. 763–773.

    Article  Google Scholar 

  13. CADFind. http://www.cadfind3d.com/

  14. Liu, R., Wang, Y., Baba, T., and Masumoto, D., Shape detection from line drawings with local neighborhood structure, Pattern Recognit., 2010, vol. 43, no. 5, pp. 1907–1916.

    Article  Google Scholar 

  15. Fonseca, M.J., Ferreira, A., and Jorge, J.A., Sketch-based retrieval of vector drawings, Sketch-based Interfaces Model., 2011, vol. 12, pp. 181–204.

    Article  Google Scholar 

  16. Knuth, D., The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd Ed. Reading, Mass.: Addison–Wesley, 1997.

    Google Scholar 

  17. Kasimov, D.R., Kuchuganov, A.V., and Kuchuganov, V.N., Vectorization of raster mechanical drawings on the base of ternary segmentation and soft computing, Program. Comput. Software, 2017, vol. 43, no. 6, pp. 337–344.

    Article  MathSciNet  Google Scholar 

  18. Kasimov, D.R., Kuchuganov, A.V., and Kuchuganov, V.N., Individual strategies in the tasks of graphical retrieval of technical drawings, J. Visual Lang. Comput., 2015, vol. 28, pp. 134–146.

    Article  Google Scholar 

Download references

Funding

The algorithm analysis was carried out by D. R. Kasimov and funded by the Russian Science Foundation, project no. 18-71-00109.

Author information

Authors and Affiliations

  1. Kalashnikov Izhevsk State Technical University, Izhevsk, Russia

    V. N. Kuchuganov, A. V. Kuchuganov & D. R. Kasimov

Authors
  1. V. N. Kuchuganov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Kuchuganov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. R. Kasimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. N. Kuchuganov, A. V. Kuchuganov or D. R. Kasimov.

Additional information

Translated by A. Klimontovich

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kuchuganov, V.N., Kuchuganov, A.V. & Kasimov, D.R. Clustering Algorithm for a Set of Machine Parts on the Basis of Engineering Drawings. Program Comput Soft 46, 25–34 (2020). https://doi.org/10.1134/S0361768820010041

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768820010041

Search

Navigation