IP Library Granted Patent US 12,385,733
Granted Patent B2
US 12,385,733 · App. 18/083,945 · Granted Aug 12, 2025

Synchronizing an optical coherence tomography system

Inventors: Gerald McMorrow (Redmond, WA); Jongtae Yuk (Redmond, WA)
Assignee: SOHAM INC.
G01B9/02091A61B1/0005A61B1/0017A61B3/102A61B5/0066A61B2090/3735G01B9/02069G01B2290/65
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,385,733
App. No.
18/083,945
Granted
Aug 12, 2025
Kind
B2
Abstract

Methods for synchronizing an Optical Coherence Tomography (OCT) system including detection when a plurality of A-line scans obtained from reflected light of a cantilever scanning fiber within a probe oscillating along a scanning path that increases in amplitude over time are no longer being obtained at a point along the oscillating scanning path when the scanning fiber reaches a minimum speed, determining a value by which a phase angle of the oscillating scanning path is out of synchronization with the plurality of A-line scans, and adjusting a trigger clock for the obtaining the plurality of A-line scans based on the value.

Claims (47)

1. A method for synchronizing an Optical Coherence Tomography (OCT) system, comprising:

detecting when a plurality of A-line scans obtained from reflected light of a cantilever scanning fiber within a probe oscillating along a scanning path that increases in amplitude over time are no longer being obtained at a point along the oscillating scanning path when the scanning fiber reaches a minimum speed;

determining a value by which a phase angle of the oscillating scanning path is out of synchronization with the plurality of A-line scans; and

adjusting a trigger clock for the obtaining the plurality of A-line scans based on the value.

2. The method of claim 1 , wherein the detecting includes:

obtaining a series of samples of at least one A-line scan among the plurality of A-lines scans just before, during and after the scanning fiber reaches the minimum speed;

generating a Line-to-Line (L-L) correlation between at least one sample among the series of samples and nearest neighbor samples to the at least one sample among the series of samples; and

generating a Neighbor-to-Neighbor (N-N) correlation between the at least one sample and two nearest neighbor samples; and

wherein determining includes adjusting the value to minimize the L-L correlation and to maximize the N-N correlation.

3. The method of claim 2 , wherein the detecting includes:

inputting the plurality of A-line scans to an L-L processor and to an N-N processor operating in parallel with the L-L processor in order to generate the L-L correlation and the N-N correlation; and

wherein the determining includes outputting the L-L correlation and the N-N correlation to a trained Artificial Intelligence (AI) engine to adjust the value in real-time.

4. The method of claim 2 , wherein the plurality of A-line scans are obtained from reflected light from a flat surface, wherein detecting includes determining if a B-line scan image constructed from the plurality of A-line scans is a straight line or a non-straight line, and wherein when the image is a non-straight line the determining includes further or alternatively adjusting the value until the non-straight line becomes the straight line.

5. The method of claim 4 , wherein the detecting includes:

inputting the plurality of A-line scans to an L-L processor and to an N-N processor operating in parallel with the L-L processor in order to generate the L-L correlation and the N-N correlation;

constructing B-line scan images from a series of the plurality of A-line scans; and

outputting the B-line scan images to a processor operating in parallel with the L-L processor and the N-N processor for analyzing whether each image among the B-line scan images is the straight line or the non-straight line; and

wherein the determining includes outputting the L-L correlation, the N-N correlation, and a straight/non-straight line determination to a trained Artificial Intelligence (AI) engine to determine how to adjust the value in real-time.

6. The method of claim 1 , wherein the plurality of A-line scans are obtained from reflected light from a flat surface, wherein detecting includes determining if a B-line scan image constructed from the plurality of A-line scans is a straight line or a non-straight line, and wherein when the image is a non-straight line the determining includes adjusting the value until the non-straight line becomes the straight line.

7. The method of claim 6 , wherein the detecting includes:

constructing B-line scan images from a series of the plurality of A-line scans; and

outputting the B-line scan images to a processor for analyzing whether each image among the B-line scan images is the straight line or the non-straight line; and

wherein the determining includes outputting a straight/non-straight line determination to a trained Artificial Intelligence (AI) engine to adjust the value in real-time.

