• Annals of Hepato-Biliary-Pancreatic Surgery
• /
• v.27 no.2
• /
• pp.131-140
• /
• 2023

During minimally invasive liver resection (MILR), the Pringle maneuver aims to minimize blood loss and provide a clear operative field, thereby identifying intrahepatic structures and facilitating safe parenchymal transection. Several techniques for using the Pringle maneuver in MILR have been described. This review presents various methods which have been reported in the literature. A systematic literature search used the MEDLINE/PubMed database from its earliest records to August 2022 using appropriate search headings and keywords. The primary outcome was identifying techniques for performing hepatic inflow occlusion during laparoscopic/robotic hepatectomy. Inclusion criteria consisted of publications describing technical steps to obtain hepatic inflow occlusion during minimally invasive hepatectomy. A literature search identified 23 relevant publications, and the full texts were examined. The techniques described in the reports can be broadly categorized into three groups: (1) the Rummel-tourniquet technique, (2) vascular clamp use, and (3) the Huang Loop technique. Various techniques have been used in MILR to achieve inflow confinement successfully. The authors prefer the modified Huang Loop technique because it is inexpensive, reliable, and quick to apply or release. Hepatobiliary surgeons are advised to familiarize themselves with these MILR techniques, which have proven effective and safe inflow occlusion.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.966-974
• /
• 1999

완전 탐색 블록 정합 알고리즘(FBMA)은 다양한 움직임 추정 알고리즘 중 최상의 움직임 추정을 할 수 있으나, 방대한 계산량이 실시간 처리의 적용에 장애 요소이다. 본 논문에서는 완전 탐색 블록 정합 알고리즘에 비해 더 낮은 계산량과 유사한 화질을 가지는 새로운 고속 움직임 추정 알고리즘을 제안한다. 제안한 방법에서는 공간적인 상관성을 이용함으로써 적절한 탐색 영역의 크기를 예측할 수 있다. 현재 블록의 움직임 추정을 위하여 이웃 블록이 가지고 있는 움직임과 탐색 영역의 크기를 이용하여 현재 블록의 탐색 영역을 적응적으로 변화시키는 방법이다. 이 예측값으로 현재 블록의 탐색 영역 크기를 결정한 후, FBMA와 같이 이 영역 안의 모든 화소점들에 대하여 현재 블록을 정합하여 움직임 벡터를 추정한다. 컴퓨터 모의 실험 결과 계산량 측면에서 제안 방법이 완전 탐색 블록 정합 알고리즘보다 50%정도 감소하였으며, PSNR 측면에서는 0.08dB에서 1.29dB 정도 감소하는 좋은 결과를 얻었다.Abstract Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, The appropriate search area can be predicted by using the temporal correlation between neighbouring blocks. For motion estimation of the current block, it is the method changing adjustably search area of current block by using motion and search area size of the neighbouring block. After deciding search area size of the current block with this predicted value, we estimate motion vector that matching current block like the FBMA for every pixel in this area. By the computer simulation the computation amount of the proposed method can be greatly decreased about 50% than that of the FBMA and the good result of the PSNR can be attained.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.5
• /
• pp.227-234
• /
• 2009

The Paper introduces a new technique for block matching motion estimation. since the temporal correlation of a animation sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the scene change detection algorithm for block matching using the temporal correlation of the animation sequence and the center-biased property of motion vectors. 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 vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that the PSNR values are improved as high as 9~32% in terms of average number of search point per motion vector estimation and improved about 0.06~0.21dB on an average except the FS(full search) algorithm.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.499-502
• /
• 2001

Fractal image coding suffers from the long search time of domain pool although it provides many properties including the high compression ratio. We find that the normalized variance of a block is independent of contrast, brightness. Using this observation, we introduce a self similar block searching method employing the d-dimensional nearest neighbor searching. This method takes Ο(log/N) time for searching the self similar domain blocks for each range block where N is the number of domain blocks. PSNR (Peak Signal Noise Ratio) of this method is similar to that of the full search method that requires Ο(N) time for each range block. Moreover, the image quality of this method is independent of the number of edges in the image.

• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.345-353
• /
• 2019

Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.229-236
• /
• 2010

With an increasing number of documents in the Internet or enterprises, it becomes crucial to efficiently support users' queries on those documents. In that situation, the full-text search technique is accepted in general, because it can answer uncontrolled ad-hoc queries by automatically indexing all the keywords found in the documents. The size of index files made for full-text searches grows with the increasing number of indexed documents, and thus the disk cost may be too large to process multi-keyword queries against those enlarged index files. To solve the problem, we propose both of the index file structure and its management scheme suitable to the processing of multi-keyword queries against a large volume of index files. For this, we adopt the structure of inverted-files, which are widely used in the multi-keyword searches, as a basic index structure and modify it to a hierarchical structure for join operations and ranking operations performed during the query processing. In order to save disk costs based on that index structure, we dynamically store in the main memory the results of join operations between two keywords, if they are highly expected to be entered in users' queries. We also do performance comparisons using a cost model of the disk to show the performance advantage of the proposed scheme.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1571-1581
• /
• 2011

In this paper, we construct inequivalent Hadamard matrices based on several new and old full orthogonal designs, using circulant and symmetric block matrices. Not all orthogonal designs produce inequivalent Hadamard matrices, because the corresponding systems of equations do not possess solutions. The systems of equations arising when we search for inequivalent Hadamard matrices from full orthogonal designs using circulant and symmetric block matrices, can be concisely described using the periodic autocorrelation function of the generators of the block matrices. We use Maple, Magma, C and Unix tools to find many new inequivalent Hadamard matrices.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.741-750
• /
• 2003

$MTP^{TM}$ guarantees high bandwidth that is necessary to tansmit high qualify full motion video data effectively. In other hand TCP/IP which is used for information search does not guarentee high bandwidth as that in $MTP^{TM}$. Therefore VOD service system that searches information manged by DBMS and transmits required full motion video data should control different kinds of protocol simultaneously. This paper describes the configuration of VODB system that has solved these problems.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.1006-1009
• /
• 2003

In a motion estimation method for use in encoding a moving picture, a full-pixel motion vector is estimated by stochastically sampling a pixel to be processed in a predetermined-sized block of a previous frame or a next frame as a reference frame for each of a plurality of equal-sized blocks in a current frame. Then, a half-pixel motion vector is estimated based on the full-pixel motion vector. Accordingly, both the calculation amount and the calculation time required for the motion estimation are effectively reduced. Further, it can be prevented that the hardware becomes complicated. .