• Title/Summary/Keyword: Partitioning methods

Search Result 241, Processing Time 0.026 seconds

Fast PU Decision Method Using Coding Information of Co-Located Sub-CU in Upper Depth for HEVC (상위깊이의 Sub-CU 부호화 정보를 이용한 HEVC의 고속 PU 결정 기법)

  • Jang, Jae-Kyu;Choi, Ho-Youl;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.20 no.2
    • /
    • pp.340-347
    • /
    • 2015
  • HEVC (High Efficiency Video Coding) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure and various prediction units (PUs), and the determination of the best CU partition structure and the best PU mode based on rate-distortion (R-D) cost. However, the computation complexity of encoding also dramatically increases. In this paper, to reduce such encoding computational complexity, we propose three fast PU mode decision methods based on encoding information of upper depth as follows. In the first method, the search of PU mode of the current CU is early terminated based on the sub-CBF (Coded Block Flag) of upper depth. In the second method, the search of intra prediction modes of PU in the current CU is skipped based on the sub-Intra R-D cost of upper depth. In the last method, the search of intra prediction modes of PU in the lower depth's CUs is skipped based on the sub-CBF of the current depth's CU. Experimental results show that the three proposed methods reduce the computational complexity of HM 14.0 to 31.4%, 2.5%, and 23.4% with BD-rate increase of 1.2%, 0.11%, and 0.9%, respectively. The three methods can be applied in a combined way to be applied to both of inter prediction and intra prediction, which results in the complexity reduction of 34.2% with 1.9% BD-rate increase.

Content-Based Image Retrieval using Third Order Color Object Relation (3차 칼라 객체 관계에 의한 내용 기반 영상 검색)

  • Kwon, Hee-Yong;Choi, Je-Woo;Lee, In-Heang;Cho, Dong-Sub;Hwang, Hee-Yeung
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.1
    • /
    • pp.62-73
    • /
    • 2000
  • In this paper, we propose a criteria which can be applied to classify conventional color feature based Content Based Image Retrieval (CBIR) methods with its application areas, and a new image retrieval method which can represent sufficient spatial information in the image and is powerful in invariant searching to translation, rotation and enlargement transform. As the conventional color feature based CBIR methods can not sufficiently include the spatial information in the image, in general, they have drawbacks, which are weak to the translation or rotation, enlargement transform. To solve it, they have represented the spatial information by partitioning the image. Retrieval efficiency, however, is decreased rapidly as increasing the number of the feature vectors. We classify conventional methods to ones using 1st order relations and ones using 2nd order relations as their color object relation, and propose a new method using 3rd order relation of color objects which is good for the translation, rotation and enlargement transform. It makes quantized 24 buckets and selects 3 high scored histogram buckets and calculates 3 mean positions of pixels in 3 buckets and 3 angles. Then, it uses them as feature vectors of a given image. Experiments show that the proposed method is especially good at enlarged images and effective for its small calculation.

  • PDF

A Data Allocation Method based on Broadcast Disks Using Indices over Multiple Broadcast Channels (다중방송 채널에서 인덱스를 이용한 브로드캐스트 디스크 기반의 데이타 할당 기법)

  • Lee, Won-Taek;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.272-285
    • /
    • 2008
  • In this paper, we concentrate on data allocation methods for multiple broadcast channels. When the server broadcasts data, the important issue is to let mobile clients access requested data rapidly. Previous works first sorted data by their access probabilities and allocate the sorted data to the multiple channels by partitioning them into multiple channels. However, they do not reflect the difference of access probabilities among data allocated in the same channel. This paper proposes ZGMD allocation method. ZGMD allocates data item on multiple channels so that the difference of access probability in the same channel is maximized. ZGMD allocates sorted data to each channels and applies Broadcast Disk in each channel. ZGMD requires a proper indexing scheme for the performance improvement. This is because in ZGMD method each channel got allocated both hot and cold data. As a result, the sequential search heuristic does not allow the mobile client to access hot data items quickly. The proposed index scheme is based on using dedicated index channels in order to search the data channel where the requested data is. We show that our method achieve the near-optimal performance in terms of the average access time and significantly outperforms the existing methods.

