Corners-based composite descriptor for shapes

In this paper, a composite descriptor for shape retrieval is proposed. The composite descriptor is obtained based upon corner-points and shape region. In an earlier paper, we proposed a composite descriptor based on shape region and shape contour, however, the descriptor was not effective for all perspective and geometric transformations. Hence, we modify the composite descriptor by replacing contour features with corner-points features. The proposed descriptor is obtained from Generic FourierDescriptors (GFD) of the shape region and the GFD ofthe corner-points. We study the performance of the proposed composite descriptor. The proposed method is evaluated using Item S8 within the MPEG-7 Still Images Content Set. Experimental results show that the proposed descriptor is effective.<br /

Coherence based histograms for shape retrieval

Histograms have been used for Shape Representation and Retrieval. The drawback of the histograms method is that histograms can be same for dissimilar shapes, which renders the method less effective for retrieval of shapes. In this paper, we describe the concept of coherence. We show how coherence can be used with distance and angular histograms. We perform experiments to test the effectiveness of the proposed method. It is found that coherence improves accuracy of retrieval significantly.<br /

Spherical harmonics descriptor for 2D-image retrieval

In this paper, spherical harmonics are proposed as shape descriptors for 2D images. We introduce the concept of connectivity; 2D images are decomposed using connectivity, which is followed by 3D model construction. Spherical harmonics are obtained for 3D models and used as descriptors for the underlying 2D shapes. Difference between two images is computed as the Euclidean distance between their spherical harmonics descriptors. Experiments are performed to test the effectiveness of spherical harmonics for retrieval of 2D images. Item S8 within the MPEG-7 still images content set is used for performing experiments; this dataset consists of 3621 still images. Experimental results show that the proposed descriptors for 2D images are effective<br /

Multi-scale analysis of connectivity for image retrieval

Previously, we proposed the concept of connectivity to obtain discriminating shape descriptors. In this paper, we use connectivity to obtain superior distance histograms for multi-scale images. Experiments are performed to evaluate the distance histograms, based on connectivity, for shape-based retrieval of multi-scale images. Item S8 within the MPEG-7 still images content set is used for performing experiments. Experimental results show that the proposed method enhances retrieval performance significantly.<br /

Discriminating shape descriptors based on connectivity

We propose a method for enhancing the accuracy of shape descriptors. The concept of connectivity to obtain discriminating shape descriptors, is introduced. We show how connectivity is applied to two popular shape descriptors. Experiments are performed to test the effect of using connectivity with generic Fourier descriptors and distance histograms. Item S8 within the MPEG-7 still images content set is used for performing experiments. This dataset consists of 3621 still images. The experimental results show that connectivity enhances the performance of the methods significantly. <br /

Image retrieval using modified generic fourier descriptors

Generic Fourier Descriptors have been used for image retrieval [12]. In this paper, we have proposed a modification to the Generic Fourier Descriptors. We have performed experiments to compare the performance of the proposed method with the standard method. Tests were performed on Set B of the MPEG-7 Still Images Content Set [13]. The experimental results show the effectiveness of the proposed method.<br /

Angular histograms for shape retrieval

Distance histograms have been used for Shape Representation and Retrieval [1][2]. In this paper, we have proposed the use of angular histograms for shape representation. We have implemented a system for conducting experiments and evaluating the effectiveness of the proposed method. The proposed method is compared with the distance histograms method. It is found that theproposed method is effective.<br /

An enhancement to the spatial pyramid matching for image classification and retrieval

Spatial pyramid matching (SPM) is one of the widely used methods to incorporate spatial information into the image representation. Despite its effectiveness, the traditional SPM is not rotation invariant. A rotation invariant SPM has been proposed in the literature but it has many limitations regarding the effectiveness. In this paper, we investigate how to make SPM robust to rotation by addressing those limitations. In an SPM framework, an image is divided into an increasing number of partitions at different pyramid levels. In this paper, our main focus is on how to partition images in such a way that the resulting structure can deal with image-level rotations. To do that, we investigate three concentric ring partitioning schemes. Apart from image partitioning, another important component of the SPM framework is a weight function. To apportion the contribution of each pyramid level to the final matching between two images, the weight function is needed. In this paper, we propose a new weight function which is suitable for the rotation-invariant SPM structure. Experiments based on image classification and retrieval are performed on five image databases. The detailed result analysis shows that we are successful in enhancing the effectiveness of SPM for image classification and retrieval. © 2013 IEEE

OpenFed: A Comprehensive and Versatile Open-Source Federated Learning Framework

Recent developments in Artificial Intelligence techniques have enabled their successful application across a spectrum of commercial and industrial settings. However, these techniques require large volumes of data to be aggregated in a centralized manner, forestalling their applicability to scenarios wherein the data is sensitive or the cost of data transmission is prohibitive. Federated Learning alleviates these problems by decentralizing model training, thereby removing the need for data transfer and aggregation. To advance the adoption of Federated Learning, more research and development needs to be conducted to address some important open questions. In this work, we propose OpenFed, an open-source software framework for end-to-end Federated Learning. OpenFed reduces the barrier to entry for both researchers and downstream users of Federated Learning by the targeted removal of existing pain points. For researchers, OpenFed provides a framework wherein new methods can be easily implemented and fairly evaluated against an extensive suite of benchmarks. For downstream users, OpenFed allows Federated Learning to be plug and play within different subject-matter contexts, removing the need for deep expertise in Federated Learning.Comment: 18 pages, 3 figures, 1 tabl