• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3239-3267
• /
• 2018

Image and video dehazing is a popular topic in the field of computer vision and digital image processing. A fast, optimized dehazing algorithm was recently proposed that enhances contrast and reduces flickering artifacts in a dehazed video sequence by minimizing a cost function that makes transmission values spatially and temporally coherent. However, its fixed-size block partitioning leads to block effects. The temporal cost function also suffers from the temporal non-coherence of newly appearing objects in a scene. Further, the weak edges in a hazy image are not addressed. Hence, a video dehazing algorithm based on well designed spectral clustering is proposed. To avoid block artifacts, the spectral clustering is customized to segment static scenes to ensure the same target has the same transmission value. Assuming that edge images dehazed with optimized transmission values have richer detail than before restoration, an edge intensity function is added to the spatial consistency cost model. Atmospheric light is estimated using a modified quadtree search. Different temporal transmission models are established for newly appearing objects, static backgrounds, and moving objects. The experimental results demonstrate that the new method provides higher dehazing quality and lower time complexity than the previous technique.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.47.3-47.3
• /
• 2021

In this talk I will review recent progress that the SDSS-IV / eBOSS collaboration has made in constraining cosmology from the clustering of galaxies, quasars and the Lyman-alpha forest. The SDSS-IV / eBOSS collaboration has measured the baryon acoustic oscillation (BAO) and redshift space distortion (RSD) features in the correlation function in redshift bins from z~0.15 to z~2.33. These features constitute measurements of angular diameter distances, Hubble distances, and growth rate measurements. A number of consistency tests have been performed between the BAO and RSD datasets and additional cosmological datasets such as the Planck cosmic microwave background constraints, the Pantheon Type Ia supernova compilation, and the weak lensing results from the Dark Energy Survey. Taken together, these joint constraints all point to a broad consistency with the standard model of cosmology LCDM + GR, though they remain in tension with local measurements of the Hubble parameter.

• The Journal of Pediatrics of Korean Medicine
• /
• v.38 no.2
• /
• pp.1-10
• /
• 2024

Objectives This study aimed to assess the reliability and validity of the Five-Visceral Weak Children Questionnaire (FWCQ) in childhood anorexia and to propose optimal cutoff values. Methods We conducted two surveys, spaced one month apart, targeting the parents of 366 children aged 2-9 years who had been diagnosed with anorexia for at least one month. To evaluate the reliability of the FWCQ, we calculated Cronbach's alpha coefficient and employed the test-retest method. Additionally, correlation analysis was performed between the FWCQ and each visceral question, and discriminant validity was assessed by comparing responses from the anorexic and normal groups. Furthermore, we determined the cutoff value of the spleen weak score, which is closely associated with appetite, for the anorexic group. Results The first survey yielded responses from 336 participants, followed by 171 responses in the second survey conducted one month later. The FWCQ demonstrated high internal consistency (Cronbach's alpha = 0.776), and test-retest results were consistent. The correlation coefficients between the FWCQ and each visceral question were all statistically significant. Moreover, significant discriminant validity was observed between the anorexic and normal groups in the FWCQ score and the heart, spleen, and kidney weak scores. The optimal cutoff value for the spleen weak score in the anorexic group was found to be 5.5 points (with a sensitivity of 73.44% and specificity of 66.47%). Conclusions The FWCQ exhibited strong reliability and validity in children with anorexia.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.2
• /
• pp.225-230
• /
• 1997

We, in this paper, propose an estimator of mean residual life function by using the residual survival function under random censoring and prove the uniform consistency and weak convergence result of this estimator. Also an example is illustrated by the real data.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.133-144
• /
• 1996

We, in this paper, propose a nonparametric estimator of bivariate mean residual life function based on Lin and Ying's (1993) bivariate survival function estimator of paired failure times under univariate censoring and prove the uniform consistency and the weak convergence result of this estimator. Through Monte Carlo simulation, the performances of the proposed estimator are tabulated and are illustrated with the skin grafts data.

• The Mathematical Education
• /
• v.31 no.2
• /
• pp.133-140
• /
• 1992

The problem of estimating a smooth distribution function F at a point $\tau$ based on randomly right censored data is treated under certain smoothness conditions on F . The asymptotic performance of a certain class of kernel estimators is compared to that of the Kap lan-Meier estimator of F($\tau$). It is shown that the .elative deficiency of the Kaplan-Meier estimate. of F($\tau$) with respect to the appropriately chosen kernel type estimate. tends to infinity as the sample size n increases to infinity. Strong uniform consistency and the weak convergence of the normalized process are also proved.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.655-660
• /
• 2003

The cache used by mobile host is an important device that recovers the weak points of limited power and bandwidth, in mobile computing environments. However, it has to stand and maintain the consistency with the server data. In this paper, we propose a 'Selective Cache Consistency Scheme'. The server allows an effective broadcasting by selecting data of high usability using 'Cache State Table' and 'Data Access Table'. Moreover, this scheme prevents the loss of data that nay occur by a long period of disconnection, by asynchronous broadcasting and transmitting those broadcast data preserved in the server. This also allows user to possess the latest data. Through experiments, we have found that the enlargement of autonomy is possible by reducing the dependence of server.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.289-298
• /
• 2006

Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the portability of mobile clients. Mobile computing satisfies user's demands for convenience and performance to use information at any time and in any place, but it has many problems to be solved in the aspect of data management. The purpose of our study is to design Mobile Continuous Query Processing System(MCQPS) to solve problems related to database hoarding, the maintenance of shared data consistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client server environments. We proved the superiority of the proposed MCQPS by comparing its performance to the C I S(Client-Intercept-Slaver) model. In Addition, we experiment on proposed index structure and methodology in various methods.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.521-530
• /
• 2005

Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the Portability of mobile clients. Mobile computing satisfies user's demands for convenience and Performance to use information at any time and in any Place, but it has many Problems to be solved in the aspect of data management. The purpose of our study is to design Mobile Query Processing System(MQPS) to solve problems related to database hoarding, the maintenance of shared data consistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client-server environments. In addition, we proved the superiority of the proposed MQPS by comparing its performance to the C-I-S(Client-Intercept- Server) model.