• Journal of Chest Surgery
• /
• v.50 no.5
• /
• pp.339-345
• /
• 2017

Background: In recent years, single-port video-assisted thoracoscopic surgery (VATS) for lobectomy in non-small cell lung cancer (NSCLC) patients has become increasingly common. The objective of this study was to compare the feasibility and safety of single-port and triple-port VATS lobectomy. Methods: A total of 73 patients with NSCLC who underwent VATS lobectomy from December 2011 to August 2016 were retrospectively reviewed, including 47 in the triple-port group and 26 in the single-port group. Statistical analysis was performed after propensity score matching. Patients were matched on a 1-to-1 basis. Results: Operative time and intraoperative blood loss in the triple-port group and the single-port group were similar ($189.4{\pm}50.8minutes$ vs. $205.4{\pm}50.6minutes$, p=0.259; $286.5{\pm}531.0mL$ vs. $314.6{\pm}513.1mL$, p=0.813). There were no cases of morbidity or mortality. No significant differences in complications or the total number of dissected lymph nodes were found between the 2 groups. In the single-port group, more mediastinal lymph nodes were dissected than in the triple-port group ($1.7{\pm}0.6$ vs. $1.2{\pm}0.5$, p=0.011). Both groups had 1 patient with bronchopleural fistula. Chest tube duration and postoperative hospital stay were shorter in the single-port group than in the triple-port group ($8.7{\pm}5.1days$ vs. $6.2{\pm}6.6days$, p=0.130; $11.7{\pm}6.1days$ vs. $9.5{\pm}6.4days$, p=0.226). However, the differences were not statistically significant. In the single-port group, the rate of conversion to multi-port VATS lobectomy was 11.5% (3 of 26). The rates of conversion to open thoracotomy in the triple-port and single-port groups were 7.7% and 3.8%, respectively (p=1.000). Conclusion: In comparison with the triple-port group, single-port VATS lobectomy showed similar results in safety and efficacy, indicating that single-port VATS lobectomy is a feasible and safe option for lung cancer patients.

• Journal of Gastric Cancer
• /
• v.18 no.3
• /
• pp.230-241
• /
• 2018

Purpose: Enhanced recovery after surgery (ERAS) protocols for gastric cancer patients have shown improved outcomes in Asia. However, data on gastric cancer ERAS (GCERAS) programs in the United States are sparse. The purpose of this study was to compare perioperative outcomes before and after implementation of an GC-ERAS protocol at a National Comprehensive Cancer Center in the United States. Materials and Methods: We reviewed medical records of patients surgically treated for gastric cancer with curative intent from January 2012 to October 2016 and compared the GC-ERAS group (November 1, 2015-October 1, 2016) with the historical control (HC) group (January 1, 2012-October 31, 2015). Propensity score matching was used to adjust for age, sex, number of comorbidities, body mass index, stage of disease, and distal versus total gastrectomy. Results: Of a total of 95 identified patients, matching analysis resulted in 20 and 40 patients in the GC-ERAS and HC groups, respectively. Lower rates of nasogastric tube (35% vs. 100%, P<0.001) and intraabdominal drain placement (25% vs. 85%, P<0.001), faster advancement of diet (P<0.001), and shorter length of hospital stay (5.5 vs. 7.8 days, P=0.01) were observed in the GC-ERAS group than in the HC group. The GC-ERAS group showed a trend toward increased use of minimally invasive surgery (P=0.06). There were similar complication and 30-day readmission rates between the two groups (P=0.57 and P=0.66, respectively). Conclusions: The implementation of a GC-ERAS protocol significantly improved perioperative outcomes in a western cancer center. This finding warrants further prospective investigation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.23 no.3
• /
• pp.233-238
• /
• 2005

3-D virtual city model is becoming increasingly important for a number of GIS applications. For reconstruction of 3D building in urban area aerial images, satellite images, LIDAR data have been used mainly and most of researches related to 3-D reconstruction focus on development of method for extraction of building height and reconstruction of building. In case of automatically extracting and reconstructing of building height using only aerial images or satellite images, there are a lot of problems, such as mismatching that result from a geometric distortion of optical images. Therefore, researches of integrating optical images and existing digital map (1/1,000) has been in progress. In this paper, we focused on extracting of building height by means of interest points and vertical line locus method for reducing matching points. Also we used digital plotter in order to validate for the results in this study using aerial images (1/5,000) and existing digital map (1/1,000).

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.283-303
• /
• 2007

