• Title/Summary/Keyword: size of segment

Search Result 332, Processing Time 0.03 seconds

Syringomyelia Associated with a Spinal Arachnoid Cyst

  • Kim, Min-Su;Kim, Seong-Ho
    • Journal of Korean Neurosurgical Society
    • /
    • v.45 no.5
    • /
    • pp.315-317
    • /
    • 2009
  • While syringomyelia is not a rare spinal disorder, syringomyelia associated with a spinal arachnoid cyst is very unusual. Here, we report a 62-year-old man who suffered from gait disturbance and numbness of bilateral lower extremities. Spinal magnetic resonance imaging (MRI) showed the presence of a spinal arachnoid cyst between the 7th cervical and 3rd thoracic vertebral segment and syringomyelia extending between the 6th cervical and 1st thoracic vertebral segment. The cyst had compressed the spinal cord anteriorly. Syringomyelia usually results from lesions that partially obstruct cerebrospinal fluid flow. Therefore, we concluded that the spinal arachnoid cyst was causing the syringomyelia. After simple excision of the arachnoid cyst, the symptoms were relieved. A follow-up MRI demonstrated that the syringomyelia had significantly decreased in size after removal of the arachnoid cyst. This report presents an unusual case of gait disturbance caused by syringomyelia associated with a spinal arachnoid cyst.

Automatic partial shape recognition system using adaptive resonance theory (적응공명이론에 의한 자동 부분형상 인식시스템)

  • 박영태;양진성
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.3
    • /
    • pp.79-87
    • /
    • 1996
  • A new method for recognizing and locating partially occluded or overlapped two-dimensional objects regardless of their size, translation, and rotation, is presented. Dominant points approximating occuluding contoures of objects are generated by finding local maxima of smoothed k-cosine function, and then used to guide the contour segment matching procedure. Primitives between the dominant points are produced by projecting the local contours onto the line between the dominant points. Robust classification of primitives. Which is crucial for reliable partial shape matching, is performed using adaptive resonance theory (ART2). The matched primitives having similar scale factors and rotation angles are detected in the hough space to identify the presence of the given model in the object scene. Finally the translation vector is estimated by minimizing the mean squred error of the matched contur segment pairs. This model-based matching algorithm may be used in diveerse factory automation applications since models can be added or changed simply by training ART2 adaptively without modifying the matching algorithm.

  • PDF

Digital Hologram Coding Technique using Block Matching of Localized Region and MCTF (로컬영역의 정합기법 및 MCTF를 이용한 디지털 홀로그램 부호화 기술)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kim, Dong-Wook
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.415-416
    • /
    • 2006
  • In this paper, we proposed a new coding technique of digital hologram video using 3D scanning method and video compression technique. The proposed coding consists of capturing a digital hologram to separate into RGB color space components, localization by segmenting the fringe pattern, frequency transform using $M{\tiems}N$ (segment size) 2D DCT (2 Dimensional Discrete Cosine Transform) for extracting redundancy, 3D scan of segment to form a video sequence, motion compensated temporal filtering (MCTF) and modified video coding which uses H.264/AVC.

  • PDF

Efficient Management of Proxy Server Cache for Video (비디오를 위한 효율적인 프록시 서버 캐쉬의 관리)

  • 조경산;홍병천
    • Journal of the Korea Society for Simulation
    • /
    • v.12 no.2
    • /
    • pp.25-34
    • /
    • 2003
  • Because of explosive growth in demand for web-based multimedia applications, proper proxy caching for large multimedia object (especially video) has become needed. For a video object which is much larger in size and has different access characteristics than the traditional web object such as image and text, caching the whole video file as a single web object is not efficient for the proxy cache. In this paper, we propose a proxy caching strategy with the constant-sized segment for video file and an improved proxy cache replacement policy. Through the event-driven simulation under various conditions, we show that our proposal is more efficient than the variable-sized segment strategy which has been proven to have higher hit ratio than other traditional proxy cache strategies.

  • PDF

