• Title/Summary/Keyword: Temporal cost

Search Result 206, Processing Time 0.037 seconds

Microvascular Anastomosis with Non-penetrating Vascular Clips in Head and Neck Free Flap Surgery (두경부 유리피판 수술에 있어서의 비천공성 혈관 클립을 이용한 미세혈관 문합술)

  • Chang, Hak;Minn, Kyung-Won;Kim, Woo-Ram;Shin, Hyun-Woo;Koh, Kyung-Suck
    • Archives of Reconstructive Microsurgery
    • /
    • v.14 no.1
    • /
    • pp.57-62
    • /
    • 2005
  • Microvascular anastomosis with suture technique is a basic skill but there are several problems such as stenosis, thrombosis and long operating time. Recently plastic surgeons have developed non-suturing mechanical coupling devices for microvascular anastomosis. The authors applied non-penetrating vascular clips (VCS clips) in the field of free flap surgery of head and neck area. Between August of 2004 and January of 2005, we performed 9 free flaps (16 vessels) using small-sized VCS clips. Four stay sutures were applied first and then VCS clips were placed between sutures about 1 mm apart. Vascular pedicle of free flap included the descending branch of lateral circumflex femoral vessel, thoracodorsal vessel, deep inferior epigastric vessel and cephalic vein. The recipient vessels were the superior thyroid artery, superficial temporal artery, internal jugular vein, external jugular vein, and superficial temporal vein. We performed 13 end-to-end (4 arteries and 9 veins) and 3 venous end-to-side anastomoses. No flap related complication occurred but we applied additional clips or sutures in two cases due to blood leakage after completion of anastomosis. Primary patency rates seemed to be good and more rapid anastomosis could be done than conventional suture technique. Advantages of VCS technique are high patency rate, low thrombogenecity and rapidity. Although the high cost of VCS instrument may be a problem, this clip could be applied safely in microvascular free tissue transfer.

  • PDF

Fuzzy Minimum Interval Partition for Uncertain Time Interval (불확실한 시간 간격을 위한 퍼지 최소 간격 분할 기법)

  • Heo, Mun-Haeng;Lee, Gwang-Gyu;Lee, Jun-Uk;Ryu, Geun-Ho;Kim, Hong-Gi
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.571-578
    • /
    • 2002
  • In temporal database, extended time dimension for history management brings about complexity of join operation and increased cost. To solve this problem, a method that joins the divided segment time data after partition the time range into fixed time interval is introduced. But existing methods can't solve the ambiguity problem of time border that caused by temporal granularity in the partition point. In this paper, We suggested Fuzzy Minimum Interval Partition (FMIP) method that introduced the possibility distribution of fuzzy theory considered uncertainty time interval border in the partition line.

Motion Estimation in Video Coding using Search Candidate Point on Region by Binary-Tree Structure (이진트리 구조에 따른 구간별 탐색 후보점을 이용한 비디오 코딩의 움직임 추정)

  • Kwak, Sung-Keun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.1
    • /
    • pp.402-410
    • /
    • 2013
  • In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

Adaptive V1-MT model for motion perception

  • Li, Shuai;Fan, Xiaoguang;Xu, Yuelei;Huang, Jinke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.371-384
    • /
    • 2019
  • Motion perception has been tremendously improved in neuroscience and computer vision. The baseline motion perception model is mediated by the dorsal visual pathway involving the cortex areas the primary visual cortex (V1) and the middle temporal (V5 or MT) visual area. However, few works have been done on the extension of neural models to improve the efficacy and robustness of motion perception of real sequences. To overcome shortcomings in situations, such as varying illumination and large displacement, an adaptive V1-MT motion perception (Ad-V1MTMP) algorithm enriched to deal with real sequences is proposed and analyzed. First, the total variation semi-norm model based on Gabor functions (TV-Gabor) for structure-texture decomposition is performed to manage the illumination and color changes. And then, we study the impact of image local context, which is processed in extra-striate visual areas II (V2), on spatial motion integration by MT neurons, and propose a V1-V2 method to extract the image contrast information at a given location. Furthermore, we take feedback inputs from V2 into account during the polling stage. To use the algorithm on natural scenes, finally, multi-scale approach has been used to handle the frequency range, and adaptive pyramidal decomposition and decomposed spatio-temporal filters have been used to diminish computational cost. Theoretical analysis and experimental results suggest the new Ad-V1MTMP algorithm which mimics human primary motion pathway has universal, effective and robust performance.

Histogram Matching of Sentinel-2 Spectral Information to Enhance Planetscope Imagery for Effective Wildfire Damage Assessment

  • Kim, Minho;Jung, Minyoung;Kim, Yongil
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.4
    • /
    • pp.517-534
    • /
    • 2019
  • In abrupt fire disturbances, high quality images suitable for wildfire damage assessment can be difficult to acquire. Quantifying wildfire burn area and severity are essential measures for quick short-term disaster response and efficient long-term disaster restoration. Planetscope (PS) imagery offers 3 m spatial and daily temporal resolution, which can overcome the spatio-temporal resolution tradeoff of conventional satellites, albeit at the cost of spectral resolution. This study investigated the potential of augmenting PS imagery by integrating the spectral information from Sentinel-2 (S2) differenced Normalized Burn Ratio (dNBR) to PS differenced Normalized Difference Vegetation Index (dNDVI) using histogram matching,specifically for wildfire burn area and severity assessment of the Okgye wildfire which occurred on April 4th, 2019. Due to the difficulty in acquiring reference data, the results of the study were compared to the wildfire burn area reported by Ministry of the Interior and Safety. The burn area estimates from this study demonstrated that the histogram-matched (HM) PS dNDVI image produced more accurate burn area estimates and more descriptive burn severity intervals in contrast to conventional methods using S2. The HM PS dNDVI image returned an error of only 0.691% whereas the S2 dNDVI and dNBR images overestimated the wildfire burn area by 5.32% and 106%, respectively. These improvements using PS were largely due to the higher spatial resolution, allowing for the detection of sparsely distributed patches of land and narrow roads, which were indistinguishable using S2 dNBR. In addition, the integration of spectral information from S2 in the PS image resolved saturation effects in areas of low and high burn severity.

