• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.55-64
• /
• 2006

In this paper, a new web-based remote 3D imaging communication system employing an adaptive matching algorithm is suggested. In the proposed method, feature values are extracted from the stereo image pair through estimation of the disparity and similarities between each pixel of the stereo image. And then, the matching window size for disparity estimation is adaptively selected depending on the magnitude of this feature value. Finally, the detected disparity map and the left image is transmitted into the client region through the network channel. And then, in the client region, right image is reconstructed and intermediate views be synthesized by a linear combination of the left and right images using interpolation in real-time. From some experiments on web based-transmission in real-time and synthesis of the intermediate views by using two kinds of stereo images of 'Joo' & 'Hoon' captured by real camera, it is analyzed that PSNRs of the intermediate views reconstructed by using the proposed transmission scheme are highly measured by 30dB for 'Joo', 27dB for 'Hoon' and the delay time required to obtain the intermediate image of 4 view is also kept to be very fast value of 67.2ms on average, respectively.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.99-108
• /
• 2011

Processor technology is currently continued to parallel processing techniques, not by only increasing clock frequency of a single processor due to the high technology cost and power consumption. In this paper, a SIMD (Single Instruction Multiple Data) based parallel processor is introduced that efficiently processes massive data inherent in multimedia. In addition, this paper proposes pixel subword parallel processing instructions for the SIMD parallel processor architecture that efficiently operate on the image and video pixels. The proposed pixel subword parallel processing instructions store and process four 8-bit pixels on the partitioned four 12-bit registers in a 48-bit datapath architecture. This solves the overflow problem inherent in existing multimedia extensions and reduces the use of many packing/unpacking instructions. Experimental results using the same SIMD-based parallel processor architecture indicate that the proposed pixel subword parallel processing instructions achieve a speedup of $2.3{\times}$ over the baseline SIMD array performance. This is in contrast to MMX-type instructions (a representative Intel multimedia extension), which achieve a speedup of only $1.4{\times}$ over the same baseline SIMD array performance. In addition, the proposed instructions achieve $2.5{\times}$ better energy efficiency than the baseline program, while MMX-type instructions achieve only $1.8{\times}$ better energy efficiency than the baseline program.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.11
• /
• pp.43-53
• /
• 2010

Wide deployment of high resolution video services leads to active studies on high speed video processing. Especially, prevalent employment of multi-core systems accelerates researches on high resolution video processing based on parallelization of multimedia software. In this paper, we propose a novel parallel H.264/AVC decoding scheme on a multi-core platform. Parallel H.264/AVC decoding is challenging not only because parallelization may incur significant synchronization overhead but also because software may have complicated dependencies. To overcome such issues, we propose a novel approach called Multi-Threaded Parallelization(MTP). In MTP, to reduce synchronization overhead, a separate thread is allocated to each stage in the pipeline. In addition, an efficient memory reuse technique is used to reduce the memory requirement. To verify the effectiveness of the proposed approach, we parallelized FFmpeg H.264/AVC decoder with the proposed technique using OpenMP, and carried out experiments on an Intel Quad-Core platform. The proposed design performs better than FFmpeg H.264/AVC decoder before the parallelization by 53%. We also reduced the amount of memory usage by 65% and 81% for a high-definition(HD) and a full high-definition(FHD) video, respectively compared with that of popular existing method called 2Dwave.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.31-38
• /
• 2017

In this paper, we propose a system which estimates Manhattan coordinate systems for urban scene images using a convolutional neural network (CNN). Estimating the Manhattan coordinate system from an image under the Manhattan world assumption is the basis for solving computer graphics and vision problems such as image adjustment and 3D scene reconstruction. We construct a CNN that estimates Manhattan coordinate systems based on GoogLeNet [1]. To train the CNN, we collect about 155,000 images under the Manhattan world assumption by using the Google Street View APIs and calculate Manhattan coordinate systems using existing calibration methods to generate dataset. In contrast to PoseNet [2] that trains per-scene CNNs, our method learns from images under the Manhattan world assumption and thus estimates Manhattan coordinate systems for new images that have not been learned. Experimental results show that our method estimates Manhattan coordinate systems with the median error of $3.157^{\circ}$ for the Google Street View images of non-trained scenes, as test set. In addition, compared to an existing calibration method [3], the proposed method shows lower intermediate errors for the test set.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.20 no.5
• /
• pp.17-22
• /
• 2002

