Experience and Educationis the best concise statement on education ever published by John Dewey, the man acknowledged to be the pre-eminent educational theorist of the twentieth century. Written more than two decades after Democracy and Education(Dewey's most comprehensive statement of his position in educational philosophy), this book demonstrates how Dewey reformulated his ideas as a result of his intervening experience with the progressive schools and in the light of the criticisms his theories had received. Analysing both "traditional" and "progressive" education, Dr. Dewey here insists that neither the old nor the new education is adequate and that each is miseducative because neither of them applies the principles of a carefully developed philosophy of experience. Many pages of this volume illustrate Dr. Dewey's ideas for a philosophy of experience and its relation to education. He particularly urges that all teachers and educators looking for a new movement in education should think in terms of the deeped and larger issues of education rather than in terms of some divisive "ism" about education, even such an "ism" as "progressivism." His philosophy, here expressed in its most essential, most readable form, predicates an American educational system that respects all sources of experience, on that offers a true learning situation that is both historical and social, both orderly and dynamic.

经验与教育 = Experience and education

Computational geometry

This paper proposes a novel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geodesic paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we do not consider the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of geodesic paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with discrete. Curve evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and contour deformations.

/pdf/path-similarity-skeleton-graph-matching-195hbaq39i.pdf

Path Similarity Skeleton Graph Matching

The VLDB journal : the international journal on very large data bases.

50 Years of object recognition: Directions forward☆

Speech emotion recognition with deep convolutional neural networks

Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation errors, articulation, scale difference, and within-class deformation can yield image and model features which don't match one-to-one but rather many-to-many. Adopting a graph-based representation of a set of features, we present a matching algorithm that establishes many-to-many correspondences between the nodes of two noisy, vertex-labeled weighted graphs. Our approach reduces the problem of many-to-many matching of weighted graphs to that of many-to-many matching of weighted point sets in a normed vector space. This is accomplished by embedding the initial weighted graphs into a normed vector space with low distortion using a novel embedding technique based on a spherical encoding of graph structure. Many-to-many vector correspondences established by the Earth Mover's Distance framework are mapped back into many-to-many correspondences between graph nodes. Empirical evaluation of the algorithm on an extensive set of recognition trials, including a comparison with two competing graph matching approaches, demonstrates both the robustness and efficacy of the overall approach.

/pdf/object-recognition-as-many-to-many-feature-matching-x8zlk00b7o.pdf

Object Recognition as Many-to-Many Feature Matching

In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge-weighted directed graph. The algorithm was based on a metric-tree representation of labeled graphs and their metric embedding into normed vector spaces, using the embedding algorithm of Matousek [13]. However, the method was limited by the fact that two graphs to be matched were typically embedded into vector spaces with different dimensionality. Before the embeddings could be matched, a dimensionality reduction technique (PCA) was required, which was both costly and prone to error. In this paper, we introduce a more efficient embedding procedure based on a spherical coding of directed graphs. The advantage of this novel embedding technique is that it prescribes a single vector space into which both graphs are embedded. This reduces the problem of directed graph matching to the problem of geometric point matching, for which efficient many-to-many matching algorithms exist, such as the Earth Mover’s Distance. We apply the approach to the problem of multi-scale, view-based object recognition, in which an image is decomposed into a set of blobs and ridges with automatic scale selection.

/pdf/many-to-many-feature-matching-using-spherical-coding-of-4ftwjv0p09.pdf

Many-to-many feature matching using spherical coding of directed graphs

http://www.cs.toronto.edu/~sven/Papers/cviu06.pdf

The representation and matching of categorical shape

Convolutional Neural Networks (CNN) have been successfully applied to image classification problems. Although powerful, they require a large amount of memory. The purpose of this paper is to perform image classification using CNNs on the embedded systems, where only a limited amount of memory is available. Our experimental analysis shows that 85.9% image classification accuracy is obtained by our framework while requiring 2GB memory only, making our framework ideal to be used in embedded systems.

M. Fatih Demirci

Papers

Speech emotion recognition with deep convolutional neural networks

Object Recognition as Many-to-Many Feature Matching

Many-to-many feature matching using spherical coding of directed graphs

The representation and matching of categorical shape

Cifar-10 Image Classification with Convolutional Neural Networks for Embedded Systems