c compiler code Search Results


96
MathWorks Inc 3 d pair
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
3 D Pair, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 96/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/3 d pair/product/MathWorks Inc
Average 96 stars, based on 1 article reviews
3 d pair - by Bioz Stars, 2026-05
96/100 stars
  Buy from Supplier

95
MathWorks Inc matlab coder
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Matlab Coder, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 95/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/matlab coder/product/MathWorks Inc
Average 95 stars, based on 1 article reviews
matlab coder - by Bioz Stars, 2026-05
95/100 stars
  Buy from Supplier

90
Free Software Foundation gnu c compiler version 4.5.0
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Gnu C Compiler Version 4.5.0, supplied by Free Software Foundation, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/gnu c compiler version 4.5.0/product/Free Software Foundation
Average 90 stars, based on 1 article reviews
gnu c compiler version 4.5.0 - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

90
Atmel Corporation atmel studio7
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Atmel Studio7, supplied by Atmel Corporation, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/atmel studio7/product/Atmel Corporation
Average 90 stars, based on 1 article reviews
atmel studio7 - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

90
Symantec Corporation c++ compiler
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
C++ Compiler, supplied by Symantec Corporation, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/c++ compiler/product/Symantec Corporation
Average 90 stars, based on 1 article reviews
c++ compiler - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

90
OpenSim Ltd adol-c
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Adol C, supplied by OpenSim Ltd, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/adol-c/product/OpenSim Ltd
Average 90 stars, based on 1 article reviews
adol-c - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

90
apple inc xcode application
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Xcode Application, supplied by apple inc, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/xcode application/product/apple inc
Average 90 stars, based on 1 article reviews
xcode application - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

94
MathWorks Inc embedded coder
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Embedded Coder, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 94/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/embedded coder/product/MathWorks Inc
Average 94 stars, based on 1 article reviews
embedded coder - by Bioz Stars, 2026-05
94/100 stars
  Buy from Supplier

90
Symantec Corporation think c 5.0 compiler
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Think C 5.0 Compiler, supplied by Symantec Corporation, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/think c 5.0 compiler/product/Symantec Corporation
Average 90 stars, based on 1 article reviews
think c 5.0 compiler - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

96
MathWorks Inc c code via367 matlab simulink real time workshop
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
C Code Via367 Matlab Simulink Real Time Workshop, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 96/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/c code via367 matlab simulink real time workshop/product/MathWorks Inc
Average 96 stars, based on 1 article reviews
c code via367 matlab simulink real time workshop - by Bioz Stars, 2026-05
96/100 stars
  Buy from Supplier

90
MathWorks Inc mex files
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Mex Files, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 90/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/mex files/product/MathWorks Inc
Average 90 stars, based on 1 article reviews
mex files - by Bioz Stars, 2026-05
90/100 stars
  Buy from Supplier

94
MathWorks Inc simulink c coder
Example of sparse image representation using SLIC: (a) coronal view <t>of</t> <t>3-D</t> CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.
Simulink C Coder, supplied by MathWorks Inc, used in various techniques. Bioz Stars score: 94/100, based on 1 PubMed citations. ZERO BIAS - scores, article reviews, protocol conditions and more
https://www.bioz.com/result/simulink c coder/product/MathWorks Inc
Average 94 stars, based on 1 article reviews
simulink c coder - by Bioz Stars, 2026-05
94/100 stars
  Buy from Supplier

Image Search Results


Example of sparse image representation using SLIC: (a) coronal view of 3-D CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.

Journal: Journal of Medical Imaging

Article Title: GIFTed Demons: deformable image registration with local structure-preserving regularization using supervoxels for liver applications

doi: 10.1117/1.JMI.5.2.024001

Figure Lengend Snippet: Example of sparse image representation using SLIC: (a) coronal view of 3-D CT lung and liver volume, (b) projection through 3-D supervoxel representation with supervoxel boundaries and (c) with assignment of mean intensity. The SLIC algorithm with different values of the parameter K = 11,000 (top) and K = 5500 (bottom) shows that clustering is consistent in image regions with sufficient structural information (close to edges, e.g., the sliding surfaces of lungs), while different clusters are generated in homogeneous image regions.

Article Snippet: The computation time per registration using the presented framework is ≈ 3 min per 3-D pair (on a standard CPU, running nonoptimized C++ code, MATLAB™ mex compiler) and is several times faster than our previous bilateral filtering procedure ( ≈ 60 min ) or the locally adaptive anisotropic regularization (several hours).

Techniques: Generated

Main anatomical views of 3-D CT registration results for case #P0 of the liver dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded (red-cyan) intensity differences between volume pair before registration (left), after registration using Demons with isotropic Gaussian kernel, iso-dem, (middle), and guided image filtering with random SLIC clustering, rdn-gif, (right). Registration using our method (right) improves registration accuracy especially close to the lung and liver surfaces (depicted by corresponding red dotted and green solid arrows, respectively).

Journal: Journal of Medical Imaging

Article Title: GIFTed Demons: deformable image registration with local structure-preserving regularization using supervoxels for liver applications

doi: 10.1117/1.JMI.5.2.024001

Figure Lengend Snippet: Main anatomical views of 3-D CT registration results for case #P0 of the liver dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded (red-cyan) intensity differences between volume pair before registration (left), after registration using Demons with isotropic Gaussian kernel, iso-dem, (middle), and guided image filtering with random SLIC clustering, rdn-gif, (right). Registration using our method (right) improves registration accuracy especially close to the lung and liver surfaces (depicted by corresponding red dotted and green solid arrows, respectively).

Article Snippet: The computation time per registration using the presented framework is ≈ 3 min per 3-D pair (on a standard CPU, running nonoptimized C++ code, MATLAB™ mex compiler) and is several times faster than our previous bilateral filtering procedure ( ≈ 60 min ) or the locally adaptive anisotropic regularization (several hours).

Techniques:

Main anatomical views of resulting 3-D displacement fields for case #P0 of the liver CT dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded magnitude of the displacement field estimated using Demons with isotropic Gaussian kernel, iso-dem, (middle) and guided image filtering with random SLIC clustering, rdn-gif, (right). (left) The reference image with the corresponding blue contour is shown for a guidance to the displacement field. Registration using our method (right) produces a visually smooth displacement field inside the lungs and liver, and at the same, estimates sliding motion at the lung and liver interface [depicted by corresponding red dotted (for lungs) and green solid (for liver) arrows].

Journal: Journal of Medical Imaging

Article Title: GIFTed Demons: deformable image registration with local structure-preserving regularization using supervoxels for liver applications

doi: 10.1117/1.JMI.5.2.024001

Figure Lengend Snippet: Main anatomical views of resulting 3-D displacement fields for case #P0 of the liver CT dataset: (a) coronal, (b) axial, and (c) sagittal views for the color-coded magnitude of the displacement field estimated using Demons with isotropic Gaussian kernel, iso-dem, (middle) and guided image filtering with random SLIC clustering, rdn-gif, (right). (left) The reference image with the corresponding blue contour is shown for a guidance to the displacement field. Registration using our method (right) produces a visually smooth displacement field inside the lungs and liver, and at the same, estimates sliding motion at the lung and liver interface [depicted by corresponding red dotted (for lungs) and green solid (for liver) arrows].

Article Snippet: The computation time per registration using the presented framework is ≈ 3 min per 3-D pair (on a standard CPU, running nonoptimized C++ code, MATLAB™ mex compiler) and is several times faster than our previous bilateral filtering procedure ( ≈ 60 min ) or the locally adaptive anisotropic regularization (several hours).

Techniques: