• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.1
• /
• pp.27-34
• /
• 2021

In this paper, we propose a copyright protection scheme for real-time streaming of HEVC(High Efficiency Video Coding) based realistic content. Previous research uses encryption and modular operation for copyright pre-protection and copyright post-protection, which causes delays in ultra high resolution video. The proposed scheme maximizes parallelism by using thread pool based DRM(Digital Rights Management) packaging with only HEVC's CABAC(Context Adaptive Binary Arithmetic Coding) codec and GPU based high-speed bit operation(XOR), thus enabling real-time copyright protection. As a result of comparing this scheme with previous research at three resolutions, PSNR showed an average of 8 times higher performance, and the process speed showed an average of 18 times difference. In addition, as a result of comparing the robustness of the forensic mark, the filter and noise attack, which showed the largest and smallest difference, with a 27-fold difference in recompression attacks, showed an 8-fold difference.

• The Korean Journal of Nuclear Medicine
• /
• v.31 no.1
• /
• pp.73-82
• /
• 1997

Regional myocardial blood flow (rMBF) can be noninvasively quantified using N-13 ammonia and dynamic positron emission tomography (PET). The quantitative accuracy of the rMBF values, however, is affected by the distortion of myocardial PET images caused by finite PET image resolution and cardiac motion. Although different methods have been developed to correct the distortion typically classified as partial volume effect and spillover, the methods are too complex to employ in a routine clinical environment. We have developed a refined method incorporating a geometric model of the volume representation of a region-of-interest (ROI) into the two-compartment N-13 ammonia model. In the refined model, partial volume effect and spillover are conveniently corrected by an additional parameter in the mathematical model. To examine the accuracy of this approach, studies were performed in 9 coronary artery disease patients. Dynamic transaxial images (16 frames) were acquired with a GE $Advance^{TM}$ PET scanner simultaneous with intravenous injection of 20 mCi N-13 ammonia. rMBF was examined at rest and during pharmacologically (dipyridamole) induced coronary hyperemia. Three sectorial myocardium (septum, anterior wall and lateral wall) and blood pool time-activity curves were generated using dynamic images from manually drawn ROIs. The accuracy of rMBF values estimated by the refined method was examined by comparing to the values estimated using the conventional two-compartment model without partial volume effect correction rMBF values obtained by the refined method linearly correlated with rMBF values obtained by the conventional method (108 myocardial segments, correlation coefficient (r)=0.88). Additionally, underestimated rMBF values by the conventional method due to partial volume effect were corrected by theoretically predicted amount in the refined method (slope(m)=1.57). Spillover fraction estimated by the two methods agreed well (r=1.00, m=0.98). In conclusion, accurate rMBF values can be efficiently quantified by the refined method incorporating myocardium geometric information into the two-compartment model using N-13 ammonia and PET.

• Korean Journal of Cognitive Science
• /
• v.28 no.4
• /
• pp.193-221
• /
• 2017

Grouping episodes into semantically related categories is necessary for better mnemonic structure. However, the effect of grouping on memory of subordinate details was not clearly understood. In an fMRI study, we tested whether attending superordinate during semantic association disrupts or enhances subordinate episodic details. In each cycle of the experiment, five cue words were presented sequentially with two related detail words placed underneath for each cue. Participants were asked whether they could imagine a category that includes the previously shown cue words in each cycle, and their confidence on retrieval was rated. Participants were asked to perform cued recall tests on presented detail words after the session. Behavioral data showed that reaction times for categorization tasks decreased and confidence levels increased in the third trial of each cycle, thus this trial was considered to be an important insight where a semantic category was believed to be successfully established. Critically, the accuracy of recalling detail words presented immediately prior to third trials was lower than those of followed trials, indicating that subordinate details were disrupted during categorization. General linear model analysis of the trial immediately prior to the completion of categorization, specifically the second trial, revealed significant activation in the temporal gyrus and inferior frontal gyrus, areas of semantic memory networks. Representative Similarity Analysis revealed that the activation patterns of the third trials were more consistent than those of the second trials in the temporal gyrus, inferior frontal gyrus, and hippocampus. Our research demonstrates that semantic grouping can cause memories of subordinate details to fade, suggesting that semantic retrieval during categorization affects the quality of related episodic memory.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.9-20
• /
• 2005

Recently, the MPEG-7 standard a multimedia content description standard is wide]y used for content based image/video retrieval systems. However, since the descriptors standardized in MPEG-7 are usually multidimensional and the problem called 'Curse of dimensionality', previously proposed indexing methods(for example, multidimensional indexing methods, dimensionality reduction methods, filtering methods, and so on) could not be used to effectively index the multimedia database represented in MPEG-7. This paper proposes an efficient multimedia data indexing mechanism reflecting the characteristics of MPEG-7 visual descriptors. In the proposed indexing mechanism, the descriptor is transformed into a histogram of some attributes. By representing the value of each bin as a binary number, the histogram itself that is a visual descriptor for the object in multimedia database could be represented as a bit string. Bit strings for all objects in multimedia database are collected to form an index file, bitmap index, in the proposed indexing mechanism. By XORing them with the descriptors for query object, the candidate solutions for similarity search could be computed easily and they are checked again with query object to precisely compute the similarity with exact metric such as Ll-norm. These indexing and searching mechanisms are efficient because the filtering process is performed by simple bit-operation and it reduces the search space dramatically. Upon experimental results with more than 100,000 real images, the proposed indexing and searching mechanisms are about IS times faster than the sequential searching with more than 90% accuracy.

