• Title/Summary/Keyword: Mobile Scan

Search Result 82, Processing Time 0.027 seconds

Performance of Wireless Mobile Node based on Experience Path with SSEPT Scheme (무선 단말의 이동경로를 고려한 선택적 채널탐색방식의 성능분석)

  • Yoon, Hong;Yoon, Chong-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.87-88
    • /
    • 2006
  • In this paper, we propose a new selective scanning scheme based on hand-off path information, which can provide an efficient reducing of delay time. This scheme eliminates almost of the scanning delay time by using Selective Scan based on Experience Path Table(SSEPT) algorithm and also completed hand-off within few milliseconds by using the next candidate channel indexing mechanism. Our scheme reduces the total number of scanning channels as well as the delay time on each channel. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the scanning channels and the total delay time.

  • PDF

Laparoscopic Removal of a Gastric Trichobezoar in an 8-Year-Old Girl - a Case Report -

  • Choi, Gyu-Seog;Choe, Byung-Ho;Park, Jin-Young
    • Advances in pediatric surgery
    • /
    • v.16 no.1
    • /
    • pp.43-48
    • /
    • 2010
  • Gastric trichobezoars are commonly observed in young women with trichotillomania and trichophagia. We encountered an 8-year-old girl who had trichotillomania and trichophagia with abdominal pain and a mass, which was diagnosed as a large gastric trichobezoar. On physical examination, a huge, firm nontender mobile mass was palpated in her epigastrium. An upper gastrointestinal series and abdominal computed tomography (CT) scan showed a large mass in the stomach. Endoscopic removal was tried but failed. Laparoscopic removal was therefore performed. The trichobezoar was successfully retrieved through a gastrotomy and removed through an extended umbilical trocar incision. This case demonstrates that laparoscopic removal of large gastric trichobezoars is feasible and safe without a large abdominal incision.

  • PDF

Low-power VLSI Architecture Design for Image Scaler and Coefficients Optimization (영상 스케일러의 저전력 VLSI 구조 설계 및 계수 최적화)

  • Han, Jae-Young;Lee, Seong-Won
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.6
    • /
    • pp.22-34
    • /
    • 2010
  • Existing image scalers generally adopt simple interpolation methods such as bilinear method to take cost-benefit, or highly complex architectures to achieve high quality resulting images. However, demands for a low power, low cost, and high performance image scaler become more important because of emerging high quality mobile contents. In this paper we propose the novel low power hardware architecture for a high quality raster scan image scaler. The proposed scaler architecture enhances the existing cubic interpolation look-up table architecture by reducing and optimizing memory access and hardware components. The input data buffer of existing image scaler is replaced with line memories to reduce the number of memory access that is critical to power consumption. The cubic interpolation formula used in existing look-up table architecture is also rearranged to reduce the number of the multipliers and look-up table size. Finally we analyze the optimized parameter sets of look-up table, which is a trade-off between quality of result image and hardware size.

An Efficient Motion Estimation Method which Supports Variable Block Sizes and Multi-frames for H.264 Video Compression (H.264 동영상 압축에서의 가변 블록과 다중 프레임을 지원하는 효율적인 움직임 추정 방법)

  • Yoon, Mi-Sun;Chang, Seung-Ho;Moon, Dong-Sun;Shin, Hyun-Chul
    • 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.

A Study on Automatic Tooth Root Segmentation For Dental CT Images (자동 치아뿌리 영역 검출 알고리즘에 관한 연구)

  • Shin, Seunghwan;Kim, Yoonho
    • The Journal of Society for e-Business Studies
    • /
    • v.19 no.4
    • /
    • pp.45-60
    • /
    • 2014
  • Dentist can obtain 3D anatomical information without distortion and information loss by using dental Computed Tomography scan images on line, and also can make the preoperative plan of implant placement or orthodontics. It is essential to segment individual tooth for making an accurate diagnosis. However, it is very difficult to distinguish the difference in the brightness between the dental and adjacent area. Especially, the root of a tooth is very elusive to automatically identify in dental CT images because jawbone normally adjoins the tooth. In the paper, we propose a method of automatically tooth region segmentation, which can identify the root of a tooth clearly. This algorithm separate the tooth from dental CT scan images by using Seeded Region Growing method on dental crown and by using Level-set method on dental root respectively. By using the proposed method, the results can be acquired average 19.2% better accuracy, compared to the result of the previous methods.

Signature-based Indexing Scheme for Similar Sub-Trajectory Retrieval of Moving Objects (이동 객체의 유사 부분궤적 검색을 위한 시그니쳐-기반 색인 기법)

  • Shim, Choon-Bo;Chang, Jae-Woo
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.247-258
    • /
    • 2004
  • Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