A Bottom up Filtering Tuple Selection Method for Continuous Skyline Query Processing in Sensor Networks (센서 네트워크에서 연속 스카이라인 질의 처리를 위한 상향식 필터링 투플 선정 방법)

  • Sun, Jin-Ho;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.280-291
    • /
    • 2009
  • Skyline Query processing is important to wireless sensor applications in order to process multi-dimensional data efficiently. Most skyline researches about sensor network focus on minimizing the energy consumption due to the battery powered constraints. In order to reduce energy consumption, Filtering Method is proposed. Most existing researches have assumed a snapshot skyline query processing and do not consider continuous queries and use data generated in ancestor node. In this paper, we propose an energy efficient method called Bottom up filtering tuple selection for continuous skyline query processing. Past skyline data generated in child nodes are stored in each sensor node and is used when choosing filtering tuple. We also extend the algorithms, called Support filtering tuple(SFT) that is used when we choose the additional filtering tuple. There is a temporal correlation between previous sensing data and recent sensing data. Thus, Based on past data, we estimate current data. By considering this point, we reduce the unnecessary communication cost. The experimental results show that our method outperforms the existing methods in terms of both data reduction rate(DRR) and total communication cost.

Active Adjustment: An Approach for Improving the Search Performance of the TPR*-tree (능동적 재조정: TPR*-트리의 검색 성능 개선 방안)

  • Kim, Sang-Wook;Jang, Min-Hee;Lim, Sung-Chae
    • The KIPS Transactions:PartD
    • /
    • v.15D no.4
    • /
    • pp.451-462
    • /
    • 2008
  • Recently, with the advent of applications using locations of moving objects, it becomes crucial to develop efficient index schemes for spatio-temporal databases. The $TPR^*$-tree is most popularly accepted as an index structure for processing future-time queries. In the $TPR^*$-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a new method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers both the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original $TPR^*$-tree significantly.

A Study on the Urban Growth Change using Satellite Imagery Data (위성영상자료를 활용한 도시성장변화에 관한 연구)

  • Kim, Yoon-Soo;Kim, Jung-Hwan;Jung, Eung-Ho;Ryu, Ji-Won
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.5 no.2
    • /
    • pp.81-90
    • /
    • 2002
  • Remote Sensing has been very useful tool in monitoring of cities and updating of GIS database compare to traditional methods due to its benefit; wide range covering on low cost and advanced data collection. However it had come to a limited method in limited researches because of its relatively poor spatial resolution in scanning. Recently launched satellites are able to produce improved imageries, and new commercial services have been commenced for the use of general public with higher spatial resolution up to $1m{\times}1m$. This study tackled a potential use of these improved satellite imageries in urban planning based on the Multi-temporal satellite imagery with particular reference to monitoring on urban areas, for example urbanization and its expanding. i) Portion of individual features and elements in each pixel of satellite imagery was computed based on 'Endmember' of targeted elements. ii) Urbanized areas were categorized based on the 'Fraction imagery' derived from the 'SMA algorithm'. iii) Alterations and expanding of urban areas were identified based on the Multi-temporal satellite imageries. Tested method showed a strong potential to produce more advanced monitoring skills of urban areas.

  • PDF

A Node Relocation Strategy of Trajectory Indexes for Efficient Processing of Spatiotemporal Range Queries (효율적인 시공간 영역 질의 처리를 위한 궤적 색인의 노드 재배치 전략)

  • Lim Duksung;Cho Daesoo;Hong Bonghee
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.664-674
    • /
    • 2004
  • The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

Estimation and Determinants on Residential Investment Profits in Seoul: A Focus on Housing Transaction Price from 2010 to 2018 (서울시 주택 예상투자이익 추정과 영향요인에 대한 시론적 분석 - 2010-2018년 주택 실거래가를 중심으로 -)

  • Ahn, Hye-Sung;Kang, Chang-Deok
    • Journal of the Korean Regional Science Association
    • /
    • v.36 no.1
    • /
    • pp.37-50
    • /
    • 2020
  • Estimating investment profits of real estate is critical to understand real estate markets and create relevant policy as real estate market and capital market combines closely. Thus, this study applied the concept of Tobin's Q to estimate investment profits for apartments as well as row-houses and multi-family homes in Seoul from 2010 to 2018. Investment profits were estimated by two approaches: subtracting the replacement cost from the transaction price and calculating ratio of the transaction price to the replacement cost, respectively. The spatio-temporal changes in investment profits were apparent in apartments compared with row-houses and multi-family homes. As a result of analyzing the spatial econometrics models, the investment profit was higher in the area with high density and new developments regardless of the housing types. The framework and key findings would be the effective reference to understand residential investment behavior, create relevant housing policy, introduce value capture of windfall, measure regional competitiveness, and estimate housing bubble.