• Title/Summary/Keyword: key feature

Search Result 801, Processing Time 0.032 seconds

Design of Indexing Agent for Semantic-based Video Retrieval (의미기반 비디오 검색을 위한 인덱싱 에이전트의 설계)

  • Lee, Jong-Hee;Oh, Hae-Seok
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.687-694
    • /
    • 2003
  • According to the rapid increase of multimedia data quantity recently, various means of video data search has been desired. In order to process video data effectively, it is required that the content information of video data is loaded in database and semantic-based retrieval method can be available for various query of users. Currently existent contents-based video retrieval systems search by single method such as annotation-based or feature-based retrieval, and show low search efficiency and requires many efforts of system administrator or annotator form less perfect automatic processing. In this paper, we propose semantic-based video retrieval system which support semantic retrieval of various users by feature-based retrieval and annotation-based retrieval of massive video data. By user's fundamental query and selection of image for key frame that extracted from query, the agent gives the detail shape for annotation of extracted key frame. Also, key frame selected by user become query image and searches the most similar key frame through feature based retrieval method that propose. Therefore, we design the system that can heighten retrieval efficiency of video data through semantic-based retrieval.

A novel method to aging state recognition of viscoelastic sandwich structures

  • Qu, Jinxiu;Zhang, Zhousuo;Luo, Xue;Li, Bing;Wen, Jinpeng
    • Steel and Composite Structures
    • /
    • v.21 no.6
    • /
    • pp.1183-1210
    • /
    • 2016
  • Viscoelastic sandwich structures (VSSs) are widely used in mechanical equipment, but in the service process, they always suffer from aging which affect the whole performance of equipment. Therefore, aging state recognition of VSSs is significant to monitor structural state and ensure the reliability of equipment. However, non-stationary vibration response signals and weak state change characteristics make this task challenging. This paper proposes a novel method for this task based on adaptive second generation wavelet packet transform (ASGWPT) and multiwavelet support vector machine (MWSVM). For obtaining sensitive feature parameters to different structural aging states, the ASGWPT, its wavelet function can adaptively match the frequency spectrum characteristics of inspected vibration response signal, is developed to process the vibration response signals for energy feature extraction. With the aim to improve the classification performance of SVM, based on the kernel method of SVM and multiwavelet theory, multiwavelet kernel functions are constructed, and then MWSVM is developed to classify the different aging states. In order to demonstrate the effectiveness of the proposed method, different aging states of a VSS are created through the hot oxygen accelerated aging of viscoelastic material. The application results show that the proposed method can accurately and automatically recognize the different structural aging states and act as a promising approach to aging state recognition of VSSs. Furthermore, the capability of ASGWPT in processing the vibration response signals for feature extraction is validated by the comparisons with conventional second generation wavelet packet transform, and the performance of MWSVM in classifying the structural aging states is validated by the comparisons with traditional wavelet support vector machine.

Dual-stream Co-enhanced Network for Unsupervised Video Object Segmentation

  • Hongliang Zhu;Hui Yin;Yanting Liu;Ning Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.4
    • /
    • pp.938-958
    • /
    • 2024
  • Unsupervised Video Object Segmentation (UVOS) is a highly challenging problem in computer vision as the annotation of the target object in the testing video is unknown at all. The main difficulty is to effectively handle the complicated and changeable motion state of the target object and the confusion of similar background objects in video sequence. In this paper, we propose a novel deep Dual-stream Co-enhanced Network (DC-Net) for UVOS via bidirectional motion cues refinement and multi-level feature aggregation, which can fully take advantage of motion cues and effectively integrate different level features to produce high-quality segmentation mask. DC-Net is a dual-stream architecture where the two streams are co-enhanced by each other. One is a motion stream with a Motion-cues Refine Module (MRM), which learns from bidirectional optical flow images and produces fine-grained and complete distinctive motion saliency map, and the other is an appearance stream with a Multi-level Feature Aggregation Module (MFAM) and a Context Attention Module (CAM) which are designed to integrate the different level features effectively. Specifically, the motion saliency map obtained by the motion stream is fused with each stage of the decoder in the appearance stream to improve the segmentation, and in turn the segmentation loss in the appearance stream feeds back into the motion stream to enhance the motion refinement. Experimental results on three datasets (Davis2016, VideoSD, SegTrack-v2) demonstrate that DC-Net has achieved comparable results with some state-of-the-art methods.

Robust 3D Model Hashing Scheme Based on Shape Feature Descriptor (형상 특징자 기반 강인성 3D 모델 해싱 기법)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • 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.

A Robust Route Maintenance Scheme Considering Node Mobility in Wireless Ad-hoc Networks (무선 Ad-hoc 네트워크에서 노드 이동성을 고려한 견고한 경로 관리 기법)

  • Kim, Kwan-Woong;Bae, Sung-Hwan;Kim, Dae-Ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4A
    • /
    • pp.309-315
    • /
    • 2009
  • Wireless Ad-hoc networks are dynamic networks that consist of mobile nodes. Nodes in Ad-hoc networks are usually laptops, PDAs or mobile phones. These devices feature Bluetooth and/or IEEE 802.11 (WiFi) network interfaces and communicate in a decentralized manner. Due to characteristics of Ad-hoc networks, Mobility is a key feature of routing protocol design. In this paper, we present an enhanced routing maintenance scheme that cope with topology changes pre-actively. The key feature of the proposed scheme is to switch next-hop node to alternative neighbor node before link breakage for preventing route failure. From extensive experiments by using NS2, the performance of the proposed scheme has been improved by comparison to AODV protocol.

