• Title/Summary/Keyword: Block mapping

Search Result 167, Processing Time 0.028 seconds

Proxy Caching Grouping by Partition and Mapping for Distributed Multimedia Streaming Service (분산 멀티미디어 스트리밍 서비스를 위한 분할과 사상에 의한 프록시 캐싱 그룹화)

  • Lee, Chong-Deuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.1
    • /
    • pp.40-47
    • /
    • 2009
  • Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.

FY-2C S-VISSR2.0 Navigation by MTSAT Image Navigation (MTSAT Image Navigation 알고리즘을 이용한 FY-2C S-VISSR2.0 Navigation)

  • Jeon, Bong-Ki;Kim, Tae-Hoon;Kim, Tae-Young;Ahn, Sang-Il;Sakong, Young-Bo
    • Proceedings of the KSRS Conference
    • /
    • 2007.03a
    • /
    • pp.251-256
    • /
    • 2007
  • FY-2C 위성은 2004년 10월 발사되어 동경 105도 에 서 운영 중인 중국의 정지 궤도 기상위성 이며 관측 영상은 한반도 지역을 포함하고 있다. 현재 FY-2C S-VISSR2.0[l]에 대한 Navigation 알고리즘이 공개되어 있지 않으며,Navigation을 위하여 S-VISSR2.0에 포함되어 있는 Simplified Mapping Block 정보를 사용하여야 한다. Simplified Mapping Block은 5도 간격의 정보만을 제 공하므로 관측 지 역 의 모든 좌표에 대한 Navigation 정보를 얻기 위해서는 보간볍을 사용하여야 한다. 그러나 보간법은 기준 점에서 멀어질수록 오차가 크게 나타날 수 있다. 따라서 본 논문에서는 모든 좌표에 대한 Navigation 정보를 얻을 수 있는 MTSAT Image Navigation 알고리즘을 FY-2C S-VISSR2.0에 적용하여 Simplified Mapping Block과의 차이를 분석하였다. 분석 방법은 Simplified Mapping Block과 MTSAT Image Navigation[2] 알고리즘을 5도 간격의 격자 점(위경도)에서 Column 및 Line 값 비교, Geo-location된 영상의 품질 비교,WDB2 Map Data의 Coast Line과의 비교를 수행하였다. 분석 결과 격자 점에서의 Column, Line 값은 0.5 이내의 차이 값을 나타내었다. 그리고 Geo-location된 영상 비교에서는 격자 점 주변에서 영상의 차이가 없으나 격자 점에서 멸어질수록 영상의 품질은 MTSAT Image Navigation 알고리즘으로 생성한 영상이 더 우수하였다. WDB2 Map Data의 Coast Line과의 비교에서 오차는 동일하게 발생하였으며,영상의 Column 축에 대한 오차는 평균 1.847 Pixel, 최대 6 Pixel, 최소 oPixel 이며, Line 축에 대한 오차는 평균 0.135 Pixel, 최대 4 Pixel, 최소 0 Pixel을 나타내었다.

  • PDF

A study on the Image Signal Compress using SOM with Isometry (Isometry가 적용된 SOM을 이용한 영상 신호 압축에 관한 연구)

  • Chang, Hae-Ju;Kim, Sang-Hee;Park, Won-Woo
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.358-360
    • /
    • 2004
  • The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

  • PDF

Comparison of Optimal Path Algorithms and Implementation of Block Transporter Planning System (최적 경로 알고리즘들의 계산비용 비교 및 트랜스포터의 최적 블록 운송 계획 적용)

  • Moon, Jong-Heon;Ruy, Won-Sun;Cha, Ju-Hwan
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.53 no.2
    • /
    • pp.115-126
    • /
    • 2016
  • In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.

Effective Fragile Watermarking for Image Authentication with High-quality Recovery Capability

  • Qin, Chuan;Chang, Chin-Chen;Hsu, Tai-Jung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2941-2956
    • /
    • 2013
  • In this paper, we propose an effective fragile image watermarking scheme for tampering detection and content recovery. Cover image is divided into a series of non-overlapping blocks and a block mapping relationship is constructed by the secret key. Several DCT coefficients with direct current and lower frequencies of the MSBs for each block are used to generate the reference bits, and different coefficients are assigned with different bit numbers for representation according to their importance. To enhance recovery performance, authentication bits are generated by the MSBs and the reference bits, respectively. After LSB substitution hiding, the embedded watermark bits in each block consist of the information of itself and its mapping blocks. On the receiver side, all blocks with tampered MSBs can be detected and recovered using the valid extracted reference bits. Experimental results demonstrate the effectiveness of the proposed scheme.

