• Title/Summary/Keyword: 연산시간 감소

Search Result 400, Processing Time 0.027 seconds

Early Termination Algorithm of Merge Mode Search for Fast High Efficiency Video Coding (HEVC) Encoder (HEVC 인코더 고속화를 위한 병합 검색 조기 종료 결정 알고리즘)

  • Park, Chan Seob;Kim, Byung Gyu;Jun, Dong San;Jung, Soon Heung;Kim, Youn Hee;Seok, Jin Wook;Choi, Jin Soo
    • Journal of Broadcast Engineering
    • /
    • v.18 no.5
    • /
    • pp.691-701
    • /
    • 2013
  • In this paper, an early termination algorithm for merge process is proposed to reduce the computational complexity in High Efficiency Video Coding (HEVC) encoder. In the HEVC, the same candidate modes from merge candidate list (MCL) are shared to predict a merge or merge SKIP mode. This search process is performed by the number of the obtained candidates for the both of the merge and SKIP modes. This may cause some redundant search operations. To reduce this redundant search operation, we employ the neighboring blocks which have been encoded in prior, to check on the contextual information. In this study, the spatial, temporal and depth neighboring blocks have been considered to compute a correlation information. With this correlation information, an early termination algorithm for merge process is suggested. When all modes of neighboring blocks are SKIP modes, then the merge process performs only SKIP mode. Otherwise, usual merge process of HEVC is performed Through experimental results, the proposed method achieves a time-saving factor of about 21.25% on average with small loss of BD-rate, when comparing to the original HM 10.0 encoder.

The Design of Transform and Quantization Hardware for High-Performance HEVC Encoder (고성능 HEVC 부호기를 위한 변환양자화기 하드웨어 설계)

  • Park, Seungyong;Jo, Heungseon;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.327-334
    • /
    • 2016
  • In this paper, we propose a hardware architecture of transform and quantization for high-perfornamce HEVC(High Efficiency VIdeo Coding) encoder. HEVC transform decides the transform mode by comparing RDCost to search for the best mode of them. But, RDCost is computed using the bit-rate and distortion which is computed by transform, quantization, de-quantization, and inverse transform. Due to the many calculations and encoding time, it is hard to process high resolution and high definition image in real-time. This paper proposes the method of transform mode decision by comparing sum of coefficient after transform only. We use BD-PSNR and BD-Bitrate which is performance indicator. Based on the experimental result, We confirmed that the decision of transform mode can process images with no significant change in the image quality. We reduced hardware area by assigning different values at the same output according to the transform mode and overlapping coefficient multiplied as much as possible. Also, we raise performance by implementing sequential pipeline operation. In view of the larger process that we used compared with the process of reference paper, Our design has reduced by half the hardware area and has increased performance 2.3 times.

A Nobel Video Quality Degradation Monitoring Schemes Over an IPTV Service with Packet Loss (IPTV 서비스에서 패킷손실에 의한 비디오품질 열화 모니터링 방법)

  • Kwon, Jae-Cheol;Oh, Seoung-Jun;Suh, Chang-Ryul;Chin, Young-Min
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.573-588
    • /
    • 2009
  • In this paper, we propose a novel video quality degradation monitoring scheme titled VR-VQMS(Visual Rhythm based Video Quality Monitoring Scheme) over an IPTV service prone to packet losses during network transmission. Proposed scheme quantifies the amount of quality degradation due to packet losses, and can be classified into a RR(reduced-reference) based quality measurement scheme exploiting visual rhythm data of H.264-encoded video frames at a media server and reconstructed ones at an Set-top Box as feature information. Two scenarios, On-line and Off-line VR-VQMS, are proposed as the practical solutions. We define the NPSNR(Networked Peak-to-peak Signal-to-Noise Ratio) modified by the well-known PSNR as a new objective quality metric, and several additional objective and subjective metrics based on it to obtain the statistics on timing, duration, occurrence, and amount of quality degradation. Simulation results show that the proposed method closely approximates the results from 2D video frames and gives good estimation of subjective quality(i.e.,MOS(mean opinion score)) performed by 10 test observers. We expect that the proposed scheme can play a role as a practical solution to monitor the video quality experienced by individual customers in a commercial IPTV service, and be implemented as a small and light agent program running on a resource-limited set-top box.

