• Title/Summary/Keyword: broadcast-only

Search Result 593, Processing Time 0.02 seconds

Ordered Reverse k Nearest Neighbor Search via On-demand Broadcast

  • Li, Li;Li, Guohui;Zhou, Quan;Li, Yanhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3896-3915
    • /
    • 2014
  • The Reverse k Nearest Neighbor (RkNN) query is valuable for finding objects influenced by a specific object and is widely used in both scientific and commercial systems. However, the influence level of each object is unknown, information that is critical for some applications (e.g. target marketing). In this paper, we propose a new query type, Ordered Reverse k Nearest Neighbor (ORkNN), and make efforts to adapt it in an on-demand scenario. An Order-k Voronoi diagram based approach is used to answer ORkNN queries. In particular, for different values of k, we pre-construct only one Voronoi diagram. Algorithms on both the server and the clients are presented. We also present experimental results that suggest our proposed algorithms may have practical applications.

Generalized Proxy-Assisted Periodic Broadcasting (G-ProB) for Heterogeneous Clients in Video-on-Demand Service

  • Febiansyah, Hidayat;Kwon, Jin-Baek
    • Journal of Information Processing Systems
    • /
    • v.6 no.4
    • /
    • pp.575-596
    • /
    • 2010
  • Video-on-Demand services are increasing rapidly nowadays. The load on servers can be very high, even exceeding their capacity. For popular contents, we can use a Periodic Broadcast (PB) strategy using multicast to serve all clients. Recent development of PB uses multiple channels broadcasting for segments of movies in certain patterns, so that users only need to wait for a small segment to start the service. However, users need higher download capacity to download multiple segments at a time. In order to compensate for this, a proxy server can help to reduce download bandwidth requirements by holding some segments for a certain time. This research will focus on more recent PB schemes that couldn't be covered by previous Proxy-Assisted Periodic Broadcast strategies.

IMAGE SYNTHESIS FOR DYNAMIC SCENES

  • Feng, Chen-Chin;Chang, Su-Yuan;Yang, Shi-Nine
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.15.1-21
    • /
    • 1999
  • Radiosity method is a global illumination model for image synthesis. It computes all energy interactions among diffuse elements in a virtual environment. One of the major drawbacks if its time consuming computation. Existing radiosity algorithms for static scene is difficult to be applicable to dynamic environments. In this paper we proposed an hierarchical scene partition scheme to speedup the link update computations in the dynamic environments. Since the proposed spatial data structure is global, it not only can be used to speedup the culling of non-affected links after geometry change, but also can be used to accelerate the subsequent visibility computation. Several empirical tests are given to show the efficiency of our improved algorithm.

A HIGH PRECISION CAMERA OPERATING PARAMETER MEASUREMENT SYSTEM AND ITS APPLICATION TO IMAGE MOTION INFERRING

  • Wentao-Zheng;Yoshiaki-Shishikui;Yasuaki-Kanatsugu;Yutaka-Tanaka
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.77-82
    • /
    • 1999
  • Information about camera operating such as zoom, focus, pan, tilt and tracking is useful not only for efficient video coding, but also for content-based video representation. A camera operating parameter measurement system designed specifically for these applications is therefore developed. This system, implemented in real time and synchronized with the video signal, measures the precise camera operating parameters. We calibrated the camera lens using a camera model that accounts for redial lens distortion. The system is then applied to infer image motion from pan and tilt operating parameters. The experimental results show that the inferred motion coincides with the actual motion very well, with an error of less than 0.5 pixel even for large motion up to 80 pixels.

Implementation of Face Animation For MPEG-4 SNHC

  • Lee, Ju-Sang;Yoo, Ji-Sang;Ahn, Chie-Teuk
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.141-144
    • /
    • 1999
  • MPEG-4 SNHC FBA(face and body animation) group is going to standardize the MPEG-4 system for low-bit rate communication with the implementation and animation of human body and face on virtual environment. In the first version of MPEG-4 standard, only the face object will be implemented and animated by using FDP (face definition parameter) and FAP(facial animation parameter), which are the abstract parameters of human face for low-bit rate coding. In this paper, MPEG-4 SNHC face object and it's animation were implemented based on the computer graphics tools such as VRML and OpenGL.

