• Title/Summary/Keyword: Feature similarity

Search Result 595, Processing Time 0.026 seconds

A Steganography for the Medical Images using Block Similarity (블록 유사도를 이용한 의료영상 스테가노그라피)

  • Moon, Il-Nam;Lee, Sin-Joo;Lee, Kwang-Man
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.5
    • /
    • pp.952-958
    • /
    • 2009
  • Recently, due to problems in terms of illegal copying of medical image and the right ownership and authentication of data, it is necessary for us to study about those problems. In this study, we propose steganography with a method of the hiding information of high-resolution in digital medical image. The proposed algorithm is one of the way that inserts secret information by protecting ROI area which is regarded as and important feature of high-resolution digital medical image. As a result, the proposed method made it possible to insert secret information of massive storage and didn't affect the imperceptibility in medical image quality based on capacity and PSNR showed the all image quality of about 33.33dB.

Person Re-identification using Sparse Representation with a Saliency-weighted Dictionary

  • Kim, Miri;Jang, Jinbeum;Paik, Joonki
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.4
    • /
    • pp.262-268
    • /
    • 2017
  • Intelligent video surveillance systems have been developed to monitor global areas and find specific target objects using a large-scale database. However, person re-identification presents some challenges, such as pose change and occlusions. To solve the problems, this paper presents an improved person re-identification method using sparse representation and saliency-based dictionary construction. The proposed method consists of three parts: i) feature description based on salient colors and textures for dictionary elements, ii) orthogonal atom selection using cosine similarity to deal with pose and viewpoint change, and iii) measurement of reconstruction error to rank the gallery corresponding a probe object. The proposed method provides good performance, since robust descriptors used as a dictionary atom are generated by weighting some salient features, and dictionary atoms are selected by reducing excessive redundancy causing low accuracy. Therefore, the proposed method can be applied in a large scale-database surveillance system to search for a specific object.

Cloning of Rod Opsin Genes Isolated from Olive Flounder Paralichthys olivaceus, Japanese Eel Anguilla japonica, and Common Carp Cyprinus carpio

  • Kim, Sung-Wan;Kim, Jong-Myoung
    • Fisheries and Aquatic Sciences
    • /
    • v.12 no.4
    • /
    • pp.265-275
    • /
    • 2009
  • G Protein-coupled receptors (GPCRs) mediating wide ranges of physiological responses is one of the most attractive targets for drug development. Rhodopsin, a dim-light photoreceptor, has been extensively used as a model system for structural and functional study of GPCRs. Fish have rhodopsin finely-tuned to their habitats where the intensity and the wavelength of lights are changed depending on its water-depth. To study the detailed molecular characteristics of GPCR architecture and to understand the fishery light-sensing system, genes encoding rod opsins were isolated from fishes living under different photic environments. Full-length rod opsin genes were obtained by combination of PCR amplification and DNA walking strategy of genomic DNA isolated from olive flounder, P. olivaceus, Japanese eel, A. japonica, and Common carp C. carpio. Deduced amino acid sequences showed a typical feature of rod opsins including the sites for Schiffs base formation (Lys296) and its counter ion (Glu113), disulfide formation (Cys110 and Cys187), and palmitoylation (Cys322 and Cys323) although Cys322 is replaced by Phe in Japanese eel. Comparison of opsins by amino acid sequence alignment indicated the closest similarity between P. olivaceus and H. hippoglossus (94%), A. japonica and A. anguilla (98%), and C. carpio and C. auratus (95%), respectively.

Neural Network-based Recognition of Handwritten Hangul Characters in Form's Monetary Fields (전표 금액란에 나타나는 필기 한글의 신경망-기반 인식)

  • 이진선;오일석
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.1
    • /
    • pp.25-30
    • /
    • 2000
  • Hangul is regarded as one of the difficult character set due to the large number of classes and the shape similarity among different characters. Most of the conventional researches attempted to recognize the 2,350 characters which are popularly used, but this approach has a problem or low recognition performance while it provides a generality. On the contrary, recognition of a small character set appearing in specific fields like postal address or bank checks is more practical approach. This paper describes a research for recognizing the handwritten Hangul characters appearing in monetary fields. The modular neural network is adopted for the classification and three kinds of feature are tested. The experiment performed using standard Hangul database PE92 showed the correct recognition rate 91.56%.

  • PDF

Korean Onomatopoeia Clustering for Sound Database (음향 DB 구축을 위한 한국어 의성어 군집화)

  • Kim, Myung-Gwan;Shin, Young-Suk;Kim, Young-Rye
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1195-1203
    • /
    • 2008
  • Onomatopoeia of korean documents is to represent from natural or artificial sound to human language and it can express onomatopoeia language which is the nearest an object and also able to utilize as standard for clustering of Multimedia data. In this study, We get frequency of onomatopoeia in the experiment subject and select 100 onomatopoeia of use to our study In order to cluster onomatopoeia's relation, we extract feature of similarity and distance metric and then represent onomatopoeia's relation on vector space by using PCA. At the end, we can clustering onomatopoeia by using k-means algorithm.

  • PDF