Recently, the study of efficient way to store and retrieve enormous music data is becoming the one of important issues in the multimedia database. Most general method of MIR (Music Information Retrieval) includes a text-based approach using text information to search a desired music. However, if users did not remember the keyword about the music, it can not give them correct answers. Moreover, since these types of systems are implemented only for exact matching between the query and music data, it can not mine any information on similar music data. Thus, these systems are inappropriate to achieve similarity matching of music data. In order to solve the problem, we propose an Efficient Query-By-Humming System (EQBHS) with a content-based indexing method that efficiently retrieve and store music when a user inquires with his incorrect humming. For the purpose of accelerating query processing in EQBHS, we design indices for significant melodies, which are 1) frequent melodies occurring many times in a single music, on the assumption that users are to hum what they can easily remember and 2) melodies partitioned by rests. In addition, we propose an error tolerated mapping method from a note to a character to make searching efficient, and the frequent melody extraction algorithm. We verified the assumption for frequent melodies by making up questions and compared the performance of the proposed EQBHS with N-gram by executing various experiments with a number of music data.

• Journal of Korea Technology Innovation Society
• /
• v.15 no.3
• /
• pp.649-674
• /
• 2012

The purpose of this study is to investigate the effects of public R&D subsidies on private R&D. We have analyzed rationales for the public R&D subsidy from different perspectives. On the basis of literature review, a two step research model is constructed: participation phase (when firms benefit from public subsidies) and decision phase (when firms make decision on additional R&D investments). Using propensity score matching(PSM) method, we compare the potential outcome of the treated group to a matched controlled group of non-subsidized firms. The data used in this paper was collected from various sources. The Korean Innovation Survey 2008(manufacturing sector) is a main source of data. Financial data such as revenue, asset and capital stock, and number of employees were supplemented from the Nice Information Service KIS Value database. The R&D survey, conducted by MEST(Ministry of Education, Science and Technology) each year, was also used for the R&D expenditures of the manufacturing firms. This study comes up with the following empirical results. First, a firm's innovation capability, financial constraints, and sector appear to influence the selection of firms who were benefited from government's financial supports for R&D. Second, empirical results show that public R&D funding complements private investment on average and appear to have perpetual effects on the following year. Finally, sectoral difference in the effect of public subsidies on firms' R&D investment was confirmed. In addition, SMEs show more positive effects than large firms.

• Journal of the Society of Naval Architects of Korea
• /
• v.55 no.1
• /
• pp.66-74
• /
• 2018

In order to evaluate the precision degree of the blocks on the dock, the shipyards recently started to use the point cloud approaches using the 3D scanners. However, they hesitate to use it due to the limited time, cost, and elaborative effects for the post-works. Although it is somewhat traditional instead, they have still used the electro-optical wave devices which have a characteristic of having less dense point set (usually 1 point per meter) around the contact section of two blocks. This paper tried to expand the usage of point sets. Our approach can estimate the rework time to weld between the Pre-Erected(PE) Block and Erected(ER) block as well as the precision of block construction. In detail, two algorithms were applied to increase the efficiency of estimation process. The first one is K-mean clustering algorithm which is used to separate only the related contact point set from others not related with welding sections. The second one is the Concave hull algorithm which also separates the inner point of the contact section used for the delayed outfitting and stiffeners section, and constructs the concave outline of contact section as the primary objects to estimate the rework time of welding. The main purpose of this paper is that the rework cost for welding is able to be obtained easily and precisely with the defective point set. The point set on the blocks' outline are challenging to get the approximated mathematical curves, owing to the lots of orthogonal parts and lack of number of point. To solve this problems we compared the Radial based function-Multi-Layer(RBF-ML) and Akima interpolation method. Collecting the proposed methods, the paper suggested the noble point matching method for minimizing the rework time of block-welding on the dock, differently the previous approach which had paid the attention of only the degree of accuracy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.113-120
• /
• 2005

3D reconstruction of a scene structure from un-calibrated image sequences has been long one of the central problems in computer vision. For 3D reconstruction in Euclidean space, projective reconstruction, which is classified into the merging method and the factorization, is needed as a preceding step. By calculating all camera projection matrices and structures at the same time, the factorization method suffers less from dia and error accumulation than the merging. However, the factorization is hard to analyze precisely long sequences because it is based on the assumption that all correspondences must remain in all views from the first frame to the last. This paper presents a new projective reconstruction method for recovery of 3D structure over long sequences. We break a full sequence into sub-sequences based on a quantitative measure considering the number of matching points between frames, the homography error, and the distribution of matching points on the frame. All of the projective reconstructions of sub-sequences are registered into the same coordinate frame for a complete description of the scene. no experimental results showed that the proposed method can recover more precise 3D structure than the merging method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1204-1218
• /
• 1999

