• Title/Summary/Keyword: Support Partitioning

Search Result 51, Processing Time 0.026 seconds

Super High-Resolution Image Style Transfer (초-고해상도 영상 스타일 전이)

  • Kim, Yong-Goo
    • Journal of Broadcast Engineering
    • /
    • v.27 no.1
    • /
    • pp.104-123
    • /
    • 2022
  • Style transfer based on neural network provides very high quality results by reflecting the high level structural characteristics of images, and thereby has recently attracted great attention. This paper deals with the problem of resolution limitation due to GPU memory in performing such neural style transfer. We can expect that the gradient operation for style transfer based on partial image, with the aid of the fixed size of receptive field, can produce the same result as the gradient operation using the entire image. Based on this idea, each component of the style transfer loss function is analyzed in this paper to obtain the necessary conditions for partitioning and padding, and to identify, among the information required for gradient calculation, the one that depends on the entire input. By structuring such information for using it as auxiliary constant input for partition-based gradient calculation, this paper develops a recursive algorithm for super high-resolution image style transfer. Since the proposed method performs style transfer by partitioning input image into the size that a GPU can handle, it can perform style transfer without the limit of the input image resolution accompanied by the GPU memory size. With the aid of such super high-resolution support, the proposed method can provide a unique style characteristics of detailed area which can only be appreciated in super high-resolution style transfer.

Multiuser Precoding and Power Allocation with Sum Rate Matching for Full-duplex MIMO Relay (전이중 MIMO 릴레이를 위한 다중 사용자 Precoding 및 Sum Rate 정합 기반 전력 할당 기법)

  • Lee, Jong-Ho;Shin, Oh-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12C
    • /
    • pp.1020-1028
    • /
    • 2010
  • Relay has attracted great attention due to its inherent capability to extend the service coverage and combat shadowing in next generation mobile communication systems. So far, most relay technologies have been developed under the half-duplex (HD) constraint that prevents relays from transmitting and receiving at the same time. Although half-duplex relay (HDR) is easy to implement, it requires partitioning of resource for transmission and reception, reducing the whole system capacity. In this paper, we propose a multinser precoding and power control scheme with sum rate matching for a full-duplex (FD) multiple-input multiple-output (MIMO) relay. Full-duplex relay (FDR) can overcome the drawback of HDR by transmitting and receiving on the same frequency at the same time, while it is crucial to reduce the effect of self-interference that is caused by its own transmitter to its own receiver. The proposed precoding scheme cancels the self-interference of the FDR as well as to support multiuser MIMO. Moreover, we suggest a power allocation scheme for FD MIMO relay with the constraint that the sum rate of the relay's received data streams is equal to that of the relay's transmit data streams.

A Real-time SoC Design of Foreground Object Segmentation (Foreground 객체 추출을 위한 실시간 SoC 설계)

  • Kim Ji-Su;Lee Tae-Ho;Lee Hyuk-Jae
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.9 s.351
    • /
    • pp.44-52
    • /
    • 2006
  • Recently developed MPEG-4 Part 2 compression standard provides a novel capability to handle arbitrary video objects. To support this capability, an efficient object segmentation technique is required. This paper proposes a real-time algorithm for foreground object segmentation in video sequences. The proposed algorithm consists of two steps: the first step that segments a video frame into multiple sub-regions using Spatio-Temporal Watershed Transform and the second step in which a foreground object segment is extracted from the sub-regions generated in the first step. For real-time processing, the algorithm is partitioned into hardware and software parts so that computationally expensive parts are off-loaded from a processor and executed by hardware accelerators. Simulation results show that the proposed implementation can handle QCIF-size video at 15 fps and extracts an accurate foreground object.

The Semantic Zooming Method for Efficient Web Browsing on Internet-connected Digital Television (IPTV 환경에서 효율적인 웹 탐색을 위한 시맨틱 주밍 기법)

  • Chung, Ji-Hye;Lee, Hye-Jeong;Lea, Jong-Ho;Kim, Yeun-Bae
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.579-583
    • /
    • 2008
  • Web pages with complex layout and small font size do not display well on large screen display such as TV because it has limited capabilities: long distance view, passive user attitude, limited input device like a legacy remote controller. We have designed and implemented new semantic zoom browsing facilities to support effective navigation on Internet-connected digital television with limited capabilities. Our browser performs partitioning of an HTML document content into semantic blocks. Semantic blocks present summarized information with more readable style and modified layout for optimal reading and browsing. Individual blocks can be selected by the user and zoomed in more detail information by the user. The scrolling on large display device needs more user interaction. Our browser modifies the layout of an HTML document with removing horizontal scrolling and minimizing vertical scrolling. This method allows users to easily view the web page by converting into optimal reading style and layout and to easily seek the information just with zooming.

  • PDF