Improved Algorithm of Sectional Tone Mapping for HDR Images (HDR 이미지를 위한 단면 톤 매핑 개선 알고리즘 구현)

  • Lee, Yong-Hwan;Kim, Heung-Jun
    • Journal of the Semiconductor & Display Technology
    • /
    • v.20 no.2
    • /
    • pp.137-140
    • /
    • 2021
  • High dynamic range (HDR) technology has been drawing attention in the field of imaging and consumer entertainment. As tools for capturing and creating HDR contents, encoding, and transmission evolve to support HDR formats, various display capabilities are being developed and increased. Hence, there is need for remapping native HDR imagery for display on lower quality legacy standard dynamic range (SDR) displays. This operation is referred to as tone mapping. In this paper, we present a sectional tone mapping method by Lenzen, and expand upon a tone mapping approach to improve temporal stability while maintaining picture quality. Compared to the existing block-based sectional tone mapping, our method uses the edge awareness-based tone mapping. We estimate the performance of the objective metric on temporal flickering. The experimental result shows that the algorithm maintains a smoother relationship between the output luminance values, and this reveals success in reducing halos and improving temporal stability with adopted edge aware filtering.

An Efficient Snapshot Technique for Shared Storage Systems supporting Large Capacity (대용량 공유 스토리지 시스템을 위한 효율적인 스냅샷 기법)

  • 김영호;강동재;박유현;김창수;김명준
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.108-121
    • /
    • 2004
  • In this paper, we propose an enhanced snapshot technique that solves performance degradation when snapshot is initiated for the storage cluster system. However, traditional snapshot technique has some limits adapted to large amount storage shared by multi-hosts in the following aspects. As volume size grows, (1) it deteriorates crucially the performance of write operations due to additional disk access to verify COW is performed. (2) Also it increases excessively the blocking time of write operation performed during the snapshot creation time. (3)Finally, it deteriorates the performance of write operations due to additional disk I/O for mapping block caused by the verification of COW. In this paper, we propose an efficient snapshot technique for large amount storage shared by multi-hosts in SAN Environments. We eliminate the blocking time of write operation caused by freezing while a snapshot creation is performing. Also to improve the performance of write operation when snapshot is taken, we introduce First Allocation Bit(FAB) and Snapshot Status Bit(SSB). It improves performance of write operation by reducing an additional disk access to volume disk for getting snapshot mapping block. We design and implement an efficient snapshot technique, while the snapshot deletion time, improve performance by deallocation of COW data block using SSB of original mapping entry without snapshot mapping entry obtained mapping block read from the shared disk.

Evaluation of Concentration using Electroencephalogram and Electrocardiogram (I) (뇌파와 심박변화를 이용한 집중도의 평가 (I))

  • 윤용현;고한우;양희경;김동윤
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2001.05a
    • /
    • pp.6-9
    • /
    • 2001
  • 집중도를 평가하기 위하여 피험자에게 집중을 유발시키는 3가지 task(단기기억작업, Corsi block tapping task, visuomotor task)를 부가하고 주관평가 및 생리신호(뇌파, 심전도, 맥파, 피부온도, 호흡, 피부전도도)를 측정하였다. 뇌파를 mapping하여 평가에 적합한 전극이 위치를 선정하고, task 수행중 집중도 변화와 짐전도의 심박변화와의 관계를 분석하였다. 분석결과 안정과 task 수행시 뇌파 mapping상 전체 power의 변호가 frontal 부분에서 크게 나타났으며, 집중시 R-R 간격의 순간간격변화가 줄어들었다.

  • PDF

A Study on the Improvement for the Implement Way of a Substitute Block System (대용폐색방식 시행방법 개선에 관한 연구)

  • Song, Nak-Kyoon;Kim, Hae-Gon;Kim, Ho-Soon;Joo, Chang-Hun;Kim, Dae-Sik
    • Proceedings of the KSR Conference
    • /
    • 2011.05a
    • /
    • pp.1860-1871
    • /
    • 2011
  • Presently, The Regular Block System(Automatic, Interlocking block system) is usually used during the operation of block section. However, In case that the regular block system fails because of the failure of the fixed signals and block equipment or in case of the unexpected emergent situation which should drive on the single-track due to the accidents in the double-track section or the repair work of the one-track, the Substitute Block System to make use of the driving permission license(mapping ticket, mapping paper) is used. In case of the operation of the opposite line and the temporary one-track, the safety gets worse and the SBS may cause the fatal accidents such as a head-on & a rear-end collision. Also, the unmanned railroad stations has recently increased owing to the effective operation of the stations, for it is difficult to execute the SBS in their absence. As a result, the increase of the operation time made the train delayed. Being on the rise of these problems, in this study, we analyzed the problems and difficulties of the SBS on the single line which is lacking stability and safety and on the sections combined between maned and unmaned railroad stations. And we proposed the method to improve the existing drive permission license used for 50 years into the brand-new one with state-of-the art technology and scientific way. In the era of the 21th century, Carrying out the new SBS equipped with stability and safety, we will contribute to the effective operation of trains and the satisfaction of our customers in the future.

  • PDF

A CLB based CPLD Low-power Technology Mapping Algorithm (CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;윤충모;인치호;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1165-1168
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

  • PDF