• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.170-171
• /
• 2012

본 논문에서는 다시점 영상 부호화 시 효율적인 부호화를 위해 이웃한 시점 영상의 부호화 정보를 이용하는데 있어 영상 간의 최대 시차 정보를 이용하여 부호화 하는 방법을 제안한다. 다시점 비디오 부호화 방법은 일반적인 단일 시점 영상의 부호화와 같이 화면 내 참조, 화면 간 참조를 수행할 뿐만 아니라, 이웃한 시점의 영상을 참조하여 부호화 하는 시점 간 참조를 수행한다. 현재 표준화가 진행중인 HEVC 기반의 다시점 부호화 방법에서는, 시점 간 참조 시 이미 부호화가 완료된 이웃한 블록으로부터 시차 벡터 (Disparity vector)를 유도하여 부호화 하는 방법도 사용된다. 이 때 이웃한 블록들로부터 얻어낼 수 있는 시차 벡터가 여러 개일 때, 최대의 절대값을 갖는 시차 벡터를 선택함으로써 부호화 효율을 높일 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.5
• /
• pp.284-290
• /
• 2002

We propose a new authenticated encryption scheme that does not require any block encryption algorithm. Our scheme is based on the Horster-Michels-Petersen authenticated encryption scheme, and it uses a technique in the Bae~Deng signcryption scheme so that the sender's signature can be verified by an arbitrary third party. Since our scheme does not use any block encryption algorithm, we can reduce the code size in its implementation. The computation and communication costs of the proposed scheme are almost the same as those of the Bao-Deng scheme that uses a block encryption algorithm. Our scheme also satisfies all the security properties such as confidentiality, authenticity and nonrepudiation.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.298-304
• /
• 2004

In transmitting a compressed video bit-stream over Internet, a packet loss causes an error propagation in both spatial and temporal domain, which in turn leads to a severe degradation in image quality. In this paper, a new error concealment algorithm is proposed to repair damaged portions of the video frames in the receiver. Conventional BMA(Boundary Matching Algorithm) assumes that the pixels on the boundary of the missing block and its neighboring blocks are very similar, but has no consideration of edges t)r discontinuity across the boundary. In our approach, the edges are detected across the boundary of the lost or erroneous block. Once the edges are detected and the orientation of each edge is found, only the pixel difference along the expected edges across the boundary is measured instead of calculating differences between all adjacent pixels on the boundary. Therefore, the proposed approach needs very few computations and the experiment shows an improvement of the performance over the conventional BMA in terms of both subjective and objective quality of video sequences.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.79-86
• /
• 2006

Recently the tagSNP selection problem has been researched for reducing the cost of association studies between human's diversities and SNPs. General approach for this problem is that all of SNPs are separated into appropriate blocks and then tagSNPs are chosen in each block. Marsel in this paper is the system that involved the concept of linkage disequilibrium for overcoming the problem that the existing block partitioning approaches have short of biological meanings. In most approaches, the contiguous regions, which recombinations have LD coefficient |D'| and then tagSNP selection step is performed. And MarSel guarantees the minimum tagSNP selection using entropy-based optimal selection algorithm when tagSNPs are chosen in each block, and enables chromosome-level association studies using efficient memory management technique when input is very large-scale dataset that is impossible to be processed in the existing systems.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.108-118
• /
• 2001

In this paper, the conventional deblocing algorithms are compared in each region of the image. Based on the comparison result, we propose a new deblocklng algorithm that can improve subjectives as well as the objective quality. Because the human visual system is mode sensitive to the blocking artifacts in the low frequency re91on, we compare the performance of several deblocking algorithms in 7he low and high frequency region separately. For this purpose we also propose an algorithm for classifying the region into low and high frequency ones. and propose a deblocking algorithm which is applied differently to each region. The result shows that the adaptive LPF method yields the best performance in the low frequency region in terms of both subjective and objective quality. Hence. by applying the adaptive LPF method to the low frequency region, the performance of conventional algorithms can be improved. In the high frequency region. it is observed that the DCT-based POCS algorithm provides the best performance. Hence, by combining the algorithm with the adaptive LPF method, the best objective performance is obtained.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.214-217
• /
• 2020

2020년 1월 국내에 신종 코로나 바이러스의 확산으로 인해 보건 마스크의 수요가 급증하고 이에 따라 마스크의 가격이 폭등하자 정부가 건강보험정보를 기반으로 보건용 마스크 판매에 관여하는 공적 마스크 5부제를 시행해 왔다. 하지만 건강보험 가입정보에 의존적인 신원 인증 시스템으로 인해 유학생 등 건강보험 미가입자의 경우 마스크의 구입이 어렵고 개인정보 접근 문제 등으로 판매채널의 확장이 어려운 문제가 있었다. 본 논문에서는 건강보험과 같은 특정 신원정보 시스템에 의존하지 않고 중앙기관이 발행하는 신뢰할 수 있는 모든 신원정보(여권, 외국인등록증 등)에 기반하여 사용자가 스스로 자신의 신원정보 속성을 블록체인을 통해 관리하는 방법을 제안한다. 또한 제안 방법에 대해 디지털신원 기법을 평가할 수 있는 지표를 기반으로 자체 평가를 수행한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.295-296
• /
• 2008

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.138-141
• /
• 2020

영상 감시 시스템은 광범위한 영역에서 쉽게 설치되고 있으며, 감시 지역을 녹화한 영상 정보는 대게 인터넷을 통한 클라우드 상의 저장소에서 관리하는 중앙 관리 방식을 사용하고 있다. 그러나 이러한 시스템의 주요한 문제점은 저장 영상의 전송 과정과 저장 대해서 객관적으로 신뢰할 수 있는 방법이 제공되지 않고 있으며, 개인정보보호를 위한 장치 유무와 별개로 모든 권한을 서비스 제공자에게 위임한 상태에서 운영하고 있다는 점이다. 본 연구에서는 공개키 기반 암호화와 블록체인 기반의 키 관리 시스템을 조합한 아키텍처를 이용하여 민감한 정보를 사용자가 안전하게 보호할 수 있는 방안을 제시한다. 제안하는 아키텍처에서는 대칭키를 사용한 블록 암호화(block-cipher) 과정을 통해 영상 정보를 암호화하고, 이때 사용하는 대칭키를 사용자의 공개키로 암호화하여 블록체인의 레저(ledger)로 기록하는 기법을 사용한다. 영상정보를 암호화하는 과정을 블록체인 네트워크의 특성(분산, 투명성, 데이터 변조 불가)을 활용하여 개인정보 영상의 생성부터 소멸까지 사용자가 추적이 가능하도록 한다.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.731-740
• /
• 2003

Since motion estimation remove the redundant data to employ the temporal correlations between adjacent frames in a video sequence, it plays an important role in digital video coding. And in the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the small-cross search pattern and the block-based gradient descent search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the small-cross search pattern, and then quickly finds the other motion vectors that are not close to the center of search window using the block-based gradient descent search pattern. Through experiments, compared with the block-based gradient descent search algorithm(BBGDS), the proposed search algorithm improves as high as 26-40% in terms of average number of search point per motion vector estimation.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.