A Case Study on Children's Informal Knowledge of the Fractional Multiplication (분수의 곱셈에서 비형식적 지식의 형식화 사례 연구)

  • Haek, Sun-Su;Kim, Won-Kyung
    • School Mathematics
    • /
    • v.7 no.2
    • /
    • pp.139-168
    • /
    • 2005
  • The purpose of this study is to investigate children's informal knowledge of the fractional multiplication and to develop a teaching material connecting the informal and the formal knowledge. Six lessons of the pre-teaching material are developed based on literature reviews and administered to the 7 students of the 4th grade in an elementary school. It is shown in these teaching experiments that children's informal knowledge of the fractional multiplication are the direct modeling of using diagram, mathematical thought by informal language, and the representation with operational expression. Further, teaching and learning methods of formalizing children's informal knowledge are obtained as follows. First, the informal knowledge of the repeated sum of the same numbers might be used in (fractional number)$\times$((natural number) and the repeated sum could be expressed simply as in the multiplication of the natural numbers. Second, the semantic meaning of multiplication operator should be understood in (natural number)$\times$((fractional number). Third, the repartitioned units by multiplier have to be recognized as a new units in (unit fractional number)$\times$((unit fractional number). Fourth, the partitioned units should be reconceptualized and the case of disjoint between the denominator in multiplier and the numerator in multiplicand have to be formalized first in (proper fractional number)$\times$(proper fractional number). The above teaching and learning methods are melted in the teaching meterial which is made with corrections and revisions of the pre-teaching meterial.

  • PDF

Development of Analytical methods for Chinomethionat in Livestock Products (축산물 중 살균제 Chinomethionat의 개별 잔류분석법 확립)

  • Yang, Seung-Hyun;Kim, Jeong-Han;Choi, Hoon
    • Korean Journal of Environmental Agriculture
    • /
    • v.40 no.2
    • /
    • pp.134-141
    • /
    • 2021
  • BACKGROUND: The analytical method was established for determination of fungicide chinomethionat in several animal commodities using gas chromatography (GC) coupled with electron capture detector (ECD). METHODS AND RESULTS: In order to verify the applicability, the method was optimized for determining chinomethonat in various livestock products including beef, pork, chicken, milk and egg. Chinomethionat residual was extracted using acetone/dichloromethane(9/1, v/v) with magnesium sulfate and sodium chloride (salting outassociated liquid-liquid extraction). The extract was diluted by direct partitioning into dichloromethane to remove polar co-extractives in the aqueous phase. The extract was finally purified with optimized silica gel 10 g. CONCLUSION: The method limit of quantitation (MLOQ) was 0.02 mg/kg, which was in accordance with the maximum residue level (MRL) of chinomathionate as 0.05 mg/kg in livestock product. Recovery tests were carried out at two levels of concentration (MLOQ, 10 MLOQ) and resulted in good recoveries (84.8~103.0%). Reproducibilities were obtained (Coefficient of variation <5.2%), and the linearity of calibration curves were reasonable (r2>0.995) in the range of 0.01-0.2 ㎍/mL. This established analytical method was fully validated and could be useful for quantification of chinomathionat in animal commodities as official analytical method.

Hierarchical Organization of Embryo Data for Supporting Efficient Search (배아 데이터의 효율적 검색을 위한 계층적 구조화 방법)

  • Won, Jung-Im;Oh, Hyun-Kyo;Jang, Min-Hee;Kim, Sang-Wook
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.16-27
    • /
    • 2011
  • Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