FAST PHONG SHADING BASED ON TABLE LOOKUP

  • Lu, Hsien-Chang;Dai, Wen-Kai
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.145.1-149
    • /
    • 1999
  • In Computer Graphics, Phong shading algorithm is essential and also sufficient for producing realistic images. In this paper, we propose an approach taking only two additions and one memory access for shading a pixel. A Phong-Shading table is used for storing the values of diffuse and specular components of the Phong reflection model. The intensity of a pixel can be obtained by table lookup. The performance of proposed method is almost the same as Gouraud shading.

Parameter estimation of weak space-based ADS-B signals using genetic algorithm

  • Tao, Feng;Jun, Liang
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.324-331
    • /
    • 2021
  • Space-based automatic dependent surveillance-broadcast (ADS-B) is an important emerging augmentation of existing ground-based ADS-B systems. In this paper, the problem of space-based ultra-long-range reception processing of ADS-B signals is described. We first introduce a header detection method for accurately determining the pulse position of a weak ADS-B signal. We designed a signal encoding method, shaping method, and fitness function. We then employed a genetic algorithm to perform high-precision frequency and phase estimations of the detected weak signal. The advantage of this algorithm is that it can simultaneously estimate the frequency and phase, meaning a direct coherent demodulation can be implemented. To address the computational complexity of the genetic algorithm, we improved the ratio algorithm for frequency estimation and raised the accuracy beyond that of the original ratio algorithm with only a slight increase in the computational complexity using relatively few sampling points.

Super-resolution of compressed image by deep residual network

  • Jin, Yan;Park, Bumjun;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.11a
    • /
    • pp.59-61
    • /
    • 2018
  • Highly compressed images typically not only have low resolution, but are also affected by compression artifacts. Performing image super-resolution (SR) directly on highly compressed image would simultaneously magnify the blocking artifacts. In this paper, a SR method based on deep learning is proposed. The method is an end-to-end trainable deep convolutional neural network which performs SR on compressed images so as to reduce compression artifacts and improve image resolution. The proposed network is divided into compression artifacts removal (CAR) part and SR reconstruction part, and the network is trained by three-step training method to optimize training procedure. Experiments on JPEG compressed images with quality factors of 10, 20, and 30 demonstrate the effectiveness of the proposed method on commonly used test images and image sets.

  • PDF

Comparison of Convolutional Neural Network Models for Image Super Resolution

  • Jian, Chen;Yu, Songhyun;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.63-66
    • /
    • 2018
  • Recently, a convolutional neural network (CNN) models at single image super-resolution have been very successful. Residual learning improves training stability and network performance in CNN. In this paper, we compare four convolutional neural network models for super-resolution (SR) to learn nonlinear mapping from low-resolution (LR) input image to high-resolution (HR) target image. Four models include general CNN model, global residual learning CNN model, local residual learning CNN model, and the CNN model with global and local residual learning. Experiment results show that the results are greatly affected by how skip connections are connected at the basic CNN network, and network trained with only global residual learning generates highest performance among four models at objective and subjective evaluations.

  • PDF

Gaussian Noise Reduction Technique using Improved Kernel Function based on Non-Local Means Filter (비지역적 평균 필터 기반의 개선된 커널 함수를 이용한 가우시안 잡음 제거 기법)

  • Lin, Yueqi;Choi, Hyunho;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.11a
    • /
    • pp.73-76
    • /
    • 2018
  • A Gaussian noise is caused by surrounding environment or channel interference when transmitting image. The noise reduces not only image quality degradation but also high-level image processing performance. The Non-Local Means (NLM) filter finds similarity in the neighboring sets of pixels to remove noise and assigns weights according to similarity. The weighted average is calculated based on the weight. The NLM filter method shows low noise cancellation performance and high complexity in the process of finding the similarity using weight allocation and neighbor set. In order to solve these problems, we propose an algorithm that shows an excellent noise reduction performance by using Summed Square Image (SSI) to reduce the complexity and applying the weighting function based on a cosine Gaussian kernel function. Experimental results demonstrate the effectiveness of the proposed algorithm.

  • PDF