• Title/Summary/Keyword: Multimedia Fingerprint

Search Result 59, Processing Time 0.024 seconds

Automatic Music Summarization Method by using the Bit Error Rate of the Audio Fingerprint and a System thereof (오디오 핑거프린트의 비트에러율을 이용한 자동 음악 요약 기법 및 시스템)

  • Kim, Minseong;Park, Mansoo;Kim, Hoirin
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.453-463
    • /
    • 2013
  • In this paper, we present an effective method and a system for the music summarization which automatically extract the chorus portion of a piece of music. A music summary technology is very useful for browsing a song or generating a sample music for an online music service. To develop the solution, conventional automatic music summarization methods use a 2-dimensional similarity matrix, statistical models, or clustering techniques. But our proposed method extracts the music summary by calculating BER(Bit Error Rate) between audio fingerprint blocks which are extracted from a song. But we could directly use an enormous audio fingerprint database which was already saved for a music retrieval solution. This shows the possibility of developing a various of new algorithms and solutions using the audio fingerprint database. In addition, experiments show that the proposed method captures the chorus of a song more effectively than a conventional method.

Performance Improvement of Fingerprint Verification using Image Matching (영상정합을 이용한 지문 인증 성능 향상)

  • Chae, Seung-Hoon;Pan, Sung-Bum;Moon, Dae-Sung;Moon, Ki-Young;Chung, Yong-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.53-60
    • /
    • 2008
  • Fingerprint verification method based on minutiae has been widely used for its speed and size stemming from utilizing only a few data, but it is vulnerable to some errors caused by the false minutiae extractions. A number of suggestions have been made to correct these problems. However, because it is very difficult to avoid all the external factors, such as noises that occur when fingerprints are collected, and all the internal factors that occur during the process of them, there is a limit in minimizing errors by improving the whole process. On the other hand, a fingerprint verification method based on images yields fewer errors because it makes direct comparison between images not using minutiae. Image-based fingerprint verification method has its limitations in aligning images with accuracy. Therefore, this paper proposes a new methodology to improve the performance utilizing both image-based and minutiae-based verification methods effectively. As the result of experimenting with both images and minutiae, the false accept rate and the false reject rate have been improved from 2.7% to 0.8% and from 6.5% to 5.5%, respectively.

  • PDF

Minutiae Extract Minimize Algorithm of Fingerprint Recognition (지문인식의 특이점 추출단계 최소화 알고리즘 구현)

  • 박종민;조범준
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.405-409
    • /
    • 2003
  • 본 논문에서는 특이점 추출에서의 과다한 추출 단계로 인하여 발생되는 문제점들을 줄이기 위하여 기존의 6 단계인 특이점 추출 과정을 개선하여 3 단계로 줄이면서도 정확성을 높이는 특이점 추출 알고리즘을 설계/구현하고자 한다.

  • PDF

Delaunay Triangulation based Fingerprint Matching Algorithm using Quality Estimation and Minutiae Classification (화질 추정과 특징점 분류를 이용한 Delaunay 삼각화 기반의 지문 정합 알고리즘)

  • Sung, Young-Jin;Kim, Gyeong-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.4
    • /
    • pp.547-559
    • /
    • 2010
  • Delaunay triangulation is suitable for fingerprint matching because of its robustness to rotation and translation. However, missing and spurious minutiae degrade the performance and computational efficiency. In this paper, we propose a method of combining local quality assessment and 4-category minutiae classification to improve accuracy and decrease computational complexity in matching process. Experimental results suggest that removing low quality areas from matching candidate areas and classifying minutiae improve computational efficiency without degrading performance. The results proved that the proposed algorithm outperforms the matching algorithm (BOZORTH3) provided by NIST.

An Improved Preliminary Cut-off Indoor Positioning Scheme in Case of No Neighborhood Reference Point (이웃 참조 위치가 없는 경우를 개선한 실내 위치 추정 사전 컷-오프 방식)

  • Park, Byoungkwan;Kim, Dongjun;Son, Jooyoung;Choi, Jongmin
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.1
    • /
    • pp.74-81
    • /
    • 2017
  • In learning stage of the preliminary Cut-off indoor positioning scheme, RSSI and UUID data received from beacons at each reference point(RP) are stored in fingerprint map. The fingerprint map and real-time beacon information are compared to identify the nearest K reference points through which the user position is estimated. If the number of K is zero, this scheme cannot estimate user position. We have improved the preliminary Cut-off scheme to get the estimated user position even in the case. The improved scheme excludes the beacon of the weakest signal received by user mobile device and identifies neighborhood reference points using the other beacon information. This procedure are performed repetitively until K > 0. The simulation results confirm that the proposed scheme outperforms K-Nearest-Neighbor (KNN), Cluster KNN and the conventional Cut-off scheme in terms of accuracy while the constraints are guaranteed to be satisfied.