Compression and Performance Evaluation of CNN Models on Embedded Board (임베디드 보드에서의 CNN 모델 압축 및 성능 검증)

  • Moon, Hyeon-Cheol;Lee, Ho-Young;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.25 no.2
    • /
    • pp.200-207
    • /
    • 2020
  • Recently, deep neural networks such as CNN are showing excellent performance in various fields such as image classification, object recognition, visual quality enhancement, etc. However, as the model size and computational complexity of deep learning models for most applications increases, it is hard to apply neural networks to IoT and mobile environments. Therefore, neural network compression algorithms for reducing the model size while keeping the performance have been being studied. In this paper, we apply few compression methods to CNN models and evaluate their performances in the embedded environment. For evaluate the performance, the classification performance and inference time of the original CNN models and the compressed CNN models on the image inputted by the camera are evaluated in the embedded board equipped with QCS605, which is a customized AI chip. In this paper, a few CNN models of MobileNetV2, ResNet50, and VGG-16 are compressed by applying the methods of pruning and matrix decomposition. The experimental results show that the compressed models give not only the model size reduction of 1.3~11.2 times at a classification performance loss of less than 2% compared to the original model, but also the inference time reduction of 1.2~2.21 times, and the memory reduction of 1.2~3.8 times in the embedded board.

