• Title/Summary/Keyword: rotation invariant

Search Result 256, Processing Time 0.023 seconds

Log-Polar Image Watermarking based on Invariant Centroid as Template (불변의 무게중심을 템플릿으로 이용한 대수-극 좌표계 영상 워터마킹 기법)

  • 김범수;유광훈;김우섭;곽동민;송영철;최재각;박길흠
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.3
    • /
    • pp.341-351
    • /
    • 2003
  • Digital image watermarking is the method that can protect the copyright of the image by embedding copyright information, which is called watermark. Watermarking must have robustness to intentional or unintentional data changing, called attack. The conventional watermarking schemes are robust to waveform attacks such as image compression, filtering etc. However, they are vulnerable to geometrical attacks such as rotation, scaling, translation, and cropping. Accordingly, this paper proposes new watermarking scheme that is robust to geometrical attacks by using invariant centroid. Invariant centroid is the gravity center of a central area in a gray scale image that remains unchanged even when the image is attacked by RST including cropping and proposed scheme uses invariant centroids of original and inverted image as the template. To make geometrically invariant domain, template and angle compensated Log -Polar Map(LPM) is used. Then Discrete Cosine Transform(DCT) is performed and the watermark is embedded into the DCT coefficients. Futhermore, to prevent a watermarked image from degrading due to interpolation during coordinate system conversion, only the image of the watermark signal is extracted and added to the original image. Experimental results show that the proposed scheme is especially robust to RST attacks including cropping.

Robust-to-rotation Iris Recognition Using Local Gradient Orientation Histogram (국부적 그래디언트 방향 히스토그램을 이용한 회전에 강인한 홍채 인식)

  • Choi, Chang-Soo;Jun, Byoung-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3C
    • /
    • pp.268-273
    • /
    • 2009
  • Iris recognition is a biometric technology which can identify a person using the iris pattern. It is important for the iris recognition system to extract the feature which is invariant to changes in iris patterns. Those changes can be occurred by the influence of lights, changes in the size of the pupil, and head tilting. In this paper, we propose a novel method based on local gradient orientation histogram which is robust to variations in illumination and rotations of iris patterns. The proposed method enables high-speed feature extraction and feature comparison because it requires no additional processing to obtain the rotation invariance, and shows comparable performance to the well-known previous methods.

Medicine-Bottle Classification Algorithm Based on SIFT (SIFT 기반의 약통 분류 시스템)

  • Park, Kil Houm;Cho, Woong Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.1
    • /
    • pp.77-85
    • /
    • 2014
  • Medicine-bottle classification algorithm to avoid medicine accidents must be robust to a geometric change such as rotation, size variation, location movement of the medicine bottles. In this paper, we propose an algorithm to classify the medicine bottles exactly in real-time by using SIFT(Scale Invariant Feature Transform) which is robust to the geometric change. In first, we classify medicine bottles by size using minimum boundary rectangle(MBR) of medicine bottles as a striking feature in order to classify the medicine bottles. We extract label region in the MBR and the region of interest(ROI) considering rotation. Then, we classify medicine bottles using SIFT for the extracted ROI. We also simplify the number of octave of SIFT in order to improve a process speed of SIFT. We confirm to classify all the medicine bottles exactly as a result of performance evaluation of the proposed algorithm about images of 250 medicine bottles. We also confirm to improve the process time more than twice the processing time by simplifying the number of octave of SIFT.

Rotation-Scale-Translation-Intensity Invariant Algorithm for Fingerprint Identigfication (RSTI 불변 지문인식 알고리즘)

  • Kim, Hyun;Kim, Hak-Il
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.88-100
    • /
    • 1998
  • In this paper, an algorithm for a real-time automatic fingerprint identification system is proposed. The fingerprint feature volume is extracted by considering distinct and local characteristics(such as intensity and image quality difference etc.) in fingerprint images, which makes the algorithm properly adaptive to various image acquisitionj methods. Also the matching technique is designed to be invariant on rotation, scaling and translation (RST) changes while being capable of real-time processing. And the classification of fingerprints is performed based on the ridge flow and the relations among singular points such as cores and deltas. The developed fingerprint identification algorithm has been applied to various sets of fingerprint images such as one from NIST(National Institute of Standards and Technology, USA), a pressed fingerprint database constructed according to Korean population distributions in sex, ages and jobs, and a set of rolled-than-scanned fingerprint images. The overall performance of the algorithm has been analyzed and evaluated to the false rejection ratio of 0.07% while holding the false acceptance ratio of 0%.

  • PDF

Detecting the Prostate Contour in TRUS Image using Support Vector Machine and Rotation-invariant Textures (SVM과 회전 불변 텍스처 특징을 이용한 TRUS 영상의 전립선 윤곽선 검출)

  • Park, Jae Heung;Seo, Yeong Geon
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.675-682
    • /
    • 2014
  • Prostate is only an organ of men. To diagnose the disease of the prostate, generally transrectal ultrasound(TRUS) images are used. Detecting its boundary is a challenging and difficult task due to weak prostate boundaries, speckle noise and the short range of gray levels. In this paper a method for automatic prostate segmentation in TRUS images using Support Vector Machine(SVM) is presented. This method involves preprocessing, extracting Gabor feature, training, and prostate segmentation. The speckle reduction for preprocessing step has been achieved by using stick filter and top-hat transform has been implemented for smoothing. Gabor filter bank for extraction of rotation-invariant texture features has been implemented. SVM for training step has been used to get each feature of prostate and nonprostate. Finally, the boundary of prostate is extracted. A number of experiments are conducted to validate this method and results shows that the proposed algorithm extracted the prostate boundary with less than 10% relative to boundary provided manually by doctors.

