• Title/Summary/Keyword: SIFT Features

Search Result 115, Processing Time 0.02 seconds

A Hybrid Feature Selection Method using Univariate Analysis and LVF Algorithm (단변량 분석과 LVF 알고리즘을 결합한 하이브리드 속성선정 방법)

  • Lee, Jae-Sik;Jeong, Mi-Kyoung
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.4
    • /
    • pp.179-200
    • /
    • 2008
  • We develop a feature selection method that can improve both the efficiency and the effectiveness of classification technique. In this research, we employ case-based reasoning as a classification technique. Basically, this research integrates the two existing feature selection methods, i.e., the univariate analysis and the LVF algorithm. First, we sift some predictive features from the whole set of features using the univariate analysis. Then, we generate all possible subsets of features from these predictive features and measure the inconsistency rate of each subset using the LVF algorithm. Finally, the subset having the lowest inconsistency rate is selected as the best subset of features. We measure the performances of our feature selection method using the data obtained from UCI Machine Learning Repository, and compare them with those of existing methods. The number of selected features and the accuracy of our feature selection method are so satisfactory that the improvements both in efficiency and effectiveness are achieved.

  • PDF

A Prostate Segmentation of TRUS Image using Average Shape Model and SIFT Features (평균 형상 모델과 SIFT 특징을 이용한 TRUS 영상의 전립선 분할)

  • Kim, Sang Bok;Seo, Yeong Geon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.1 no.3
    • /
    • pp.187-194
    • /
    • 2012
  • Prostate cancer is one of the most frequent cancers in men and is a major cause of mortality in the most of countries. In many diagnostic and treatment procedures for prostate disease, transrectal ultrasound(TRUS) images are being used because the cost is low. But, accurate detection of prostate boundaries is a challenging and difficult task due to weak prostate boundaries, speckle noises and the short range of gray levels. This paper proposes a method for automatic prostate segmentation in TRUS images using its average shape model and invariant features. This approach consists of 4 steps. First, it detects the probe position and the two straight lines connected to the probe using edge distribution. Next, it acquires 3 prostate patches which are in the middle of average model. The patches will be used to compare the features of prostate and nonprostate. Next, it compares and classifies which blocks are similar to 3 representative patches. Last, the boundaries from prior classification and the rough boundaries from first step are used to determine the segmentation. A number of experiments are conducted to validate this method and results showed that this new approach extracted the prostate boundary with less than 7.78% relative to boundary provided manually by experts.

A Cross-Platform Malware Variant Classification based on Image Representation

  • Naeem, Hamad;Guo, Bing;Ullah, Farhan;Naeem, Muhammad Rashid
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3756-3777
    • /
    • 2019
  • Recent internet development is helping malware researchers to generate malicious code variants through automated tools. Due to this reason, the number of malicious variants is increasing day by day. Consequently, the performance improvement in malware analysis is the critical requirement to stop the rapid expansion of malware. The existing research proved that the similarities among malware variants could be used for detection and family classification. In this paper, a Cross-Platform Malware Variant Classification System (CP-MVCS) proposed that converted malware binary into a grayscale image. Further, malicious features extracted from the grayscale image through Combined SIFT-GIST Malware (CSGM) description. Later, these features used to identify the relevant family of malware variant. CP-MVCS reduced computational time and improved classification accuracy by using CSGM feature description along machine learning classification. The experiment performed on four publically available datasets of Windows OS and Android OS. The experimental results showed that the computation time and malware classification accuracy of CP-MVCS was higher than traditional methods. The evaluation also showed that CP-MVCS was not only differentiated families of malware variants but also identified both malware and benign samples in mix fashion efficiently.

