• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.742-751
• /
• 2011

This paper presents a robust 3D model hashing dependent on key and parameter by using heat kernel signature (HKS), which is special shape feature descriptor, In the proposed hashing, we calculate HKS coefficients of local and global time scales from eigenvalue and eigenvector of Mesh Laplace operator and cluster pairs of HKS coefficients to 2D square cells and calculate feature coefficients by the distance weights of pairs of HKS coefficients on each cell. Then we generate the binary hash through binarizing the intermediate hash that is the combination of the feature coefficients and the random coefficients. In our experiment, we evaluated the robustness against geometrical and topological attacks and the uniqueness of key and model and also evaluated the model space by estimating the attack intensity that can authenticate 3D model. Experimental results verified that the proposed scheme has more the improved performance than the conventional hashing on the robustness, uniqueness, model space.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.401-408
• /
• 2006

In this paper, we propose a new class of segmentation technique for feature extraction based on the statistical and regional classification at each vertical or horizontal line of digital image data. Data is processed and clustered at each line, different from the point or space process. They are designed to segment gray-scale sectional images using a horizontal and vertical line process due to their statistical and property differences, and to extract the feature. The techniques presented here show efficient results in case of the gray level overlap and not having threshold image. Such images are also not easy to be segmented by the global or local threshold methods. Line pixels inform us the sectionable data, and can be set according to cluster quality due to the differences of histogram and statistical data. The total segmentation on line clusters can be obtained by adaptive extension onto the horizontal axis. Each processed region has its own pixel value, resulting in feature extraction. The advantage and effectiveness of the line-cluster approach are both shown theoretically and demonstrated through the region-segmental carotid artery medical image processing.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.699-706
• /
• 2015

In recent years, as near-duplicate image has been increasing explosively by the spread of Internet and image-editing technology that allows easy access to image contents, related research has been done briskly. However, BoF (Bag-of-Feature), the most frequently used method for near-duplicate image detection, can cause problems that distinguish the same features from different features or the different features from same features in the quantization process of approximating a high-level local features to low-level. Therefore, a post-verification method for BoF is required to overcome the limitation of vector quantization. In this paper, we proposed and analyzed the performance of a post-verification method for BoF, which converts SIFT (Scale Invariant Feature Transform) descriptors into 128 bits binary codes and compares binary distance regarding of a short ranked list by BoF using the codes. Through an experiment using 1500 original images, it was shown that the near-duplicate detection accuracy was improved by approximately 4% over the previous BoF method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1614-1632
• /
• 2017

Bag of visual words is a popular model in human action recognition, but usually suffers from loss of spatial and temporal configuration information of local features, and large quantization error in its feature coding procedure. In this paper, to overcome the two deficiencies, we combine sparse coding with spatio-temporal pyramid for human action recognition, and regard this method as the baseline. More importantly, which is also the focus of this paper, we find that there is a hierarchical structure in feature vector constructed by the baseline method. To exploit the hierarchical structure information for better recognition accuracy, we propose a tree regularized classifier to convey the hierarchical structure information. The main contributions of this paper can be summarized as: first, we introduce a tree regularized classifier to encode the hierarchical structure information in feature vector for human action recognition. Second, we present an optimization algorithm to learn the parameters of the proposed classifier. Third, the performance of the proposed classifier is evaluated on YouTube, Hollywood2, and UCF50 datasets, the experimental results show that the proposed tree regularized classifier obtains better performance than SVM and other popular classifiers, and achieves promising results on the three datasets.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.6
• /
• pp.10-21
• /
• 2000

The Cellular Noninear Networks structure for Distance Transform(DT) and the robust optical flow detection algorithm based on the DT are proposed. For some applications of optical flows such as target tracking and camera ego-motion computation, correct optical flows at a few feature points are more useful than unreliable one at every pixel point. The proposed algorithm is for detecting the optical flows on the trajectories only of the feature points. The translation lengths and the directions of feature movements are detected on the trajectories of feature points on which Distance Transform Field is developed. The robustness caused from the use of the Distance Transform and the easiness of hardware implementation with local analog circuits are the properties of the proposed structure. To verify the performance of the proposed structure and the algorithm, simulation has been done about various images under different noisy environment.

• 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.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.158-166
• /
• 2002

In this paper, we proposed a contour shape description method which use the CFR(contour fluctuation ratio) feature. The CFR is the ratio of the line length to the curve length of a contour segment. The line length means the distance of two end points on a contour segment, and the curve length means the sum of distance of all adjacent two points on a contour segment. We should acquire rotation and scale invariant contour segments because each CFR is computed from contour segments. By using the interleaved contour segment of which length is proportion to the entire contour length and which is generated from all the points on contour, we could acquire rotation and scale invariant contour segments. The CFR can describes the local or global feature of contour shape according to the unit length of contour segment. Therefore we describe the shape of objects with the feature vector which represents the distribution of CFRs, and calculate the similarity by comparing the feature vector of corresponding unit length segments. We implemented the proposed method and experimented with rotated and scaled 165 fish images of fifteen types. The experimental result shows that the proposed method is not only invariant to rotation and scale but also superior to NCCH and TRP method in the clustering power.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.214-221
• /
• 2008

In this paper, we proposed a new mesh editing algorithm based on the motion between two sample meshes. First, the motion vectors are defined as the derivation vector of the corresponding vertices on the sample meshes. Then, the motion feature vectors are extracted between the motion vectors. The motion feature vectors represent the similarity of the vertex motion in a local mesh surface. When a mesh structure is forced by an external motion of anchor vertices, the deformed mesh geometry is obtained by minimizing the cost function with preserving the motion feature vectors. Simulation results demonstrated that the proposed algorithm yields visually pleasing editing results.

• Journal of Biosystems Engineering
• /
• v.40 no.4
• /
• pp.417-427
• /
• 2015

Purpose: This study investigated different band selection methods to classify spectrally similar data - obtained from aerial images of healthy citrus canopies and citrus greening disease (Huanglongbing or HLB) infected canopies - using small differences without unmixing endmember components and therefore without the need for an endmember library. However, large number of hyperspectral bands has high redundancy which had to be reduced through band selection. The objective, therefore, was to first select the best set of bands and then detect citrus Huanglongbing infected canopies using these bands in aerial hyperspectral images. Methods: The forward feature selection algorithm (FFSA) was chosen for band selection. The selected bands were used for identifying HLB infected pixels using various classifiers such as K nearest neighbor (KNN), support vector machine (SVM), naïve Bayesian classifier (NBC), and generalized local discriminant bases (LDB). All bands were also utilized to compare results. Results: It was determined that a few well-chosen bands yielded much better results than when all bands were chosen, and brought the classification results on par with standard hyperspectral classification techniques such as spectral angle mapper (SAM) and mixture tuned matched filtering (MTMF). Median detection accuracies ranged from 66-80%, which showed great potential toward rapid detection of the disease. Conclusions: Among the methods investigated, a support vector machine classifier combined with the forward feature selection algorithm yielded the best results.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1534-1542
• /
• 2004

A novel vision-based scheme of extracting real-time traffic information parameters is presented. The method is based on a region classification followed by a spatio-temporal image analysis. The detection region images for each traffic lane are classified into one of the three categories: the road, the vehicle, and the shadow, using statistical and structural features. Misclassification in a frame is corrected by using temporally correlated features of vehicles in the spatio-temporal image. Since only local images of detection regions are processed, the real-time operation of more than 30 frames per second is realized without using dedicated parallel processors, while ensuring detection performance robust to the variation of weather conditions, shadows, and traffic load.