default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunan Zhu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j13]Junan Zhu
, Zhizhe Tang, Ping Ma, Zheng Liang, Chuanjian Wang:
AutoPromptSeg: Automated Decoupling of Uncertainty Prompts with SAM for semi-supervised medical image segmentation. Comput. Medical Imaging Graph. 128: 102708 (2026)- [j12]Junan Zhu, Zhizhe Tang, Zheng Liang, Ping Ma, Chuanjian Wang:
KANSeg: An efficient medical image segmentation model based on Kolmogorov-Arnold networks for multi-organ segmentation. Digit. Signal Process. 168: 105472 (2026) - [j11]Tongxue Zhou, Mingyang Li, Su Ruan, Tingjin Luo, Bingbing Jiang, Junan Zhu, Ping Ma, Defu Yang, Guang Yang:
A reliable framework for brain tumor segmentation via multi-modal fusion and uncertainty modeling. Inf. Fusion 129: 104085 (2026) - 2025
- [j10]Junan Zhu, Zhizhe Tang, Ping Ma, Zheng Liang, Chuanjian Wang:
DLKUNet: A Lightweight and Efficient Network With Depthwise Large Kernel for Medical Image Segmentation. Int. J. Imaging Syst. Technol. 35(1) (2025) - 2024
- [j9]Ning An, Linsheng Huang, Mengnan Hu, Junan Zhu, Chuanjian Wang:
Improved basic elements detection algorithm for bridge engineering design drawings based on YOLOv5. Artif. Intell. Eng. Des. Anal. Manuf. 38 (2024) - [j8]Junan Zhu, Hongxin Zhu, Zhaohong Jia, Ping Ma:
DiffSwinTr: A diffusion model using 3D Swin Transformer for brain tumor segmentation. Int. J. Imaging Syst. Technol. 34(3) (2024) - 2023
- [j7]Zhaohong Jia, Hongxin Zhu, Junan Zhu, Ping Ma:
Two-Branch network for brain tumor segmentation using attention mechanism and super-resolution reconstruction. Comput. Biol. Medicine 157: 106751 (2023) - 2020
- [i12]Junan Zhu, Kristina Rivera, Dror Baron:
Noisy Pooled PCR for Virus Testing. CoRR abs/2004.02689 (2020)
2010 – 2019
- 2019
- [j6]Junan Zhu, Tao Chen, Jingtai Cao:
Siamese Network Using Adaptive Background Superposition Initialization for Real-Time Object Tracking. IEEE Access 7: 119454-119464 (2019) - [j5]Ping Ma, Yue Bai, Junan Zhu, Chunjun Wang, Cheng Peng:
DSOD: DSO in Dynamic Environments. IEEE Access 7: 178300-178309 (2019) - 2018
- [j4]Junan Zhu, Dror Baron:
Performance Limits With Additive Error Metrics in Noisy Multimeasurement Vector Problems. IEEE Trans. Signal Process. 66(20): 5338-5348 (2018) - [i11]Junan Zhu, Dror Baron:
Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem. CoRR abs/1801.00552 (2018) - 2017
- [j3]Junan Zhu, Dror Baron, Florent Krzakala:
Performance Limits for Noisy Multimeasurement Vector Problems. IEEE Trans. Signal Process. 65(9): 2444-2454 (2017) - [c6]Ryan Pilgrim, Junan Zhu, Dror Baron, Waheed U. Bajwa:
Generalized geometric programming for rate allocation in consensus. Allerton 2017: 374-381 - [c5]Junan Zhu, Ryan Pilgrim, Dror Baron:
An overview of multi-processor approximate message passing. CISS 2017: 1-6 - [i10]Junan Zhu, Ryan Pilgrim, Dror Baron:
An Overview of Multi-Processor Approximate Message Passing. CoRR abs/1702.03049 (2017) - [i9]Junan Zhu:
Statistical Physics and Information Theory Perspectives on Linear Inverse Problems. CoRR abs/1705.05070 (2017) - [i8]Ryan Pilgrim, Junan Zhu, Dror Baron, Waheed U. Bajwa:
Generalized Geometric Programming for Rate Allocation in Consensus. CoRR abs/1710.09041 (2017) - 2016
- [j2]Yanting Ma, Junan Zhu, Dror Baron:
Approximate Message Passing Algorithm With Universal Denoising and Gaussian Mixture Learning. IEEE Trans. Signal Process. 64(21): 5611-5622 (2016) - [c4]Puxiao Han, Junan Zhu, Ruixin Niu, Dror Baron:
Multi-processor approximate message passing using lossy compression. ICASSP 2016: 6240-6244 - [c3]Junan Zhu, Ahmad Beirami, Dror Baron:
Performance trade-offs in multi-processor approximate message passing. ISIT 2016: 680-684 - [i7]Junan Zhu, Dror Baron:
Multi-Processor Approximate Message Passing with Lossy Compression. CoRR abs/1601.03790 (2016) - [i6]Puxiao Han, Junan Zhu, Ruixin Niu, Dror Baron:
Multi-Processor Approximate Message Passing Using Lossy Compression. CoRR abs/1601.04595 (2016) - [i5]Junan Zhu, Dror Baron, Florent Krzakala:
Performance Limits for Noisy Multi-Measurement Vector Problems. CoRR abs/1604.02475 (2016) - [i4]Junan Zhu, Ahmad Beirami, Dror Baron:
Performance Trade-Offs in Multi-Processor Approximate Message Passing. CoRR abs/1604.02752 (2016) - 2015
- [j1]Junan Zhu, Dror Baron, Marco F. Duarte:
Recovery From Linear Measurements With Complexity-Matching Universal Signal Estimation. IEEE Trans. Signal Process. 63(6): 1512-1527 (2015) - [i3]Yanting Ma, Junan Zhu, Dror Baron:
Approximate Message Passing with Universal Denoising. CoRR abs/1506.02693 (2015) - 2014
- [c2]Junan Zhu, Dror Baron, Marco F. Duarte:
Complexity-adaptive universal signal estimation for compressed sensing. SSP 2014: 388-391 - [i2]Yanting Ma, Junan Zhu, Dror Baron:
Compressed Sensing via Universal Denoising and Approximate Message Passing. CoRR abs/1407.1944 (2014) - 2013
- [c1]Junan Zhu, Dror Baron:
Performance regions in compressed sensing from noisy measurements. CISS 2013: 1-6 - [i1]Junan Zhu, Dror Baron:
Performance Regions in Compressed Sensing from Noisy Measurements. CoRR abs/1302.4405 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-26 23:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
