• Title/Summary/Keyword: Time Slice

Search Result 239, Processing Time 0.031 seconds

Automatic Liver Segmentation Method on MR Images using Normalized Gradient Magnitude Image (MR 영상에서 정규화된 기울기 크기 영상을 이용한 자동 간 분할 기법)

  • Lee, Jeong-Jin;Kim, Kyoung-Won;Lee, Ho
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.11
    • /
    • pp.1698-1705
    • /
    • 2010
  • In this paper, we propose a fast liver segmentation method from magnetic resonance(MR) images. Our method efficiently divides a MR image into a set of discrete objects, and boundaries based on the normalized gradient magnitude information. Then, the objects belonging to the liver are detected by using 2D seeded region growing with seed points, which are extracted from the segmented liver region of the slice immediately above or below the current slice. Finally, rolling ball algorithm, and connected component analysis minimizes false positive error near the liver boundaries. Our method was validated by twenty data sets and the results were compared with the manually segmented result. The average volumetric overlap error was 5.2%, and average absolute volumetric measurement error was 1.9%. The average processing time for segmenting one data set was about three seconds. Our method could be used for computer-aided liver diagnosis, which requires a fast and accurate segmentation of liver.

A Study on the Design of Multifrequency Digital Receiver (MF디지탈 수신기의 설계에 관한 고찰)

  • O, Deok-Gil;Kim, Jin-Tae;Park, Hang-Gu
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.6
    • /
    • pp.27-33
    • /
    • 1984
  • This paper is an experimental gaudy on the digital hardware implementation of the R2-MF Receiver for 32 channel configurations used in signalling systems between ESS. There are many methods to detect MF signal by DSP techniques, but the requirement for MF detection needs not sharp frequency response, needs only decision about some specific frequencies exist or not at discrete frequency sampling points. The hardware used to implement this algorithm is Am 2900 series "bit-slice microprocessor" chips based on the microprogramming techniques for real time signal processing. And we used the additional Z-80A processor chips for the system control and the decision about which is the right MF signal from the detected MF spectrums. Hence we could enhance the flexibilities of the hardware and the software, this leads that this system is well suits for signalling systems used in TDM ESS.n TDM ESS.

  • PDF

Dynamic Resource Reservation for Ultra-low Latency IoT Air-Interface Slice

  • Sun, Guolin;Wang, Guohui;Addo, Prince Clement;Liu, Guisong;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3309-3328
    • /
    • 2017
  • The application of Internet of Things (IoT) in the next generation cellular networks imposes a new characteristic on the data traffic, where a massive number of small packets need to be transmitted. In addition, some emerging IoT-based emergency services require a real-time data delivery within a few milliseconds, referring to as ultra-low latency transmission. However, current techniques cannot provide such a low latency in combination with a mice-flow traffic. In this paper, we propose a dynamic resource reservation schema based on an air-interface slicing scheme in the context of a massive number of sensors with emergency flows. The proposed schema can achieve an air-interface latency of a few milliseconds by means of allowing emergency flows to be transported through a dedicated radio connection with guaranteed network resources. In order to schedule the delay-sensitive flows immediately, dynamic resource updating, silence-probability based collision avoidance, and window-based re-transmission are introduced to combine with the frame-slotted Aloha protocol. To evaluate performance of the proposed schema, a probabilistic model is provided to derive the analytical results, which are compared with the numerical results from Monte-Carlo simulations.

Surface Reconstruction for Cutting Path Generation on VLM-Slicer (VLM-Slicer에서 절단 경로 생성을 위한 측면 형상 복원)

  • Lee, Sang-Ho;An, Dong-Gyu;Yang, Dong-Yeol
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.7
    • /
    • pp.71-79
    • /
    • 2002
  • A new rapid prototyping process, Variable Lamination Manufacturing using a 4-axis-controlled hotwire cutter and expandable polystyrene foam sheet as a laminating material of the part (VLM-S), has been developed to reduce building time and to improve the surface finish of parts. The objective of this study is to reconstruct the surface of the original 3D CAD model in order to generate mid-slice data using the advancing front technique. The generation of 3D layers by a 4 axis-controlled hot-wire cutter requires a completely different procedure to generate toolpath data unlike the conventional RP CAD systems. The cutting path data for VLM-S are created by VLM-Slicer, which is a special CAD/CAM software with automatic generation of 3D toolpath. For the conventional sheet type system like LOM, the STL file would be sliced into 2D data only. However, because of using the thick layers and a sloping edge with the firstorder approximation between the top and bottom layers, VLM-Slicer requires surface reconstruction, mid-slice, and the toolpath data generation as well as 2D slicing. Surface reconstruction demands the connection between the two neighboring cross-sectional contours using the triangular facets. VLM-S employs thick layers with finite thickness, so that surface reconstruction is necessary to obtain a sloping angle of a side surface and the point data at a half of the sheet thickness. In the process of the toolpath data generation the surface reconstruction algorithm is expected to minimize the error between the ruled surface and the original parts..

