2020
DOI: 10.3390/s20226630
|View full text |Cite
|
Sign up to set email alerts
|

Illumination-Invariant Feature Point Detection Based on Neighborhood Information

Abstract: Feature point detection is the basis of computer vision, and the detection methods with geometric invariance and illumination invariance are the key and difficult problem in the field of feature detection. This paper proposes an illumination-invariant feature point detection method based on neighborhood information. The method can be summarized into two steps. Firstly, the feature points are divided into eight types according to the number of connected neighbors. Secondly, each type of feature points is classi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 40 publications
(55 reference statements)
0
2
0
Order By: Relevance
“…To solve these problems, a new prediction method based on DL using a key-point detection algorithm is proposed in our study. The key-point detection algorithm was considered the most suitable model because of the ability of the algorithm to find a specific point where the WBL passes through the tibia plateau [ 22 , 23 ]. Key-point detection algorithms are often used for pose estimation, face detection, and object detection [ 17 , 23 ].…”
Section: Discussionmentioning
confidence: 99%
“…To solve these problems, a new prediction method based on DL using a key-point detection algorithm is proposed in our study. The key-point detection algorithm was considered the most suitable model because of the ability of the algorithm to find a specific point where the WBL passes through the tibia plateau [ 22 , 23 ]. Key-point detection algorithms are often used for pose estimation, face detection, and object detection [ 17 , 23 ].…”
Section: Discussionmentioning
confidence: 99%
“…After that, RFA fuses the features of multiple branches and uses 1 × 1 convolution to adjust the channel size. Finally, the receptive field enhancement module also simulates the residual structure using a shortcut connection method, weights the input and summarizes the features of multiple branches to obtain the result [ 22 ]. To accommodate various situations, this section proposes two similar structures RFA and RFA+.…”
Section: Methodsmentioning
confidence: 99%