Windowed Wavelet Stereo Matching Using Shift ability (이동성(shift ability)을 이용한 윈도우 웨이블릿 스테레오 정합)

  • 신재민;이호근;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1C
    • /
    • pp.56-63
    • /
    • 2003
  • In this paper, a wavelet-based stereo matching algorithm to obtain an accurate disparity map in wavelet transformed domain by using a shift ability property, a modified wavelet transform, the similarities for their sub-bands, and a hierarchical structure is proposed. New approaches for stereo matching by lots of feature information are to utilize translation-variant results of the sub-bands in the wavelet transformed domain because they cannot literally expect translation invariance in a system based on convolution and sub-sampling. After the similarity matching for each sub-band, we can easily find optimal matched-points because the sub-bands appearance of the shifted signals is definitely different from that of the original signal with no shift.

Isolation and Nucleotide Sequence Analysis of ADP-glucose Pyrophosphorylase gene from Chinese cabbage (Brassica rapa L.)

  • Kim, In-Jung;Park, Jee-Young;Lee, Young-Wook;Chung, Won-Il;Lim, Yong-Pyo
    • Journal of Plant Biotechnology
    • /
    • v.4 no.2
    • /
    • pp.59-65
    • /
    • 2002
  • ADP-glucose pyrophosphorylase (AGPase) catalyzes the key regulatory step in starch biosynthesis. Two cDNA clones encoding AGPase subunits were isolated from the leaf cDNA library of Chinese cabbage (Brassica campestris L. spp. pekinensis). One was designated as BCAGPS for the small subunit and the other as BCAGPL for the large subunit. Both cDNAs have uninterrupted open reading frames deriving 57 kDa and 63 kDa polypeptides for BCAGPS and BCAGPL, respectively, which showed significant similarity to those of other dicot plants. Also, However, the deduced amino acid sequence of BCAGPL has a unique feature. That is, it contains two regions (Rl and R2) lacking in all other plant enzymes. This is the first report of BCAGPL containing Rl and R2 among plant large subunits as well as small subunits. From the genomic Southern analysis and BAC library screening, we inferred the genomic status of BCAGPS and BCAGPL gene.

Parallel Multi-task Cascade Convolution Neural Network Optimization Algorithm for Real-time Dynamic Face Recognition

  • Jiang, Bin;Ren, Qiang;Dai, Fei;Zhou, Tian;Gui, Guan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4117-4135
    • /
    • 2020
  • Due to the angle of view, illumination and scene diversity, real-time dynamic face detection and recognition is no small difficulty in those unrestricted environments. In this study, we used the intrinsic correlation between detection and calibration, using a multi-task cascaded convolutional neural network(MTCNN) to improve the efficiency of face recognition, and the output of each core network is mapped in parallel to a compact Euclidean space, where distance represents the similarity of facial features, so that the target face can be identified as quickly as possible, without waiting for all network iteration calculations to complete the recognition results. And after the angle of the target face and the illumination change, the correlation between the recognition results can be well obtained. In the actual application scenario, we use a multi-camera real-time monitoring system to perform face matching and recognition using successive frames acquired from different angles. The effectiveness of the method was verified by several real-time monitoring experiments, and good results were obtained.

Study on the Line Simplification Method based on Turning Function for updating Digital Map (수치지도 갱신을 위한 선회함수 기반의 선형 단순화 기법 연구)

  • Park, Woo-Jin;Park, Seung-Yong;Woo, Ho-Seok;Yu, Ki-Yun
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2009.04a
    • /
    • pp.15-17
    • /
    • 2009
  • The line simplification method based on the turning function is studied in this paper for conversion of ground plan data to geospatial data to update the digital map. This method eliminate vertices effectively by estimating the length and the angle between the vertices based on the turning function which is useful to express the shape of linear feature. As the result, this method shows high shape similarity, high elimination rate of vertices and 100% of satisfaction degree to the drawing rules. Thus this line simplification method is judged to be effective in updating the digital map with ground plans.

  • PDF

A Novel Automatic Algorithm for Selecting a Target Brain using a Simple Structure Analysis in Talairach Coordinate System

  • Koo B.B.;Lee Jong-Min;Kim June Sic;Kim In Young;Kim Sun I.
    • Journal of Biomedical Engineering Research
    • /
    • v.26 no.3
    • /
    • pp.129-132
    • /
    • 2005
  • It is one of the most important issues to determine a target brain image that gives a common coordinate system for a constructing population-based brain atlas. The purpose of this study is to provide a simple and reliable procedure that determines the target brain image among the group based on the inherent structural information of three-dimensional magnetic resonance (MR) images. It uses only 11 lines defined automatically as a feature vector representing structural variations based on the Talairach coordinate system. Average characteristic vector of the group and the difference vectors of each one from the average vector were obtained. Finally, the individual data that had the minimum difference vector was determined as the target. We determined the target brain image by both our algorithm and conventional visual inspection for 20 healthy young volunteers. Eighteen fiducial points were marked independently for each data to evaluate the similarity. Target brain image obtained by our algorithm showed the best result, and the visual inspection determined the second one. We concluded that our method could be used to determine an appropriate target brain image in constructing brain atlases such as disease-specific ones.