Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA New Algorithm Based Entropic Threshold for Edge Detection in Images
96
0
0.0
(
0
)
Added by
Mohamed A. El-Sayed
Publication date
2012
fields
Informatics Engineering
and research's language is
English
Authors
Mohamed A. El-Sayed
Ask ChatGPT about the research
No Arabic abstract
Edge detection is one of the most critical tasks in automatic image analysis. There exists no universal edge detection method which works well under all conditions. This paper shows the new approach based on the one of the most efficient techniques for edge detection, which is entropy-based thresholding. The main advantages of the proposed method are its robustness and its flexibility. We present experimental results for this method, and compare results of the algorithm against several leading edge detection methods, such as Canny, LOG, and Sobel. Experimental results demonstrate that the proposed method achieves better result than some classic methods and the quality of the edge detector of the output images is robust and decrease the computation time.
rate research
Read More
Edge detection is an important field in image processing. Edges characterize object boundaries and are therefore useful for segmentation, registration, feature extraction, and identification of objects in a scene. In this paper, an approach utilizing an improvement of Baljit and Amar method which uses Shannon entropy other than the evaluation of derivatives of the image in detecting edges in gray level images has been proposed. The proposed method can reduce the CPU time required for the edge detection process and the quality of the edge detector of the output images is robust. A standard test images, the real-world and synthetic images are used to compare the results of the proposed edge detector with the Baljit and Amar edge detector method. In order to validate the results, the run time of the proposed method and the pervious method are presented. It has been observed that the proposed edge detector works effectively for different gray scale digital images. The performance evaluation of the proposed technique in terms of the measured CPU time and the quality of edge detector method are presented. Experimental results demonstrate that the proposed method achieve better result than the relevant classic method.
Object detection methods are widely adopted for computer-aided diagnosis using medical images. Anomalous findings are usually treated as objects that are described by bounding boxes. Yet, many pathological findings, e.g., bone fractures, cannot be clearly defined by bounding boxes, owing to considerable instance, shape and boundary ambiguities. This makes bounding box annotations, and their associated losses, highly ill-suited. In this work, we propose a new bone fracture detection method for X-ray images, based on a labor effective and flexible annotation scheme suitable for abnormal findings with no clear object-level spatial extents or boundaries. Our method employs a simple, intuitive, and informative point-based annotation protocol to mark localized pathology information. To address the uncertainty in the fracture scales annotated via point(s), we convert the annotations into pixel-wise supervision that uses lower and upper bounds with positive, negative, and uncertain regions. A novel Window Loss is subsequently proposed to only penalize the predictions outside of the uncertain regions. Our method has been extensively evaluated on 4410 pelvic X-ray images of unique patients. Experiments demonstrate that our method outperforms previous state-of-the-art image classification and object detection baselines by healthy margins, with an AUROC of 0.983 and FROC score of 89.6%.
We study a class of mathematical and statistical algorithms with the aim of establishing a computer-based framework for fast and reliable automatic abnormality detection on landmark represented image templates. Under this framework, we apply a landmark-based algorithm for finding a group average as an estimator that is said to best represent the common features of the group in study. This algorithm extracts information of momentum at each landmark through the process of template matching. If ever converges, the proposed algorithm produces a local coordinate system for each member of the observing group, in terms of the residual momentum. We use a Bayesian approach on the collected residual momentum representations for making inference. For illustration, we apply this framework to a small database of brain images for detecting structure abnormality. The brain structure changes identified by our framework are highly consistent with studies in the literature.
We developed a source detection algorithm based on the Minimal Spanning Tree (MST), that is a graph-theoretical method useful for finding clusters in a given set of points. This algorithm is applied to gamma-ray bidimensional images where the points correspond to the arrival direction of photons, and the possible sources are associated with the regions where they clusterize. Some filters to select these clusters and to reduce the spurious detections are introduced. An empirical study of the statistical properties of MST on random fields is carried in order to derive some criteria to estimate the best filter values. We introduce also two parameters useful to verify the goodness of candidate sources. To show how the MST algorithm works in the practice, we present an application to an EGRET observation of the Virgo field, at high galactic latitude and with a low and rather uniform background, in which several sources are detected.
This paper presents a fast algorithm for obtaining high-accuracy subpixel translation of low PSNR images. Instead of locating the maximum point on the upsampled images or fitting the peak of correlation surface, the proposed algorithm is based on the measurement of centroid on the cross correlation surface by Modified Moment method. Synthetic images, real solar images and standard testing images with white Gaussian noise added were tested, and the results show that the accuracies of our algorithm are comparable with other subpixel registration techniques and the processing speed is higher. The drawback is also discussed at the end of this paper.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