A fast block-matching algorithm using the slice-competition method (슬라이스 경쟁 방식을 이용한 고속 블럭 정합 알고리즘)

  • Jeong, Yeong-Hun;Kim, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.6
    • /
    • pp.692-702
    • /
    • 2001
  • In this paper, a new block-matching algorithm for standard video encoder is proposed. The algorithm finds a motion vector using the increasing SAD transition curve for each predefined candidates, not a coarse-to-fine approach as a conventional method. To remove low-probability candidates at the early stage of accumulation, a dispersed accumulation matrix is also proposed. This matrix guarantees high-linearity to the SAD transition curve. Therefore, base on this method, we present a new fast block-matching algorithm with the slice competition technique. The Candidate Selection Step and the Candidate Competition Step makes an out-performance model that considerably reduces computational power and not to be trapped into local minima. The computational power is reduced by 10%~70% than that of the conventional BMAs. Regarding computational time, an 18%~35% reduction was achieved by the proposed algorithm. Finally, the average MAD is always low in various bit-streams. The results were also very similar to the MAD of the full search block-matching algorithm.

  • PDF

An Efficient Hardware Implementation of CABAC Using H/W-S/W Co-design (H/W-S/W 병행설계를 이용한 CABAC의 효율적인 하드웨어 구현)

  • Cho, Young-Ju;Ko, Hyung-Hwa
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.6
    • /
    • pp.600-608
    • /
    • 2014
  • In this paper, CABAC H/W module is developed using co-design method. After entire H.264/AVC encoder was developed with C using reference SW(JM), CABAC H/W IP is developed as a block in H.264/AVC encoder. Context modeller of CABAC is included on the hardware to update the changed value during binary encoding, which enables the efficient usage of memory and the efficient design of I/O stream. Hardware IP is co-operated with the reference software JM of H.264/AVC, and executed on Virtex-4 FX60 FPGA on ML410 board. Functional simulation is done using Modelsim. Compared with existing H/W module of CABAC with register-level design, the development time is reduced greatly and software engineer can design H/W module more easily. As a result, the used amount of slice in CABAC is less than 1/3 of that of CAVLC module. The proposed co-design method is useful to provide hardware accelerator in need of speed-up of high efficient video encoder in embedded system.

Electrical properties and ATP-sensitive K+ channel density of the rat substantia nigra pars compacta neurons (랫드 흑질 신경세포의 전기적 특성과 ATP-sensitive K+채널의 전류밀도)

  • Han, Seong-kyu;Park, Jin-bong;Ryu, Pan-dong
    • Korean Journal of Veterinary Research
    • /
    • v.40 no.2
    • /
    • pp.275-282
    • /
    • 2000
  • Substantia nigra is known to highly express glibenclamide binding site, a protein associated to ATP-sensitive $K^{+}$ ($K_{ATP}$) channel in the brain. However, the functional expression of $K_{ATP}$ channels in the area is not yet known. In this work, we attempted to estimate the functional expression of $K_{ATP}$ channels in neurons of the substantia nigra pars compacta (SNC) in young rats using slice patch clamp technique. Membrane properties and whole cell currents attributable to $K_{ATP}$ channel were examined by the current and voltage clamp method, respectively. In SNC, two sub-populations of neurons were identified. Type I (rhythmic) neurons had low frequency rebound action potentials ($4.5{\pm}0.25Hz$, n=75) with rhythmic pattern. Type II (phasic) neurons were characterized by faster firing ($22.7{\pm}3.16Hz$, n=12). Both time constants and membrane capacitance in rhythmic neurons ($34.0{\pm}1.27$ ms, $270.0{\pm}11.83$ pF) and phasic neurons ($23.7{\pm}4.16$ ms, $184{\pm}35.2$ pF) were also significantly different. The current density of $K_{ATP}$ channels was $6.1{\pm}1.47$ pA/pF (2.44~15.43 pA/pF, n=8) at rhythmic neurons of young rats. Our data show that in SNC there are two types of neurons with different electrical properties and the density of $K_{ATP}$, channel of rhythmic neuron is about 600 channels per neuron.

  • PDF

