System and method for transform based subspace interpolation for unsupervised domain adaptation for machine inspection

US2025060284A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2025060284-A1
Application numberUS-202418785497-A
CountryUS
Kind codeA1
Filing dateJul 26, 2024
Priority dateAug 16, 2023
Publication dateFeb 20, 2025
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

This disclosure provides a system and method for transform based subspace interpolation for unsupervised domain adaptation for machine inspection. Embodiments of the present disclosure present a deep transform-based subspace interpolation method to cater to challenging unsupervised adaptation scenario for machine inspection of different but related machines. In the present disclosure, source and target domain data are modeled as low-dimensional subspace using deep transforms. The intermediate domains connecting the two domains are then learned to generate domain invariant features for cross-domain classification. The requisite formulation employing deep transform learning and the closed-form updates for the transforms and their corresponding coefficients are presented. The method of the present disclosure demonstrates potential in learning reliable data representations, particularly in limited data scenario and real-life industrial applications requiring adaptation between different machines.

First claim

Opening claim text (preview).

What is claimed is: 1 . A processor implemented method, comprising: obtaining, via one or more hardware processors, (i) a plurality of source domain data (X s ) comprising a first set of features (d) with a plurality of measurements (n s ), and (ii) a plurality of target domain data (X t ) comprising a second set of features (d) with a plurality of measurements (n t ) for a machine inspection; learning, via the one or more hardware processors, a deep source domain transform (T 0 ) associated with the plurality of source domain data using a N-layer deep transform learning (DTL) architecture, wherein a transform for each layer of N-layer deep source domain transform (T 0 ) is computed for learning the deep source domain transform (T 0 ); computing, via the one or more hardware processors, a plurality of coefficients (Z 0 ) on the plurality of source domain data (X s ) using the deep source domain transform (T 0 ); and learning, via one or more hardware processors, a set of intermediate deep transforms associated with a plurality of intermediate domains, wherein the set of intermediate deep transforms associated with the plurality of intermediate domains are learned by iteratively transforming the plurality of target domain data (X t ) along a direction that reduces a residue on the plurality of target domain data (X t ) till a deep target domain transform (T M ) is obtained that best represents the plurality of target domain data (X t ), and wherein step of iteratively transforming the plurality of target domain data (X t ) comprises: (i) computing, a plurality of coefficients (Z m ) corresponding to the plurality of target domain data (X t ) by transforming the plurality of target domain data (X t ) using a transform of current subspace; (ii) computing the residue on the plurality of target domain data (X t ) using a current transform and the plurality of coefficients (Z m ) corresponding to the plurality of target domain data (X t ); (iii) computing a change in transform of a current subspace to reduce the residue on the plurality of target domain data (X t ); and (iv) computing a transform of a subsequent subspace by adding the change in the transform to the transform of the current subspace. 2 . The processor implemented method of claim 1 , comprising: traversing the plurality of coefficients (Z 0 ) across the deep source domain transform (T 0 ), the set of intermediate deep transforms, and the deep target domain transform (T M ) to generate a first set of domain invariant features for the plurality of source domain data (X s ); training a classifier using the first set of domain invariant features for the plurality of source domain data (X s ) and a plurality of source labels (Y s ); computing a plurality of coefficients (Z M ) on the plurality of target domain data (X t ) using the deep target domain transform (T M ); traversing the plurality of coefficients (Z M ) across the deep source domain transform (T 0 ), the set of intermediate deep transforms, and the deep target domain transform (T M ) to generate a second set of domain invariant features for the plurality of target domain data (X t ); and estimating a plurality of target labels (Y t ) using the second set of domain invariant features for the plurality of target domain data (X t ) and the trained classifier. 3 . The processor implemented method of claim 1 , wherein each of the deep transform is indicative of number of subspace, and wherein the deep source domain transform (T 0 ) indicates a first subspace, an intermediate deep transform (T m ) from the set of intermediate deep transforms indicates m th subspace, and the deep target transform (T M ) indicates a target subspace. 4 . The processor implemented method of claim 1 , wherein the deep target domain transform (T M ) that best represents the plurality of target domain data (X t ) is obtained when the change in the transform of the current subspace is less than an empirically computed threshold. 5 . The processor implemented method of claim 1 , wherein iteratively transforming the plurality of target domain data (X t ) along the direction that reduces the residue on the plurality of target domain data (X t ) indicates that a domain shift is fully absorbed by the learnt set of intermediate deep transforms between a source domain (S) and a target domain (T). 6 . The processor implemented method of claim 1 , wherein a domain adaptation for machine inspection is performed between machines that are different but related to each other. 7 . A system, comprising: a memory storing instructions; one or more communication interfaces; and one or more hardware processors coupled to the memory via the one or more communication interfaces, wherein the one or more hardware processors are configured by the instructions to: obtain (i) a plurality of source domain data (X s ) comprising a first set of features (d) with a plurality of measurements (n s ), and (ii) a plurality of target domain data (X t ) comprising a second set of features (d) with a plurality of measurements (n t ) for a machine inspection; learn a deep source domain transform (T 0 ) associated with the plurality of source domain data using a N-layer deep transform learning (DTL) architecture, wherein a transform for each layer of N-layer deep source domain transform (T 0 ) is computed for learning the deep source domain transform (T 0 ); compute a plurality of coefficients (Z 0 ) on the plurality of source domain data (X s ) using the deep source domain transform (T 0 ); and learn a set of intermediate deep transforms associated with a plurality of intermediate domains, wherein the set of intermediate deep transforms associated with the plurality of intermediate domains are learned by iteratively transforming the plurality of target domain data (X t ) along a direction that reduces a residue on the plurality of target domain data (X t ) till a deep target domain transform (T M ) is obtained that best represents the plurality of target domain data (X t ), and wherein step of iteratively transforming the plurality of target domain data (X t ) comprises: (i) computing, a plurality of coefficients (Z m ) corresponding to the plurality of target domain data (X t ) by transforming the plurality of target domain data (X t ) using a transform of current subspace; (ii) computing the residue on the plurality of target domain data (X t ) using a current transform and the plurality of coefficients (Z m ) corresponding to the plurality of target domain data (X t ); (iii) computing a change in transform of a current subspace to reduce the residue on the plurality of target domain data (X t ); and (iv) computing a transform of a subsequent subspace by adding the change in the transform to the transform of the current subspace. 8 . The system of claim 7 , wherein the one or more hardware processors are further configured by the instructions to: traverse the plurality of coefficients (Z 0 ) across the deep source domain transform (T 0 ), the set of intermediate deep transforms, and the deep target domain transform (T M ) to generate a first set of domain invariant features for the plurality of source domain data (X s ); train a classifier using the first set of domain invariant features for the plurality of source domain data (X s ) and a plurality of source labels (Y s ); compute a plurality of coefficients (Z M ) on the plurality of target domain data (X t ) using the deep target domain transform (T M ); traverse the plurality of coefficients (Z M ) across the deep source domain transform (T 0 ), the set of intermediate deep transforms, and the deep target domain transform (T M ) to generate a second set of domain invariant features for the plurality of target doma

Assignees

Inventors

Classifications

  • Learning methods · CPC title

  • Transfer learning · CPC title

  • G01M99/005Primary

    Testing of complete machines, e.g. washing-machines or mobile phones (testing of machine parts G01M13/00; testing of electric apparatus or components G01R31/50) · CPC title

  • G06N3/045Primary

    Combinations of networks · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2025060284A1 cover?
This disclosure provides a system and method for transform based subspace interpolation for unsupervised domain adaptation for machine inspection. Embodiments of the present disclosure present a deep transform-based subspace interpolation method to cater to challenging unsupervised adaptation scenario for machine inspection of different but related machines. In the present disclosure, source an…
Who is the assignee on this patent?
Tata Consultancy Services Ltd
What technology area does this patent fall under?
Primary CPC classification G01M99/005. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Feb 20 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).