• Journal of information and communication convergence engineering
• /
• 제8권2호
• /
• pp.185-190
• /
• 2010

In this paper we propose the CBIR algorithm which is based on a novel image block method that combined both color and edge feature. The main drawback of global histogram representation is dependent of the color without spatial or shape information, a new image block method that divided the image to 8 related blocks which contained more information of the image is utilized to extract image feature. Based on these 8 blocks, histogram equalization and edge detection techniques are also used for image retrieval. The experimental results show that the proposed image block method has better ability of characterizing the image contents than traditional block method and can perform the retrieval system efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1671-1689
• /
• 2013

The key issue of block-based multi-focus image fusion is to determine the size of the sub-block because different sizes of the sub-block will lead to different fusion effects. To solve this problem, this paper presents a novel genetic algorithm (GA) based multi-focus image fusion method, in which the block size can be automatically found. In our method, the Sum-modified-Laplacian (SML) is selected as an evaluation criterion to measure the clarity of the image sub-block, and the edge information retention is employed to calculate the fitness of each individual. Then, through the selection, crossover and mutation procedures of the GA, we can obtain the optimal solution for the sub-block, which is finally used to fuse the images. Experimental results show that the proposed method outperforms the traditional methods, including the average, gradient pyramid, discrete wavelet transform (DWT), shift invariant DWT (SIDWT) and two existing GA-based methods in terms of both the visual subjective evaluation and the objective evaluation.

• 대한임베디드공학회논문지
• /
• 제15권2호
• /
• pp.43-49
• /
• 2020

In this paper, we propose a stage-wise knowledge transfer method that uses block-wise retraining to transfer the useful knowledge of a pre-trained residual network (ResNet) in a teacher-student framework (TSF). First, multiple hint information transfer and block-wise supervised retraining of the information was alternatively performed between teacher and student ResNet models. Next, Softened output information-based knowledge transfer was additionally considered in the TSF. The results experimentally showed that the proposed method using multiple hint-based bottom-up knowledge transfer coupled with incremental block-wise retraining provided the improved student ResNet with higher accuracy than existing KD and hint-based knowledge transfer methods considered in this study.

• 대한조선학회논문집
• /
• 제43권1호
• /
• pp.103-118
• /
• 2006

At the initial design stage, the generation process of the production material information of a building block and the simulation process of the block erection, which are required to perform the production planning and scheduling, have been manually performed using 2D drawings, based on the data of parent ships, and subjective intuition from past experience. To make these processes automatic, the accurate generation method of the production material information and the convenient simulation method of the block erection based on the initial hull structural model(3D CAD model), were developed in this study. Here, the initial hull' structural model was generated from the initial hull structural CAD system early developed by us. To evaluate the developed methods. these methods were applied to corresponding processes of a deadweight 300,OOOton VLCC. As a result. it was shown that the production material information of a building block can be accurately generated and the block erection can be conveniently simulated in the initial design stage.

• 한국정보통신학회논문지
• /
• 제20권12호
• /
• pp.2282-2288
• /
• 2016

보안키 생성기법으로 하드웨어 또는 소프트웨어 관련 생성기법들이 다양하게 제안되고 있다. 본 연구는 기존의 보안키 생성기법들을 분석하여, NAND 플래시 메모리의 Bad Block 정보를 이용하는 새로운 보안키인 NBSK(NAND Bad block based Secure Key)을 설계하고 이를 이용한 암호화기법을 제안한다. NAND 플래시 메모리에 존재하는 Bad Block은 생산중에 발생하기도 하고 사용 도중에 발생하기도 한다. 생산중 발생하는 초기 Bad Block 정보는 변하지 않으며, 사용도중 발생하는 Bad Block 정보는 주기적으로 변할 수 있다는 특성을 가지고 있다. 따라서 본 연구는 NAND 플래시 메모리 생산중에 발생하는 초기의 Bad Block 정보의 물리주소를 이용하여 보안키로 활용할 수 있도록 암호화키를 설계하고 이를 이용한 암호화 기법을 제안한다. 제안 기법을 이용하면 보안키의 생성과 분배의 단순성과 보안키의 인증성과 기밀성 등의 일반적인 보안 특성을 만족할 수 있다.