만약 사용자가 원하는 멀티미디어 콘텐츠를 원하는 시간에 TV를 통해서 볼 수 있게 된다면, 다시 말해서 보고 싶을 때, 보고 싶은 방송을 포함한 멀티미디어 콘텐츠를 원하는 시간에 바로 볼 수 있게 된다면 사용자는 방송시간에 맞추어 TV를 보지 않아도 되고 원하는 콘텐츠를 검색하느라 시간을 보낼 필요도 없어질 것이다. 예약 녹화의 경우에는 시간정보를 가지고 미리 예약을 해야 하는 경우이므로 이와는 다른 경우라 하겠다. 이러한 서비스는 바로 디지털 콘텐츠와 이를 가정에서 저장할 수 있는 장치의 발달이 바탕이 되고 있다.(표 1 생략, 원문이미지 참조) 표 1은 영국의 BBC사에서 1998년에 조사한 자료로 디지털 멀티미디어 데이터를 저장하고 재생할 수 있는 저장장치의 가격과 용량의 전망을 나타낸다. 여기에서 데이터는 5.5 Mbps급의 MPEG-2 스트림을 기준으로 하였다. 표 1에서 보수적 견해는 매 18개월마다, 현실적 견해는 매 10개월마다 동일 가격의 용량이 2배가 되는 것으로 계산한 것이다. 여기서 보듯 저장장치의 가격 대비 성능이 갈수록 나아지고 있어 가정에서 멀티미디어 콘텐츠를 저장할 수 있는 가정용 서버의 등장이 멀지 않았음을 보여준다. 1999년 가을에 활동을 접은 DAVIC의 마지막 활동이 바로 이러한 저장장치를 이용한 "TV Anytime Service"였다 . Anytime Ser vice란 저장장치를 통해 사용자가 원하는 콘텐츠를 저장해 놓았다가 사용자가 원하는 시간에 언제나 볼 수 있다는 개념이다. 이를 소비자관점에서 보면 Personalized service라고 할 수 있다. 이어 1999년 여름에 창설이 된 "TV Anytime Forum"이라는 단체에서 이러한 저장장치를 이용한 서비스를 위한 환경을 구축하고 있다. TV Anytime Forum은 가정에서 저장장치가 있는 단말인 PDR(Personal Digital Recorder)을 이용한 서비스, 즉 Anytime Service 위한 응용을 가능하게 하기위한 콘텐트 개발자에서부터 가전기기에 이르는 분야에서 Interoperable한 규격을 만들어 보자는 것이 그 목적이다. 특히 여러가지 디지털미디어 전달방식, 예를 들어 DVB, ATSC, ARIB 등에 독립적인 규격을 만드는 것을 원칙으로 하고 있다. 1999년 7월에 첫 번째 회의를 하면서 설립이 되었다. 2001년 말 기준으로 BBC, NHK, Microsoft, Sony, IBM, Phillips, NTT, Intel, Canal+, Tivo, 대우전자, 삼성전자, LG전자, KETI, ETRI 등 콘텐츠 사업자, 방송업자, 네트웍 사업자, 가전업체, 소프트웨어 개발회상에 이르기까지 총 157개 회원사로 구성되어 있으며 년 6회 회의를 개최한다. 2000년 11월에는 서울에서 회의를 개최하였으며 2003년 6월에 다시 한국에서 개최하기로 확정되어 있다. 본 글에서는 이러한 Anytime Service 환경이 구축되었을 때의 각 산업별로 얻을 수 있는 이득에 대해서 알아보고 TV Anytime Forum의 각 Working Group들의 작업 내용들, 그리고 지난 1월에 열렸던 15차 회의의 결과들에 대해서 살펴보고 국내의 TV Anytime 활동에 대해서 간단하게 소개하고 마치도록 하겠다. 현재 디지털 방송기술, 비디오 스트리밍 기술이나 MPEG 등과 같은 기술수준으로도 충분히 이러한 서비스를 시작할 수 있으며 소비자들도 이러한 욕구를 서서히 느끼고 있다. 정보와 서비스를 선택할 수 있게 만들자는 목표를 설정하고 있다. 이러 목표는 통신$.$컴퓨터$.$멀티미디어 기술발전으로 가능하게 되었다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.215-226
• /
• 2005

Loop invariant code motion (LICM) optimization includes relatively heavy code analyses, thus being not readily applicable to Java Just-In-Time (JIT) compilation where the JIT compilation time is part of the whole running time. 'Classical' LICM optimization first analyzes the code and constructs both the def-use chains and the use-def chains. which are then used for performing code motions. This paper proposes a light-weight LICM algorithm, which requires only the def-use chains of loop invariant code (without use-def chains) by exploiting the fact that the Java virtual machine is based on a stack machine, hence generating code with simpler patterns. We also propose two techniques that allow more code motions than classical LICM techniques. First, unlike previous JIT techniques that uses LICM only in single-path loops for simplicity, we apply LICM to multi-path loops (natural loops) safely for partially redundant code. Secondly, we move loop-invariant, partially-redundant null pointer check code via predication support in Itanium. The proposed techniques were implemented in a JIT compiler for Itanium processor on ORP (Open Runtime Platform) Java virtual machine of Intel. On SPECjvrn98 benchmarks, the proposed technique increases the JIT compilation overhead by the geometric mean of 1.3％, yet it improves the total running time by the geometric mean of 2.2％.