Stereotactic radiosurgery for brain metastasis in non-small cell lung cancer

  • Won, Yong Kyun;Lee, Ja Young;Kang, Young Nam;Jang, Ji Sun;Kang, Jin-Hyoung;Jung, So-Lyoung;Sung, Soo Yoon;Jo, In Young;Park, Hee Hyun;Lee, Dong-Soo;Chang, Ji Hyun;Lee, Yun Hee;Kim, Yeon-Sil
    • Radiation Oncology Journal
    • /
    • v.33 no.3
    • /
    • pp.207-216
    • /
    • 2015
  • Purpose: Stereotactic radiosurgery (SRS) has been introduced for small-sized single and oligo-metastases in the brain. The aim of this study is to assess treatment outcome, efficacy, and prognostic variables associated with survival and intracranial recurrence. Materials and Methods: This study retrospectively reviewed 123 targets in 64 patients with non-small cell lung cancer (NSCLC) treated with SRS between January 2006 and December 2012. Treatment responses were evaluated using magnetic resonance imaging. Overall survival (OS) and intracranial progression-free survival (IPFS) were determined. Results: The median follow-up was 13.9 months. The median OS and IPFS were 14.1 and 8.9 months, respectively. Fifty-seven patients died during the follow-up period. The 5-year local control rate was achieved in 85% of 108 evaluated targets. The 1- and 2-year OS rates were 55% and 28%, respectively. On univariate analysis, primary disease control (p < 0.001), the Eastern Cooperative Oncology Group (ECOG) performance status (0-1 vs. 2; p = 0.002), recursive partitioning analysis class (1 vs. 2; p = 0.001), and age (<65 vs. ${\geq}65$ years; p = 0.036) were significant predictive factors for OS. Primary disease control (p = 0.041) and ECOG status (p = 0.017) were the significant prognostic factors for IPFS. Four patients experienced radiation necrosis. Conclusion: SRS is a safe and effective local treatment for brain metastases in patients with NSCLC. Uncontrolled primary lung disease and ECOG status were significant predictors of OS and intracranial failure. SRS might be a tailored treatment option along with careful follow-up of the intracranial and primary lung disease status.

Clinical application of RapidArc volumetric modulated arc therapy as a component in whole brain radiation therapy for poor prognostic, four or more multiple brain metastases

  • Lee, Seung-Heon;Lee, Kyu-Chan;Choi, Jin-Ho;Kim, Hye-Young;Lee, Seok-Ho;Sung, Ki-Hoon;Kim, Yun-Mi
    • Radiation Oncology Journal
    • /
    • v.30 no.2
    • /
    • pp.53-61
    • /
    • 2012
  • Purpose: To determine feasibility of RapidArc in sequential or simultaneous integrated tumor boost in whole brain radiation therapy (WBRT) for poor prognostic patients with four or more brain metastases. Materials and Methods: Nine patients with multiple (${\geq}4$) brain metastases were analyzed. Three patients were classified as class II in recursive partitioning analysis and 6 were class III. The class III patients presented with hemiparesis, cognitive deficit, or apraxia. The ratio of tumor to whole brain volume was 0.8-7.9%. Six patients received 2-dimensional bilateral WBRT, (30 Gy/10-12 fractions), followed by sequential RapidArc tumor boost (15-30 Gy/4-10 fractions). Three patients received RapidArc WBRT with simultaneous integrated boost to tumors (48-50 Gy) in 10-20 fractions. Results: The median biologically effective dose to metastatic tumors was 68.1 $Gy_{10}$ and 67.2 $Gy_{10}$ and the median brain volume irradiated more than 100 $Gy_3$ were 1.9% (24 $cm^3$) and 0.8% (13 $cm^3$) for each group. With less than 3 minutes of treatment time, RapidArc was easily applied to the patients with poor performance status. The follow-up period was 0.3-16.5 months. Tumor responses among the 6 patients who underwent follow-up magnetic resonance imaging were partial and stable in 3 and 3, respectively. Overall survival at 6 and 12 months were 66.7% and 41.7%, respectively. The local progression-free survival at 6 and 12 months were 100% and 62.5%, respectively. Conclusion: RapidArc as a component in whole brain radiation therapy for poor prognostic, multiple brain metastases is an effective and safe modality with easy application.

