http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Shortest Path Routing with Large-Margin
Lutbat Yadamsuren,Enkhbat Rentsen,Hwang Won-Joo 한국멀티미디어학회 2011 한국멀티미디어학회 국제학술대회 Vol.2011 No.-
We present a new discriminative approach to routing inspired by the large-margin (max-margin) criterion serving as basis support vector machines. Our formulation uses the benefit of the dualization convex program, it is possible to be standard solvers to learn the weighting metrics of the shortest path routing and theoretically we found weight settings that could perform within a few percent from that of the optimal general routing.
Optimized Brightness Preserving Weight Clustering Histogram Equalization
Nyamlkhagva Sengee,Heung-Kook Choi,Enkhbat Rentsen 한국멀티미디어학회 2009 한국멀티미디어학회 학술발표논문집 Vol.2009 No.1
In this paper, a novel histogram equalization method is presented. Although global histogram equalization (HE) achieves comparatively better performance on almost all types of image, HE sometimes produces excessive visual deterioration. Therefore we propose the new method called "Optimized Brightness Preserving Weight Clustering Histogram Equalization" (OBPWCHE). OBPWCHE divides an input image histogram into clusters using weight criteria and all clusters which are remapped same range on output image histogram are equalized independently by HE. As adjusting the weight criteria, we can adapt the number of clusters. To select optimal number of clusters, we use Pareto optimization method which based on two quality measurements: distortion and brightness. Experimental results show that OBPWCHE can enhance image contrast while preserving image brightness and visualization of images more effectively than HE and other brightness preserving methods without undesirable enhancement.
A Complex Search Technique for Solving the Quadratic Assignment Problem
Ider Tseveendorj,Catherine Roucairol,Bazarragchaa Barsbold,Enkhbat Rentsen,Bertrand Le Cun,Francois Galea 한국멀티미디어학회 2009 한국멀티미디어학회 국제학술대회 Vol.2009 No.-
An algorithm recently developed by Enkhbat et al. based on continuous relaxation of the quadratic assignment problem generates suboptimal solution of good quality on average giving no sufficient enough verification on global optimality of the generated solution, whereas a branch and bound method provides a solution with verified global optimality, taking on input an upper bound close to global optimality. In this research we investigated possibility for combining these two techniques, so that firstly upper bound is obtained from the relaxed problem using a continuous global optimization, then a branch and bound procedure is taken to solve the problem completely.
Cell Segmentation in Phase Contrast Microscopy by Constrained Optimization
Adiya, Enkhbolor,Vongphachah, Bouasone,Al-Shidaifat, Alaaddin,Rentsen, Enkhbat,Choi, Heung-Kook IGI Global 2015 International journal of e-health and medical comm Vol.6 No.1
<P>Utilization of automatic cell segmentation process is difficult to identify in a cell due to halo and shade-off distortions when observing the phase contrast microscopy images. Therefore, it is an important step to restore artifact-free images made ready for segmentation process. The main focus of this paper is to define a gradient projection algorithm to restore images based on the minimization problem of quadratic objective function with non-negative constraints. The proposed algorithm converges to a global minimum solution independent on initialization. The experimental result shows that the proposed algorithm can restore artifact-free images, which could produce high quality segmentation results using a simple thresholding method.</P>