2017
DOI: 10.1007/978-3-319-68527-4_11
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Region Selection Algorithm for Auto-focusing Method Based on Depth from Focus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…By the simple structure of the dilated filters, they are also a good choice when the runtime matters. The other classical filter extensions from [33,[35][36][37]40] require a larger number of operations in order to return the resulting edge pixels, whereas the custom dilated filters always have the same number of operations for any extension. It seems that the gaps imply a speed up.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…By the simple structure of the dilated filters, they are also a good choice when the runtime matters. The other classical filter extensions from [33,[35][36][37]40] require a larger number of operations in order to return the resulting edge pixels, whereas the custom dilated filters always have the same number of operations for any extension. It seems that the gaps imply a speed up.…”
Section: Discussionmentioning
confidence: 99%
“…First-order derivative orthogonal gradient operators are the most basic operators and have been extensively researched over the decades. We consider in our analysis the following edge-detected operators and their extensions: pixel difference operator [32], separated pixel difference operator [32], Sobel operator and the extension to a 5 × 5 or 7 × 7 kernel [33][34][35][36][37], Prewitt operator and the extension to a 5 × 5 or 7 × 7 kernel [34,36], Kirsch operator [38] and the 5 × 5 kernel expansion [33], Kitchen and Malin operator [39], Kayalli operator, Scharr operator and the extensions to 5 × 5 kernel [36,40], Kroon operator [41] and Orhei operator [42].…”
Section: First-order Derivative Orthogonal Gradient Operatorsmentioning
confidence: 99%
“…where j d the position information of the j-th detection frame is, i y is the position prediction information of the i-th tracker by Kalman filter, and i S is the covariance matrix between the detection and tracking positions. When the calculated Mahalanobis distance is less than the set threshold, the association is considered successful, as shown in Equation (14), where χ is the indicator function and (1) t is the specified threshold.…”
Section: Objects Tracking Methodsmentioning
confidence: 99%
“…There are many traditional detection methods proposed by researchers. These algorithms have three common processes, including region selection [1], feature extraction [2] and classification [3]. Region selection generally uses a sliding window method to traverse the image globally.…”
Section: Introductionmentioning
confidence: 99%
“…ere are many traditional object detection models proposed by researchers. Traditional object detection models mainly rely on region selection [6], feature extraction [7], and classifier classification [8]. In 2006, Dalal and Triggs proposed the HOG algorithm [9], which composes features by calculating and counting the histogram of the local area's gradient direction.…”
Section: Introductionmentioning
confidence: 99%