• 한국멀티미디어학회논문지
• /
• 제20권8호
• /
• pp.1312-1320
• /
• 2017

Recently, vector map data is developed and used in many domains widely. In the most cases, vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the production process of vector maps is considerably complex and consumes a lot of money and human resources. Therefore, the secured storage and transmission are necessary to prevent the illegal copying and distribution from hacker. This paper presents a selective encryption algorithm using geometric objects in frequency domain for vector map data. In the proposed algorithm, polyline and polygon data in vector map is the target of the selective encryption process. Experimental results verified that proposed algorithm is effectively and adaptive the requirements of security.

• 대한전자공학회논문지SP
• /
• 제42권5호
• /
• pp.123-136
• /
• 2005

본 논문에서는 신경회로망보다 우수한 성능을 보이는 학습 이론인 SVM을 기반으로, 인간의 인지 과학에서 많은 연구가 이루어지고 있는 선택적 주의집중을 응용한 중첩 패턴 인식 시스템을 제안한다. 제안된 선택적 주의집중 모델은 SVM의 입력단에 주의집중층을 추가하여 SVM의 입력을 직접 변화시키는 학습을 하며 선택적 필터의 기능을 수행한다. 주의집중의 핵심은 학습을 멈추는 적절한 시점을 찾는 것과 그 시점에서 결과를 판단하는 주의집중 척도를 정의하는 것이다. 지지벡터는 주변에 존재하는 패턴들을 대표하는 표본이므로 입력 패턴이 초기상태일 때 주의집중을 하고자 하는 클래스의 가장 가까운 지지벡터를 기준으로 그 지지벡터와의 거리가 최소가 되었을 때 주의집중을 멈추는 것이 적절하다. 일반적인 주의집중을 적용하면 주의집중 척도를 정의하기가 난해해지기 때문에 변형된 입력이 원래 입력의 범위를 넘지 않는다는 제약조건을 추가하여 사용할 수 있는 정보의 폭을 넓히고 새로운 척도를 정의하였다. 이때 사용한 정보는 변형된 입력과 원래 입력의 유클리드 거리, SVM의 출력, 초기상태에 가장 가까웠던 히든뉴런의 출력값이다. 인식 실험을 위해 USPS 숫자 데이터를 사용하여 45개의 조합으로 중첩시켰으며, 주의집중을 적용시켰을 때 단일 SVM보다 인식 성능이 월등히 우수함을 확인하였고, 또한 제한된 주의집중을 사용하였을 때 일반적 주의집중을 이용하는 것 보다 성능이 더 뛰어났음을 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제18권7호
• /
• pp.818-826
• /
• 2015

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents the selective encryption scheme using hybrid transform for GIS vector map data protection to store, transmit or distribute to authorized users. In proposed scheme, polylines and polygons in vector map are targets of selective encryption. We select the significant objects in polyline/polygon layer, and then they are encrypted by the key sets generated by using Chaotic map before changing them in DWT, DFT domain. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

• Journal of Information Processing Systems
• /
• 제13권1호
• /
• pp.68-82
• /
• 2017

Nowadays, geographic information system (GIS) is developed and implemented in many areas. A huge volume of vector map data has been accessed unlawfully by hackers, pirates, or unauthorized users. For this reason, we need the methods that help to protect GIS data for storage, multimedia applications, and transmission. In our paper, a selective encryption method is presented based on vertex randomization and hybrid transform in the GIS vector map. In the proposed algorithm, polylines and polygons are focused as the targets for encryption. Objects are classified in each layer, and all coordinates of the significant objects are encrypted by the key sets generated by using chaotic map before changing them in DWT, DFT domain. Experimental results verify the high efficiency visualization by low complexity, high security performance by random processes.

• 한국멀티미디어학회논문지
• /
• 제17권7호
• /
• pp.769-777
• /
• 2014

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

• 한국멀티미디어학회논문지
• /
• 제19권8호
• /
• pp.1453-1459
• /
• 2016

Recently, vector map has developed, used in many domains, and in most cases vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the manufacturing process of a vector map is complex and the maintenance of a digital map requires substantial monetary and human resources. This paper presents the selective encryption scheme based on polyline simplification methods for GIS vector map data protection to store, transmit or distribute to authorized users. Main advantages of our algorithm are random vertices and transformation processes but it still meets requirements of security by random processes, and this algorithm can be implement to many types of vector map formats.

• 한국미생물·생명공학회지
• /
• 제15권5호
• /
• pp.328-333
• /
• 1987

