{"id":"W4407268455","doi":"10.1109/lsp.2025.3539908","title":"Deep Unrolled Graph Laplacian Regularization for Robust Time-of-Flight Depth Denoising","year":2025,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Optical Sensing Technologies","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Shanghai Rising-Star Program; National Natural Science Foundation of China","keywords":"Regularization (linguistics); Noise reduction; Laplacian matrix; Laplace operator; Artificial intelligence; Computer science; Image denoising; Graph; Algorithm; Mathematics; Theoretical computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004918179,0.0007431064,0.0004518944,0.0003649096,0.000219599,0.0004057144,0.0009275984,0.000911478,0.0008888977],"category_scores_gemma":[0.00161158,0.0003349926,0.0004744303,0.0003721309,0.0005938431,0.0009538997,0.0008534518,0.001215974,0.0002576652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000663328,"about_ca_system_score_gemma":0.0007693656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005542409,"about_ca_topic_score_gemma":0.008024499,"domain_scores_codex":[0.9997879,0.00004069404,0.000007824702,0.00006056909,0.00007463637,0.00002845576],"domain_scores_gemma":[0.9997246,0.0001140666,0.00003908516,0.0000373589,0.00006268363,0.000022171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001207585,0.00009171182,0.0007869836,0.00009142015,0.00006057412,0.000108304,0.0001047625,0.7744469,0.05177565,0.01406923,0.00314015,0.1552035],"study_design_scores_gemma":[0.000002508046,0.000009260502,0.00006079997,0.000001596052,0.000002444768,0.00001063076,0.00000339128,0.9953341,0.002401157,0.001921367,0.0002493671,0.000003378935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01546867,0.00009608639,0.9831851,0.000134211,0.00001564605,0.00001182529,0.00004068588,0.0004182973,0.0006294079],"genre_scores_gemma":[0.5818341,0.0003568024,0.4115314,0.0003131567,0.00005495025,0.00008606826,0.0004177954,0.0002734255,0.005132166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005542409,"threshold_uncertainty_score":0.0110203,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009894748165495307,"score_gpt":0.2405463081626221,"score_spread":0.2306515599971268,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}