Recognizing F5-like stego images from multi-class JPEG stego images

  • Lu, Jicang;Liu, Fenlin;Luo, Xiangyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4153-4169
    • /
    • 2014
  • To recognize F5-like (such as F5 and nsF5) steganographic algorithm from multi-class stego images, a recognition algorithm based on the identifiable statistical feature (IDSF) of F5-like steganography is proposed in this paper. First, this paper analyzes the special modification ways of F5-like steganography to image data, as well as the special changes of statistical properties of image data caused by the modifications. And then, by constructing appropriate feature extraction sources, the IDSF of F5-like steganography distinguished from others is extracted. Lastly, based on the extracted IDSFs and combined with the training of SVM (Support Vector Machine) classifier, a recognition algorithm is presented to recognize F5-like stego images from images set consisting of a large number of multi-class stego images. A series of experimental results based on the detection of five types of typical JPEG steganography (namely F5, nsF5, JSteg, Steghide and Outguess) indicate that, the proposed algorithm can distinguish F5-like stego images reliably from multi-class stego images generated by the steganography mentioned above. Furthermore, even if the types of some detected stego images are unknown, the proposed algorithm can still recognize F5-like stego images correctly with high accuracy.

Binary Hashing CNN Features for Action Recognition

  • Li, Weisheng;Feng, Chen;Xiao, Bin;Chen, Yanquan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4412-4428
    • /
    • 2018
  • The purpose of this work is to solve the problem of representing an entire video using Convolutional Neural Network (CNN) features for human action recognition. Recently, due to insufficient GPU memory, it has been difficult to take the whole video as the input of the CNN for end-to-end learning. A typical method is to use sampled video frames as inputs and corresponding labels as supervision. One major issue of this popular approach is that the local samples may not contain the information indicated by the global labels and sufficient motion information. To address this issue, we propose a binary hashing method to enhance the local feature extractors. First, we extract the local features and aggregate them into global features using maximum/minimum pooling. Second, we use the binary hashing method to capture the motion features. Finally, we concatenate the hashing features with global features using different normalization methods to train the classifier. Experimental results on the JHMDB and MPII-Cooking datasets show that, for these new local features, binary hashing mapping on the sparsely sampled features led to significant performance improvements.

Feature Extraction for Automatic Golf Swing Analysis by Image Processing (영상처리를 이용한 골프 스윙 자동 분석 특징의 추출)

  • Kim, Pyeoung-Kee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.53-58
    • /
    • 2006
  • In this paper, I propose an image based feature extraction method for an automatic golf swing analysis. While most swing analysis systems require an expert like teaching professional, the proposed method enables an automatic swing analysis without a professional. The extracted features for swing analysis include not only key frames such as addressing, backward swing, top, forward swing, impact, and follow-through swing but also important positions of golfer's body parts such as hands, shoulders, club head, feet, knee. To see the effectiveness of the proposed method. I tested it for several swing pictures. Experimental results show that the proposed method is effective for extracting important swing features. Further research is under going to develop an automatic swing analysis system using the proposed features.

  • PDF

Cover song search based on magnitude and phase of the 2D Fourier transform (이차원 퓨리에 변환의 크기와 위상을 이용한 커버곡 검색)

  • Seo, Jin Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.6
    • /
    • pp.518-524
    • /
    • 2018
  • The cover song refers to live recordings or reproduced albums. This paper studies two-dimensional Fourier transform as a feature-dimension reduction method to search cover song fast. The two-dimensional Fourier transform is conducive in feature-dimension reduction for cover song search due to musical-key invariance. This paper extends the previous work, which only utilize the magnitude of the Fourier transform, by introducing an invariant from phase based on the assumption that adjacent frames have the same musical-key change. We compare the cover song retrieval accuracy of the Fourier-transform based methods over two datasets. The experimental results show that the addition of the invariant from phase improves the cover song retrieval accuracy over the previous magnitude-only method.

Towards Improving Causality Mining using BERT with Multi-level Feature Networks

  • Ali, Wajid;Zuo, Wanli;Ali, Rahman;Rahman, Gohar;Zuo, Xianglin;Ullah, Inam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.10
    • /
    • pp.3230-3255
    • /
    • 2022
  • Causality mining in NLP is a significant area of interest, which benefits in many daily life applications, including decision making, business risk management, question answering, future event prediction, scenario generation, and information retrieval. Mining those causalities was a challenging and open problem for the prior non-statistical and statistical techniques using web sources that required hand-crafted linguistics patterns for feature engineering, which were subject to domain knowledge and required much human effort. Those studies overlooked implicit, ambiguous, and heterogeneous causality and focused on explicit causality mining. In contrast to statistical and non-statistical approaches, we present Bidirectional Encoder Representations from Transformers (BERT) integrated with Multi-level Feature Networks (MFN) for causality recognition, called BERT+MFN for causality recognition in noisy and informal web datasets without human-designed features. In our model, MFN consists of a three-column knowledge-oriented network (TC-KN), bi-LSTM, and Relation Network (RN) that mine causality information at the segment level. BERT captures semantic features at the word level. We perform experiments on Alternative Lexicalization (AltLexes) datasets. The experimental outcomes show that our model outperforms baseline causality and text mining techniques.