A Data Gathering Protocol for Multihop Transmission for Large Sensor Networks (대형 센서네트워크에서 멀티홉 전송을 이용한 데이터 수집 프로토콜)

  • Park, Jang-Su;Ahn, Byoung-Chul
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.50-56
    • /
    • 2010
  • This paper proposes a data gathering method by adapting the mobile sink to prolong the whole operation time of large WSNs. After partitioning a network into several clusters, a mobile sink visits each cluster and collects data from it. An efficient protocol improves the energy efficiency by delivering messages from the mobile sink to the cluster head as well as reduces the data gathering delay, which is the disadvantage of the mobile sink. For the scalability of sensor network, the network architecture should support the multihop transmission in the duster rather than the single hop transmission. The process for the data aggregation linked to the travelling path is proposed to improve the energy consumption of intermediate nodes. The experiment results show that the proposed model is more efficient than legacy methods in the energy consumption and the data gathering time.

GC-Tree: A Hierarchical Index Structure for Image Databases (GC-트리 : 이미지 데이타베이스를 위한 계층 색인 구조)

  • 차광호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

On-line Signature Verification Using Fusion Model Based on Segment Matching and HMM (구간 분할 및 HMM 기반 융합 모델에 의한 온라인 서명 검증)

  • Yang Dong Hwa;Lee Dae-Jong;Chun Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.1
    • /
    • pp.12-17
    • /
    • 2005
  • The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.

Intrusion-Tolerant Jini Service Architecture for Enhancing Survivability of Ubiquitous Services (유비쿼터스 서비스 생존성 제고를 위한 침입감내 Jini 서비스 구조)

  • Kim, Sung-Ki;Park, Kyung-No;Min, Byoung-Joon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.4
    • /
    • pp.41-52
    • /
    • 2008
  • Ubiquitous service environment is poor in reliability of connection and has a high probability that the intrusion and the system failure may occur. Therefore, in the environment, the capability of a system to collectively accomplish its mission in spite of active intrusions and various failure scenarios, that is, the survivability of services are needed. In this paper, we analyze the Jgroup/ARM framework that was developed in order to help the development of fault- tolerant Jini services. More importantly, we propose an intrusion-tolerant Jini service architecture to satisfy the security availability and quality of services on the basis of the analysis. The proposed architecture is able to protect a Jini system not only from faults such as network partitioning or server crash, but also from attacks exploiting flaws. It is designed to provides performance enough to show a low response latency so as to support seamless service usage. Through the experiment on a test-bed, we have confirmed that the architecture is able to provide high security and availability at the level that degraded services quality is ignorable.

Design and Performance Analysis of A Novel P2P-SIP Architecture for Network-based Mobility Support in Intelligent Home Networks (지능형 홈네트워크에서 네트워크 기반의 이동성 지원을 위한 P2P-SIP 구조의 설계 및 성능분석)

  • Kim, SeungWon;Jeong, JongPil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.7
    • /
    • pp.293-302
    • /
    • 2013
  • Home network providers have many worries about providing home network services with an expandable, reliable, flexible and low-cost structure according to the expanding market environment. The existing client-server system has various problems such as complexity and high costs in providing home network services. In this paper we propose the P2P-SIP structure. P2P communication terminal supporting access of distributed resources provides functions which the existing SIP-based network devices have. Because diverse terminals in a home network access through networks, also, partitioning network domains with home gateways to manage, and applying the network-based PMIPv6(Proxy Mobile IPv6) technology considering mobility of terminals would help to have a more efficient home network structure. Especially, the proposed P2P-SIP structure proves itself as a very efficient structure to have an outstanding expandability among different home networks in a region, and to reduce maintenance costs.

Portable and Extensible ARINC 653 for Drones (드론을 위한 이식성과 확장성을 지원하는 ARINC 653)

  • Kim, Jooho;Jo, Hyun-Chul;Jin, Hyun-Wook;Lee, Sangil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1884-1891
    • /
    • 2016
  • With the various usage of civil drones, such as hobby, filmmaking and surveillance, the need for technology that safely reconstructs software for target application domains has been increasingly rising. In order to support a reliable software integration of avionic systems, the ARINC 653 standard has been proposed and adapted mainly on manned aircrafts. Therefore, applying ARINC 653 on civil drones could be desirable. Though, various researches on implementing ARINC 653 has been conducted, there are still additional requirements to apply ARINC 653 to civil drones that use various platforms and have a wide range of use. In this paper, taking account of these requirements, we implement a portable and extensible ARINC 653 and analyze its performance. We offer the portability with the OS abstraction layer that reduces dependency on a specific operating system, and provide the design that can extend internal functions, such as partition scheduler and process scheduler.