161 results on '"Chen, Xiao-Diao"'
Search Results
2. SLIM: A transparent structurized self-learning interpolation method for super-resolution images
3. Edge detection using multi-scale closest neighbor operator and grid partition
4. Annotate less but perform better: weakly supervised shadow detection via label augmentation
5. Improving ellipse fitting via multi-scale smoothing and key-point searching
6. How to use extra training data for better edge detection?
7. Omni-supervised shadow detection with vision foundation model
8. Improved bounds of Mitrinović–Adamović-type inequalities by using two-parameter functions
9. Exploring better target for shadow detection
10. Light-weight shadow detection via GCN-based annotation strategy and knowledge distillation
11. Single image shadow detection via uncertainty analysis and GCN-based refinement strategy
12. New Approximation Formulas for Tighter Bounds of the Q-Function and its Applications
13. A Unet-like Low-cost Image Inpainting Method Built upon Efficient ViT
14. Boosting Deep Unsupervised Edge Detection via Segment Anything Model
15. Monotonous two-parameter functions for asymptoticly approximating the inequalities involving the inverse tangent functions
16. Tighter bounds for the inequalities of Sinc function based on reparameterization
17. New bounds of Sinc function by using a family of exponential functions
18. A constructive method for approximating trigonometric functions and their integrals
19. A competition flow method for computing medial axis transform
20. Domain knowledge based non-linear assembly sequence planning for furniture products
21. New inequalities for hyperbolic functions based on reparameterization
22. New bounds of Wilker- and Huygens-type inequalities for inverse trigonometric functions
23. A fast and robust method for computing real roots of nonlinear equations
24. New inequalities between the inverse hyperbolic tangent and the analogue for corresponding functions
25. An efficient method based on progressive interpolation for solving non-linear equations
26. Make Segment Anything Model Perfect on Shadow Detection
27. Coincidence condition of two Bézier curves of an arbitrary degree
28. Rational cubic clipping with linear complexity for computing roots of polynomials
29. A rational cubic clipping method for computing real roots of a polynomial
30. How Many Annotations Do We Need for Generalizing New-Coming Shadow Images?
31. Approximating trigonometric functions by using exponential inequalities
32. A planar quadratic clipping method for computing a root of a polynomial in an interval
33. A New Method for Sharpening the Bounds of Several Special Functions
34. A two-point-Padé-approximant-based method for bounding some trigonometric functions
35. Conditions for the coincidence of two quartic Bézier curves
36. Geometric point interpolation method in [formula omitted] space with tangent directional constraint
37. Multi-degree reduction of Bézier curves using reparameterization
38. Tighter bounds for the inequalities of Sinc function based on reparameterization
39. New bounds of Sinc function by using a family of exponential functions
40. Monotonous two-parameter functions for asymptoticly approximating the inequalities involving the inverse tangent functions
41. Computing the Hausdorff distance between two B-spline curves
42. Cubic B-spline curve approximation by curve unclamping
43. Computing the minimum distance between a point and a clamped B-spline surface
44. Computing the minimum distance between two Bézier curves
45. Computing the minimum distance between a point and a NURBS curve
46. Free-Form Deformation with Rational DMS-Spline Volumes
47. A family of Wilker's inequalities in two parameters and its applications
48. New inequalities for hyperbolic functions based on reparameterization
49. Computing minimum distance between two implicit algebraic surfaces
50. A robust algorithm for finding the real intersections of three quadric surfaces
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.