• Journal of Advanced Navigation Technology
• /
• v.22 no.1
• /
• pp.20-26
• /
• 2018

In this paper, we propose a moving object detection and tracking algorithm based on multi-frame feature point tracking information to reduce false positives. However, there are problems of detection error and tracking speed in existing studies. In order to compensate for this, we first calculate the corner feature points and the optical flow of multiple frames for camera movement compensation and object tracking. Next, the tracking error of the optical flow is reduced by the multi-frame forward-backward tracking, and the traced feature points are divided into the background and the moving object candidate based on homography and RANSAC algorithm for camera movement compensation. Among the transformed corner feature points, the outlier points removed by the RANSAC are clustered and the outlier cluster of a certain size is classified as the moving object candidate. Objects classified as moving object candidates are tracked according to label tracking based data association analysis. In this paper, we prove that the proposed algorithm improves both precision and recall compared with existing algorithms by using quadrotor image - based detection and tracking performance experiments.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.66-69
• /
• 2000

웹이 등장하면서 지금까지 인터넷 상에서 텍스트와 이미지를 이용하여 정보를 표현하고 전달하는 방법이 가장 많이 사용되어왔다. 그러나 웹 관련 기술의 비약적인 발달과 네트워크 속도의 증가 및 인터넷의 급속한 보급으로 단순한 텍스트와 이미지 중심의 HTML 문서를 이용한 정보의 전달이 아닌 멀티미디어 데이터를 이용한 정보의 표현과 전달이 점차 증대되고 있다. 이에 따라 멀티미디어 데이터를 전송하기 위한 스트리밍 프로토콜도 등장하였다. 최근에는 컴퓨터의 성능 증가 및 네트워크 속도의 증가(초고속 통신 서비스의 보급)에 의해 멀티미디어 데이터의 전송이 가능하게 됨으로써 기존의 공중파나 CATV 방송국의 형태 지니고 인터넷 상에서 실시간 생방송 서비스와 VOD(Video On Demand) 서비스를 제공하는 인터넷 방송국이 급속하게 생겨나고 있다. (11) 인터넷 방송은 동영상과 오디오의 실시간 전달을 가능하게 하는 멀티미디어 스트리밍 기술과 멀티미디어를 실시 간으로 전송할 수 있는 실시간 전송 프로토콜을 기반으로 발전하고 있다. 인터넷 상에서 멀티미디어 스트리밍 서비스를 하는 대부분의 인터넷 방송은 스트리밍 서버로서 RealNetworks사의 RealSystem과 Microsoft사의 WMT(Windows Media Technologies)를 사용하고 있다. 본 논문은 Real Server와 WMT의 비교 분석을 통해 실시간 전송 프로토콜을 지원하고, 멀티미디어 스트리밍 기술을 지원하는 자바를 기반으로 한 분산 서버 구조의 스트리밍 서버, 서버간의 부하를 제어하는 미들웨어, 멀티미디어 스트림을 재생할 수 있는 클라이언트를 설계하고 구현한다.있다.구현한다. 이렇게 구현된 시스템은 전자 상거래, 가상 쇼핑몰, 가상 전시화, 또는 3차원 게임이나 가상교육 시스템과 같은 웹기반 응용프로그램에 사용될 수 있다.물을 보존·관리하는 것이 필요하다. 이는 도서관의 기능만으로는 감당하기 어렵기 때문에 대학정보화의 센터로서의 도서관과 공공기록물 전문 담당자로서의 대학아카이브즈가 함께 하여 대학의 공식적인 직무 관련 업무를 원활하게 지원하고, 그럼으로써 양 기관의 위상을 높이는 상승효과를 낼 수 있다.하여는, 인쇄된 일차적 정보자료의 검색방법등을 개선하고, 나아가서는 법령과 판례정보를 위한 효율적인 시스템을 구축하며, 뿐만 아니라 이용자의 요구에 충분히 대처할 수 잇는 도서관으로 변화되는 것이다. 이와 함께 가장 중요한 것은 법과대학과 사법연수원에서 법학 연구방법에 관한 강좌를 개설하여 각종 법률정보원의 활용 내지 도서관 이용방법에 관하여 교육하는 것이다.글을 연구하고, 그 결과에 의존하여서 우리의 실제의 생활에 사용하는 $\boxDr$한국어사전$\boxUl$등을 만드는 과정에서, 어떤 의미에서 실험되었다고 말할 수가 있는 언어과학의 연구의 결과에 의존하여서 수행되는 철학적인 작업이다. 여기에서는 하나의 철학적인 연구의 시작으로 받아들여지는 이 의미분석의 문제를 반성하여 본다. 것이 필요하다고 사료된다.크기에 의존하며, 또한 이러한 영향은 $(Ti_{1-x}AI_{x})N$ 피막에 존재하는 AI의 함량이 높고, 초기에 증착된 막의 업자 크기가 작을 수록 클 것으로 여겨진다. 그리고 환경의 의미의 차이에 따라 경관의 미학적 평가가 달라진 것으로

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.182-192
• /
• 2010

