• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.21 no.1
• /
• pp.15-22
• /
• 2013

In oceanic flight routes, HF radio and satellite data links have weather restrictions, long propagation delay and low data throughput. In this paper, we propose oceanic aeronautical communications scheme in the VHF band based on ad-hoc communication. The proposed scheme organizes autonomously a multi-hop network that is divided into multiple local network using aircraft to fly long-distance communication and supports a hybrid type of multiple access, which consists of random access and TDMA (Time Division Multiple Access) scheme. In addition, several algorithms to apply spatial reuse of transmission to multi-hop long range communication environments have been proposed. The proposed system proves performance improvement on delay time as an effective solution to communicate end-to-end on the oceanic flight routes and strengthens the reliability of oceanic aeronautical communication.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.391-401
• /
• 2004

In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.88-88
• /
• 2002

Satellite Image archiving system requires large storage and long transmission time. A simple and cheap way of overcoming these limitations is to increase the compression ratio. However this requires a feasibility study for accurate applications. Here, a new still image compression standard is being developed, the JPEG2000. It provides lossless and lossy compression, progressive transmission by pixel accuracy and by resolution, region-of-interest coding, user-defined tiling size, random codestream access and processing etc. In this study, we will briefly introduce the JPEG2000 compression standard which provides a new compression technique based on the wavelet technology and offers better compression ratios, and evaluate the compression ratios of JPEG2000 for satellite image by performing various image quality tests. Also, we will compare brief test result using the commercial remote sensing software.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.543-552
• /
• 2005

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.

• Journal of Broadcast Engineering
• /
• v.22 no.4
• /
• pp.473-483
• /
• 2017

Since the advent of 3D and UHD contents, demand for high-quality panoramic images has been increasing. The UWV(Ultra-Wide Viewing) service uses a wider viewing angle than conventional panoramas to provide a lively experience for users and enhance their understanding of the event. In this paper, we propose a spatial adjacency map generation method and an UWV file storage format technology to provide UWV service. The spatial adjacency map measures the similarity between images and generate the position information of the images based on similarity. And the stitching time of the image can be shortened through the generated position information. Through the spatial adjacency map, we generate the large screen content quickly. The UWV file format which is based on ISOBMFF process spatial adjacency map and videos and support random access. In this paper, we design the UWV player to verify the spatial adjacency map and UWV file format and show the result of experiments.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.6
• /
• pp.422-433
• /
• 2015

In this paper, we demonstrate inter-layer prediction tools for scalable video coders. The proposed scalable coder is designed to support not only spatial, quality and temporal scalabilities, but also view scalability. In addition, we propose quad-tree inter-layer prediction tools to improve coding efficiency at enhancement layers. The proposed inter-layer prediction tools generate texture prediction signal with exploiting texture, syntaxes, and residual information from a reference layer. Furthermore, the tools can be used with inter and intra prediction blocks within a large coding unit. The proposed framework guarantees the rate distortion performance for a base layer because it does not have any compulsion such as constraint intra prediction. According to experiments, the framework supports the spatial scalable functionality with about 18.6%, 18.5% and 25.2% overhead bits against to the single layer coding. The proposed inter-layer prediction tool in multi-loop decoding design framework enables to achieve coding gains of 14.0%, 5.1%, and 12.1% in BD-Bitrate at the enhancement layer, compared to a single layer HEVC for all-intra, low-delay, and random access cases, respectively. For the single-loop decoding design, the proposed quad-tree inter-layer prediction can achieve 14.0%, 3.7%, and 9.8% bit saving.

• ETRI Journal
• /
• v.39 no.5
• /
• pp.672-682
• /
• 2017

Video compression exploits statistical, spatial, and temporal redundancy, as well as transform and quantization. In particular, the transform in a frequency domain plays a major role in energy compaction of spatial domain data into frequency domain data. The high efficient video coding standard uses the type-II discrete cosine transform (DCT-II) and type-VII discrete sine transform (DST-VII) to improve the coding efficiency of residual data. However, the DST-VII is applied only to the Intra $4{\times}4$ residual block because it yields relatively small gains in the larger block than in the $4{\times}4$ block. In this study, after rearranging the data of the residual block, we apply the DST-VII to the inter-residual block to achieve coding gain. The rearrangement of the residual block data is similar to the arrangement of the basis vector with a the lowest frequency component of the DST-VII. Experimental results show that the proposed method reduces the luma-chroma (Cb+Cr) BD rates by approximately 0.23% to 0.22%, 0.44% to 0.58%, and 0.46% to 0.65% for the random access, low delay B, and low delay P configurations, respectively.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.67-76
• /
• 2012

Expanding services and productions for screen content videos recently, necessity of new compression techniques is emerging. The next-generation video coding standard is also considering specified coding tools for screen content videos, but it is still preliminary stage. In this paper, we investigate the characteristics of screen content videos for which we propose the quantization in spatial domain to improve coding efficiency. The proposed method directly employs quantization for residual signal without any transformations. The proposed method also applies adaptive coefficients prediction and in-loop filter for quantized residual signals in spatial domain based on the characteristics of screen content videos. As a results, the proposed method for the random access, the low-delay and the all-intra modes achieve bit-saving about 4.4%, 5.1%. and 4.9%, respectively.

• The Korean Journal of Applied Statistics
• /
• v.33 no.6
• /
• pp.739-751
• /
• 2020

Seoul public bike program facilitates access to bicycles and offers potential for greater mobility and health for users. Furthermore, it would have positive impacts on transport congestion, energy use, and the environment. Hence, it is important to find future rental locations by taking to account both bike-demand and regional imbalance. This paper first finds eligible candidates of rental locations with the required spatial conditions such as a sufficient sidewalk width and accessibility of bike pick-up vehicles. And then, estimates public bike daily usage for each selected location via random forest based on Seoul public bike historical usage, Seoul geographical features, regional characteristics, and populations. This study contributes to a better comprehension of the Seoul public bike program, and would be useful in determining new public bike rental locations.