Development of Models for Regional Cardiac Surgery Centers

  • Park, Choon Seon;Park, Nam Hee;Sim, Sung Bo;Yun, Sang Cheol;Ahn, Hye Mi;Kim, Myunghwa;Choi, Ji Suk;Kim, Myo Jeong;Kim, Hyunsu;Chee, Hyun Keun;Oh, Sanggi;Kang, Shinkwang;Lee, Sok-Goo;Shin, Jun Ho;Kim, Keonyeop;Lee, Kun Sei
    • Journal of Chest Surgery
    • /
    • v.49 no.sup1
    • /
    • pp.28-36
    • /
    • 2016
  • Background: This study aimed to develop the models for regional cardiac surgery centers, which take regional characteristics into consideration, as a policy measure that could alleviate the concentration of cardiac surgery in the metropolitan area and enhance the accessibility for patients who reside in the regions. Methods: To develop the models and set standards for the necessary personnel and facilities for the initial management plan, we held workshops, debates, and conference meetings with various experts. Results: After partitioning the plan into two parts (the operational autonomy and the functional comprehensiveness), three models were developed: the 'independent regional cardiac surgery center' model, the 'satellite cardiac surgery center within hospitals' model, and the 'extended cardiac surgery department within hospitals' model. Proposals on personnel and facility management for each of the models were also presented. A regional cardiac surgery center model that could be applied to each treatment area was proposed, which was developed based on the anticipated demand for cardiac surgery. The independent model or the satellite model was proposed for Chungcheong, Jeolla, North Gyeongsang, and South Gyeongsang area, where more than 500 cardiac surgeries are performed annually. The extended model was proposed as most effective for the Gangwon and Jeju area, where more than 200 cardiac surgeries are performed annually. Conclusion: The operation of regional cardiac surgery centers with high caliber professionals and quality resources such as optimal equipment and facility size, should enhance regional healthcare accessibility and the quality of cardiac surgery in South Korea.

Accelerated Loarning of Latent Topic Models by Incremental EM Algorithm (점진적 EM 알고리즘에 의한 잠재토픽모델의 학습 속도 향상)

  • Chang, Jeong-Ho;Lee, Jong-Woo;Eom, Jae-Hong
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.12
    • /
    • pp.1045-1055
    • /
    • 2007
  • Latent topic models are statistical models which automatically captures salient patterns or correlation among features underlying a data collection in a probabilistic way. They are gaining an increased popularity as an effective tool in the application of automatic semantic feature extraction from text corpus, multimedia data analysis including image data, and bioinformatics. Among the important issues for the effectiveness in the application of latent topic models to the massive data set is the efficient learning of the model. The paper proposes an accelerated learning technique for PLSA model, one of the popular latent topic models, by an incremental EM algorithm instead of conventional EM algorithm. The incremental EM algorithm can be characterized by the employment of a series of partial E-steps that are performed on the corresponding subsets of the entire data collection, unlike in the conventional EM algorithm where one batch E-step is done for the whole data set. By the replacement of a single batch E-M step with a series of partial E-steps and M-steps, the inference result for the previous data subset can be directly reflected to the next inference process, which can enhance the learning speed for the entire data set. The algorithm is advantageous also in that it is guaranteed to converge to a local maximum solution and can be easily implemented just with slight modification of the existing algorithm based on the conventional EM. We present the basic application of the incremental EM algorithm to the learning of PLSA and empirically evaluate the acceleration performance with several possible data partitioning methods for the practical application. The experimental results on a real-world news data set show that the proposed approach can accomplish a meaningful enhancement of the convergence rate in the learning of latent topic model. Additionally, we present an interesting result which supports a possible synergistic effect of the combination of incremental EM algorithm with parallel computing.