고효율 에타놀 생성 균주인 Zymomonas mobilis의 plasmid vector가 숙주세포 내에서 안정하게 유지되는지의 여부를 회분 및 연속배양 방법을 통하여 조사하였다. Z. mobilis 숙주세포는 전이된 plasmid의 크기와 배지의 조성에 따라 증식속도에 영향을 받음을 알 수 있었고 작은 크기의 plasmid를 비 선택성 (non-selective) 배지에서 배양한 경우 더 빠른 성장을 보였다. 또한 사용한 4종류의 plasmid vector 모두 숙주세포 내에서 30세대 이상에 걸쳐 93% 이상의 높은 안정성을 나타내면서 독립적으로 증식함이 확인되었다.

• 한국미생물·생명공학회지
• /
• 제23권5호
• /
• pp.536-543
• /
• 1995

Multicopy integration vector is a very useful vector system in that they can be integrated into chromosomal DNA in several copies and stably maintained under non-selective conditions. To develop a multicopy integration vector system in the yeast Yarrowia lipolytica, P-type ribosomal DNA was cloned from Y lipolytica. A HindIII-BglII fragment of the cloned rDNA and a promoterless URA3 gene were inserted into pGEM1, generating multicopy integration vectors, pMIYL-1 and pMIYL-2. The rDNA fragment is for targeted homologous recombination between the vector and the chromosomal DNA of Y. lipolytica, and the promoterless URA3 gene is a defective selection marker for inducing multicopy integration. pMIYL-1 and pMIYL-2 have an unique restriction enzyme site, KpnI, and two unique restriction enzyme sites, KpnI and EcoRI, repectively, which can be used for targeting of the vectors into the rDNA of Y. lipolytica chromosomal DNA. After transformation of the vectors into Y. lipolytica, copy number and stability were analyzed by Southern hybridization. The vectors were found to be present in less than 5 copies per cell and were stably maintained during growth in non-selective media.

• 한국미생물·생명공학회지
• /
• 제31권4호
• /
• pp.322-328
• /
• 2003

TAR(Transformation-Associated Recombination) cloning 법은 복잡한 고등생물의 게놈으로부터 유전자나 특정 염색체 부위를 선별적 분리를 가능하게 한다. 이 방법은 목적으로 하는 염색체 부위의 주변에 존재하는 비교적 짧은 게놈 염기서열에 대한 정보를 필요로 하며, spheroplast 형질전환 과정에서 게놈 DNA와 5'-와 3'-표적배열을 지닌 TAR vector 사이에서 일어나는 상동성 재조합과정에 의해 이루어진다. 본 연구에서는 single-copy 유전자의 클론닝에 필요한 specific hook의 최소 크기를 조사하였고, 서로 다른 TAR vector(radial과 unique vector)의 유용성을 조사하기 위해 동일한 single-copy 유전자의 클론닝을 통해 비교하였다. 그 결과, hHPRT 유전자에 대한 TAR cloning의 빈도는 hook의 길이가 750 bp∼63 bp의 범위에서 동일하게 나타났다. radial hook을 사용한 경우보다 unique hook을 사용하였을 경우 형질전환체의 수는 약 20배정도의 감소를 보였으나 목적으로 하는 재조합체의 분리 빈도는 두 배 이상 증가하였다. 그러므로 본 연구에서 two-unique TAR vector는 선별력이 높으므로 일반적 TAR cloning에 사용할 수 있으며, radial TAR vector의 경우는 병리학적 표본과 같이 제한된 게놈 DNA를 사용하는 경우에 더 적합하다고 볼 수 있다. 또한, single-copy 유전자의 분리에 필요로 하는 specific hoot의 최소 길이는 약 60 bp로도 가능하다는 것을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.31-34
• /
• 2000

In this paper, we proposed multispectral image compression method using CIP (classified inter-channel prediction) and SVQ (selective vector quantization) in wavelet domain. First, multispectral image is wavelet transformed and classified into one of three classes considering reflection characteristics of the subband with the lowest resolution. Then, for a reference channel which has the highest correlation with other channels, the variable VQ is performed in the classified intra-channel to remove spatial redundancy. For other channels, the CIP is performed to remove spectral redundancy. Finally, the prediction error is reduced by performing SVQ. Experiments are carried out on a multispectral image. The results show that the proposed method reduce the bit rate at higher reconstructed image quality and improve the compression efficiency compared to conventional method.