Plant leaf Classification Using Orientation Feature Descriptions (방향성 특징 기술자를 이용한 식물 잎 인식)

  • Gang, Su Myung;Yoon, Sang Min;Lee, Joon Jae
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.300-311
    • /
    • 2014
  • According to fast change of the environment, the structured study of the ecosystem by analyzing the plant leaves are needed. Expecially, the methodology that searches and classifies the leaves from captured from the smart device have received numerous concerns in the field of computer science and ecology. In this paper, we propose a plant leaf classification technique using shape descriptor by combining Scale Invarinat Feature Transform (SIFT) and Histogram of Oriented Gradient (HOG) from the image segmented from the background via Graphcut algorithm. The shape descriptor is coded in the field of Locality-constrained Linear Coding to optimize the meaningful features from a high degree of freedom. It is connected to Support Vector Machines (SVM) for efficient classification. The experimental results show that our proposed approach is very efficient to classify the leaves which have similar color, and shape.

Improving Matching Performance of SURF Using Color and Relative Position (위치와 색상 정보를 사용한 SURF 정합 성능 향상 기법)

  • Lee, KyungSeung;Kim, Daehoon;Rho, Seungmin;Hwang, Eenjun
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.2
    • /
    • pp.394-400
    • /
    • 2012
  • SURF is a robust local invariant feature descriptor and has been used in many applications such as object recognition. Even though this algorithm has similar matching accuracy compared to the SIFT, which is another popular feature extraction algorithm, it has advantage in matching time. However, these descriptors do not consider relative location information of extracted interesting points to guarantee rotation invariance. Also, since they use gray image of original color image, they do not use the color information of images, either. In this paper, we propose a method for improving matching performance of SURF descriptor using the color and relative location information of interest points. The location information is built from the angles between the line connecting the centers of interest points and the orientation line constructed for the center of each interest points. For the color information, color histogram is constructed for the region of each interest point. We show the performance of our scheme through experiments.

Gradual Block-based Efficient Lossy Location Coding for Image Retrieval (영상 검색을 위한 점진적 블록 크기 기반의 효율적인 손실 좌표 압축 기술)

  • Choi, Gyeongmin;Jung, Hyunil;Kim, Haekwang
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.319-322
    • /
    • 2013
  • Image retrieval research activity has moved its focus from global descriptors to local descriptors of feature point such as SIFT. MPEG is Currently working on standardization of effective coding of location and local descriptors of feature point in the context mobile based image search driven application in the name of MPEG-7 CDVS (Compact Descriptor for Visual Search). The extracted feature points consist of two parts, location information and Descriptor. For efficient image retrieval, we proposed a novel method that is gradual block-based efficient lossy location coding to compress location information according to distribution in images. From experimental result, the number of average bits per feature point reduce 5~6% and the accuracy rate keep compared to state of the art TM 3.0.

Analysis of the Increase of Matching Points for Accuracy Improvement in 3D Reconstruction Using Stereo CCTV Image Data

  • Moon, Kwang-il;Pyeon, MuWook;Eo, YangDam;Kim, JongHwa;Moon, Sujung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.2
    • /
    • pp.75-80
    • /
    • 2017
  • Recently, there has been growing interest in spatial data that combines information and communication technology with smart cities. The high-precision LiDAR (Light Dectection and Ranging) equipment is mainly used to collect three-dimensional spatial data, and the acquired data is also used to model geographic features and to manage plant construction and cultural heritages which require precision. The LiDAR equipment can collect precise data, but also has limitations because they are expensive and take long time to collect data. On the other hand, in the field of computer vision, research is being conducted on the methods of acquiring image data and performing 3D reconstruction based on image data without expensive equipment. Thus, precise 3D spatial data can be constructed efficiently by collecting and processing image data using CCTVs which are installed as infrastructure facilities in smart cities. However, this method can have an accuracy problem compared to the existing equipment. In this study, experiments were conducted and the results were analyzed to increase the number of extracted matching points by applying the feature-based method and the area-based method in order to improve the precision of 3D spatial data built with image data acquired from stereo CCTVs. For techniques to extract matching points, SIFT algorithm and PATCH algorithm were used. If precise 3D reconstruction is possible using the image data from stereo CCTVs, it will be possible to collect 3D spatial data with low-cost equipment and to collect and build data in real time because image data can be easily acquired through the Web from smart-phones and drones.