• 한국컴퓨터정보학회논문지
• /
• 제16권6호
• /
• pp.71-77
• /
• 2011

본 논문에서는 번호판 인식 시스템에서 번호판 영상의 화질 개선을 위하여 국부 블록(Local block : LB) 학습기반의 초해상도 알고리즘을 제안한다. 본 논문에서 국부 블록은 영상 내에서 정보를 담고 있는 최소 단위로 정의하였으며, 학습의 기본 단위가 된다. 제안된 방법은 먼저 다양한 환경에 적합한 훈련 국부 블록 set을 생성하였다. 훈련 국부 블록 set은 고해상도 국부 블록과 저해상도 국부 블록의 순서쌍으로 구성되며 다양한 크기의 번호판과 열화 영상에 대응하기 위하여 다양한 크기와 열화를 갖는 저해상도 국부 블록 훈련 set을 구성하였다. 그 다음으로는 저해상도 입력 영상에서 복원해야할 정보를 훈련 국부 블록 set에서 추출/융합하는 과정을 제안하였다. 모의 실험결과, 열화된 저해상도 번호판 영상에 대해 제안한 방법이 효과적인 복원 성능을 나타내는 것을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권6호
• /
• pp.1600-1619
• /
• 2023

Organizations and other institutions have recently started using cloud service providers to store and share information in light of the Internet of Things (IoT). The major issues with this storage are preventing unauthorized access and data theft from outside parties. The Block chain based Security Sharing scheme with Data Access Control (BSSDAC) was implemented to improve access control and secure data transaction operations. The goal of this research is to strengthen Data Access Control (DAC) and security in IoT applications. To improve the security of personal data, cypher text-Policy Attribute-Based Encryption (CP-ABE) can be developed. The Aquila Optimization Algorithm (AOA) generates keys in the CP-ABE. DAC based on a block chain can be created to maintain the owner's security. The block chain based CP-ABE was developed to maintain secures data storage to sharing. With block chain technology, the data owner is enhancing data security and access management. Finally, a block chain-based solution can be used to secure data and restrict who has access to it. Performance of the suggested method is evaluated after it has been implemented in MATLAB. To compare the proposed method with current practices, Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) are both used.

• Journal of information and communication convergence engineering
• /
• 제9권5호
• /
• pp.487-490
• /
• 2011

This paper presents splitting and merging algorithm based on adaptive thresholding. The algorithm first divides the image into blocks, and then compares each block using the calculated thresholding value. The blocks which are same are merged using the certain threshold value and different blocks are split unless it satisfies the threshold value. When the block has been merged, maximum and minimum block sizes are determined then the average block size is determined. After the average block size is determined the average intensity and standard deviation of average block is calculated. The process of thresholding is applied to binarize the image. Finally, the experimental results show that the proposed method distinguishes clearly the background with text in the document image.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2351-2369
• /
• 2012

This paper describes interpolation method of motion field in the Wyner-Ziv video coding (WZVC) based on Expectation-Maximization (EM) algorithm. In the EM algorithm, the estimated motion field distribution is calculated on a block-by-block basis. Each pixel in the block shares similar probability distribution, producing an undesired blocking artefact on the pixel-based motion field. The proposed interpolation techniques are Bicubic and Lanczos which successively use 16 and 32 neighborhood probability distributions of block-based motion field for one pixel in k-by-k block on pixel-based motion field. EM-based WZVC codec updates the estimated probability distribution on block-based motion field, and interpolates it to pixel resolution. This is required to generate higher-quality soft side information (SI) such that the decoding algorithm is able to make syndrome estimation more quickly. Our experiments showed that the proposed interpolation methods have the capability to reduce EM-based WZVC decoding complexity with small increment of bit rate.

• 한국통신학회논문지
• /
• 제35권11C호
• /
• pp.907-910
• /
• 2010

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.