A Fast Mount and Stability Scheme for a NAND Flash Memory-based File System (NAND 플래시 메모리 기반 파일 시스템을 위한 빠른 마운트 및 안정성 기법)

  • Park, Sang-Oh;Kim, Sung-Jo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.12
    • /
    • pp.683-695
    • /
    • 2007
  • NAND flash memory-based file systems cannot store their system-related information in the file system due to wear-leveling of NAND flash memory. This forces NAND flash memory-based file systems to scan the whole flash memory during their mounts. The mount time usually increases linearly according to the size of and the usage pattern of the flash memory. NAND flash memory has been widely used as the storage medium of mobile devices. Due to the fact that mobile devices have unstable power supply, the file system for NAND flash memory requires stable recovery mechanism from power failure. In this paper, we present design and implementation of a new NAND flash memory-based file system that provides fast mount and enhanced stability. Our file system mounts 19 times faster than JFFS2's and 2 times faster than YAFFS's. The stability of our file system is also shown to be equivalent to that of JFFS2.

Hardware Implementation of Rasterizer with SIMD Architecture Applicable to Mobile 3D Graphics System (모바일 3차원 그래픽스 시스템에 적용 가능한 SIMD 구조를 갖는 래스터라이저의 하드웨어 구현)

  • Ha, Chang-Soo;Sung, Kwang-Ju;Choi, Byeong-Yoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.313-315
    • /
    • 2010
  • In this paper, we describe research results of developing hardware rasterizer that is applicable to mobile 3D graphics system, designed in SIMD architecture and verified in FPGA. Tile-based scan conversion unit is designed like SIMD architecture running four tiles simultaneously and each tile traverses pixels hierarchical in 3-level so that visiting counts is minimized. As experimental results, $8{\times}8$ is the most efficient size of tile and the last step of tile traversing is performed on $2{\times}2$ sized subtile. The rasterizer supports flat shading and gouraud shading and texture mapper supports affine mapping and perspective corrected mapping. Also, texture mapper supports point sampling mode and bilinear interpolating sampling mode and two types of wrapping modes and various blending modes. The rasterzer operates as 120Mhz on xilinx vertex4 $l{\times}100$ device. To easy verification, texture memory and frame buffer are generated as block rom and block ram.

  • PDF

Development of distance sensor module with object tracking function using radial arrangement of phototransistor for educational robot (교육용 로봇을 위한 포토트랜지스터의 방사형 배열을 이용한 물체추적기능을 갖는 거리 센서 모듈 개발)

  • Cho, Se-Hyoung
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.922-932
    • /
    • 2018
  • Radial distance sensors are widely used for surveying and autonomous navigation. It is necessary to train the operation principle of these sensors and how to apply them. Although commercialization of radial distance sensor continues to be cost-effective through lower performance, but it is still expensive for educational purposes. In this paper, we propose a distance sensor module with object tracking using radial array of low cost phototransistor which can be used for educational robot. The proposed method is able to detect the position of a fast moving object immediately by arranging the phototransistor in the range of 180 degrees and improve the sensing angle range and track the object by the sensor rotation using the servo motor. The scan speed of the proposed sensor is 50~200 times faster than the commercial distance sensor, thus it can be applied to a high performance educational mobile robot with 1ms control loop.

Differences in Finding Smartphone Apps across User Types Categorized by App Icon Arrangement Style (스마트폰 사용자의 앱정리 유형에 따른 앱아이콘 탐색의 차이 연구 -아이폰 사용자 중심으로-)

  • Kang, Minjeong
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.11
    • /
    • pp.143-155
    • /
    • 2017
  • In the mobile-first era, plenty of mobile apps have been created so that the number of apps owned in a smartphone have been increasing as well. However, users spend most of time with only a few apps and the rest of apps are just kept in their smartphones for future usage. Thus, in order to help users find the apps quickly it is important to study how users arrange apps in a mobile phone screen and find an app. In the literature, we extracted 5 user types to organize mobile apps. We further conducted user survey with 30 subjects and finalized major 3 user types categorized by relatedness(A), aesthetic(B), and external concepts(C). We found that most of subjects took less than 2 minutes when finding frequently-used-apps. However we identified difference in times taken to find a barely-used-apps across three user types; while A type users turns out to be the most effective in finding barely-used-apps, the B type uses tend to be the least effective among three types. For the A type users, an app's name is more important than an icon image because they tend to guess the functionality from the name of the app. The B type users use the color of app icon to find the app in the smartphone. For the C type users who tend to remain the original position of an app when first downloading it in the smartphone, the visibility of an app icon is important to catch users' eyes while they scan a page. The results of this study is expected to be useful for UX designers who improve the usability of app icon usage considering the user types.