Microsurgical treatment of distal middle cerebral artery aneurysm: A single-center review

  • Taehoon Jang;Sung-Tae Kim;Jin Lee;Won-Hee Lee;Keun-Soo Lee;Se-Young Pyo;Junghae Ko;Hangwoo Lee;Yeong Gyun Jeong
    • Journal of Cerebrovascular and Endovascular Neurosurgery
    • /
    • v.26 no.1
    • /
    • pp.37-45
    • /
    • 2024
  • Objective: To review the characteristics of distal middle cerebral artery (MCA) aneurysm treated by microsurgery, the detailed surgical options, and the clinical result. Methods: We retrospectively reviewed cerebral aneurysm in the M2 and M3 segments of the MCA surgically treated between January 2015 and December 2022. The demographic data, aneurysm-related findings, type of surgical approach, surgical technique, and clinical outcomes of the enrolled patients were analyzed. Results: Sixteen distal MCA aneurysms were treated with microneurosurgery (incidence, 1.0%; female, 12; mean age, 58.1 years; ruptured, three). Twelve aneurysms were in the M2 segment (insular segment), two aneurysms at the M2-M3 junction, and two aneurysms in the M3 segment (opercular segment). Twelve aneurysms were saccular (average size, 4.9 mm; multiplicity, 50%; average aneurysms, 3.0; partially thrombosed, 1; sidewall aneurysm, 2). Three aneurysms were fusiform, of which two were ruptured. Of the ruptured aneurysms, one was a ruptured dissecting aneurysm. The trans-sylvian and trans-sulcal approaches were used in fourteen and two patients, respectively. Neck clipping, wrap clipping, and surgical trapping were performed in twelve, one, and one patient, respectively. Proximal occlusion was performed in one patient. Bypass technique was required in two patients (neck clipping and proximal occlusion). The modified Rankin Score was 6 in the two patients with ruptured aneurysms. The remaining patients did not show further neurological deterioration after microneurosurgery. Conclusions: Distal MCA aneurysms had a high incidence of being diagnosed with multiple other aneurysms and were relatively non-saccular.

A Video-Quality Control Scheme using ANFIS Architecture in a DASH Environment (DASH 환경에서 ANFIS 구조를 이용한 비디오 품질 조절 기법)

  • Son, Ye-Seul;Kim, Hyun-Jun;Kim, Joon-Tae
    • Journal of Broadcast Engineering
    • /
    • v.23 no.1
    • /
    • pp.104-114
    • /
    • 2018
  • Recently, as HTTP-based video streaming traffic continues to increase, Dynamic Adaptive Streaming over HTTP(DASH), which is one of the HTTP-based adaptive streaming(HAS) technologies, is receiving attention. Accordingly, many video quality control techniques have been proposed to provide a high quality of experience(QoE) to clients in a DASH environment. In this paper, we propose a new quality control method using ANFIS(Adaptive Network based Fuzzy Inference System) which is one of the neuro-fuzzy system structure. By using ANFIS, the proposed scheme can find fuzzy parameters that selects the appropriate segment bitrate for clients. Also, considering the characteristic of VBR video, the next segment download time can be more accurately predicted using the actual size of the segment. And, by using this, it adjusts video quality appropriately in the time-varying network. In the simulation using NS-3, we show that the proposed scheme shows higher average segment bitrate and lower number of bitrate-switching than the existing methods and provides improved QoE to the clients.