This paper proposes the hardware IP design of JBIG2 encoder. In order to facilitate the next generation FAX after the standardization of JBIG2, major modules of JBIG2 encoder are designed and implemented, such as symbol extraction module, Huffman coder, MMR coder, and MQ coder. ImpulseC Codeveloper and Xilinx ISE/EDK program are used for the synthesis of VHDL code. To minimize the memory usage, 128 lines of input image are processed succesively instead of total image. The synthesized IPs are downloaded to Virtex-4 FX60 FPGA on ML410 development board. The four synthesized IPs utilize 36.7% of total slice of FPGA. Using Active-HDL tool, the generated IPs were verified showing normal operation. Compared with the software operation using microblaze cpu on ML410 board, the synthesized IPs are better in operation time. The improvement ratio of operation time between the synthesized IP and software is 17 times in case of symbol extraction IP, and 10 times in Huffman coder IP. MMR coder IP shows 6 times faster and MQ coder IP shows 2.2 times faster than software only operation. The synthesized H/W IP and S/W module cooperated to succeed in compressing the CCITT standard document.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.471-479
• /
• 2018

Recently, the spread of smart TV based Android iOS Set Top box has become common. This paper propose a new approach to control the TV using gestures away from the era of controlling the TV using remote control. In this paper, the AdaBoost algorithm is applied to gesture recognition by using a mono camera. First, we use Camshift-based Body tracking and estimation algorithm based on Gaussian background removal for body coordinate extraction. Using global and local feature vectors, we recognized gestures with speed change. By tracking the time interval trajectories of hand and wrist, the AdaBoost algorithm with CART algorithm is used to train and classify gestures. The principal component feature vector with high classification success rate is searched using CART algorithm. As a result, 24 optimal feature vectors were found, which showed lower error rate (3.73%) and higher accuracy rate (95.17%) than the existing algorithm.

• Journal of Platform Technology
• /
• v.11 no.2
• /
• pp.26-38
• /
• 2023

This paper is a study on a transport robot capable of autonomously driving to a destination using a QR code in an indoor environment. The transport robot was designed and manufactured by attaching a lidar sensor so that the robot can maintain a certain distance during movement by detecting the distance between the camera for recognizing the QR code and the left and right walls. For the location information of the delivery robot, the QR code image was enlarged with Lanczos resampling interpolation, then binarized with Otsu Algorithm, and detection and analysis were performed using the Zbar library. The QR code recognition experiment was performed while changing the size of the QR code and the traveling speed of the transport robot while the camera position of the transport robot and the height of the QR code were fixed at 192cm. When the QR code size was 9cm × 9cm The recognition rate was 99.7% and almost 100% when the traveling speed of the transport robot was less than about 0.5m/s. Based on the QR code recognition rate, an experiment was conducted on the case where the destination is only going straight and the destination is going straight and turning in the absence of obstacles for autonomous driving to the destination. When the destination was only going straight, it was possible to reach the destination quickly because there was little need for position correction. However, when the destination included a turn, the time to arrive at the destination was relatively delayed due to the need for position correction. As a result of the experiment, it was found that the delivery robot arrived at the destination relatively accurately, although a slight positional error occurred while driving, and the applicability of the QR code-based destination self-driving delivery robot was confirmed.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.876-884
• /
• 2003

It is essential to identify both the pupil and iris boundaries for iris recognition. The circular edge detector proposed by Daugman is the most common and powerful method for the iris region extraction. The method is accurate but requires lots of computational time since it is based on the exhaustive search. Some heuristic methods have been proposed to reduce the computational time, but they are not as accurate as that of Daugman. In this paper, we propose a pupil and iris boundary finding algorithm which is faster than and as accurate as that of Daugman. The proposed algorithm searches the boundaries using the Daugman's circular edge detector, but reduces the search region using the problem domain knowledge. In order to find the pupil boundary, the search region is restricted in the maximum and minimum bounding circles in which the pupil resides. The bounding circles are obtained from the binarized pupil image. Two iris boundary points are obtained from the horizontal line passing through the center of the pupil region obtained above. These initial boundary points, together with the pupil point comprise two bounding circles. The iris boundary is searched in this bounding circles. Experiments show that the proposed algorithm is faster than that of Daugman and more accurate than the conventional heuristic methods.