• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.247-256
• /
• 2004

In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1617-1622
• /
• 2004

MPEG/Audio decoder for mobile multimedia systems requires low power consumption. Implementations of AV decoder using a single RISC processor often need high power consumption owing to cash-miss in case of insufficient cash memory. In this paper, we present a MPEG/Audio decoder for mobile handset applications and implement it on a RISC processor embedding a minimized DSP accelerator. Audio decoding algorithm is splined into two parts; computation intensive and control intensive parts. Those parts we, respectively, allocated to DSP and RISC core, which are designed to run in parallel to increase the processing efficiency. The proposed system implements MP3 and AAC decoders at l7MHz and 24MHz clocks, which are reductions of 48% and 40% of complexities in comparison with implementations on a single RISC processor. The proposed method is adequate for mobile multimedia applications with insufficient cash memory.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.1060-1070
• /
• 2022

With the development of information technology, the size of the system has become larger and diversified, and the existing role-based access control has faced limitations. Blockchain technology is being used in various fields by presenting new solutions to existing security vulnerabilities. This paper suggests efficient role-based access control in a blockchain where the required gas and processing time vary depending on the access frequency and capacity of the storage. The proposed method redefines the role of reusable units, introduces a hierarchical structure that can efficiently reflect dynamic states to enhance efficiency and scalability, and includes user-centered authentication functions to enable cryptocurrency linkage. The proposed model was theoretically verified using Markov chain, implemented in Ethereum private network, and compared experiments on representative functions were conducted to verify the time and gas efficiency required for user addition and transaction registration. Based on this in the future, structural expansion and experiments are required in consideration of exception situations.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.719-722
• /
• 2004

객체 중심점에서 움직임을 추정하고 보상하여 빠르게 움직이는 객체의 윤곽선을 실시간으로 추적 할 수 있는 알고리듬을 제안하였다. 방사상 표현 (radial representation) 방식을 적용하여 객체 중심점에서만 블록정합 (block matching) 알고리듬으로 움직임을 추정하고 보상하여 적은 계산량으로 객체 움직임을 추정하고 보상함으로써 객체 윤곽선을 실시간으로 추적하였다. 에너지 수렴 과정에서 기울기 영상과 차영상 (differential image)을 에너지 함수로 함께 사용함으로 배경 잡영 등에도 강건하도록 하였다. 실험 결과 움직임이 빠른 객체와 배경 잡영 속의 객체도 실시간으로 강건하게 추적함을 확인하였다.

• Journal of Convergence for Information Technology
• /
• v.9 no.12
• /
• pp.1-7
• /
• 2019

As the cloud environment has become more prevalent among large companies, small and medium-sized companies are also trying to utilize various technologies (IoT, blockchain, etc.) that use cloud services as a way to coexist with large companies. In this paper, a blockchain-based IoT information collection model is proposed to efficiently handle large volumes of IoT data produced by small businesses in order to improve information efficiency of SMEs. The proposed model allowe d small businesses to improve their production efficiency by independently creating groups of the same information so that data that could be generated at the endpoints of small businesses can be block-chained and forwarded to the data center for analysis. In addition, the proposed model's performance assessment was assumed to handle the production throughput of data processed in IoT for small and medium businesses, not large enterprises, so the link between large volumes of data processed in the proposed model could be maintained evenly. One of the biggest features of the proposed model is the ability to expand processes to efficiently control the information of prod ucts produced, as well as the productivity of small and medium enterprises.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.211-219
• /
• 1995

블록-삼각(Block-angular)구조를 갖는 선형 제약식과 분리되지 않는 콘벡스 목적함수의 대규모 비분리 콘벡스 최적화 문제의 해법으로 번들-분해법 (Bundle Based Decomposition)을 이용한 알고리즘 SQA(Separable Quadratic Approximation)은 비분리 콘벡스 프로그램을 분리가능한 2차계획 법(Separable Quadratic Programming) 문제로 근사화시켜 번들-분해법을 축 차적으로 적용한다. 본 연구는 수렴성(local convergence & global convergence) 및 알고리즘 구현 [1]에 이어 이에 대한 수치적용 결과를 중심 으로 소개한다. 수치 적용은 ANSI C로 작성된 SQA 프로그램을 SUN SPARC II에서 실행하였으며 이때 대규모 비분리 최적화 문제의 비분리 목 적함수와 블록-삼각 구조의 선형 제약식들이 계수들은 ANSI C의 랜덤함수 로부터 임의의 값들을 이용하였다. 이와같은 다양한 비분리 콘벡스 최적화 문제에 대한 수렴성, 반복회수 및 처리시간등의 결과와 함께 GAMS/MINOS 의 최적해를 소개한다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.402-410
• /
• 2006