A Reliable Group Key Re-transmission Mechanism in Ad-hoc Environment (Ad-hoc 환경에서 신뢰적인 그룹 키 재전송 기법)

  • Hong, Suk-Hyung;Kim, Kyung-Min;Lee, Kwang-Kyum;Sin, Young-Tae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.370-374
    • /
    • 2006
  • Ad-hoc 환경의 응용은 재난구조나 회의실 또는 강의실에서의 정보 교환과 같은 그룹 통에서 이용된다. Ad-hoc 환경은 무선 채널을 이용하므로 상대적인 낮은 대역폭과 높은 오류 발생률을 가지게 된다. 따라서 Ad-hoc 네트워크에서는 신뢰적인 전송이 요구된다. 이동 노드는 상대적으로 낮은 성능과 에너지의 제한으로 인해 유선 환경과 같은 신뢰적인 전송 기법을 Ad-hoc 환경에 적용하기에는 문제가 발생한다. Ad-hoc 환경의 무선 채널이 가지는 보안적인 취약성과 높은 에러율을 극복하는 신뢰적인 그룹 키 전송을 위한 재전송 기법을 제안한다. 신뢰적인 트리 형성하기 위해 n차 트리 구조를 이용한다. 손실 감지를 위한 ACK 메시지를 이용하고 손실 복구를 위한 재전송 기법에 대해 연구를 한다. 제안한 신뢰적인 그룹 키 전송을 위한 재전송 기법은 트리의 깊이의 차수가 루트 관리 노드, 서브 관리 노드와 로컬 멤버 노드로 구성되기 때문에 손실 감지와 손실 복구에 대한 연산의 오버헤드가 적다. 루트 관리 노드는 멤버 노드로부터 받은 개인키 정보를 이용하여 그룹 키를 생성하고 그룹 키 부분 정보를 서브 관리 노드에게 전송하고 서브 관리 노드에 대한 신뢰성을 책임진다. 서브 관리 노드는 루트 관리 노드로부터 받은 그룹 키 부분 정보를 로컬 멤버 노드에게 전송하고 로컬 멤버 노드에 대한 신뢰성을 책임진다. 루트 관리 노드와 서브 관리 노드를 관리 노드라 한다. 관리 노드가 신뢰적인 전송을 위해 관리하는 멤버 노드는 전체 그룹에 독립적으로 유지 가능하므로 확장성 및 효율성이 좋다. 관리 노드는 동적인 그룹에 따른 타이머를 설정함으로써 손실 감지에 대한 시간을 줄임으로써 효율적인 손실 감지 및 손실 복구를 한다. 임계값 설정으로 인한 중복 수신에 대한 오버헤드를 줄일 수 있다.신뢰성을 향상 시킬 수 있는 Load Balancing System을 제안한다.할 때 가장 효과적인 라우팅 프로토콜이라고 할 수 있다.iRNA 상의 의존관계를 분석할 수 있었다.수안보 등 지역에서 나타난다 이러한 이상대 주변에는 대개 온천이 발달되어 있었거나 새로 개발되어 있는 곳이다. 온천에 이용하고 있는 시추공의 자료는 배제하였으나 온천이응으로 직접적으로 영향을 받지 않은 시추공의 자료는 사용하였다 이러한 온천 주변 지역이라 하더라도 실제는 온천의 pumping 으로 인한 대류현상으로 주변 일대의 온도를 올려놓았기 때문에 비교적 높은 지열류량 값을 보인다. 한편 한반도 남동부 일대는 이번 추가된 자료에 의해 새로운 지열류량 분포 변화가 나타났다 강원 북부 오색온천지역 부근에서 높은 지열류량 분포를 보이며 또한 우리나라 대단층 중의 하나인 양산단층과 같은 방향으로 발달한 밀양단층, 모량단층, 동래단층 등 주변부로 NNE-SSW 방향의 지열류량 이상대가 발달한다. 이것으로 볼 때 지열류량은 지질구조와 무관하지 않음을 파악할 수 있다. 특히 이러한 단층대 주변은 지열수의 순환이 깊은 심도까지 가능하므로 이러한 대류현상으로 지표부근까지 높은 지온 전달이 되어 나타나는 것으로 판단된다.의 안정된 방사성표지효율을 보였다. $^{99m}Tc$-transferrin을 이용한 감염영상을 성공적으로 얻을 수 있었으며, $^{67}Ga$-citrate 영상과 비교하여 더 빠른 시간 안에 우수한 영상을 얻을 수 있었다. 그러므로 $^{99m}Tc$-transierrin이 감염 병소의 영상진단에 사용될 수 있을 것으로 기대된다.리를 정량화 하였다. 특히 선조체에서의 도파민 유리에 의한 수용체 결합능의 감소는 흡연에 의한 혈중 니코틴의 축

  • PDF

A study on the discriminant analysis of node deployment based on cable type Wi-Fi in indoor (케이블형 Wi-Fi 기반 실내 공간의 노드 배치 판별 분석에 관한 연구)

  • Zin, Hyeon-Cheol;Kim, Won-Yeol;Kim, Jong-Chan;Kim, Yoon-Sik;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.9
    • /
    • pp.836-841
    • /
    • 2016
  • An indoor positioning system using Wi-Fi is essential to produce a radio map that combines the indoor space of two or more dimensions, the information of node positions, and etc. in processing for constructing the radio map, the measurement of the received signal strength indicator(RSSI) and the confirmation of node placement information counsume substantial time. Especially, when the installed wireless environment is changed or a new space is created, easy installation of the node and fast indoor radio mapping are needed to provide indoor location-based services. In this paper, to reduce the time consumption, we propose an algorithm to distinguish the straight and curve lines of a corridor section by RSSI visualization and Sobel filter-based edge detection that enable accurate node deployment and space analysis using cable-type Wi-Fi node installed at a 3 m interval. Because the cable type Wi-Fi is connected by a same power line, it has an advantage that the installation order of nodes at regular intervals could be confirmed accurately. To be able to analyze specific sections in space based on this advantage, the distribution of the signal was confirmed and analyzed by Sobel filter based edge detection and total RSSI distribution(TRD) computation through a visualization process based on the measured RSSI. As a result to compare the raw data with the performance of the proposed algorithm, the signal intensity of proposed algorithm is improved by 13.73 % in the curve section. Besides, the characteristics of the straight and the curve line were enhanced as the signal intensity of the straight line decreased by an average of 34.16 %.

