• Title/Summary/Keyword: SET7

Search Result 5,124, Processing Time 0.033 seconds

An Improved Level Set Method to Image Segmentation Based on Saliency

  • Wang, Yan;Xu, Xianfa
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.7-21
    • /
    • 2019
  • In order to improve the edge segmentation effect of the level set image segmentation and avoid the influence of the initial contour on the level set method, a saliency level set image segmentation model based on local Renyi entropy is proposed. Firstly, the saliency map of the original image is extracted by using saliency detection algorithm. And the outline of the saliency map can be used to initialize the level set. Secondly, the local energy and edge energy of the image are obtained by using local Renyi entropy and Canny operator respectively. At the same time, new adaptive weight coefficient and boundary indication function are constructed. Finally, the local binary fitting energy model (LBF) as an external energy term is introduced. In this paper, the contrast experiments are implemented in different image database. The robustness of the proposed model for segmentation of images with intensity inhomogeneity and complicated edges is verified.

The Clinical Outcomes after Embryo Transfer (ET) on Day 2 and Day 5 or Subsequent ET on Day 2-5, 2-6, 2-7, 3-5 and 4-7 in In Vitro Fertilization-ET Cycles (체외수정술에서 배아 이식 시기와 방법 (2일과 5일 및 2-5, 2-6, 2-7, 3-5, 4-7일 연속 이식)에 관한 연구)

  • Kim, Dae-Won;Park, Kee-Sang;Song, Hai-Bum;Lee, Taek-Hoo;Chun, Sang-Sik
    • Clinical and Experimental Reproductive Medicine
    • /
    • v.30 no.1
    • /
    • pp.31-37
    • /
    • 2003
  • 연구목적: 일반적으로 IVF-ET에서 가장 높은 임신율을 얻는 방법은 5 day ET (배반포기 배아 이식)이지만 장기간 배양이 적절하지 못한 경우에는 $2{\sim}4$일째에 ET를 실시하고 나서 $5{\sim}7$일째에 배반포기에 도달한 배아를 재이식 (SET)하여, SET의 효용성에 대하여 조사하고자 실시하였다. 연구재료 및 방법: 48주기의 환자에서 회수한 난자와 수정란은 10%와 20% hFF가 첨가한 DMEM에서 이식 직전까지 각각 공배양하였다. 채란 2일 (group I, day 2 ET), 5일째 이식 (group II, day 5 ET) 또는 재이식 (group III, SET; 2-5, 2-6, 2-7, 3-5, 4-7일)을 실시하면서 수정률, 할구분할률 및 임신율을 각각 비교하였다. 결과에 대한 통계 분석을 SAS (version 6.2)를 이용한 Duncan's Multiple Range Test를 이용하여 p값이 0.05 보다 작을 때 통계적으로 유의차가 있는 것으로 하였다. 결 과: 수정률은 group II (90.5%)가 다른 군에 비하여 높게 (p<0.05) 나타났다 (group I: 80.6%; group III: 82.9%). 할구분할률은 군간에 차이가 없었다 (수정란 당 $93.3{\sim}99.1%$). 임상적 임신율은 group II와 III (각각 58.3%)가 group I (33.3%) 보다 높게 나타났다. 그러나 처리군이 적어서 통계적인 차이는 없었다. 결 론: 배반포기 배아를 단독 이식하는 것이 임신율을 높일 수 있는 최선의 방법으로 나타났지만, 채란수가 적거나 수정률이 저조한 경우에는 $2{\sim}4$일째에 ET를 실시한 후 여분의 배아를 배반포기까지 배양한 다음 $5{\sim}7$일에 재이식 (SET)하면 blastocyst ET에서 나타날 수 있는 이식 자체의 실패를 방지할 수 있으면서 임신율을 높일 수 있는 이식 기법이 될 것이다.