문서영상 검색을 위한 디지털도서관의 대부분은 논문제목과/또는 논문요약으로부터 만들어진 색인에 근거한 제한적인 검색기능을 제공하고 있다. 본 논문에서는 영문 문서영상전체에 대한 검색을 위한 단어 영상 형태 특징기반의 단어검색시스템을 제안한다. 본 논문에서는 검색의 효율성과 정확도를 높이기 위해 1) 기존의 단어검색시스템에서 사용된 특징들을 조합하여 사용하며, 2) 특징의 개수 및 위치뿐만 아니라 특징들의 순서를 포함하여 매칭하는 방법을 사용하며, 3) 특징비교에 의해 검색결과를 얻은 후에 여과목적으로 문자인식을 부분적으로 적용하는 2단계의 검색방법을 사용한다. 제안된 시스템의 동작은 다음과 같다. 문서 영상이 주어지면, 문서 영상 구조가 분석되고 단어 영역들의 조합으로 분할된다. 단어 영상의 특징들이 추출되어 저장된다. 사용자의 텍스트 질의가 주어지면 이에 대응되는 단어 영상이 만들어지며 이로부터 영상특징이 추출된다. 이 참조 특징과 저장된 특징들과 비교하여 유사한 단어를 검색하게 된다. 제안된 시스템은 IBM-PC를 이용한 웹 환경에서 구축되었으며, 영문 문서영상을 이용하여 실험이 수행되었다. 실험결과는 본 논문에서 제안하는 방법들의 유효성을 보여주고 있다. Abstract Most existing digital libraries for document image retrieval provide a limited retrieval service due to their indexing from document titles and/or the content of document abstracts. This paper proposes a word spotting system for full English document image retrieval based on word image shape features. In order to improve not only the efficiency but also the precision of a retrieval system, we develop the system by 1) using a combination of the holistic features which have been used in the existing word spotting systems, 2) performing image matching by comparing the order of features in a word in addition to the number of features and their positions, and 3) adopting 2 stage retrieval strategies by obtaining retrieval results by image feature matching and applying OCR(Optical Charater Recognition) partly to the results for filtering purpose. The proposed system operates as follows: given a document image, its structure is analyzed and is segmented into a set of word regions. Then, word shape features are extracted and stored. Given a user's query with text, features are extracted after its corresponding word image is generated. This reference model is compared with the stored features to find out similar words. The proposed system is implemented with IBM-PC in a web environment and its experiments are performed with English document images. Experimental results show the effectiveness of the proposed methods.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.27-36
• /
• 2010

In Web registration pages and online polling applications, CAPTCHA(Completely Automated Public Turing Test To Tell Computers and Human Apart) is used for distinguishing human users from automated programs. Text-based CAPTCHAs have been widely used in many popular Web sites in which distorted text is used. However, because the advanced optical character recognition techniques can recognize the distorted texts, the reliability becomes low. Image-based CAPTCHAs have been proposed to improve the reliability of the text-based CAPTCHAs. However, these systems also are known as having some drawbacks. First, some image-based CAPTCHA systems with small number of image files in their image dictionary is not so reliable since attacker can recognize images by repeated executions of machine learning programs. Second, users may feel uncomfortable since they have to try CAPTCHA tests repeatedly when they fail to input a correct keyword. Third, some image-base CAPTCHAs require high communication cost since they should send several image files for one CAPTCHA. To solve these problems of image-based CAPTCHA, this paper proposes a new CAPTCHA based on both image and text. In this system, an image and keywords are integrated into one CAPTCHA image to give user a hint for the answer keyword. The proposed CAPTCHA can help users to input easily the answer keyword with the hint in the fused image. Also, the proposed system can reduce the communication costs since it uses only a fused image file for one CAPTCHA. To improve the reliability of the image-text fusion CAPTCHA, we also propose a dynamic building method of large image dictionary from gathering huge amount of images from theinternet with filtering phase for preserving the correctness of CAPTCHA images. In this paper, we proved that the proposed image-text fusion CAPTCHA provides users more convenience and high reliability than the image-based CAPTCHA through experiments.