Declarative Validation Specification for DICOM Objects
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current validation methods for DICOM objects, such as those using XML Schema, XSLT, and XPath, are complex, require high expertise, and are not directly expressive of DICOM constraints, leading to inefficiencies and portability issues when validating binary objects within relational database systems.
Innovation Solution
A declarative validation specification is used to validate digital objects with identifiable subobjects, employing a constraint language that allows direct expression of DICOM constraints, optimization of validation processes, and technology neutrality, enabling faster and more straightforward validation of DICOM objects within a database system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If XML Schema, XSLT, and XPath are used to validate DICOM objects, then validation can be performed, but the complexity of the validation process increases and requires high expertise
Solution Approach 1:
The patent introduces an intermediary component that translates complex XML Schema, XSLT, and XPath validation rules into a simplified constraint language. This intermediary layer handles the complexity of XML-based validation while presenting a simpler interface to users, thereby maintaining validation reliability while reducing perceived complexity.
Solution Approach 2:
The patent changes the parameter of validation expression from complex XML-based syntax to a simpler constraint language. By transforming the validation rules into a more accessible format, the system maintains the rigorous validation capability while reducing the expertise required to understand and implement validation logic.
2Reliability
If XML-based validation methods are used for binary objects, then validation can be performed, but computational overhead increases and speed decreases
Solution Approach 1:
The patent extracts the essential validation logic from the computationally heavy XML processing framework and implements it directly in the constraint language. By separating the core validation requirements from the XML overhead, the system achieves both reliability and improved validation speed for binary objects.
Solution Approach 2:
The patent substitutes the mechanical XML parsing and processing system with a more efficient constraint language interpreter. This replacement eliminates the computational overhead associated with XML Schema, XSLT, and XPath while maintaining validation capability, thereby improving productivity.
3Reliability
If XML Schema and XSLT are used to express DICOM constraints, then validation can be performed, but the expression of constraints becomes indirect and complex
Solution Approach 1:
Instead of forcing DICOM constraints to fit the XML Schema and XSLT frameworks, the patent inverts the approach by allowing constraints to be expressed directly in a native constraint language. This inversion enables more direct and intuitive expression of DICOM-specific constraints while maintaining validation reliability.
Solution Approach 2:
The patent changes the expression parameter from indirect XML-based syntax to direct constraint language syntax. This transformation makes constraint expression more intuitive and easier to understand while preserving the rigorous validation capability needed for DICOM objects.
4Reliability
If XML-based validation is used in relational database systems, then validation can be performed, but portability issues arise
Solution Approach 1:
The patent creates a universal constraint language that can be implemented across different relational database systems without dependency on specific XML processing capabilities. This universal approach enables the same validation logic to be ported across different database platforms while maintaining validation reliability.
Data Source
AI summary
Techniques for validating complex digital objects such as DICOM objects. The techniques employ a declarative validation document which employs a declarative constraint language to specify the constraints to which the complex digital object is subject. A validator performs an evaluation of the constraint document with regard to the complex digital object. The complex digital object is valid if all of the constraints in the validation document are satisfied. The constraint document may be compiled by an optimizing compiler and the validator may apply the resulting compiled constraint specification to an in-memory representation of the digital object which has been optimized for fast reference. An example is given of the use of the techniques with DICOM objects.