This paper presents a method for feature based block motion estimation that uses multi -resolution image sequences to obtain the panoramic images in the continuous ultrasound image sequences. In the conventional block motion estimation method, the centers of motion estimation blocks are set at the predetermined and equally spaced locations. This requires the large blocks to include at least one feature, which inevitably requires long estimation time. In this paper, we propose an adaptive method which locates the center of the motion estimation blocks at the feature points. This make it possible to reduce the block size while keeping the motion estimation accuracy The Harris-Stephen corner detector is used to get the feature points. The comer points tend to group together, which cause the error in the global motion estimation. In order to distribute the feature points as evenly as Possible, the image is firstly divided into regular subregions, and a strongest corner point is selected as a feature in each subregion. The ultrasound Images contain speckle patterns and noise. In order to reduce the noise artifact and reduce the computational time, the proposed method use the multi-resolution image sequences. The first algorithm estimates the motion in the smoothed low resolution image, and the estimated motion is prolongated to the next higher resolution image. By this way the size of search region can be reduced in the higher resolution image. Experiments were performed on three types of ultrasound image sequences. These were shown that the proposed method reduces both the computational time (from 77ms to 44ms) and the displaced frame difference (from 66.02 to 58.08).

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.306-308
• /
• 2003

본 논문은 컬러영상내 움직이는 객체의 효과적인 검출을 위해 색상과 위치정보를 적용시킨 K-means 클러스터링 알고리즘을 이용하여 움직이는 객체들을 추출한 방법을 제안하고 있다. 최종 클러스터링된 중심픽셀(prototype)이 갖고있는 RGB 값을 사용해 프레임을 비교해 객체와 배경의 분리를 가능하게 했고 마지막으로 후처리를 이용해 남아있는 배경잡음을 제거하였다. 본 연구의 실험은 여러 교통장면을 포함한 다양한 영상에서 이루어졌으며 실험결과 제안된 알고리즘은 기존의 픽셀이나 블록기반의 방법에 비해 보다 정확한 객체 검출이 가능했으며 한 가지 특징 정보를 사용한 클러스터링에 비해 보다 높은 정확도를 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.709-712
• /
• 2006

다양한 종류의 컴퓨터가 사람, 사물, 환경 속에 내재되어 있고, 이들이 서로 연결되어, 필요한 곳에서 활용할 수 있는 유비쿼터스 환경에서는 홈 네트워크를 통해 이 기종 기기간 다양한 데이터 교환을 요구한다. 더욱이 원활한 영상 데이터의 처리, 전송, 모니터링 기술은 핵심적 요소가 아닐 수 없다. 공간 및 시간적인 해상도, 컬러의 표현 그리고 화질의 측정방법 등 고전적 영상 처리 연구 분야뿐만 아니라 국한된 대역폭을 갖는 홈네트워크의 전송체계에서 전송률 문제에 대한 심도 있는 연구가 필요하다. 본 논문에서는 홈네트워크 상황에서 콘텐츠의 중심이 되는 영상 데이터의 전송과 처리 그리고 제어를 위하여 새로운 움직임 추정 알고리즘을 제안한다. 각도, 거리등 다양한 환경에서 전송되어지는 스테레오 카메라의 영상데이터들은 축소, 확대, 이동, 보정 등 전처리 후 제안된 변형계층 모션벡터 추정 알고리즘을 이용하여 압축 처리, 전송된다. 기존 모션벡터 추정 알고리즘의 장점을 계승하고 단점을 보완한 변형계층 알고리즘은 비정형, 소형 매크로 블록을 이용하여 휘도의 편차가 큰 영상의 효율적 움직임 추정에 이용된다. 본 논문에서 제안한 변형계층 알고리즘과 이를 이용해 구현된 영상시스템은 유비쿼터스 환경에서 다양하게 활용될 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.141-148
• /
• 2011

Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.