8. The method of claim 1 , wherein the plurality of A-line scans are obtained from reflected light from a surface that is not a flat surface, wherein detecting includes determining if B-line scan images constructed from the plurality of A-line scans are in focus or out of focus, and wherein when the B-line scan images are out of focus the determining includes adjusting the value until one of the B-line scan images becomes in focus.

9. The method of claim 8 , wherein the determining includes:

generating Fast Fourier Transforms (FFTs) of a series of B-line scan images when the plurality of A-line scans are at various phase angles around an optimum phase angle; and

analyzing the FFTs to determine if the B-line scan images are in focus or out of focus; and

wherein the determining includes outputting an in focus/out of focus determination to a trained Artificial Intelligence (AI) engine to adjust the value in real-time.

10. The method of claim 8 , wherein the detecting includes:

obtaining a series of samples of at least one A-line scan among the plurality of A-lines scans just before, during and after the scanning fiber reaches the minimum speed;

generating a Line-to-Line (L-L) correlation between at least one sample among the series of samples and nearest neighbor samples to the at least one sample among the series of samples; and

generating a Neighbor-to-Neighbor (N-N) correlation between the at least one sample and two nearest neighbor samples;

and wherein the determining includes further or alternatively adjusting the value to minimize the L-L correlation and to maximize the N-N correlation.

11. The method of claim 10 , wherein the plurality of A-line scans are obtained from reflected light from a flat surface, wherein detecting includes determining if a B-line scan image constructed from the plurality of A-line scans is a straight line or a non-straight line, and wherein when the image is a non-straight line the determining includes further or alternatively adjusting the value until the non-straight line becomes the straight line.

12. The method of claim 11 , wherein the detecting includes:

generating Fast Fourier Transforms (FFTs) of a series of B-line scan images when the plurality of A-line scans are at various phase angles around an optimum phase angle;

analyzing with a lateral FFT processor the FFTs to determine if the B-line scan images are in focus or out of focus;

inputting the plurality of A-line scans to an L-L processor and to an N-N processor operating in parallel with the L-L processor in order to generate the L-L correlation and the N-N correlation;

constructing B-line scan images from a series of the plurality of A-line scans; and

outputting the B-line scan images to a processor operating in parallel with the L-L processor, the N-N processor and the lateral FFT processor for analyzing whether each image among the B-line scan images is the straight line or the non-straight line; and

wherein the determining includes outputting the L-L correlation, the N-N correlation, a straight/non-straight line determination and an in focus/out of focus determination to a trained Artificial Intelligence (AI) engine to determine how to adjust the value in real-time.

13. The method of claim 8 , wherein the plurality of A-line scans are obtained from reflected light from a flat surface, wherein detecting includes determining if a B-line scan image constructed from the plurality of A-line scans is a straight line or a non-straight line, and wherein when the image is a non-straight line the determining includes further or alternatively adjusting the value until the non-straight line becomes the straight line.

14. The method of claim 11 , wherein the detecting includes:

generating Fast Fourier Transforms (FFTs) of a series of B-line scan images when the plurality of A-line scans are at various phase angles around an optimum phase angle;

analyzing with a lateral FFT processor the FFTs to determine if the B-line scan images are in focus or out of focus; and

outputting the B-line scan images to a processor operating in parallel with the lateral FFT processor for analyzing whether each image among the B-line scan images is the straight line or the non-straight line; and