Real-time Sign Object Detection in Subway station using Rotation-invariant Zernike Moment (회전 불변 제르니케 모멘트를 이용한 실시간 지하철 기호 객체 검출)

  • Weon, Sun-Hee;Kim, Gye-Young;Choi, Hyung-Il
    • Journal of Digital Contents Society
    • /
    • v.12 no.3
    • /
    • pp.279-289
    • /
    • 2011
  • The latest hardware and software techniques are combined to give safe walking guidance and convenient service of realtime walking assistance system for visually impaired person. This system consists of obstacle detection and perception, place recognition, and sign recognition for pedestrian can safely walking to arrive at their destination. In this paper, we exploit the sign object detection system in subway station for sign recognition that one of the important factors of walking assistance system. This paper suggest the adaptive feature map that can be robustly extract the sign object region from complexed environment with light and noise. And recognize a sign using fast zernike moment features which is invariant under translation, rotation and scale of object during walking. We considered three types of signs as arrow, restroom, and exit number and perform the training and recognizing steps through adaboost classifier. The experimental results prove that our method can be suitable and stable for real-time system through yields on the average 87.16% stable detection rate and 20 frame/sec of operation time for three types of signs in 5000 images of sign database.

Design of a SIFT based Target Classification Algorithm robust to Geometric Transformation of Target (표적의 기하학적 변환에 강인한 SIFT 기반의 표적 분류 알고리즘 설계)

  • Lee, Hee-Yul;Kim, Jong-Hwan;Kim, Se-Yun;Choi, Byung-Jae;Moon, Sang-Ho;Park, Kil-Houm
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.116-122
    • /
    • 2010
  • This paper proposes a method for classifying targets robust to geometric transformations of targets such as rotation, scale change, translation, and pose change. Targets which have rotation, scale change, and shift is firstly classified based on CM(Confidence Map) which is generated by similarity, scale ratio, and range of orientation for SIFT(Scale-Invariant Feature Transform) feature vectors. On the other hand, DB(DataBase) which is acquired in various angles is used to deal with pose variation of targets. Range of the angle is determined by comparing and analyzing the execution time and performance for sampling intervals. We experiment on various images which is geometrically changed to evaluate performance of proposed target classification method. Experimental results show that the proposed algorithm has a good classification performance.

Design of robust Watermarking Algorithm against the Geometric Transformation for Medical Image Security (의료 영상보안을 위한 기하학적 변형에 견고한 워터마킹 알고리즘 설계)

  • Lee, Yun-Bae;Oh, Guan-Tack
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2586-2594
    • /
    • 2009
  • A digital watermarking technique used as a protection and certifying mechanism of copyrighted creations including music, still images, and videos in terms of finding any loss in data, reproduction and pursuit. This study suggests using a selected geometric invariant point through the whole processing procedure of an image and inserting and extracting based on the invariant point so that it will be robust in a geometric transformation attack. The introduced algorithm here is based on a watershed splitting method in order to make medical images strong against RST(Rotation Scale, Translation) transformation and other processing. It also helps to maintain the watermark in images that are compressed and stored for a period of time. This algorithm also proved that is has robustness against not only JPEG compression attack, but also RST attack and filtering attack.

An Algorithm to Obtain Location Information of Objects with Concentric Noise Patterns (동심원 잡음패턴을 가진 물체의 위치정보획득 알고리즘)

  • 심영석;문영식;박성한
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.11
    • /
    • pp.1393-1404
    • /
    • 1995
  • For the factory automation(FA) of production or assembly lines, computer vision techniques have been widely used for the recognition and position-control of objects. In this application, it is very important to analyze characteristic features of each object and to find an efficient matching algorithm using the selected features. If the object has regular or homogeneous patterns, the problem is relatively simple. However, If the object is shifted or rotated, and if the depth of the input visual system is not fixed, the problem becomes very complicated. Also, in order to understand and recognize objects with concentric noise patterns, it is more effective to use feature-information represented in polar coordinates than in cartesian coordinates. In this paper, an algorithm for the recognition of objects with concentric circular noise-patterns is proposed. And position-conrtol information is calculated with the matching result. First, a filtering algorithm for eliminating concentric noise patterns is proposed to obtain concentric-feature patterns. Then a shift, rotation and scale invariant alogrithm is proposed for the recognition and position-control of objects uusing invariant feature information. Experimental results indicate the effectiveness of the proposed alogrithm.

  • PDF

Hardware Accelerated Design on Bag of Words Classification Algorithm

  • Lee, Chang-yong;Lee, Ji-yong;Lee, Yong-hwan
    • Journal of Platform Technology
    • /
    • v.6 no.4
    • /
    • pp.26-33
    • /
    • 2018
  • In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.