FOOD TEXTURE DESCRIPTORS BASED ON FRACTAL AND LOCAL GRADIENT INFORMATION

Marc Bosch1, Fengqing Zhu1, Nitin Khanna1

  • 1Video and Image Processing Lab (VIPER), School of Electrical and Computer Engineering.

Proceedings of the ... European Signal Processing Conference (EUSIPCO). EUSIPCO (Conference)
|June 3, 2017
PubMed
Summary

This study introduces novel image analysis techniques for food identification, aiding dietary assessments. The developed texture descriptors significantly outperform existing methods in classifying food images.

Related Concept Videos

Shape and Texture of Coarse Aggregate01:25

Shape and Texture of Coarse Aggregate

Aggregate shape is classified based on the relative sharpness or roundness of the edges and corners. This classification includes categories like rounded, angular, elongated, and flaky, each with specific characteristics. Rounded aggregates, fully shaped by attrition, are typical of river or seashore gravel, while angular aggregates, such as crushed rock, have well-defined edges. Aggregates that are elongated and flaky are less desirable, as they can reduce the workability and strength of...
739
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
982
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
1.0K
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
829
Properties of Fourier Transform I01:21

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
718
Sensory Perception: Organization of the Somatosensory System01:11

Sensory Perception: Organization of the Somatosensory System

The somatosensory system is the central and peripheral nervous system component that senses and processes touch, pressure, pain, temperature, and body position or proprioception. The process of sensation takes place at three levels:
The receptor level:
The receptor level is the first stage of sensation. It involves the detection of a stimulus by specialized sensory receptors. The stimulus must arrive within the receptor's receptive field. Next, the receptor converts the energy of the...
11.6K