wherein the determining includes outputting an in focus/out of focus determination and a straight/non-straight line determination to a trained Artificial Intelligence (AI) engine to determine how to adjust the value in real-time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 7, 2023
From: MCMORROW, GERALD; YUK, JONGTAE
To: VERAVANTI INC.
Reel/Frame 062911/0496 →
Continuity (3)
Continuation In Part 17236901 · Apr 21, 2021
Division 16777807 · Jan 30, 2020
Related Publication 20230184536A1 · Jun 15, 2023
References Cited (126)
US 6294775B1 · Seibel et al. · 2001 [cited by applicant]
US 6563105B2 · Seibel · 2003 [cited by examiner]
US 6845190B1 · Smithwick et al. · 2005 [cited by applicant]
US 6856712B2 · Fauver et al. · 2005 [cited by applicant]
US 6959130B2 · Fauver et al. · 2005 [cited by applicant]
US 6975898B2 · Seibel · 2005 [cited by applicant]
US 7068878B2 · Crossman-Bosworth et al. · 2006 [cited by applicant]
US 7159782B2 · Johnston et al. · 2007 [cited by applicant]
US 7189961B2 · Johnston et al. · 2007 [cited by applicant]
US 7252236B2 · Johnston et al. · 2007 [cited by applicant]
US 7298938B2 · Johnston · 2007 [cited by applicant]
US 7312879B2 · Johnston · 2007 [cited by applicant]
US 7349098B2 · Li · 2008 [cited by applicant]
US 7391013B2 · Johnston et al. · 2008 [cited by applicant]
US 7395967B2 · Melville · 2008 [cited by applicant]
US 7447415B2 · Melville et al. · 2008 [cited by applicant]
US 7522813B1 · Johnston et al. · 2009 [cited by applicant]
US 7583872B2 · Seibel et al. · 2009 [cited by applicant]
US 7608842B2 · Johnston · 2009 [cited by applicant]
US 7616986B2 · Seibel et al. · 2009 [cited by applicant]
US 7680373B2 · Melville et al. · 2010 [cited by applicant]
US 7738762B2 · Melville et al. · 2010 [cited by applicant]
US 7784697B2 · Johnston et al. · 2010 [cited by applicant]
US 7791009B2 · Johnston et al. · 2010 [cited by applicant]
US 7813538B2 · Carroll et al. · 2010 [cited by applicant]
US 7901348B2 · Soper et al. · 2011 [cited by applicant]
US 8212884B2 · Seibel et al. · 2012 [cited by applicant]
US 8305432B2 · Johnston · 2012 [cited by applicant]
US 8382662B2 · Soper et al. · 2013 [cited by applicant]
US 8411922B2 · Lee et al. · 2013 [cited by applicant]
US 8437587B2 · Melville · 2013 [cited by applicant]
US 8466956B2 · Sugimoto · 2013 [cited by applicant]
US 8537203B2 · Seibel et al. · 2013 [cited by applicant]
US 8840566B2 · Seibel et al. · 2014 [cited by applicant]
US 8929688B2 · Johnston · 2015 [cited by applicant]
US 8947514B2 · Shibasaki · 2015 [cited by examiner]
US 8957484B2 · Melville et al. · 2015 [cited by applicant]
US 9066651B2 · Johnston · 2015 [cited by applicant]
US 9160945B2 · Johnston · 2015 [cited by applicant]
US 9226687B2 · Soper et al. · 2016 [cited by applicant]
US 9554729B2 · Soper et al. · 2017 [cited by applicant]
US 9561078B2 · Seibel et al. · 2017 [cited by applicant]
US 10080484B2 · Yang et al. · 2018 [cited by applicant]
US 20010055462A1 · Seibel · 2001 [cited by applicant]
US 20020064341A1 · Fauver · 2002 [cited by examiner]
US 20020139920A1 · Seibel et al. · 2002 [cited by applicant]
US 20050196324A1 · Harris · 2005 [cited by examiner]
US 20060170930A1 · Li · 2006 [cited by applicant]
US 20080058629A1 · Seibel et al. · 2008 [cited by applicant]
US 20080144998A1 · Melville et al. · 2008 [cited by applicant]
US 20080161648A1 · Karasawa · 2008 [cited by applicant]
US 20080165360A1 · Johnston · 2008 [cited by applicant]
US 20090028407A1 · Seibel · 2009 [cited by examiner]
US 20090137893A1 · Seibel et al. · 2009 [cited by applicant]
US 20130271757A1 · Kang et al. · 2013 [cited by applicant]
US 20150159991A1 · Hasegawa · 2015 [cited by examiner]
US 20180196250A1 · Shimamoto · 2018 [cited by applicant]
US 20180256031A1 · Adamson · 2018 [cited by examiner]
US 20180315194A1 · Moult et al. · 2018 [cited by applicant]
US 20190223714A1 · Raymond et al. · 2019 [cited by applicant]
US 20200273216A1 · Kennedy et al. · 2020 [cited by applicant]
US 20210055543A1 · Van Lierop et al. · 2021 [cited by applicant]
US 20210239451A1 · McMorrow et al. · 2021 [cited by applicant]
US 20230128254A1 · Hsu · 2023 [cited by examiner]
AU 2002331723B2 · 2007 [cited by applicant]
CN 1310615C · 2007 [cited by applicant]
EP 1803008A1 · 2007 [cited by applicant]
EP 1805779A1 · 2007 [cited by applicant]
EP 1851673A1 · 2007 [cited by applicant]
EP 1954193A1 · 2008 [cited by applicant]
EP 2061367A1 · 2009 [cited by applicant]
EP 2096688A2 · 2009 [cited by applicant]
EP 2224841A1 · 2010 [cited by applicant]
EP 2225699A1 · 2010 [cited by applicant]
EP 1592992B1 · 2012 [cited by applicant]
EP 1691666B1 · 2012 [cited by applicant]
EP 2653995A1 · 2013 [cited by applicant]
EP 2179454B1 · 2016 [cited by applicant]
EP 2099353B1 · 2018 [cited by applicant]
EP 2092388B1 · 2018 [cited by applicant]
EP 3415075A1 · 2018 [cited by applicant]
EP 3552534A2 · 2019 [cited by applicant]
JP 4080426B2 · 2008 [cited by applicant]
JP 2009212519A · 2009 [cited by applicant]
JP 2011504782A · 2011 [cited by applicant]
JP 2011504783A · 2011 [cited by applicant]
JP 4672023B2 · 2011 [cited by applicant]
JP 502587782 · 2012 [cited by applicant]
JP 5069105B2 · 2012 [cited by applicant]
JP 5069310B2 · 2012 [cited by applicant]
JP 5097270B2 · 2012 [cited by applicant]
JP 519026782 · 2013 [cited by applicant]
JP 5513897B2 · 2014 [cited by applicant]
JP 5608718B2 · 2014 [cited by applicant]
JP 5781269B2 · 2015 [cited by applicant]
WO WO2001097902A2 · 2001 [cited by applicant]
WO WO2003019661A1 · 2003 [cited by applicant]
WO WO2004068218A2 · 2004 [cited by applicant]
WO WO2005058137A2 · 2005 [cited by applicant]
WO WO2006004743A2 · 2006 [cited by applicant]
WO WO2006041452A1 · 2006 [cited by applicant]
WO WO2006041459A1 · 2006 [cited by applicant]
WO WO2006071216A1 · 2006 [cited by applicant]
WO WO2006096155A1 · 2006 [cited by applicant]
WO WO2007067163A1 · 2007 [cited by applicant]
WO WO2007106075A2 · 2007 [cited by applicant]
WO WO2008033168A1 · 2008 [cited by applicant]
WO WO2008076149A1 · 2008 [cited by applicant]
WO WO2008085186A1 · 2008 [cited by applicant]
WO WO2009014525A1 · 2009 [cited by applicant]
WO WO2009070160A1 · 2009 [cited by applicant]
WO WO2009070161A1 · 2009 [cited by applicant]
WO WO2019071295A1 · 2019 [cited by applicant]
U.S. Appl. No. 11/833,831, filed Aug. 3, 2007, Johnston et al. [cited by applicant]
U.S. Appl. No. 60/138,404, filed Jun. 8, 1999, Seibel. [cited by applicant]
U.S. Appl. No. 60/212,411, filed Jun. 19, 2000, Seibel. [cited by applicant]
U.S. Appl. No. 60/253,445, filed Nov. 27, 2000, Seibel et al. [cited by applicant]
U.S. Appl. No. 60/333,421, filed Nov. 26, 2001, Seibel et al. [cited by applicant]
U.S. Appl. No. 60/442,852, filed Jan. 24, 2003, Seibel et al. [cited by applicant]
U.S. Appl. No. 60/529,077, filed Dec. 12, 2003, Seibel et al. [cited by applicant]
U.S. Appl. No. 60/644,335, filed Jan. 14, 2005, Li. [cited by applicant]
U.S. Appl. No. 60/912,237, filed Apr. 17, 2007, Carroll et al. [cited by applicant]
U.S. Appl. No. 61/589,069, filed Jan. 20, 2012, N/A. [cited by applicant]
U.S. Appl. No. 61/934,479, filed Jan. 31, 2014, Yang et al. [cited by applicant]
International Patent Application No. PCT/2021/14972; Invitation to Pay Add'l Fees; dated Mar. 9, 2021; 2 pages. [cited by applicant]
International Patent Application No. PCT/US2023/084141; Int'l Search Report and the Written Opinion; dated May 1, 2024; 7 pages. [cited by applicant]