A Salient Based Bag of Visual Word Model (SBBoVW): Improvements toward Difficult Object Recognition and Object Location in Image Retrieval

  • Mansourian, Leila;Abdullah, Muhamad Taufik;Abdullah, Lilli Nurliyana;Azman, Azreen;Mustaffa, Mas Rina
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.769-786
    • /
    • 2016
  • Object recognition and object location have always drawn much interest. Also, recently various computational models have been designed. One of the big issues in this domain is the lack of an appropriate model for extracting important part of the picture and estimating the object place in the same environments that caused low accuracy. To solve this problem, a new Salient Based Bag of Visual Word (SBBoVW) model for object recognition and object location estimation is presented. Contributions lied in the present study are two-fold. One is to introduce a new approach, which is a Salient Based Bag of Visual Word model (SBBoVW) to recognize difficult objects that have had low accuracy in previous methods. This method integrates SIFT features of the original and salient parts of pictures and fuses them together to generate better codebooks using bag of visual word method. The second contribution is to introduce a new algorithm for finding object place based on the salient map automatically. The performance evaluation on several data sets proves that the new approach outperforms other state-of-the-arts.

Improved Image Matching Method Based on Affine Transformation Using Nadir and Oblique-Looking Drone Imagery

  • Jang, Hyo Seon;Kim, Sang Kyun;Lee, Ji Sang;Yoo, Su Hong;Hong, Seung Hwan;Kim, Mi Kyeong;Sohn, Hong Gyoo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.38 no.5
    • /
    • pp.477-486
    • /
    • 2020
  • Drone has been widely used for many applications ranging from amateur and leisure to professionals to get fast and accurate 3-D information of the surface of the interest. Most of commercial softwares developed for this purpose are performing automatic matching based on SIFT (Scale Invariant Feature Transform) or SURF (Speeded-Up Robust Features) using nadir-looking stereo image sets. Since, there are some situations where not only nadir and nadir-looking matching, but also nadir and oblique-looking matching is needed, the existing software for the latter case could not get good results. In this study, a matching experiment was performed to utilize images with differences in geometry. Nadir and oblique-looking images were acquired through drone for a total of 2 times. SIFT, SURF, which are feature point-based, and IMAS (Image Matching by Affine Simulation) matching techniques based on affine transformation were applied. The experiment was classified according to the identity of the geometry, and the presence or absence of a building was considered. Images with the same geometry could be matched through three matching techniques. However, for image sets with different geometry, only the IMAS method was successful with and without building areas. It was found that when performing matching for use of images with different geometry, the affine transformation-based matching technique should be applied.

Image Identifier based on Local Feature's Histogram and Acceleration Technique using GPU (지역 특징 히스토그램 기반 영상식별자와 GPU 가속화)

  • Jeon, Hyeok-June;Seo, Yong-Seok;Hwang, Chi-Jung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.9
    • /
    • pp.889-897
    • /
    • 2010
  • Recently, a cutting-edge large-scale image database system has demanded these attributes: search with alarming speed, performs with high accuracy, archives efficiently and much more. An image identifier (descriptor) is for measuring the similarity of two images which plays an important role in this system. The extraction method of an image identifier can be roughly classified into two methods: a local and global method. In this paper, the proposed image identifier, LFH(Local Feature's Histogram), is obtained by a histogram of robust and distinctive local descriptors (features) constrained by a district sub-division of a local region. Furthermore, LFH has not only the properties of a local and global descriptor, but also can perform calculations at a magnificent clip to determine distance with pinpoint accuracy. Additionally, we suggested a way to extract LFH via GPU (OpenGL and GLSL). In this experiment, we have compared the LFH with SIFT (local method) and EHD (global method) via storage capacity, extraction and retrieval time along with accuracy.