Object detection and segmentation using DenseNets and SIFT Keypoint Match

In this paper, we propose a model based on DenseNets and scale invariant feature transform (SIFT) keypoint match technology for object detection and segmentation. DenseNets is built on Convolutional Neural Networks (CNNs) with dense connections and used for semantic image segmentation. Our main idea is that, on the basis of the DenseNets model, we conduct the morphological processing, and apply the SIFT keypoint match technology to detect the object pixels. Opening operation and closing operation are the basic operations of morphological processing. They all consist of erosion operation and dilation operation but the order is different between them. The morphological processing combines two kinds of operations and can form a morphological filter which can filter the noise. The SIFT keypoint match algorithm is widely used to extract the invariant of position, scale and rotation so we use it to eliminate the misjudgment. Our experiments show that our method can acquire more accurate results compared with DenseNets model.

[1]  Pietro Perona,et al.  Fast Feature Pyramids for Object Detection , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Dong Yu,et al.  Context-Dependent Pre-Trained Deep Neural Networks for Large-Vocabulary Speech Recognition , 2012, IEEE Transactions on Audio, Speech, and Language Processing.

[3]  Kilian Q. Weinberger,et al.  Densely Connected Convolutional Networks , 2016, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[4]  Jitendra Malik,et al.  Region-Based Convolutional Networks for Accurate Object Detection and Segmentation , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[6]  Andrew Spencer,et al.  Morphological Theory: An Introduction to Word Structure in Generative Grammar , 1991 .