| 1. |
- Li, Bo, 1982-, et al.
(author)
-
Distinctive curve features
- 2016
-
In: Electronics Letters. - : John Wiley & Sons. - 0013-5194 .- 1350-911X. ; 52:3, s. 197-198
-
Journal article (peer-reviewed)abstract
- Curves and lines are geometrical, abstract features of an image. Whereas interest points are more limited, curves and lines provide much more information of the image structure. However, the research done in curve and line detection is very fragmented. The concept of scale space is not yet fused very well into curve and line detection. Keypoint (e.g. SIFT, SURF, ORB) is a successful concept which represent features (e.g. blob, corner etc.) in scale space. Stimulated by the keypoint concept, a method which extracts distinctive curves (DICU) in scale space, including lines as a special form of curve features is proposed. A curve feature can be represented by three keypoints (two end points, and one middle point). A good way to test the quality of detected curves is to analyse the repeatability under various image transformations. DICU using the standard Oxford benchmark is evaluated. The overlap error is calculated by averaging the overlap error of three keypoints on the curve. Experiment results show that DICU achieves good repeatability comparing with other state-of-the-art methods. To match curve features, a relatively uncomplicated way is to combine local descriptors of three keypoints on each curve.
|
|
| 2. |
- Li, Bo, 1982-, et al.
(author)
-
Distinctive curves : unified scale-invariant detection of edges, corners, lines and curves
-
Other publication (other academic/artistic)abstract
- This paper aims to broaden the scope of shape related features including edges, corners, lines and curves: 1) Edges, corners, lines, curves are all shape related features. In the past, the detection of each type of feature is usually solved independently under certain hypotheses. Our proposed distinctive curve detection method (DICU) solves the detection of all these type of features together. 2) Compared to the development in scale-invariant interest point detectors which have adopted more objective robustness measures using repeatability score, the research in line and curve features is still limited to “true/false positive” measures. DICU detection utilizes the scale-space concept and proves that curve features can be as robust as scale-invariant interest points. DICU has three advantages: 1) DICU outputs multi-type features which can benefit future computer vision applications. At the same time, the computational efficiency is unaffected, after detecting edges, only 5% additional computation is needed to detect corners, lines, and curves. 2) It is robust under various image perturbations and transformations and outperforms state-of-the-art interest point detectors and line detectors. At the same time, all types of detected features are robust. 3) Curve features contains more geometric information than points. Our curve matching test shows that curve matching can outperform interest point matching.
|
|
| 3. |
- Li, Bo, 1982-, et al.
(author)
-
Fast edge detection by center of mass
- 2013
-
In: The 1st IEEE/IIAE International Conference on Intelligent Systems and Image Processing 2013 (ICISIP2013). - Kitakyushu, Japan : The Institute of Industrial Applications Engineers. ; , s. 103-110
-
Conference paper (peer-reviewed)abstract
- In this paper, a novel edge detection method that computes image gradient using the concept of Center of Mass (COM) is presented. The algorithm runs with a constant number of operations per pixel independently from its scale by using integral image. Compared with the conventional convolutional edge detector such as Sobel edge detector, the proposed method performs faster when region size is larger than 9×9. The proposed method can be used as framework for multi-scale edge detectors when the goal is to achieve fast performance. Experimental results show that edge detection by COM is competent with Canny edge detection.
|
|
| 4. |
- Li, Bo, 1982-, et al.
(author)
-
Fast edge filter and multi-scale edge detection
-
Other publication (other academic/artistic)abstract
- The first step of efficient edge detection is to use a filter to detect intensity change. The filter size is a parameter which affects the edge detection result. A filter of large size is less sensitive to noise while a filter of small size is more accurate when locating edges. This gives the user a choice of choosing the proper filter size depending on the situation. A more stable edge detection approach is multi-scale edge detection, which detects gradients using several filter sizes. The time consumption of a conventional edge filter is usually or , where w is the width of the filter. Therefore, using filters of large size or multi-scale filters is not very efficient. We propose an efficient edge detection method with time consumption. It uses the center of mass concept and utilizes the power of integral images to achieve this efficiency. The results of our experiments show that the proposed edge detector is very stable and we also propose a simplified multi-scale edge detection scheme which can be used in practical operations.
|
|
| 5. |
- Li, Bo, 1982-, et al.
(author)
-
Independent Thresholds on Multi-scale Gradient Images
- 2013
-
In: The 1st IEEE/IIAE International Conference on Intelligent Systems and Image Processing 2013 (ICISIP2013). - Kitakyushu, Japan : The Institute of Industrial Applications Engineers. ; , s. 124-131
-
Conference paper (peer-reviewed)abstract
- In this paper we propose a multi-scale edge detection algorithm based on proportional scale summing. Our analysis shows that proportional scale summing successfully improves edge detection rate by applying independent thresholds on multi-scale gradient images. The proposed method improves edge detection and localization by summing gradient images with a proportional parameter cn (c < 1); which ensures that the detected edges are as close as possible to the fine scale. We employ non-maxima suppression and thinning step similar to Canny edge detection framework on the summed gradient images. The proposed method can detect edges successfully and experimental results show that it leads to better edge detection performance than Canny edge detector and scale multiplication edge detector.
|
|
| 6. |
- Li, Bo, 1982-
(author)
-
Interest Curves : Concept, Evaluation, Implementation and Applications
- 2015
-
Doctoral thesis (other academic/artistic)abstract
- Image features play important roles in a wide range of computer vision applications, such as image registration, 3D reconstruction, object detection and video understanding. These image features include edges, contours, corners, regions, lines, curves, interest points, etc. However, the research is fragmented in these areas, especially when it comes to line and curve detection. In this thesis, we aim to discover, integrate, evaluate and summarize past research as well as our contributions in the area of image features. This thesis provides a comprehensive framework of concept, evaluation, implementation, and applications for image features.Firstly, this thesis proposes a novel concept of interest curves. Interest curves is a concept derived and extended from interest points. Interest curves are significant lines and arcs in an image that are repeatable under various image transformations. Interest curves bring clear guidelines and structures for future curve and line detection algorithms and related applications.Secondly, this thesis presents an evaluation framework for detecting and describing interest curves. The evaluation framework provides a new paradigm for comparing the performance of state-of-the-art line and curve detectors under image perturbations and transformations.Thirdly, this thesis proposes an interest curve detector (Distinctive Curves, DICU), which unifies the detection of edges, corners, lines and curves. DICU represents our state-of-the-art contribution in the areas concerning the detection of edges, corners, curves and lines. Our research efforts cover the most important attributes required by these features with respect to robustness and efficiency.Interest curves preserve richer geometric information than interest points. This advantage gives new ways of solving computer vision problems. We propose a simple description method for curve matching applications. We have found that our proposed interest curve descriptor outperforms all state-of-the-art interest point descriptors (SIFT, SURF, BRISK, ORB, FREAK). Furthermore, in our research we design a novel object detection algorithm that only utilizes DICU geometries without using local feature appearance. We organize image objects as curve chains and to detect an object, we search this curve chain in the target image using dynamic programming. The curve chain matching is scale and rotation-invariant as well as robust to image deformations. These properties have given us the possibility of resolving the rotation-variance problem in object detection applications. In our face detection experiments, the curve chain matching method proves to be scale and rotation-invariant and very computational efficient.
|
|
| 7. |
- Li, Bo, 1982-, et al.
(author)
-
Restricted Hysteresis Reduce Redundancy in Edge Detection
- 2013
-
In: Journal of Signal and Information Processing. - 2159-4465 .- 2159-4481. ; 4:3B, s. 158-163
-
Journal article (peer-reviewed)abstract
- In edge detection algorithms, there is a common redundancy problem, especially when the gradient direction is close to -135°, -45°, 45°, and 135°. Double edge effect appears on the edges around these directions. This is caused by the discrete calculation of non-maximum suppression. Many algorithms use edge points as feature for further task such as line extraction, curve detection, matching and recognition. Redundancy is a very important factor of algorithm speed and accuracy. We find that most edge detection algorithms have redundancy of 50% in the worst case and 0% in the best case depending on the edge direction distribution. The common redundancy rate on natural images is approximately between 15% and 20%. Based on Canny’s framework, we propose a restriction in the hysteresis step. Our experiment shows that proposed restricted hysteresis reduce the redundancy successfully.
|
|
| 8. |
- Li, Bo, 1982-, et al.
(author)
-
Scale-invariant corner keypoints
- 2014
-
In: 2014 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP). - : IEEE conference proceedings. - 9781479957514 ; , s. 5741-5745
-
Conference paper (peer-reviewed)abstract
- Effective and efficient generation of keypoints from images is the first step of many computer vision applications, such as object matching. The last decade presented us with an arms race toward faster and more robust keypoint detection, feature description and matching. This resulted in several new algorithms, for example Scale Invariant Features Transform (SIFT), Speed-up Robust Feature (SURF), Oriented FAST and Rotated BRIEF (ORB) and Binary Robust Invariant Scalable Keypoints (BRISK). The keypoint detection has been improved using various techniques in most of these algorithms. However, in the search for faster computing, the accuracy of the algorithms is decreasing. In this paper, we present SICK (Scale-Invariant Corner Keypoints), which is a novel method for fast keypoint detection. Our experiment results show that SICK is faster to compute and more robust than recent state-of-the-art methods.
|
|
| 9. |
- Li, Bo, 1982-, et al.
(author)
-
Scale-invariant corner keypoints
-
Other publication (other academic/artistic)abstract
- Effective and efficient generation of keypoints from images is the first step of many computer vision applications, such as object matching. The last decade presented us with an arms race toward faster and more robust keypoint detection, feature description and matching. This resulted in several new algorithms, for example Scale Invariant Features Transform (SIFT), Speed-up Robust Feature (SURF), Oriented FAST and Rotated BRIEF (ORB) and Binary Robust Invariant Scalable Keypoints (BRISK). The keypoint detection has been improved using various techniques in most of these algorithms. However, in the search for faster computing, the accuracy of the algorithms is decreasing. In this paper, we present SICK (Scale-Invariant Corner Keypoints), which is a novel method for fast keypoint detection. Our experiment results show that SICK is faster to compute and more robust than recent state-of-the-art methods.
|
|
| 10. |
- Mullins, Niamh, et al.
(author)
-
Dissecting the Shared Genetic Architecture of Suicide Attempt, Psychiatric Disorders, and Known Risk Factors
- 2022
-
In: Biological Psychiatry. - : Elsevier. - 0006-3223 .- 1873-2402. ; 91:3, s. 313-327
-
Journal article (peer-reviewed)abstract
- BACKGROUND: Suicide is a leading cause of death worldwide, and nonfatal suicide attempts, which occur far more frequently, are a major source of disability and social and economic burden. Both have substantial genetic etiology, which is partially shared and partially distinct from that of related psychiatric disorders.METHODS: We conducted a genome-wide association study (GWAS) of 29,782 suicide attempt (SA) cases and 519,961 controls in the International Suicide Genetics Consortium (ISGC). The GWAS of SA was conditioned on psychiatric disorders using GWAS summary statistics via multitrait-based conditional and joint analysis, to remove genetic effects on SA mediated by psychiatric disorders. We investigated the shared and divergent genetic architectures of SA, psychiatric disorders, and other known risk factors.RESULTS: Two loci reached genome-wide significance for SA: the major histocompatibility complex and an intergenic locus on chromosome 7, the latter of which remained associated with SA after conditioning on psychiatric disorders and replicated in an independent cohort from the Million Veteran Program. This locus has been implicated in risk-taking behavior, smoking, and insomnia. SA showed strong genetic correlation with psychiatric disorders, particularly major depression, and also with smoking, pain, risk-taking behavior, sleep disturbances, lower educational attainment, reproductive traits, lower socioeconomic status, and poorer general health. After conditioning on psychiatric disorders, the genetic correlations between SA and psychiatric disorders decreased, whereas those with nonpsychiatric traits remained largely unchanged.CONCLUSIONS: Our results identify a risk locus that contributes more strongly to SA than other phenotypes and suggest a shared underlying biology between SA and known risk factors that is not mediated by psychiatric disorders.
|
|
