• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.328-331
• /
• 2008

많은 양의 이미지를 포함하고 있는 대용량 데이터베이스에 대한 이미지 검색에서 보다 짧은 시간에 적은 양의 검색공간을 사용하면서 원하는 결과를 얻을 수 있는 이미지 인덱싱 기법에 대한 다양한 연구가 진행되어 왔다. 본 논문에서는 외형 기반의 이미지 검색에서 기존의 인덱싱 기법보다 빠른 검색을 지원할 수 있는 해시 기반의 새로운 인덱싱 기법을 제안한다. 기존의 해시 기반 인덱싱 기법에서는 해시 주소 계산을 위해 인덱스 값의 범위가 미리 정해져야 하기 때문에 색상 정보 등 소수의 특징 정보를 제외하고는 인덱싱에 널리 사용되지 못하고 있다. 한편, 제안된 해시 구조는 값의 범위가 정해지지 않은 정수형의 인덱스 값을 기반으로 효과적으로 이미지 인덱스를 구축할 수 있다. 효과적인 이미지 검색을 위해 제안된 인덱스를 기반한 범위검색(Range Search) 기법을 제안하였으며, 실험을 통해 제안된 인덱스 구조에서의 범위 검색이 기존의 인덱스 구조에 비해 보다 효과적임을 보인다.

• Journal of Korean Society of Archives and Records Management
• /
• v.19 no.3
• /
• pp.155-178
• /
• 2019

The study aims to analyze the characteristics and problems of raw image file formats, evaluate its suitability for the management of digital photographic records, and suggest the introduction method to utilize such format in public institutions. Raw image file formats feature reversibility and flexibility. However, most of them are proprietary file formats that depend on the digital camera manufacturer. The DNG format, which was developed to standardize raw image file formats, has received positive reviews from overseas public agencies. However, the DNG format is not fully recognized as a standard; hence, it is appropriate to use it tentatively until the standard raw format appears. On the other hand, the converted digital photo file format is not recognized as an original with legal authenticity. Therefore, in the short term, DNG files created by format conversion and original raw files should be encapsulated and preserved. Furthermore, it is necessary to redefine the baseline of the hash value and file size to recognize the legal authenticity only with DNG files in the long term.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.99-106
• /
• 2017

With the advent of virtual money such as bit coins, interest in the block chain is increasing. Block Chain is a technology that supports Distributed Ledger and is a versatile technology applicable to various fields. Currently, the block chain is conducting research for various applications such as virtual money, trade finance, marketplace, power market, image contents service, and IoT. The technologies that make up the block chain are smart contract, digital signature/hash function and consensus algorithm. And these technologies operate on P2P networks. In this paper, we have studied e-mail system based on the ethereum which is one of the block chain based technologies. Most legacy mail systems use SMTP and the POP3/IMAP protocol to send and receive e-mail, and e-mail use S/MIME to protect the e-mail. However, S/MIME is vulnerable to DDoS attacks because it is configured centrally. And it also does not provide non-repudiation of mail reception. To overcome these weaknesses, we proposed an e-mail system model based on ethereum. The proposed model is able to cope with DDoS attack and forgery prevention by using block chain based technology, and reliable recording and management among block chain participants are provided, so that it is possible to provide a non-repudiation function of e-mail transmission and reception.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.549-555
• /
• 2003

CA is cost-effective to generate pseudorandom patterns than LFSR. Based on the effectiveness of a CA based pseudorandom pattern generator, CA have been employed successfully in several applications. Especially Nongroup CA is applied to efficient hash function generation, cryptography and image compression. In this paper we analyze the properties of TPNCA and by using basic paths in the 0-tree of a linear TPNCA we analyze the structure of the state-transition graph. Also by showing the structure of the complemented CA which have the acyclic state of the 0-tree as the complement vector is isomorphic to the structure of the original TPNCA, we reduce the time in analyzing the CA-states.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.2
• /
• pp.417-424
• /
• 2019

This paper presents the design of a JPEG-LS codec for lossless image compression from AR/VR device. The proposed JPEG-LS(: LosSless) codec is mainly composed of a context modeling block, a context update block, a pixel prediction block, a prediction error coding block, a data packetizer block, and a memory block. All operations are organized in a fully pipelined architecture for real time image processing and the LOCO-I compression algorithm using improved 2D approach to compliant with the SBT coding. Compared with a similar study in JPEG-LS, the Block-RAM size of proposed STB-FLC architecture is reduced to 1/3 compact and the parallel design of the predication block could improved the processing speed.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.24 no.4
• /
• pp.184-193
• /
• 2021

The system for managing spatial data updates the existing information by extracting only the information that is different from the existing information for the newly obtained spatial information file to update the stored information. In order to extract only objects that have changed from existing information, it is necessary to compare whether there is any difference from existing information for all objects included in the newly obtained spatial information file. This study was conducted to improve this total inspection method in a situation where the amount of spatial information that is frequently updated increases and data update is required at the national level. In this study, before inspecting individual objects in a new acquisition space information file, a method of determining whether individual space objects have been changed only by the information in the file was considered. Spatial data files have structured data characteristics different from general image or text document files, so it is possible to determine whether to change the file unit in a simpler way compared to the existing method of creating and managing file hash. By reducing the number of target files that require full inspection, it is expected to improve the use of resources in the system by saving the overall data quality inspection time and saving data extraction time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.3
• /
• pp.220-228
• /
• 2001

Digital watermarking is a technique for the purpose of protecting the ownership of the image by embedding invisible watermarks in a digital imnge. To guarantee the security of the digital watermarking scheme for copyright protection, it is required to satisfy some requirements robustness and perceptual invisibility which provided by the location of embedded bits, the public watermarking algorithm, and the hidden use of the key, which can protect unauthorized accesses from illegal users. For this, in this paper we propose a new copyright watermarking scheme, which is based on one-way hash functions using RSA functions and modular operations. RSA functions are widely used in cryptographic systems. Our watermarking scheme is robust against LSB(Jeast significant bit) attacks and gamma corresction attack, and is also perceptually invisible. We demonstrate the characteristics of our proposed watermarking scheme through experiments.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.304-313
• /
• 2016

We present a novel memory-efficient parallel ray casting algorithm for unstructured grid volume rendering on multi-core CPUs. Our method is based on the Bunyk ray casting algorithm. To solve the high memory overhead problem of the Bunyk algorithm, we allocate a fixed size local buffer for each thread and the local buffers contain information of recently visited faces. The stored information is used by other rays or replaced by other face's information. To improve the utilization of local buffers, we propose an image-plane based ray grouping algorithm that makes ray groups have high coherency. The ray groups are then distributed to computing threads and each thread processes the given groups independently. We also propose a novel hash function that uses the index of faces as keys for calculating the buffer index each face will use to store the information. To see the benefits of our method, we applied it to three unstructured grid datasets with different sizes and measured the performance. We found that our method requires just 6% of the memory space compared with the Bunyk algorithm for storing face information. Also it shows compatible performance with the Bunyk algorithm even though it uses less memory. In addition, our method achieves up to 22% higher performance for a large-scale unstructured grid dataset with less memory than Bunyk algorithm. These results show the robustness and efficiency of our method and it demonstrates that our method is suitable to volume rendering for a large-scale unstructured grid dataset.