Blast Design for Controlled Augmentation of Muck Pile Throw and Drop (발파석의 비산과 낙하를 조절하기 위한 발파 설계)

  • Rai, Piyush;Yang, Hyung-Sik
    • Tunnel and Underground Space
    • /
    • v.20 no.5
    • /
    • pp.360-368
    • /
    • 2010
  • The paper presents a case study from a surface mine where the controlled augmentation of throw and drop of the blasted muck piles was warranted to spread the muck piles on the lower berm of the bench. While the augmentation of throw increased the lateral spread and the looseness of the broken muck, the augmentation of drop significantly lowered the muck pile height for easy excavation by the excavators. In this light, the present paper highlights and discusses some pertinent changes in the blast design parameters for such specialized application of cast blasting in a surface mine, where a sandstone bench, with average height of 22-24 m was to be made amenable for excavation by 10 m3 rope shovels, which possessed maximum digging capability of up to 14 m. The results of tailoring the blast design parameters for augmentation of throw and drop are compared with the baseline blasts which were earlier practiced on the same bench by dividing the full height of the bench in 2-slices; upper slice (10-14 m high) and lower slice (12-15 m high). Results of fragment size, its distribution and total cycle time of excavator (shovel) are presented, and discussed.

Optimized Implementation of Lightweight Block Cipher PIPO Using T-Table (T-table을 사용한 경량 블록 암호 PIPO의 최적화 구현)

  • Minsig Choi;Sunyeop Kim;Insung Kim;Hanbeom Shin;Seonggyeom Kim;Seokhie Hong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.3
    • /
    • pp.391-399
    • /
    • 2023
  • In this paper, we presents for the first time an implementation using T-table for PIPO-64/128, 256 which are lightweight block ciphers. While our proposed implementation requires 16 T-tables, we show that the two types of T-tables are circulant and obtain variants implementations that require a smaller number of T-tables. We then discuss trade-off between the number of required T-tables (code size) and throughput by evaluating the throughput of the variant implementations on an Intel Core i7-9700K processor. The throughput-optimized versions for PIPO-64/128, 256 provide better throughput than TLU(Table-Look-Up) reference implementation by factors of 3.11 and 2.76, respectively, and bit-slice reference implementation by factors of 3.11 and 2.76, respectively.

MR Neurography: Current Several Issues for Novice Radiologists (자기공명영상 신경조영술: 경험이 적은 영상의학과 의사가 이해해야 할 몇 가지 쟁점들)

  • Dong-ho Ha
    • Journal of the Korean Society of Radiology
    • /
    • v.81 no.1
    • /
    • pp.81-100
    • /
    • 2020
  • Magnetic resonance neurography (MRN) has been increasingly used in recent years for the assessment of peripheral neuropathies. Fat suppression T2-weighted imaging (T2WI) and diffusion-weighted imaging (DWI) have typically been used to provide high contrast MRN. Isotropic 3-dimensional (3D) sequences with fast spin echo, post-processing imaging techniques, and fast imaging methods, among others, allow good visualization of peripheral nerves that have a small diameter, complex anatomy, and oblique course within a reasonable scan time. However, there are still several issues when performing high contrast and high resolution MRN including standard sequence; fat saturation techniques; balance between resolution, field of view, and slice thickness; post-processing techniques; 2D vs. 3D image acquisition; different T2 contrasts between proximal and distal nerves; high T2 signal intensity of adjacent veins or joint fluid; geometric distortion; and appropriate p-values on DWI. The proper understanding of these issues will help novice radiologists evaluate peripheral neuropathies using MRN.