St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Systems
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Computing, Telecommunication and Control:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Systems, 2014, Issue 6(210), Pages 43–48 (Mi ntitu84)  

Intellectual Systems and Technologies

Unsupervised learning of hierarchical 2D features for image classification

A. A. Khurshudov, V. N. Markov

Kuban State Technological University
Abstract: One of the key problems of image classification and pattern recognition domains is that of feature detection. The desired features are expected to be robust and invariant to a number of spatial transformations, compact enough to evade the «curse of dimensionality» which is a frequent obstacle when dealing with largenatural images, and provide a characteristic relation to a classification category with high probability. There exists a number of approaches developed to reach the stated goals, including a variety of deep learningmodels, such as Restricted Boltzman Machines, convolutional networks, autoencoders, PCA, Deep Belief Networks, etc. However, most applications of the above-mentioned algorithms are often concentrated on obtaining the most accurate features for a chosen dataset rather than trying to extract the inner structureof the data. This paper suggest a slightly different approach, namely a method for building a hierarchy of meaningful features with each level composed of the features from a previous layer. Such model has multipleapplications — it can serve as a composite feature detector in an unsupervised pre-training step of learning, or be itself a metric that answers the question of whether the same spatial structure is present across thedataset. The proposed approach exploits the idea of local connectivity supposing that multiple adjacent image parts which contain some meaningful features might present another, more high-level feature when composed together. We also discuss the advantages of a hierarchical feature model, such as the ability to guess a high-level feature presence by discovering a collection of low-level features concentrated in the same area, or its stability against noise and distortion which happens due to the fact that each feature level acceptsa certain degree of deviation accumulating those to the top of the hierarchy. The resulting model operates on 2D images, but can be easily extended in order to extract 3D features from a continuous data input, suchas a movie, which promises to be a good way to deal with 3D transformations, which can drastically change the appearance of an object while preserving its identity.
Keywords: hierarchical model, deep learning, unsupervised feature learning, feature detection.
Document Type: Article
UDC: 004.93'12
Language: Russian
Citation: A. A. Khurshudov, V. N. Markov, “Unsupervised learning of hierarchical 2D features for image classification”, St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Sys, 2014, no. 6(210), 43–48
Citation in format AMSBIB
\Bibitem{KhuMar14}
\by A.~A.~Khurshudov, V.~N.~Markov
\paper Unsupervised learning of hierarchical 2D features for image classification
\jour St. Petersburg Polytechnical University Journal. Computer Science. Telecommunication and Control Sys
\yr 2014
\issue 6(210)
\pages 43--48
\mathnet{http://mi.mathnet.ru/ntitu84}
Linking options:
  • https://www.mathnet.ru/eng/ntitu84
  • https://www.mathnet.ru/eng/ntitu/y2014/i6/p43
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Computing, Telecommunication and Control
    Statistics & downloads:
    Abstract page:134
    Full-text PDF :57
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025