Development of a Real-Time Mobile GIS using the HBR-Tree (HBR-Tree를 이용한 실시간 모바일 GIS의 개발)

  • Lee, Ki-Yamg;Yun, Jae-Kwan;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.1 s.11
    • /
    • pp.73-85
    • /
    • 2004
  • Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

  • PDF

A Hardware Barrier Synchronization using Multi -drop Scheme in Parallel Computer Systems (병렬 컴퓨터 시스템에서의 Multi-drop 방식을 사용한 하드웨어 장벽 동기화)

  • Lee, June-Bum;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.485-495
    • /
    • 2000
  • The parallel computer system that uses parallel program on the application such as a large scale business or complex operation is required. One of crucial operation of parallel computer system is synchronization. A representative method of synchronization is barrier synchronization. A barrier forces all process to wait until all the process reach the barrier and then releases all of the processes. There are software schemes, hardware scheme, or combinations of these mechanism to achieve barrier synchronization which tends to use hardware scheme. Besides, barrier synchronization lets parallel computer system fast because it has fewer start-up overhead. In this paper, we propose a new switch module that can implement fast and fault-tolerant barrier synchronization in hardware scheme. A proposed barrier synchronization is operated not in full-switch-driven method but in processor-driven method. An effective barrier synchronization is executed with inexpensive hardware supports. Therefore, a new proposed hardware barrier synchronization is designed that it is operated in arbitrary network topology. In this paper, we only show comparison of barrier synchronization on Multistage Interconnection Network. This research results in 24.6-24.8% reduced average delay. Through this result, we can expect lower average delay in irregular network.

  • PDF

A Middleware System for Efficient Acquisition and Management of Heterogeneous Geosensor Networks Data (이질적인 지오센서 네트워크 데이터의 효율적인 수집 및 관리를 위한 미들웨어 시스템)

  • Kim, Min-Soo;Lee, Chung-Ho
    • Spatial Information Research
    • /
    • v.20 no.1
    • /
    • pp.91-103
    • /
    • 2012
  • Recently, there has been much interest in the middleware that can smoothly acquire and analyze Geosensor information which includes sensor readings, location, and its surrounding spatial information. In relation to development of the middleware, researchers have proposed various algorithms for energy-efficient information filtering in Geosensor networks and have proposed Geosensor web technologies which can efficiently mash up sensor readings with spatial information on the web, also. The filtering algorithms and Geosensor Web technologies have contributions on energy-efficiency and OpenAPI, however the algorithms and technologies could not support easy and rapid development of u-GIS applications that need various Geosensor networks. Therefore, we propose a new Geosensor network middleware that can dramatically reduce the time and cost required for development of u-GIS applications that integrate heterogeneous Geosensor networks. The proposed middleware has several merits of being capable of acquiring heterogeneous Geosensor information using the standard SWE and an extended SQL, optimally performing various attribute and spatial operators, and easily integrating various Geosensor networks. Finally, we clarify our middleware's distinguished features by developing a prototype that can monitor environmental information in realtime using spatial information and various sensor readings of temperature, humidity, illumination, imagery, and location.

A Encryption Technique of JPEG2000 Image Using 3-Dimensional Chaotic Cat Map (3차원 카오스 캣맵을 이용한 JPEG2000 영상의 암호화 기술)

  • Choi, Hyun-Jun;Kim, Soo-Min;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.5 s.305
    • /
    • pp.173-180
    • /
    • 2005
  • In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform(DWT) and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system and cat map which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the Proposed methods implemented in software for about 500 images. Consequently, we are sure that the proposed is efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas.