• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.745-752
• /
• 2016

We suggest an efficient Simultaneous Localization and 3D Polygon Map Building (SLAM) method with Kinect depth sensor for mobile robots in indoor environments. In this method, Kinect depth data is separated into row planes so that scan line segments are on each row plane. After grouping all scan line segments from all row planes into line groups, a set of 3D Scan polygons are fitted from each line group. A map matching algorithm then figures out pairs of scan polygons and existing map polygons in 3D, and localization is performed to record correct pose of the mobile robot. For 3D map-building, each 3D map polygon is created or updated by merging each matched 3D scan polygon, which considers scan and map edges efficiently. The validity of the proposed 3D SLAM algorithm is revealed via experiments.

• Clinical and Experimental Pediatrics
• /
• v.54 no.5
• /
• pp.212-218
• /
• 2011

Purpose: The diagnosis of acute pyelonephritis (APN) is often difficult, as its clinical and biological manifestations are non-specific in children. If not treated quickly and adequately, however, APN may cause irreversible renal damage, possibly leading to hypertension and chronic renal failure. We were suspecting the diagnostic value of $^{99m}Tc$-dimercaptosuccinic acid (DMSA) scan by experiences and so compared the results of DMSA scan to those of multi-detector row computed tomography (MDCT). Methods: We retrospectively selected and analyzed 81 patients who were diagnosed as APN by MDCT during evaluation of their acute abdomen in emergency room and then received DMSA scan also for the diagnostic work-up of APN after admission. We evaluated the results of imaging studies and compared the diagnostic value of each method by age groups, <2 years (n=45) and ${\geq}$2 years (n=36). Results: Among total 81 patients with MDCT-proven APN, DMSA scan was diagnostic only in 55 children (68%), while the remaining 26 children (32%) showed false negative normal findings. These 26 patients were predominantly male and most of them, 19 (73.1%) were <2 years of age. Conclusion: DMSA scan holds obvious limitation compared to MDCT in depicting acute inflammatory lesions of kidney in children with APN, especially in early childhood less than 2 years of age. MDCT showed hidden lesions of APN, those were undetectable through DMSA scan in children.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.108-110
• /
• 2004

Automatic license plate recognition (LPR) is one of the critical techniques of the intelligent transportation system (ITS), in which license plate location plays an important role. In this paper, through surveying the international existing techniques, a new method for locating license plate is proposed: utilize row scan method to locate up and down boundary of the plate; and based on the location of up and down boundary, take advantage of the feature of plate area to locate left and right boundary of the plate. The tests of using the proposed algorithms have been conducted. The experimental results show that the proposed approaches are reasonable and accurate.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.732-736
• /
• 2010

Processing a large amount of data becomes more important than ever. Particularly, the information queries which require multi-dimensional record scan can be efficiently implemented with SIMD instruction sets. In this article, we present a SIMD record scan technique which employs row-based scanning. Our technique is different from existing SIMD techniques for predicate processes and aggregate operations. Those techniques apply SIMD instructions to the attributes in the same column of the database, exploiting the column-based record organization of the in-memory database systems. Whereas, our SIMD technique is useful for multi-dimensional record scanning. As the sizes of registers and the memory become larger, our row-based SIMD scan can have bigger impact on the performance. Moreover, since our technique is orthogonal to the parallelization techniques for multi-core processors, it can be applied to both uni-processors and multi-core processors without too many changes in the software architectures.

• ETRI Journal
• /
• v.25 no.5
• /
• pp.288-296
• /
• 2003

In this study, we present a 260k color TFT LCD driver chip set that consumes only 5 mW in the module, which has exceptionally low power consumption. To reduce power consumption, we used many power-lowering schemes in the logic and analog design. A driver IC for LCDs has a built-in graphic SRAM. Besides write and read operations, the graphic SRAM has a scan operation that is similar to the read operation of one row-line, which is displayed on one line in an LCD panel. Currently, the embedded graphic memory is implemented by an 8-transistor leaf cell and a 6-transistor leaf cell. We propose an efficient scan method for a 6-transistor embedded graphic memory that is greatly improved over previous methods. The proposed method is implemented in a 0.22 ${\mu}m$ process. We demonstrate the efficacy of the proposed method by measuring and comparing the current consumption of chips with and without our proposed scheme.

• Journal of International Society for Simulation Surgery
• /
• v.2 no.1
• /
• pp.43-45
• /
• 2015

Recent progress on CT such as multi-detector row CT, oral contrast agents and multiplanar reconstruction have markedly improved the image quality as well as diagnostic performance of gastric cancer. Multiplanar reformatted images at predetermined orientations can be easily performed and embedded into routine CT protocol without increasing medical expense or labor. Currently, many institutions have adopted routine multiplanar reformatted protocols and therefore knowledge on them can improve the diagnostic accuracy of gastric cancer.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.5
• /
• pp.58-65
• /
• 2007

As multimedia portable devices become popular, the amount of computation for processing data including video compression has significantly increased. Various researches for low power consumption of the mobile devices and real time processing have been reported. Motion Estimation is responsible for 67% of H.264 encoder complexity. In this research, a new circuit is designed for motion estimation. The new circuit uses motion prediction based on approximate SAD, Alternative Row Scan (ARS), DAU, and FDVS algorithms. Our new method can reduce the amount of computation by 75% when compared to multi-frame motion estimation suggested in JM8.2. Furthermore, optimal number and size of reference frame blocks are determined to reduce computation without affecting the PSNR. The proposed Motion Estimation method has been verified by using the hardware and software Co-Simulation with iPROVE. It can process 30 CIF frames/sec at 50MHz.

• Journal of Veterinary Clinics
• /
• v.34 no.5
• /
• pp.330-334
• /
• 2017

The aim of this study was to establish an injection protocol of a test bolus and a main bolus of contrast material for computed tomographic pulmonary angiography (CTPA) for visualizing optimal pulmonary arteries in normal beagle dogs. CTPA using a test bolus method from either protocol A or B were performed in each of four normal beagle dogs. In protocol A, CTPA was conducted with a scan duration for around 8 s, setting the contrast enhancement peak of the pulmonary trunk in the middle of the scan duration. The arrival time to the contrast enhancement peak was predicted from a previous dynamic scan using a test bolus (150 mg iodine/kg) injected with the same injection duration using for a main bolus (450 mg iodine/kg). In protocol B, CTPA was started at the predicted appearance time of contrast material in the pulmonary trunk based on a previous dynamic scan using a test bolus injected with the same injection rate as a main bolus. CTPA using protocol A showed the optimal opacification of the pulmonary artery with pulmonary venous contamination. Proper CTPA images in the absence of venous contamination were obtained in protocol B. CTPA with a scan duration for 8 s should be started at the appearance time of contrast enhancement in the pulmonary trunk, which can be identified exactly when a test bolus is injected at the same injection rate used for the main bolus.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.949-955
• /
• 2005

In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.4
• /
• pp.88-97
• /
• 1989

This paper proposes an efficient switch-box router which consists of two parts ; greedy poly-jog router and via minimizer. The greedy switch-box router of Luk, routes not only metal wires at horizontal tracks and poly-silicon wires at vertical tracks but also poly-siliocon wires ar horizontal tracks if necessary. The via minimizer reduces the number of vias and the wire length by fipping of each corner, parallel moving of wire segment, transformation metal into poly-silicon, and transformation poly-silicon into metal. The result is generated through the column-wise scan across the routing region. The expected time complexity is O(M(Nnet)). Where M, N, and Nnet are respectively the number of columns, rows, and nets in the routing region.