Point Pattern Matching Algorithm Using Unit-Circle Parametrization

  • Choi, Nam-Seok;Lee, Byung-Gook;Lee, Joon-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.825-832
    • /
    • 2010
  • This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

Implementation of a Decision Tree for Positioning (측위를 위한 결정 트리 구현)

  • Yim Jae-Geol;Jeong Seung-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06b
    • /
    • pp.316-318
    • /
    • 2006
  • 무선 통신 기술의 발달로 사용자의 이동성이 제공되기 시작하면서 위치기반서비스(LBS: Location Based Service)가 부각되었다. 서비스의 예로 공공안전 서비스, 위치추적 서비스, 항법 서비스, 정보제공 서비스 등 부가가치가 높은 서비스들이 많이 있는데, 이러한 서비스를 개발하려면 필수적으로 사용자의 위치를 파악해야 한다. 옥내 측위 방법으로 여러가지가 실험되고 있는데, Fingerprint 방법이 일반적으로 가장 정확도가 높다. 기존의 Fingerprint 방식에는 K-NN 방법과 Bayesian 방법이 소개되었는데, 결정 트리를 이용한 방법은 효율성이 기존의 K-NN이나 Bayesian 방법보다 뛰어나게 좋음에도 불구하고 적용한 사례가 없다. 그래서 본 논문은 결정 트리를 이용하는 방법을 제안한다. K-NN 및 Bayesian 방법과 제안하는 방법을 비교 분석한 결과와 제안하는 방법의 실험 결과도 보인다.

  • PDF

A Study on the Fingerprint Recognition Using Fingerprint Orientation and Features. (방향성과 특징점을 이용한 지문 인식 시스템에 관한 연구)

  • 김인식;권욱주;박건주;김정규
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.219-223
    • /
    • 2004
  • 본 논문에서는 여러 생체 인식 시스템 중 지문 인식에 관한 연구를 기술한다 지문 입력장치를 통해 입력 받은 영상을 이용하여 개인의 식별을 위해 방향성과 특징점 정보를 이용, 매칭을 실시한다. 지문의 매칭은 1 차로 소벨 마스크와 창틀 마스크를 이용한 방향성 매칭과 2 차로 특징점 정보를 이용한 매칭 2 단계로 이루어 진다 방향성 정보를 이용한 매칭 방법에서는 가장 널리 알려진 소벨 마스크 보다 창틀 마스크가 더 정확한 것으로 판별 되었으며, 특징점 정보를 이용한 알고리즘에서는 상당한 의사 특징점을 제거 할 수 있었다 신뢰할 수 있는 방향성 검출 알고리즘과 특징점을 검출하기 위한 연구를 하였으며, 지문영상의 특징점으로는 끝점과 분기점을 사용하였다.

  • PDF

A Study on Protection of Iris and fingerprint Data Based on Digital Watermarking in Mid-Frequency Band (중간 주파수 영역에서의 디지털 워터마킹 기법에 의한 홍채 및 지문 데이터 보호 연구)

  • Jeong, Dae-Sik;Park, Kang-Ryoung
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.9
    • /
    • pp.1227-1238
    • /
    • 2005
  • Recently, with the advance of network and internet technologies, it is appeared the Problem that the digital contents such as image, voice and video are illegally pirated and distributed. To protect the copyright of the digital contents, the digital watermarking technology of inserting the provider's information into the contents has been widely used. In this paper, we propose the method of applying the digital watermarking into biometric information such as fingerprint and iris in order to prevent the problem caused by steal and misuse. For that, we propose the method of inserting watermark in frequency domain, compare the recognition performance before and aster watermark inserting. Also, we experiment the robustness of proposed method against blurring attack, which is conventionally taken on biometrics data. Experimental results show that our proposed method can be used for protecting iris and fingerprint data, efficiently.

  • PDF

A Study on Media Security in Ubiquitous Network System (유비쿼터스 네트워크 시스템에서의 미디어 보안에 관한 연구)

  • Ju, Min-Seong;Ahn, Seong-Soo;Woo, Young-Hwan;Kim, Yong-Tae;Kim, Tai-Hoon;Park, Gil-Cheol;Kim, Seok-Soo
    • Convergence Security Journal
    • /
    • v.7 no.1
    • /
    • pp.29-34
    • /
    • 2007
  • Recently, the distribution and using of the digital multimedia contents are easy by developing the internet application program and related technology. However, the digital signal is easily duplicated and the duplicates have the same quality compare with original digital signal. To solve this problem, there is the multimedia fingerprint which is studied for the protection of copyright. Fingerprinting scheme is a technique which supports copyright protection to track redistributers of electronic information using cryptographic techniques. Only regular user can know the inserted fingerprint data in fingerprinting schemes differ from a symmetric/asymmetric scheme and the scheme guarantee an anonymous before re-contributed data. In this paper, we present a new scheme which is the detection of colluded multimedia fingerprint by neural network. This proposed scheme is consists of the anti-collusion code generation and the neural network for the error correction.

  • PDF