• The Korean Journal of Malacology
• /
• v.20 no.2
• /
• pp.165-169
• /
• 2004

The BLAST server for the mollusk was constructed on the basis of the Intel Server Platform SC-5250 dual Xeon 2.8 GHz cpu and Linux operating system. After establishing the operating system, we installed NCBI (National Center for Biotechnology Information) WebBLAST package after web server configuration for cgi (common gate interface) (http://chimp.kribb.re.kr/mollusks). To build up the stand alone blast, we conducted as follows: First, we downloaded the genome information (mitochondria genome information), DNA sequences, amino acid sequences related with mollusk available at NCBI. Second, it was translated into the multifasta format that was stored as database by using the formatdb program provided by NCBI. Finally, the cgi was used for the Stand Alone Blast server. In addition, we have added the vector, Escherichia coli, and repeat sequences into the server to confirm a potential contamination. Finally, primer3 program is also installed for the users to design the primer. The stand alone BLAST gave us several advantages: (1) we can get only the data that agree with the nucleotide sequence directly related with the mollusks when we are searching BLAST; (2) it will be very convenient to confirm contamination when we made the cDNA or genomic library from mollusks; (3) Compared to the current NSBI, we can quickly get the BLAST results on the mollusks sequence information.

• Radiation Oncology Journal
• /
• v.11 no.1
• /
• pp.175-181
• /
• 1993

Radiosurgery requires integral procedure where special devices and computer systems are needed for localization, dose planning and treatment. The aim of this work is to verify the overall mechanical accuracy of our LINAC and develop dose calculation algorithm for LINAC radiosurgery. The alignment of treatment machine and the performance testing of the entire system were extensively carried out and the basic data such as percent depth dose, off-axis ratio and output factor were measured. A three dimensional treatment planning system for stereotactic radiosurgery has been developed. We used an IBM personal computer with C programming language (IBM personal system/2, Model 80386, IBM Co., USA) for calculating the dose distribution. As a result, deviations at isocenter on gantry and table rotation for our treatment machine were acceptable since they were less than 2 mm. According to the phantom experiments, the focusing isocenter were successful by the error of less than 2 mm. Finally, the mechanical accuracy of our three dimensional planning system was confirmed by film dosimetry in sphere phantom.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2749-2756
• /
• 2015

Recently, Depending on the quality of data increases, the problem of time-consuming to process the image is raised by being required to accelerate the image processing algorithms, in a traditional CPU and CUDA(Compute Unified Device Architecture) based recognition system for computing speed and performance gains compared to OpenMP When character recognition has been learned by the system to measure the input by the character data matching is implemented in an environment that recognizes the region of the well, so that the font of the characters image learning English alphabet are each constant and standardized in size and character an image matching method for calculating the matching has also been implemented. GPGPU (General Purpose GPU) programming platform technology when using the CUDA computing techniques to recognize and use the four cores of Intel i5 2500 with OpenMP to deal quickly and efficiently an algorithm, than the performance of existing CPU does not produce the rate of four times due to the delay of the data of the partition and merge operation proposed a method of improving the rate of speed of about 3.2 times, and the parallel processing of the video card that processes a result, the sequential operation of the process compared to CPU-based who performed the performance gain is about 21 tiems improvement in was confirmed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.65-77
• /
• 2009

This paper proposes fast image processing algorithms using SSE (Streaming SIMD Extensions) instructions. The CPU's supporting SSE instructions have 128bit XMM registers; data included in these registers are processed at the same time with the SIMD (Single Instruction Multiple Data) mode. This paper develops new SIMD image processing algorithms for Mean filter, Sobel horizontal edge detector, and Morphological erosion operation which are most widely used in automated optical inspection systems and compares their processing times. In order to objectively evaluate the processing time, the developed algorithms are compared with OpenCV 1.0 operated in SISD (Single Instruction Single Data) mode, Intel's IPP 5.2 and MIL 8.0 which are fast image processing libraries supporting SIMD mode. The experimental result shows that the proposed algorithms on average are 8 times faster than the SISD mode image processing library and 1.4 times faster than the SIMD fast image processing libraries. The proposed algorithms demonstrate their applicability to practical image processing systems at high speed without commercial image processing libraries or additional hardwares.