Low Temperature Characteristics of Schottky Barrier Single Electron and Single Hole Transistors

  • Jang, Moongyu;Jun, Myungsim;Zyung, Taehyoung
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.950-953
    • /
    • 2012
  • Schottky barrier single electron transistors (SB-SETs) and Schottky barrier single hole transistors (SB-SHTs) are fabricated on a 20-nm thin silicon-on-insulator substrate incorporating e-beam lithography and a conventional CMOS process technique. Erbium- and platinum-silicide are used as the source and drain material for the SB-SET and SB-SHT, respectively. The manufactured SB-SET and SB-SHT show typical transistor behavior at room temperature with a high drive current of $550{\mu}A/{\mu}m$ and $-376{\mu}A/{\mu}m$, respectively. At 7 K, these devices show SET and SHT characteristics. For the SB-SHT case, the oscillation period is 0.22 V, and the estimated quantum dot size is 16.8 nm. The transconductance is $0.05{\mu}S$ and $1.2{\mu}S$ for the SB-SET and SB-SHT, respectively. In the SB-SET and SB-SHT, a high transconductance can be easily achieved as the silicided electrode eliminates a parasitic resistance. Moreover, the SB-SET and SB-SHT can be operated as a conventional field-effect transistor (FET) and SET/SHT depending on the bias conditions, which is very promising for SET/FET hybrid applications. This work is the first report on the successful operations of SET/SHT in Schottky barrier devices.

A Novel Reversible Data Hiding Scheme for VQ-Compressed Images Using Index Set Construction Strategy

  • Qin, Chuan;Chang, Chin-Chen;Chen, Yen-Chang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.2027-2041
    • /
    • 2013
  • In this paper, we propose a novel reversible data hiding scheme in the index tables of the vector quantization (VQ) compressed images based on index set construction strategy. On the sender side, three index sets are constructed, in which the first set and the second set include the indices with greater and less occurrence numbers in the given VQ index table, respectively. The index values in the index table belonging to the second set are added with prefixes from the third set to eliminate the collision with the two derived mapping sets of the first set, and this operation of adding prefixes has data hiding capability additionally. The main data embedding procedure can be achieved easily by mapping the index values in the first set to the corresponding values in the two derived mapping sets. The same three index sets reconstructed on the receiver side ensure the correctness of secret data extraction and the lossless recovery of index table. Experimental results demonstrate the effectiveness of the proposed scheme.

A Study on the Design of the Teletext Systems for the Hangul Process (한글처리를 위한 문자다중방송 시스템의 설계에 관한 연구)

  • 김정석;전경일;김용덕
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.7
    • /
    • pp.799-806
    • /
    • 1988
  • This paper deals with the teletext systems with processing the Hangul which is compatible with the NABTS. The Hangul set was included in the graphic-set repertory of the 7bit in-use table and the synthesis method was used to process the Hangul codes. The Hangul in the Teletext systems by the NABTS is possible to use DRCS method, but the transmission delay problem has occurred in that case. As a result, all the programs within the NABTS format are possible to use without any modifications in this systems.

  • PDF

THE FIXED POINT INDEX FOR ACCRETIVE MAPPINGS WITH K-SET CONTRACTION PERTURBATIONS IN CONES

  • Chen, Y.Q.;Ha, K.S.;Cho, Y.J.
    • Journal of the Korean Mathematical Society
    • /
    • v.34 no.1
    • /
    • pp.237-245
    • /
    • 1997
  • The fixed point index plays an important role in solving the positive solutions of nonlinear equations in ordered Banach spaces ([7], [10], [11], [14], [15]). Many authors have studied the existence problems of positive solutions of nonlinear equations for nonlinear mappings ([1]-[5], [7], [9], [10], [14], [15]).

  • PDF

Characterization of Korean Clays and Pottery by Neutron Activation Analysis (III). A Classification Rule for Unknown Korean Ancient Potsherds

  • Lee, Chul;Kwun, Oh-Cheun;Jung, Dae-Il;Lee, Ihn-Chong;Kim, Nak-Bae
    • Bulletin of the Korean Chemical Society
    • /
    • v.7 no.6
    • /
    • pp.438-442
    • /
    • 1986
  • A number of Korean potsherd samples has been classified by Fisher's discriminant method for the training set of Kyungki, Koryung and Kyungnam groups. The Koryung samples have been further classified for the training set of Koryung A, B and C subgroups. The training sets have been used to define classification of unknown samples and clay samples so as to find out some similarity between clay samples and certain potsherd groups.

Storage Policies for Versions Management of XML Documents using a Change Set (변경 집합을 이용한 XML 문서의 버전 관리를 위한 저장 기법)

  • Yun Hong Won
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1349-1356
    • /
    • 2004
  • The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change oper-ation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We pro-pose three storage policies using a change set. Three storage policies are (1) storing all the change sets, (2) storing the change sets and the versions periodically. (3) storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Though the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.