RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
          펼치기
        • 등재정보
          펼치기
        • 학술지명
          펼치기
        • 주제분류
          펼치기
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Detecting Partial and Near Duplication in the Blogosphere

        YOON, Yeo-Chan,JANG, Myung-Gil,KIM, Hyun-Ki,PARK, So-Young The Institute of Electronics, Information and Comm 2012 IEICE transactions on information and systems Vol.95 No.2

        <P>In this paper, we propose a duplicate document detection model recognizing both partial duplicates and near duplicates. The proposed model can detect partial duplicates as well as exact duplicates by splitting a large document into many small sentence fingerprints. Furthermore, the proposed model can detect even near duplicates, the result of trivial revisions, by filtering the common words and reordering the word sequence.</P>

      • Duplicate Video Detection using Motion Distribution in Shot and Frame Descriptor

        In-Su Won,Jong-Wook Kang,Dong-Seok Jeong 한국멀티미디어학회 2011 한국멀티미디어학회 국제학술대회 Vol.2011 No.-

        In this paper, we propose the motion distribution and key-frame descriptor based on shot change for near-duplication video contents detection. The motion distribution descriptor of motion distribution histogram in shot is constructed using motion vectors of the macro-block that are gained by video decoding process. We use the motion distribution descriptor for pre-filtering to increase the matching speed. To improve the discriminability, we use the frame descriptor of key-frame which is selected from segmented shot through filtering to determine whether the video is duplicated or not. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast. We confirm that the proposed algorithm can be useful for practical application.

      • KCI등재

        다채널 진동 센서를 이용한 선박 엔진의 진동 감지 및 고장 분류 시스템

        이양민,이광용,배승현,장휘,이재기 한국정보처리학회 2010 정보처리학회논문지. 컴퓨터 및 통신시스템 Vol.17 No.2

        There has been some research in the equipment defect detection based on vibration information. Most research of them is based on vibration monitoring to determine the equipment defect or not. In this paper, we introduce more accurate system for engine defect detection based on vibration information and we focus on detection of engine defect for boat and system control. First, it uses the duplicated-checking method for vibration information to determine the engine defect or not. If there is a defect happened, we use the method using error part of vibration information basis with error range to determine which kind of error is happened. On the other hand, we use the engine trend analysis and standard of safety engine to implement the vibration information database. Our simulation results show that the probability of engine defect determination is 100% and the probability of engine defect classification and detection is 96%. 진동 정보를 통해 기계 설비의 상태나 고장 유무를 판단하는 연구들이 다수 진행 중에 있는데, 대부분의 연구에서는 설비에 대한 진동을 모니터링하거나 고장 유무를 판별하여 사용자에게 알리는 수준이다. 본 논문에서는 진동에 의한 고장 진단과 판별을 보다 정교하게 수행하는 선박 엔진의 고장 감지 기법과 시스템을 제안하였다. 일차적으로 이중적 진동 정보 판별 기법을 적용하여 진동 정보를 확인한 다음에 고장 유무를 검사한다. 만일 고장이 발생한 경우에는 진동 정보의 오류 부분만을 이용하여 고장 진동 파형에 대한 오차 범위를 기준으로 어떤 유형의 고장인지를 판별할 수 있는 기법을 적용하였다. 또한 선박의 진동 경향 분석과 엔진 안전 보존을 목적으로 진동 정보를 데이터베이스에 저장하고 추적할 수 있도록 시스템을 구현하였다. 제안 시스템을 선박 엔진의 고장 판별 유무와 고장 진동 파형 감별 인자에 대해 실험을 수행한 결과 고장 유무 판별은 약 100% 정확성을 가졌고 고장 진동 파형의 유형 인식에서는 약 96% 정확성을 가졌다.

      • KCI등재후보

        WWW 환경에서 중복문서의 검출 기법에 대한 고찰

        이순행,이상철,김상욱,김학진 한국정보과학회 2009 데이타베이스 연구 Vol.25 No.1

        Recently, as the number of documents in the WWW(World Wide Web) increases, it becomes crucial to treat duplicate documents. In this article, we survey previous research results related to handling duplicate documents in WWW environment. First, we introduce a variety of methods for determining whether given two documents are duplicated. Second, we address methods for detecting duplicate documents efficiently from a large document database. Finally, we suggest further research directions. 최근 들어 웹 문서가 증가함에 따라 중복문서 검출의 중요성이 점차 커지고 있다. 본 논문에서는 WWW 환경에서 중복문서를 검출하는 기법에 관련된 기존의 연구 현황에 대하여 소개한다. 먼저, 두 개의 문서가 주어졌을 때 중복인 지의 여부를 판정하는 기법들을 소개한다. 두 번째로는 대용량의 문서 데이터베이스에서 중복문서들을 효율적으로 검출하는 기법들에 대해 논한다. 마지막으로 향후 연구 방향에 대하여 제시한다.

      • KCI등재

        Detection Copy-Move Forgery in Image Via Quaternion Polar Harmonic Transforms

        ( Salam A. Thajeel ),( Ali Shakir Mahmood ),( Waleed Rasheed Humood ),( Ghazali Sulong ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.8

        Copy-move forgery (CMF) in digital images is a detrimental tampering of artefacts that requires precise detection and analysis. CMF is performed by copying and pasting a part of an image into other portions of it. Despite several efforts to detect CMF, accurate identification of noise, blur and rotated region-mediated forged image areas is still difficult. A novel algorithm is developed on the basis of quaternion polar complex exponential transform (QPCET) to detect CMF and is conducted involving a few steps. Firstly, the suspicious image is divided into overlapping blocks. Secondly, invariant features for each block are extracted using QPCET. Thirdly, the duplicated image blocks are determined using k-dimensional tree (kd-tree) block matching. Lastly, a new technique is introduced to reduce the flat region-mediated false matches. Experiments are performed on numerous images selected from the CoMoFoD database. MATLAB 2017b is used to employ the proposed method. Metrics such as correct and false detection ratios are utilised to evaluate the performance of the proposed CMF detection method. Experimental results demonstrate the precise and efficient CMF detection capacity of the proposed approach even under image distortion including rotation, scaling, additive noise, blurring, brightness, colour reduction and JPEG compression. Furthermore, our method can solve the false match problem and outperform existing ones in terms of precision and false positive rate. The proposed approach may serve as a basis for accurate digital image forensic investigations.

      • KCI등재

        Concentric Circle-Based Image Signature for Near-Duplicate Detection in Large Databases

        Ayoung Cho,Won-Keun Yang,Dong-Seok Jeong,Weon-Geun Oh 한국전자통신연구원 2010 ETRI Journal Vol.32 No.6

        Many applications dealing with image management need a technique for removing duplicate images or for grouping related (near-duplicate) images in a database. This paper proposes a concentric circle-based image signature which makes it possible to detect near-duplicates rapidly and accurately. An image is partitioned by radius and angle levels from the center of the image. Feature values are calculated using the average or variation between the partitioned sub-regions. The feature values distributed in sequence are formed into an image signature by hash generation. The hashing facilitates storage space reduction and fast matching. The performance was evaluated through discriminability and robustness tests. Using these tests, the particularity among the different images and the invariability among the modified images are verified, respectively. In addition, we also measured the discriminability and robustness by the distribution analysis of the hashed bits. The proposed method is robust to various modifications, as shown by its average detection rate of 98.99%. The experimental results showed that the proposed method is suitable for near-duplicate detection in large databases.

      • KCI등재

        블록 차이를 이용한 유사 동영상 검출 및 클러스터링

        이현덕(Hyundeok Lee),배건태(Guntae Bae),변혜란(Hyeran Byun) 한국정보과학회 2011 정보과학회논문지 : 소프트웨어 및 응용 Vol.38 No.9

        인터넷의 주요 컨텐츠 유형이 문자에서 사진과 동영상으로 발전함에 따라, 동영상을 공유할 수 있는 동영상 검색 서비스가 확산되고 있으며, 이와 함께 유사 동영상으로 인한 효율성 저하 등 다양한 문제가 대두되었다. 본 논문에서는 이러한 문제의 해결을 위해, 내용 기반의 유사 동영상 검출 방법을 제안한다. 다양한 변환에 강인하고 실시간으로 검출 가능한 유사 동영상 검출 알고리즘을 목표로, 동영상의 시 공간 변화 특성을 반영한 블록 차이 기반의 특징 추출 방법을 제안한다. 또한 다양한 길이의 동영상을 고려한 유사 동영상 검출 방법 및 유사 동영상 클러스터링 방법을 제안한다. 제안한 방법에 대하여 VIREO 실험 데이터를 이용하여 기존 연구와의 비교 실험을 수행하였으며, 정확성과 처리 시간에 대한 실험을 통하여 그 성능을 검증하였다. As the increasing of the sharing and search services for video, a major content type of Internet has been shifted to multimedia such as photo and video. And with the rapid increasing of videos, the duplicated videos problem has become an important aspect for efficiency of services. In this paper, we propose a content based near-duplicate video detection method to solve the problem. We propose a feature extraction method using block difference that can consider spatio-temporal variations of video. Proposed feature extraction method is robust to various transformations and can detect near-duplicate video in real-time. We propose a video matching method and clustering method for various length videos. In experiment, we perform experiment with VIREO dataset for comparison with other algorithms. We verified the performance of proposed method by performing the experiment for accuracy and speed.

      • SCIESCOPUSKCI등재

        Seamless Mobility Management in IP-based Wireless/Mobile Networks with Fast Handover

        ( Byungjoo Park ),( Eunsang Hwang ),( Gil-cheol Park ) 한국인터넷정보학회 2009 KSII Transactions on Internet and Information Syst Vol.3 No.3

        The challenges of rapidly growing numbers of mobile nodes in IPv6-based networks are being faced by mobile computing researchers worldwide. Recently, IETF has standardized Mobile IPv6 and Fast Handover for Mobile IPv6 (FMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that FMIPv6 generally improves MIPv6 in terms of handover speed, they did not carefully consider the details of the whole handover procedures. Therefore, in conventional protocols, the handover process reveals numerous problems manifested by a time-consuming network layer based movement detection and latency in configuring a new care of address with confirmation. In this article, we study the impact of the address configuration and confirmation procedure on the IP handover latency. To mitigate such effects, we propose a new scheme which can reduce the latency taken by the movement detection, address configuration and confirmation from the whole handover latency. Furthermore, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach is focused on the reduction of handover latency. Finally, we demonstrate total handover scenarios for the proposed techniques and discussed the major factors which contribute to the handover latency.

      • SCIESCOPUSKCI등재

        IPv6 Autoconfiguration for Hierarchical MANETs with Efficient Leader Election Algorithm

        Bouk, Safdar Hussain,Sasase, Iwao The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.3

        To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