• Journal of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.427-444
• /
• 2024

The matrix completion problem is to predict missing entries of a data matrix using the low-rank approximation of the observed entries. Typical approaches to matrix completion problem often rely on thresholding the singular values of the data matrix. However, these approaches have some limitations. In particular, a discontinuity is present near the thresholding value, and the thresholding value must be manually selected. To overcome these difficulties, we propose a shrinkage and thresholding function that smoothly thresholds the singular values to obtain more accurate and robust estimation of the data matrix. Furthermore, the proposed function is differentiable so that the thresholding values can be adaptively calculated during the iterations using Stein unbiased risk estimate. The experimental results demonstrate that the proposed algorithm yields a more accurate estimation with a faster execution than other matrix completion algorithms in image inpainting problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1874-1884
• /
• 1996

In this paper, we proposed automatic searching algorithm of thresholding value using multilevel thresholding for face segmentation from input bust image effectively. The proposed algorithm extracted the thresholding value of brightness that is formed background region, face region and hair region without illumination, background and face size from input image. The statistical projection analysis project the brightness of multilevel thresholding image into horizontal and vertical direction and decide the thresholding value of face. And the algorithm extracted elliptical type block of face from input image in order to reduce the back ground region and hair region efficiently. The proposed algorithm can reduce searching area of feature extraction and processing time for face recognication.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1235-1238
• /
• 2004

Thresholding has been used to reduce the number of gray values in images. Typically, a single threshold value has been used, resulting in two gray level images. Image reduction of one single threshold value, however, may lose too much of the high-frequency edge information. Thus, dynamic thresholding that uses a different threshold for each pixel is preferred instead of using a single threshold value. Dynamic thresholding can preserve high frequency details as well as reduce the size of images. Since it takes long time to perform existing software dynamic thresholding in an embedded system, this paper proposes and implements a circuit by using a FPGA in order to perform a real-time dynamic thresholding,. The proposed circuit consists of two counters, and threshold look-up table, and control unit. The values of two counters determine each pixel position, the threshold look-up table converts each pixel value into other value, and the control unit generates necessary control signals. On arriving from a camera to the proposed circuit, each pixel is compared with its threshold value and is converted into other gray value. An image processing system by using the proposed circuit will be implemented and some experiments will be performed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1695-1700
• /
• 2005

In this paper, we propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the surface voxel of photo-consistency with inside voxel on the optic ray of the center camera. As iterating the process of the voxels, the threshold value is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph cut as compare with conventional algorithms.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.4
• /
• pp.155-160
• /
• 2006

This paper presents the hierarchical block matching algorithm using the 4 subbands of the wavelet transformation and the thresholding method. The proposed algorithm improves the PSNR performance of the reconstructed image using the 4 subbands of the wavelet transformation and reduces the computational complexity by thresholding the motion vector. The experimental results of the proposed algorithm for 'Carphone' image and 'Mother and Daughter' image show that if the thresholding value is 0, the computational complexity is increasing up to 16% and the PSNR performance of the reconstructed image improves the 0.16dB in comparison with that of the existing. hierarchical motion estimation algorithm. In addition, as the thresholding value is increasing, the computational complexity reduces up to 8% and the PSNR performance of the reconstructed image is similar.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.60-65
• /
• 2014

This paper describes an efficient framework for the extraction of a brain tumor from magnetic resonance (MR) images. Before the segmentation process, a median filter is used to filter the image. Then, the morphological gradient is computed and added to the filtered image for intensity enhancement. After the enhancement process, the thresholding value is calculated using the mean and the standard deviation of the image. This thresholding value is used to binarize the image followed by the morphological operations. Moreover, the combination of these morphological operations allows to compute the local thresholding image supported by a flood-fill algorithm and a pixel replacement process to extract the tumor from the brain. Thus, this framework provides a new source of evidence in the field of segmentation that the specialist can aggregate with the segmentation results in order to soften his/her own decision.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1689-1694
• /
• 2005

Face detection plays an important role in face recognition, video surveillance, and human computer interface. In this paper, we present a face detection system using eye detection with progressive thresholding from a digital camera. The face candidate is detected by using skin color segmentation in the YCbCr color space. The face candidates are verified by detecting the eyes that is located by iterative thresholding and correlation coefficients. Preprocessing includes histogram equalization, log transformation, and gray-scale morphology for the emphasized eyes image. The distance of the eye candidate points generated by the progressive increasing threshold value is employed to extract the facial region. The process of the face detection is repeated by using the increasing threshold value. Experimental results show that more enhanced face detection in real time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2113-2128
• /
• 2019

Image thresholding techniques introducing spatial information are widely used image segmentation. Some methods are used to calculate the optimal threshold by building a specific histogram with different parameters, such as gray value of pixel, average gray value and gradient-magnitude, etc. However, these methods still have some limitations. In this paper, an entropic thresholding method based on Gabor histogram (a new 2D histogram constructed by using Gabor filter) is applied to image segmentation, which can distinguish foreground/background, edge and noise of image effectively. Comparing with some methods, including 2D-KSW, GLSC-KSW, 2D-D-KSW and GLGM-KSW, the proposed method, tested on 10 realistic images for segmentation, presents a higher effectiveness and robustness.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.487-490
• /
• 2011

This paper presents splitting and merging algorithm based on adaptive thresholding. The algorithm first divides the image into blocks, and then compares each block using the calculated thresholding value. The blocks which are same are merged using the certain threshold value and different blocks are split unless it satisfies the threshold value. When the block has been merged, maximum and minimum block sizes are determined then the average block size is determined. After the average block size is determined the average intensity and standard deviation of average block is calculated. The process of thresholding is applied to binarize the image. Finally, the experimental results show that the proposed method distinguishes clearly the background with text in the document image.