Isolation and Characterization of the Smallest Bacteriophage P4 Derivatives Packaged into P4-Size Head in Bacteriophage P2-P4 System

  • Kim, Kyoung-Jin;Song, Jae-Ho
    • Journal of Microbiology
    • /
    • v.44 no.5
    • /
    • pp.530-536
    • /
    • 2006
  • Bacteriophage P4, a satellite phage of coliphage P2, is a very useful experimental tool for the study of viral capsid assembly and cos-cleavage. For an in vitro cos-cleavage reaction study of the P2-P4 system, new shortened and selectable markers containing P4 derivative plasm ids were designed as a substrate molecules. They were constructed by swapping the non-essential segment of P4 DNA for either the kanamycin resistance (kmr) gene or the ampicillin resistance (apr) gene. The size of the genomes of the resulting markers were 82% (P4 ash8 delRI:: kmr) and 79% (P4 ash8 delRI:: apr) of the wild type P4 genome. To determine the lower limit of genome size that could be packaged into the small P4-size bead, these shortened P4 plasmids were converted to phage particles with infection of the helper phage P2. The conversion of plasmid P4 derivatives to bacteriophage particles was verified by the heat stability test and the burst size determination experiment. CsCl buoyant equilibrium density gradient experiments confirmed not only the genome size of the viable phage form of shortened P4 derivatives, but also their packaging into the small P4-size head. P4 ash8 delRI:: apr turned out to be the smallest P4 genome that can be packaged into P4-sized head.

A Fast Shortest Path Algorithm Between Two Points inside a Segment-Visible Polygon (선분가시 다각형 내부에 있는 두 점 사이의 최단 경로를 구하는 빠른 알고리즘)

  • Kim, Soo-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.2
    • /
    • pp.369-374
    • /
    • 2010
  • The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

Segmenting the Plus-size Women's Apparel Consumers using Store Patronage (이용점포 유형에 따른 플러스 사이즈 여성의류 시장세분화)

  • Yu, Haekyung;Lee, Sun Mi;Ko, Sunyoung
    • Fashion & Textile Research Journal
    • /
    • v.15 no.1
    • /
    • pp.35-45
    • /
    • 2013
  • The purposes of this study were to segment the women's plus-size market by the types of store patronage, profile the segments, and examine the differences in satisfaction with clothing attributes and variety of plus-size apparels according to different segments. The questionnaires included the 7-point likert scales on store patronage, satisfaction, clothing involvement and body cathexis. Five body measurements were recorded by sales people, and the respondents also provided information on their weight, height and garment size in addition to demographic characteristics. Questionnaires were collected from 7 franchise stores in Seoul, Anyang, Daegu, and Cheonan during the months of February, 2011 to April, 2011. 210 questionnaires were distributed and 160 were returned. Excluding incomplete questionnaires, a total of 149 questionnaires were used in the final analysis. The cluster analysis based on store patronage identified four segments- major patrons of specialty stores, multi-channel users, regular store users, and internet shopping mall users. Significant differences were found among the four segments of women's plus-size consumers in terms of clothing involvement, age, occupation, education and clothing expenditures. Internet shopping mall user group were in overall less satisfied with several clothing attributes and variety compared to other groups.

Low-Cost Elliptic Curve Cryptography Processor Based On Multi-Segment Multiplication (멀티 세그먼트 곱셈 기반 저비용 타원곡선 암호 프로세서)

  • LEE Dong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.8 s.338
    • /
    • pp.15-26
    • /
    • 2005
  • In this paper, we propose an efficient $GF(2^m)$ multi-segment multiplier architecture and study its application to elliptic curve cryptography processors. The multi-segment based ECC datapath has a very small combinational multiplier to compute partial products, most of its internal data buses are word-sized, and it has only a single m bit multiplexer and a single m bit register. Hence, the resource requirements of the proposed ECC datapath can be minimized as the segment number increases and word-size is decreased. Hence, as compared to the ECC processor based on digit-serial multiplication, the proposed ECC datapath is more efficient in resource usage. The resource requirement of ECC Processor implementation depends not only on the number of basic hardware components but also on the complexity of interconnection among them. To show the realistic area efficiency of proposed ECC processors, we implemented both the ECC processors based on the proposed multi-segment multiplication and digit serial multiplication and compared their FPGA resource usages. The experimental results show that the Proposed multi-segment multiplication method allows to implement ECC coprocessors, requiring about half of FPGA resources as compared to digit serial multiplication.